default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Pritchard 0001
Person information
- affiliation: Google, Los Angeles, CA, USA
- affiliation (former): University of Southern California, Los Angeles, CA, USA
- affiliation (former): Princeton University, Department of Computer Science, NJ, USA
- affiliation (former): École Polytechnique Fédérale de Lausanne, Switzerland
- affiliation (PhD 2010): University of Waterloo, Department of Combinatorics & Optimization, Canada
Other persons with the same name
- David E. Pritchard (aka: David Pritchard 0002) — Massachusetts Institute of Technology, Cambridge, MA, USA (and 1 more)
- David Pritchard 0003 — Wellington Institute of Technology, School of Information Technology, New Zealand
- David Pritchard 0004 — University of British Columbia, Vancouver, BC, Canada
- David Pritchard 0005 — University of Southampton, Department of Electronics and Computer Science, UK
- David Pritchard 0007 — University of North Carolina, Department of Biostatistics, Chapel Hill, NC, USA
- David Pritchard 0008
![[0000-0002-9215-7210]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-9215-7210")
— Newcastle University, School of Engineering, Newcastle Upon Tyne, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j15]Marija Djokic-Petrovic, David Pritchard, Milos R. Ivanovic, Vladimir M. Cvjetkovic:
IMI Python: Upgraded CS Circles web-based Python course. Comput. Appl. Eng. Educ. 24(3): 464-480 (2016)- [i16]Ojas Parekh, David Pritchard:
Generalized Hypergraph Matching via Iterated Packing and Local Ratio. CoRR abs/1604.00322 (2016) - 2015
- [j14]Marco Di Summa, David Pritchard, Laura Sanità:
Finding the closest ultrametric. Discret. Appl. Math. 180: 70-80 (2015) - [c11]David Alexander Griffith Pritchard:
Websheets: A Templated Online Coding Exercise System. ITiCSE 2015: 335 - [c10]David Pritchard:
Frequency distribution of error messages. PLATEAU@SPLASH 2015: 1-8 - [i15]David Pritchard:
Frequency Distribution of Error Messages. CoRR abs/1509.07238 (2015) - 2014
- [j13]Jochen Könemann, Ojas Parekh, David Pritchard:
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation. Algorithmica 68(3): 776-804 (2014) - [j12]András Frank, Tamás Király, Júlia Pap, David Pritchard:
Characterizing and recognizing generalized polymatroids. Math. Program. 146(1-2): 245-273 (2014) - [c9]Ojas Parekh, David Pritchard:
Generalized Hypergraph Matching via Iterated Packing and Local Ratio. WAOA 2014: 207-223 - 2013
- [j11]Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. SIAM J. Discret. Math. 27(1): 240-256 (2013) - [j10]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Hypergraphic LP Relaxations for Steiner Trees. SIAM J. Discret. Math. 27(1): 507-533 (2013) - [j9]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On approximating string selection problems with outliers. Theor. Comput. Sci. 498: 107-114 (2013) - 2012
- [c8]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CPM 2012: 427-438 - [i14]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CoRR abs/1202.2820 (2012) - 2011
- [j8]David Pritchard, Deeparnab Chakrabarty:
Approximability of Sparse Integer Programs. Algorithmica 61(1): 75-93 (2011) - [j7]Radoslav Fulek, Filip Moric, David Pritchard:
Diameter bounds for planar graphs. Discret. Math. 311(5): 327-335 (2011) - [j6]Filip Moric, David Pritchard:
Counting large distances in convex polygons: a computational approach. Electron. Notes Discret. Math. 38: 731-736 (2011) - [j5]Jochen Könemann, David Pritchard, Kunlun Tan:
A partition-based relaxation for Steiner trees. Math. Program. 127(2): 345-370 (2011) - [j4]David Pritchard, Ramakrishna Thurimella:
Fast computation of small cuts via cycle space sampling. ACM Trans. Algorithms 7(4): 46:1-46:30 (2011) - [c7]Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. ESA 2011: 799-810 - [i13]Filip Moric, David Pritchard:
Counting large distances in convex polygons. CoRR abs/1103.0412 (2011) - 2010
- [j3]David A. G. Pritchard:
Efficient Divide-and-Conquer Implementations of Symmetric FSAs. J. Cell. Autom. 5(6): 481-490 (2010) - [j2]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Oper. Res. Lett. 38(6): 567-570 (2010) - [j1]David Pritchard:
Decisions and elections: explaining the unexpected author: Donald G. Saari publisher: cambridge university press, 2001 isbn 0-521-80816-2. SIGACT News 41(3): 30-33 (2010) - [c6]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Hypergraphic LP Relaxations for Steiner Trees. IPCO 2010: 383-396 - [c5]David Pritchard:
k-Edge-Connectivity: Approximation and LP Relaxation. WAOA 2010: 225-236 - [i12]Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer:
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010) - [i11]David Pritchard:
k-Edge-Connectivity: Approximation and LP Relaxation. CoRR abs/1004.1917 (2010) - [i10]David Pritchard:
An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack. CoRR abs/1005.3324 (2010) - [i9]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound. CoRR abs/1006.2249 (2010) - [i8]David Pritchard, Thomas Rothvoß:
Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers). CoRR abs/1009.6144 (2010)
2000 – 2009
- 2009
- [b1]David Pritchard:
Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization. University of Waterloo, Ontario, Canada, 2009 - [c4]David Pritchard:
Approximability of Sparse Integer Programs. ESA 2009: 83-94 - [i7]David Pritchard:
Approximability of Sparse Integer Programs. CoRR abs/0904.0859 (2009) - [i6]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Hypergraphic LP Relaxations for Steiner Trees. CoRR abs/0910.0281 (2009) - 2008
- [c3]David Pritchard:
Fast Distributed Computation of Cuts Via Random Circulations. ICALP (1) 2008: 145-160 - [c2]Jochen Könemann, Ojas Parekh, David Pritchard:
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. WAOA 2008: 1-14 - 2007
- [i5]David Pritchard:
Efficient Divide-and-Conquer Simulations Of Symmetric FSAs. CoRR abs/0708.0580 (2007) - [i4]Jochen Könemann, David Pritchard, Kunlun Tan:
A Partition-Based Relaxation For Steiner Trees. CoRR abs/0712.3568 (2007) - [i3]David Pritchard:
How to Use Random Circulations to Find Small Cuts. CoRR abs/cs/0702113 (2007) - [i2]David Pritchard:
Nearest Neighbor Network Traversal. CoRR abs/cs/0702114 (2007) - 2006
- [c1]David Pritchard, Santosh S. Vempala:
Symmetric network computation. SPAA 2006: 261-270 - [i1]David Pritchard:
An Optimal Distributed Edge-Biconnectivity Algorithm. CoRR abs/cs/0602013 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
