We stand with Ukraine  

David Pritchard

Affiliations:
  • Google, Los Angeles, CA, USA
  • University of Southern California, Los Angeles, CA, USA (former)
  • Princeton University, Department of Computer Science, NJ, USA (former)
  • École Polytechnique Fédérale de Lausanne, Switzerland (former)
  • University of Waterloo, Department of Combinatorics & Optimization, Canada (PhD 2010)


According to our database1, David Pritchard authored at least 33 papers between 2006 and 2016.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
IMI Python: Upgraded CS Circles web-based Python course.
[BibTeX]
[DOI]
Marija Djokic-Petrovic
,
David Pritchard
,
Milos R. Ivanovic
,
Vladimir M. Cvjetkovic
Comput. Appl. Eng. Educ., 2016

2015
Finding the closest ultrametric.
[BibTeX]
[DOI]
Marco Di Summa
,
David Pritchard
,
Laura Sanità
Discret. Appl. Math., 2015

Frequency distribution of error messages.
[BibTeX]
[DOI]
David Pritchard
Proceedings of the 6th Workshop on Evaluation and Usability of Programming Languages and Tools, 2015

Websheets: A Templated Online Coding Exercise System.
[BibTeX]
[DOI]
David Alexander Griffith Pritchard
Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education, 2015

2014
Characterizing and recognizing generalized polymatroids.
[BibTeX]
[DOI]
András Frank
,
Tamás Király
,
Júlia Pap
,
David Pritchard
Math. Program., 2014

Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation.
[BibTeX]
[DOI]
Jochen Könemann
,
Ojas Parekh
,
David Pritchard
Algorithmica, 2014

Generalized Hypergraph Matching via Iterated Packing and Local Ratio.
[BibTeX]
[DOI]
Ojas Parekh
,
David Pritchard
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013
On approximating string selection problems with outliers.
[BibTeX]
[DOI]
Christina Boucher
,
Gad M. Landau
,
Avivit Levy
,
David Pritchard
,
Oren Weimann
Theor. Comput. Sci., 2013

Hypergraphic LP Relaxations for Steiner Trees.
[BibTeX]
[DOI]
Deeparnab Chakrabarty
,
Jochen Könemann
,
David Pritchard
SIAM J. Discret. Math., 2013

Cover-Decomposition and Polychromatic Numbers.
[BibTeX]
[DOI]
Béla Bollobás
,
David Pritchard
,
Thomas Rothvoß
,
Alex D. Scott
SIAM J. Discret. Math., 2013

2011
Fast computation of small cuts via cycle space sampling.
[BibTeX]
[DOI]
David Pritchard
,
Ramakrishna Thurimella
ACM Trans. Algorithms, 2011

A partition-based relaxation for Steiner trees.
[BibTeX]
[DOI]
Jochen Könemann
,
David Pritchard
,
Kunlun Tan
Math. Program., 2011

Counting large distances in convex polygons: a computational approach.
[BibTeX]
[DOI]
Filip Moric
,
David Pritchard
Electron. Notes Discret. Math., 2011

Diameter bounds for planar graphs.
[BibTeX]
[DOI]
Radoslav Fulek
,
Filip Moric
,
David Pritchard
Discret. Math., 2011

Counting large distances in convex polygons
[BibTeX]
[DOI]
Filip Moric
,
David Pritchard
CoRR, 2011

Approximability of Sparse Integer Programs.
[BibTeX]
[DOI]
David Pritchard
,
Deeparnab Chakrabarty
Algorithmica, 2011

2010
Decisions and elections: explaining the unexpected author: Donald G. Saari publisher: cambridge university press, 2001 isbn 0-521-80816-2.
[BibTeX]
[DOI]
David Pritchard
SIGACT News, 2010

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound.
[BibTeX]
[DOI]
Deeparnab Chakrabarty
,
Jochen Könemann
,
David Pritchard
Oper. Res. Lett., 2010

Efficient Divide-and-Conquer Implementations of Symmetric FSAs.
[BibTeX]
[DOI]
David A. G. Pritchard
J. Cell. Autom., 2010

Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers)
[BibTeX]
[DOI]
David Pritchard
,
Thomas Rothvoß
CoRR, 2010

An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack
[BibTeX]
[DOI]
David Pritchard
CoRR, 2010

k-Edge-Connectivity: Approximation and LP Relaxation
[BibTeX]
[DOI]
David Pritchard
CoRR, 2010

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
[BibTeX]
[DOI]
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
CoRR, 2010

<i>k</i>-Edge-Connectivity: Approximation and LP Relaxation.
[BibTeX]
[DOI]
David Pritchard
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

2009
Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization.
[BibTeX]
[DOI]
David Pritchard
PhD thesis, 2009

Approximability of Sparse Integer Programs.
[BibTeX]
[DOI]
David Pritchard
Proceedings of the Algorithms, 2009

2008
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.
[BibTeX]
[DOI]
Jochen Könemann
,
Ojas Parekh
,
David Pritchard
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Fast Distributed Computation of Cuts Via Random Circulations.
[BibTeX]
[DOI]
David Pritchard
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Nearest Neighbor Network Traversal
[BibTeX]
[DOI]
David Pritchard
CoRR, 2007

How to Use Random Circulations to Find Small Cuts
[BibTeX]
[DOI]
David Pritchard
CoRR, 2007

Efficient Divide-and-Conquer Simulations Of Symmetric FSAs
[BibTeX]
[DOI]
David Pritchard
CoRR, 2007

2006
An Optimal Distributed Edge-Biconnectivity Algorithm
[BibTeX]
[DOI]
David Pritchard
CoRR, 2006

Symmetric network computation.
[BibTeX]
[DOI]
David Pritchard
,
Santosh S. Vempala
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006


  Loading...