Symmetric network computation. - David Pritchard 001; Santosh S. Vempala (SPAA, 2006)

An Optimal Distributed Edge-Biconnectivity Algorithm - David Pritchard 001 (CoRR, 2006)

Efficient Divide-and-Conquer Simulations Of Symmetric FSAs - David Pritchard 001 (CoRR, 2007)

How to Use Random Circulations to Find Small Cuts - David Pritchard 001 (CoRR, 2007)

Nearest Neighbor Network Traversal - David Pritchard 001 (CoRR, 2007)

Fast Distributed Computation of Cuts Via Random Circulations. - David Pritchard 001 (ICALP (1), 2008)

Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. - Jochen Könemann; Ojas Parekh; David Pritchard 001 (WAOA, 2008)

Approximability of Sparse Integer Programs. - David Pritchard 001 (ESA, 2009)

Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization. - David Pritchard 001 (2009)

k-Edge-Connectivity: Approximation and LP Relaxation. - David Pritchard 001 (WAOA, 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; et al. (CoRR, 2010)

k-Edge-Connectivity: Approximation and LP Relaxation - David Pritchard 001 (CoRR, 2010)

An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack - David Pritchard 001 (CoRR, 2010)

Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers) - David Pritchard 001; Thomas Rothvoß (CoRR, 2010)

Efficient Divide-and-Conquer Implementations of Symmetric FSAs. - David A. G. Pritchard (J. Cell. Autom., 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 001 (Oper. Res. Lett., 2010)

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

Approximability of Sparse Integer Programs. - David Pritchard 001; Deeparnab Chakrabarty (Algorithmica, 2011)

Counting large distances in convex polygons - Filip Moric; David Pritchard 001 (CoRR, 2011)

Diameter bounds for planar graphs. - Radoslav Fulek; Filip Moric; David Pritchard 001 (Discret. Math., 2011)

Counting large distances in convex polygons: a computational approach. - Filip Moric; David Pritchard 001 (Electron. Notes Discret. Math., 2011)

A partition-based relaxation for Steiner trees. - Jochen Könemann; David Pritchard 001; Kunlun Tan (Math. Program., 2011)

Fast computation of small cuts via cycle space sampling. - David Pritchard 001; Ramakrishna Thurimella (ACM Trans. Algorithms, 2011)

Cover-Decomposition and Polychromatic Numbers. - Béla Bollobás; David Pritchard 001; Thomas Rothvoß; Alex D. Scott (SIAM J. Discret. Math., 2013)

Hypergraphic LP Relaxations for Steiner Trees. - Deeparnab Chakrabarty; Jochen Könemann; David Pritchard 001 (SIAM J. Discret. Math., 2013)

On approximating string selection problems with outliers. - Christina Boucher 001; Gad M. Landau; Avivit Levy; David Pritchard 001; Oren Weimann (Theor. Comput. Sci., 2013)

Generalized Hypergraph Matching via Iterated Packing and Local Ratio. - Ojas Parekh; David Pritchard 001 (WAOA, 2014)

Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation. - Jochen Könemann; Ojas Parekh; David Pritchard 001 (Algorithmica, 2014)

Characterizing and recognizing generalized polymatroids. - András Frank; Tamás Király; Júlia Pap; David Pritchard 001 (Math. Program., 2014)

Websheets: A Templated Online Coding Exercise System. - David Alexander Griffith Pritchard (ITiCSE, 2015)

Frequency distribution of error messages. - David Pritchard 001 (PLATEAU@SPLASH, 2015)

Finding the closest ultrametric. - Marco Di Summa; David Pritchard 001; Laura Sanità (Discret. Appl. Math., 2015)

IMI Python: Upgraded CS Circles web-based Python course. - Marija Djokic-Petrovic; David Pritchard 001; Milos R. Ivanovic; Vladimir M. Cvjetkovic (Comput. Appl. Eng. Educ., 2016)