| Publication | Date of Publication | Type |
|---|
Competitive contagion in networks
Games and Economic Behavior | 2019-03-29 | Paper |
Mechanism design in large games: incentives and privacy (extended abstract)
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Strategic network formation with attack and immunization
Web and Internet Economics | 2017-02-10 | Paper |
On the learnability of discrete distributions
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Privacy and truthful equilibrium selection for aggregative games
Web and Internet Economics | 2016-01-08 | Paper |
Efficient noise-tolerant learning from statistical queries
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Efficient learning of typical finite automata from random walks
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
A network formation game for bipartite exchange economies
| 2014-12-18 | Paper |
Competitive contagion in networks
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Learning from multiple sources
| 2011-11-08 | Paper |
A clustering coefficient network formation game
Algorithmic Game Theory | 2011-10-28 | Paper |
scientific article; zbMATH DE number 5885080 (Why is no real title available?)
| 2011-05-06 | Paper |
Regret to the best vs. regret to the average
Machine Learning | 2009-03-31 | Paper |
Graphical games
| 2008-09-12 | Paper |
Risk-Sensitive Online Learning
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Regret to the Best vs. Regret to the Average
Learning Theory | 2008-01-03 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Efficient noise-tolerant learning from statistical queries
Journal of the ACM | 2005-01-25 | Paper |
scientific article; zbMATH DE number 1882071 (Why is no real title available?)
| 2003-03-13 | Paper |
Horn approximations of empirical data
Artificial Intelligence | 2003-02-04 | Paper |
A sparse sampling algorithm for near-optimal planning in large Markov decision processes
Machine Learning | 2002-07-08 | Paper |
Near-optimal reinforcement learning in polynomial time
Machine Learning | 2002-07-08 | Paper |
scientific article; zbMATH DE number 1753137 (Why is no real title available?)
| 2002-06-10 | Paper |
Testing problems with sublearning sample complexity
Journal of Computer and System Sciences | 2001-04-17 | Paper |
Toward efficient agnostic learning
Machine Learning | 2000-06-21 | Paper |
On the boosting ability of top-down decision tree learning algorithms
Journal of Computer and System Sciences | 2000-06-05 | Paper |
scientific article; zbMATH DE number 1306866 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1222296 (Why is no real title available?)
| 1999-04-27 | Paper |
scientific article; zbMATH DE number 1256765 (Why is no real title available?)
| 1999-03-01 | Paper |
Efficient learning of typical finite automata from random walks
Information and Computation | 1998-06-02 | Paper |
scientific article; zbMATH DE number 1024063 (Why is no real title available?)
| 1997-09-17 | Paper |
Rigorous learning curve bounds from statistical mechanics
Machine Learning | 1997-05-06 | Paper |
Learning from a population of hypotheses
Machine Learning | 1995-10-29 | Paper |
Efficient distribution-free learning of probabilistic concepts
Journal of Computer and System Sciences | 1995-10-09 | Paper |
On the sample complexity of weak learning
Information and Computation | 1995-07-10 | Paper |
On the complexity of teaching
Journal of Computer and System Sciences | 1995-07-05 | Paper |
Learning Boolean formulas
Journal of the ACM | 1995-04-10 | Paper |
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM | 1995-03-01 | Paper |
Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
Machine Learning | 1994-03-03 | Paper |
Learning in the Presence of Malicious Errors
SIAM Journal on Computing | 1993-10-10 | Paper |
Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
SIAM Journal on Computing | 1993-10-10 | Paper |
scientific article; zbMATH DE number 67610 (Why is no real title available?)
| 1992-09-27 | Paper |
Equivalence of models for polynomial learnability
Information and Computation | 1992-06-28 | Paper |
A general lower bound on the number of examples needed for learning
Information and Computation | 1989-01-01 | Paper |
