Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gregory Valiant
2010 – today
- 2013
[c15]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, Paul Valiant: Testing k-Modal Distributions: Optimal Algorithms via Reductions. SODA 2013: 1833-1852- 2012
- [j5]Adam Tauman Kalai, Ankur Moitra, Gregory Valiant: Disentangling Gaussians. Commun. ACM 55(2): 113-120 (2012)
- [j4]Georg Gottlob, Stephanie Tien Lee, Gregory Valiant, Paul Valiant: Size and Treewidth Bounds for Conjunctive Queries. J. ACM 59(3): 16 (2012)
- [c14]Gregory Valiant: Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas. FOCS 2012: 11-20
- [i10]Gregory Valiant: Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas with Noise. Electronic Colloquium on Computational Complexity (ECCC) 19: 6 (2012)
- [i9]Gregory Valiant: Beating brute-force: Improved algorithms for finding correlations, and related problems. TinyToCS 1 (2012)
- 2011
- [j3]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar: When is it best to best-respond? SIGecom Exchanges 10(2): 16-18 (2011)
- [c13]
- [c12]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar: Best-Response Mechanisms. ICS 2011: 155-165
- [c11]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar: Incentive-compatible distributed greedy protocols. PODC 2011: 335-336
- [c10]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar: Best-response auctions. ACM Conference on Electronic Commerce 2011: 351-360
- [c9]Gregory Valiant, Paul Valiant: Estimating the unseen: an n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTs. STOC 2011: 685-694
- [i8]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, Paul Valiant: Testing $k$-Modal Distributions: Optimal Algorithms via Reductions. CoRR abs/1112.5659 (2011)
- 2010
- [j2]Gregory Valiant, Tim Roughgarden: Braess's Paradox in large random graphs. Random Struct. Algorithms 37(4): 495-515 (2010)
- [j1]Ho-Lin Chen, Tim Roughgarden, Gregory Valiant: Designing Network Protocols for Good Equilibria. SIAM J. Comput. 39(5): 1799-1832 (2010)
- [c8]Ankur Moitra, Gregory Valiant: Settling the Polynomial Learnability of Mixtures of Gaussians. FOCS 2010: 93-102
- [c7]
- [c6]Constantinos Daskalakis, Rafael M. Frongillo, Christos H. Papadimitriou, George Pierrakos, Gregory Valiant: On Learning Algorithms for Nash Equilibria. SAGT 2010: 114-125
- [c5]Adam Tauman Kalai, Ankur Moitra, Gregory Valiant: Efficiently learning mixtures of two Gaussians. STOC 2010: 553-562
- [i7]Ankur Moitra, Gregory Valiant: Settling the Polynomial Learnability of Mixtures of Gaussians. CoRR abs/1004.4223 (2010)
- [i6]Gregory Valiant, Paul Valiant: A CLT and tight lower bounds for estimating entropy. Electronic Colloquium on Computational Complexity (ECCC) 17: 179 (2010)
- [i5]Gregory Valiant, Paul Valiant: Estimating the unseen: A sublinear-sample canonical estimator of distributions. Electronic Colloquium on Computational Complexity (ECCC) 17: 180 (2010)
- [i4]Gregory Valiant, Paul Valiant: A CLT and tight lower bounds for estimating entropy. Electronic Colloquium on Computational Complexity (ECCC) 17: 183 (2010)
- [i3]Gregory Valiant, Paul Valiant: Estimating the unseen: A sublinear-sample canonical estimator of distributions. Electronic Colloquium on Computational Complexity (ECCC) 17: 184 (2010)
2000 – 2009
- 2009
- [c4]Georg Gottlob, Stephanie Tien Lee, Gregory Valiant: Size and treewidth bounds for conjunctive queries. PODS 2009: 45-54
- [c3]Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant: On the complexity of Nash equilibria of action-graph games. SODA 2009: 710-719
- [i2]Gregory Valiant, Paul Valiant: Size Bounds for Conjunctive Queries with General Functional Dependencies. CoRR abs/0909.2030 (2009)
- 2008
- [c2]Ho-Lin Chen, Tim Roughgarden, Gregory Valiant: Designing networks with good equilibria. SODA 2008: 854-863
- [i1]Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant: On the Complexity of Nash Equilibria of Action-Graph Games. CoRR abs/0802.1604 (2008)
- 2006
- [c1]Gregory Valiant, Tim Roughgarden: Braess's paradox in large random graphs. ACM Conference on Electronic Commerce 2006: 296-305
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-14 22:06 CEST by the dblp team