| 2009 | ||
|---|---|---|
| 53 | Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou: The complexity of computing a Nash equilibrium. Commun. ACM 52(2): 89-97 (2009) | |
| 2008 | ||
| 52 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: On the Dimensionality of Voting Games. AAAI 2008: 69-74 | |
| 51 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: A tractable and expressive class of marginal contribution nets and its applications. AAMAS (2) 2008: 1007-1014 | |
| 50 | Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated two-sided matching markets. ACM Conference on Electronic Commerce 2008: 256-263 | |
| 49 | Patrick Briest, Paul W. Goldberg, Heiko Röglin: Approximate Equilibria in Games with Few Players CoRR abs/0804.4524: (2008) | |
| 2007 | ||
| 48 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: Computational Complexity of Weighted Threshold Games. AAAI 2007: 718-723 | |
| 47 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing good nash equilibria in graphical games. ACM Conference on Electronic Commerce 2007: 162-171 | |
| 46 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Frugality ratios and improved truthful mechanisms for vertex cover. ACM Conference on Electronic Commerce 2007: 336-345 | |
| 45 | Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: A Unified Approach to Congestion Games and Two-Sided Markets. WINE 2007: 30-41 | |
| 44 | Paul W. Goldberg, P. Polpinit: The Price of Selfish Stackelberg Leadership in a Network Game CoRR abs/0711.1242: (2007) | |
| 43 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing Good Nash Equilibria in Graphical Games CoRR abs/cs/0703133: (2007) | |
| 42 | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed Selfish Load Balancing. SIAM J. Comput. 37(4): 1163-1181 (2007) | |
| 41 | Nick Palmer, Paul W. Goldberg: PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance. Theor. Comput. Sci. 387(1): 18-31 (2007) | |
| 2006 | ||
| 40 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash equilibria in graphical games on trees revisited. ACM Conference on Electronic Commerce 2006: 100-109 | |
| 39 | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed selfish load balancing. SODA 2006: 354-363 | |
| 38 | Paul W. Goldberg, Christos H. Papadimitriou: Reducibility among equilibrium problems. STOC 2006: 61-70 | |
| 37 | Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou: The complexity of computing a Nash equilibrium. STOC 2006: 71-78 | |
| 36 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Frugality ratios and improved truthful mechanisms for vertex cover CoRR abs/cs/0606044: (2006) | |
| 35 | Nick Palmer, Paul W. Goldberg: PAC Classification based on PAC Estimates of Label Class Distributions CoRR abs/cs/0607047: (2006) | |
| 34 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash Equilibria in Graphical Games on Trees Revisited Electronic Colloquium on Computational Complexity (ECCC)(005): (2006) | |
| 33 | Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin: Utilitarian resource assignment. J. Discrete Algorithms 4(4): 567-587 (2006) | |
| 32 | Paul W. Goldberg: Some Discriminant-Based PAC Algorithms. Journal of Machine Learning Research 7: 283-306 (2006) | |
| 31 | Paul W. Goldberg: A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment. SIAM J. Discrete Math. 20(2): 328-343 (2006) | |
| 2005 | ||
| 30 | Nick Palmer, Paul W. Goldberg: PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance. ALT 2005: 157-170 | |
| 29 | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed Selfish Load Balancing CoRR abs/cs/0506098: (2005) | |
| 28 | Paul W. Goldberg, Christos H. Papadimitriou: Reducibility Among Equilibrium Problems Electronic Colloquium on Computational Complexity (ECCC)(090): (2005) | |
| 27 | Konstantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou: The complexity of computing a Nash equilibrium Electronic Colloquium on Computational Complexity (ECCC)(115): (2005) | |
| 2004 | ||
| 26 | Paul W. Goldberg: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. PODC 2004: 131-140 | |
| 25 | Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin: Utilitarian resource assignment CoRR cs.GT/0410018: (2004) | |
| 24 | Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün: Identifying Uniformly Mutated Segments within Repeats. J. Bioinformatics and Computational Biology 2(4): 657-668 (2004) | |
| 2003 | ||
| 23 | Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson: A proportionate fair scheduling rule with good worst-case performance. SPAA 2003: 101-108 | |
| 2002 | ||
| 22 | Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün: Statistical Identification of Uniformly Mutated Segments within Repeats. CPM 2002: 249-261 | |
| 2001 | ||
| 21 | Paul W. Goldberg: Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required. COLT/EuroCOLT 2001: 116-127 | |
| 20 | Paul W. Goldberg: When Can Two Unsupervised Learners Achieve PAC Separation? COLT/EuroCOLT 2001: 303-319 | |
| 19 | Paul W. Goldberg: Learning Fixed-Dimension Linear Thresholds from Fragmented Data. Inf. Comput. 171(1): 98-122 (2001) | |
| 18 | Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk: The Complexity of Gene Placement. J. Algorithms 41(2): 225-243 (2001) | |
| 17 | Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg: Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. SIAM J. Comput. 31(2): 375-397 (2001) | |
| 2000 | ||
| 16 | Paul W. Goldberg, Stephen Kwek: The Precision of Query Points as a Resource for Learning Convex Polytopes with Membership Queries. COLT 2000: 225-235 | |
| 1999 | ||
| 15 | Paul W. Goldberg: Learning Fixed-Dimension Linear Thresholds from Fragmented Data. COLT 1999: 88-99 | |
| 14 | Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk: The Complexity of Gene Placement. SODA 1999: 386-395 | |
| 1998 | ||
| 13 | Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg: Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. FOCS 1998: 436-445 | |
| 12 | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin: Constructing Computer Virus Phylogenies. J. Algorithms 26(1): 188-208 (1998) | |
| 11 | Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias: Exact Learning of Discretized Geometric Concepts. SIAM J. Comput. 28(2): 674-699 (1998) | |
| 1997 | ||
| 10 | Paul W. Goldberg, Christopher K. I. Williams, Christopher M. Bishop: Regression with Input-dependent Noise: A Gaussian Process Treatment. NIPS 1997 | |
| 1996 | ||
| 9 | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin: Constructing Computer Virus Phylogenies. CPM 1996: 253-270 | |
| 8 | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow: Minimizing Phylogenetic Number To Find Good Evolutionary Trees. Discrete Applied Mathematics 71(1-3): 111-136 (1996) | |
| 7 | Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott: PAC Learning of One-Dimensional Patterns. Machine Learning 25(1): 51-70 (1996) | |
| 1995 | ||
| 6 | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow: Minimizing Phylogenetic Number to find Good Evolutionary Trees. CPM 1995: 102-127 | |
| 5 | Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir: Four Strikes Against Physical Mapping of DNA. Journal of Computational Biology 2(1): 139-152 (1995) | |
| 4 | Paul W. Goldberg, Mark Jerrum: Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. Machine Learning 18(2-3): 131-148 (1995) | |
| 1994 | ||
| 3 | Paul W. Goldberg, Sally A. Goldman, H. David Mathias: Learning Unions of Boxes with Membership and Equivalence Queries. COLT 1994: 198-207 | |
| 2 | Paul W. Goldberg, Sally A. Goldman: Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise. COLT 1994: 246-255 | |
| 1993 | ||
| 1 | Paul W. Goldberg, Mark Jerrum: Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. COLT 1993: 361-369 | |