David Pritchard

According to our database, David Pritchard authored at least 30 papers between 2006 and 2015.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2015

Frequency distribution of error messages.

David Pritchard

Proceedings of the 6th Workshop on Evaluation and Usability of Programming Languages and Tools, 2015

Websheets: A Templated Online Coding Exercise System.

David Alexander Griffith Pritchard

Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education, 2015

2014

Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation.

Jochen Könemann, Ojas Parekh, David Pritchard

Algorithmica, 2014

Generalized Hypergraph Matching via Iterated Packing and Local Ratio.

Ojas Parekh, David Pritchard

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013

On approximating string selection problems with outliers.

Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann

Theor. Comput. Sci., 2013

Hypergraphic LP Relaxations for Steiner Trees.

Deeparnab Chakrabarty, Jochen Könemann, David Pritchard

SIAM J. Discret. Math., 2013

Cover-Decomposition and Polychromatic Numbers.

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.

David Pritchard, Ramakrishna Thurimella

ACM Trans. Algorithms, 2011

A partition-based relaxation for Steiner trees.

Jochen Könemann, David Pritchard, Kunlun Tan

Math. Program., 2011

Counting large distances in convex polygons: a computational approach.

Filip Moric, David Pritchard

Electron. Notes Discret. Math., 2011

Diameter bounds for planar graphs.

Radoslav Fulek, Filip Moric, David Pritchard

Discret. Math., 2011

Counting large distances in convex polygons

Filip Moric, David Pritchard

CoRR, 2011

Approximability of Sparse Integer Programs.

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.

David Pritchard

SIGACT News, 2010

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound.

Deeparnab Chakrabarty, Jochen Könemann, David Pritchard

Oper. Res. Lett., 2010

Efficient Divide-and-Conquer Implementations of Symmetric FSAs.

David A. G. Pritchard

J. Cell. Autom., 2010

Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers)

David Pritchard, Thomas Rothvoß

CoRR, 2010

An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack

David Pritchard

CoRR, 2010

k-Edge-Connectivity: Approximation and LP Relaxation

David Pritchard

CoRR, 2010

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)

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.

David Pritchard

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

2009

Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization.

David Pritchard

PhD thesis, 2009

Approximability of Sparse Integer Programs.

David Pritchard

Proceedings of the Algorithms, 2009

2008

Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.

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.

David Pritchard

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Nearest Neighbor Network Traversal

David Pritchard

CoRR, 2007

How to Use Random Circulations to Find Small Cuts

David Pritchard

CoRR, 2007

Efficient Divide-and-Conquer Simulations Of Symmetric FSAs

David Pritchard

CoRR, 2007

2006

An Optimal Distributed Edge-Biconnectivity Algorithm

David Pritchard

CoRR, 2006

Symmetric network computation.

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