David A. G. Pritchard
David A. G. Pritchard
Google Los Angeles
Email verificata su uwaterloo.ca - Home page
Titolo
Citata da
Citata da
Anno
CS circles: an in-browser python course for beginners
D Pritchard, T Vasiga
Proceeding of the 44th ACM technical symposium on Computer science education …, 2013
472013
A partition-based relaxation for Steiner trees
J Könemann, D Pritchard, K Tan
Mathematical Programming 127 (2), 345-370, 2011
312011
Frequency distribution of error messages
D Pritchard
Proceedings of the 6th Workshop on Evaluation and Usability of Programming …, 2015
272015
Hypergraphic LP relaxations for Steiner trees
D Chakrabarty, J Könemann, D Pritchard
International Conference on Integer Programming and Combinatorial …, 2010
272010
Fast computation of small cuts via cycle space sampling
D Pritchard, R Thurimella
ACM Transactions on Algorithms (TALG) 7 (4), 1-30, 2011
262011
Approximability of sparse integer programs
D Pritchard
European Symposium on Algorithms, 83-94, 2009
262009
Approximability of sparse integer programs
D Pritchard, D Chakrabarty
Algorithmica 61 (1), 75-93, 2011
252011
Cover-decomposition and polychromatic numbers
B Bollobás, D Pritchard, T Rothvoß, A Scott
SIAM Journal on Discrete Mathematics 27 (1), 240-256, 2013
202013
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound
D Chakrabarty, J Könemann, D Pritchard
Operations Research Letters 38 (6), 567-570, 2010
162010
On approximating string selection problems with outliers
C Boucher, GM Landau, A Levy, D Pritchard, O Weimann
Theoretical Computer Science 498, 107-114, 2013
152013
Generalized hypergraph matching via iterated packing and local ratio
O Parekh, D Pritchard
International Workshop on Approximation and Online Algorithms, 207-223, 2014
132014
Finding the closest ultrametric
M Di Summa, D Pritchard, L Sanitŕ
Discrete Applied Mathematics 180, 70-80, 2015
102015
Max-weight integral multicommodity flow in spiders and high-capacity trees
J Könemann, O Parekh, D Pritchard
International Workshop on Approximation and Online Algorithms, 1-14, 2008
92008
Linear programming tools and approximation algorithms for combinatorial optimization
D Pritchard
University of Waterloo, 2010
82010
An optimal distributed bridge-finding algorithm
D Pritchard
Proceedings of the 25th Annual ACM SIGACT-SIGOPS Symposium on Principles of …, 2006
82006
IMI Python: Upgraded CS circles web‐based python course
M Djokic‐Petrovic, D Pritchard, M Ivanovic, V Cvjetkovic
Computer Applications in Engineering Education 24 (3), 464-480, 2016
72016
Characterizing and recognizing generalized polymatroids
A Frank, T Király, J Pap, D Pritchard
Mathematical Programming 146 (1), 245-273, 2014
72014
Robust network computation
DDAG Pritchard
Massachusetts Institute of Technology, 2005
72005
Hypergraphic LP relaxations for Steiner trees
D Chakrabarty, J Könemann, D Pritchard
SIAM Journal on Discrete Mathematics 27 (1), 507-533, 2013
52013
An lp with integrality gap 1+ epsilon for multidimensional knapsack
D Pritchard
arXiv preprint arXiv:1005.3324, 2010
52010
Il sistema al momento non puň eseguire l'operazione. Riprova piů tardi.
Articoli 1–20