Paul Goldberg
Paul Goldberg
Professor of Computer Science, Oxford University
Verified email at - Homepage
Cited by
Cited by
The complexity of computing a Nash equilibrium
C Daskalakis, PW Goldberg, CH Papadimitriou
Communications of the ACM 52 (2), 89-97, 2009
Regression with input-dependent noise: A Gaussian process treatment
P Goldberg, C Williams, C Bishop
Advances in neural information processing systems 10, 1997
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
P Goldberg, M Jerrum
Proceedings of the sixth annual conference on Computational learning theory …, 1993
Four strikes against physical mapping of DNA
PW Goldberg, MC Golumbic, H Kaplan, R Shamir
Journal of Computational Biology 2 (1), 139-152, 1995
Reducibility among equilibrium problems
PW Goldberg, CH Papadimitriou
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
Distributed selfish load balancing
P Berenbrink, T Friedetzky, LA Goldberg, PW Goldberg, Z Hu, R Martin
SIAM Journal on Computing 37 (4), 1163-1181, 2007
Computational complexity of weighted threshold games
E Elkind, LA Goldberg, P Goldberg, M Wooldridge
AAAI, 718-723, 2007
Uncoordinated two-sided matching markets
H Ackermann, PW Goldberg, VS Mirrokni, H Röglin, B Vöcking
Proceedings of the 9th ACM Conference on Electronic Commerce, 256-263, 2008
Evolutionary trees can be learned in polynomial time in the two-state general Markov model
M Cryan, LA Goldberg, PW Goldberg
SIAM Journal on Computing 31 (2), 375-397, 2001
Named entity recognition in electronic health records using transfer learning bootstrapped neural networks
L Gligic, A Kormilitzin, P Goldberg, A Nevado-Holgado
Neural Networks 121, 132-139, 2020
Nash equilibria in graphical games on trees revisited
E Elkind, LA Goldberg, P Goldberg
Proceedings of the 7th ACM Conference on Electronic Commerce, 100-109, 2006
On the computational complexity of weighted voting games
E Elkind, LA Goldberg, PW Goldberg, M Wooldridge
Annals of Mathematics and Artificial Intelligence 56, 109-131, 2009
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
J Fearnley, PW Goldberg, A Hollender, R Savani
arXiv preprint arXiv:2011.01929, 2020
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
PW Goldberg
Proceedings of the twenty-third annual ACM symposium on principles of …, 2004
Constructing computer virus phylogenies
LA Goldberg, PW Goldberg, CA Phillips, GB Sorkin
Journal of Algorithms 26 (1), 188-208, 1998
Learning equilibria of games via payoff queries
J Fearnley, M Gairing, P Goldberg, R Savani
Proceedings of the fourteenth ACM conference on Electronic commerce, 397-414, 2013
A tractable and expressive class of marginal contribution nets and its applications
E Elkind, LA Goldberg, PW Goldberg, M Wooldridge
Mathematical Logic Quarterly 55 (4), 362-376, 2009
The complexity of the homotopy method, equilibrium selection, and Lemke-Howson solutions
PW Goldberg, CH Papadimitriou, R Savani
ACM Transactions on Economics and Computation (TEAC) 1 (2), 1-25, 2013
Few-shot learning for named entity recognition in medical text
M Hofer, A Kormilitzin, P Goldberg, A Nevado-Holgado
arXiv preprint arXiv:1811.05468, 2018
Decentralized dynamics for finite opinion games
D Ferraioli, PW Goldberg, C Ventre
Theoretical Computer Science 648, 96-115, 2016
The system can't perform the operation now. Try again later.
Articles 1–20