| Publication | Date of Publication | Type |
|---|
| Correlation clustering | 2026-05-29 | Paper |
| Approximation algorithms for orienteering and discounted-reward TSP | 2026-05-29 | Paper |
| Winning without observing payoffs: exploiting behavioral biases to win nearly every round | 2025-11-04 | Paper |
| The Johnson-Lindenstrauss transform itself preserves differential privacy | 2025-05-05 | Paper |
| Active property testing | 2025-05-05 | Paper |
| Stability yields a PTAS for k-median and k-means clustering | 2025-04-29 | Paper |
Non-abelian discrete groups from the breaking of continuous flavor symmetries
Journal of High Energy Physics | 2025-04-29 | Paper |
Non-abelian discrete flavor symmetries from T^2/Z_N orbifolds
Journal of High Energy Physics | 2025-04-29 | Paper |
| Dueling optimization with a monotone adversary | 2025-03-06 | Paper |
| Stochastic vertex cover with few queries | 2024-07-19 | Paper |
On classification of strategic agents who can both game and improve
(available as arXiv preprint) | 2024-04-15 | Paper |
Advancing subgroup fairness via sleeping experts
(available as arXiv preprint) | 2023-02-03 | Paper |
Bilu-Linial stability, certified algorithms and the independent set problem
(available as arXiv preprint) | 2022-05-11 | Paper |
| Approximation Stability and Proxy Objectives | 2022-02-04 | Paper |
Approximate convex hull of data streams
(available as arXiv preprint) | 2021-07-28 | Paper |
Foundations of data science
Texts and Readings in Mathematics | 2021-06-23 | Paper |
| On price versus quality | 2021-06-15 | Paper |
scientific article; zbMATH DE number 7306900 (Why is no real title available?)
(available as arXiv preprint) | 2021-02-05 | Paper |
| scientific article; zbMATH DE number 7306900 (Why is no real title available?) | 2021-02-05 | Paper |
Ignorance is almost bliss: near-optimal stochastic matching with few queries
Operations Research | 2020-11-04 | Paper |
Ignorance is almost bliss: near-optimal stochastic matching with few queries
Operations Research | 2020-11-04 | Paper |
| Foundations of Data Science | 2020-02-11 | Paper |
Computing Stackelberg equilibria of large general-sum games
(available as arXiv preprint) | 2020-02-04 | Paper |
| Computing Stackelberg equilibria of large general-sum games | 2020-02-04 | Paper |
Lifelong learning in costly feature spaces
Theoretical Computer Science | 2020-01-29 | Paper |
Sparse Approximation via Generating Point Sets
ACM Transactions on Algorithms | 2019-11-25 | Paper |
| Improved equilibria via public service advertising | 2019-05-06 | Paper |
| Approximate clustering without the approximation | 2019-05-06 | Paper |
| Lifelong learning in costly feature spaces | 2019-01-10 | Paper |
Opting into optimal matchings
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Sparse approximation via generating point sets
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| From battlefields to elections: winning strategies of Blotto and auditing games | 2018-03-15 | Paper |
Differentially private data analysis of social networks via restricted sensitivity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Learnability of DNF with representation-specific queries
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
The minimum latency problem
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 |
An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
Information Processing Letters | 2016-06-01 | Paper |
Online allocation and pricing with economies of scale
Web and Internet Economics | 2016-01-08 | Paper |
Online algorithms for market clearing
Journal of the ACM | 2015-12-04 | Paper |
Noise-tolerant learning, the parity problem, and the statistical query model
Journal of the ACM | 2015-11-12 | Paper |
Routing without regret, on convergence to Nash equilibria of regret-minimizing algorithms in routing games
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| Near-optimal online auctions | 2014-10-13 | Paper |
Noise-tolerant learning, the parity problem, and the statistical query model
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Welfare and profit maximization with production costs
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Clustering under approximation stability
Journal of the ACM | 2014-02-17 | Paper |
A learning theory approach to noninteractive database privacy
Journal of the ACM | 2014-02-17 | Paper |
Fast private data release algorithms for sparse queries
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Circumventing the price of anarchy: leading dynamics to good behavior
SIAM Journal on Computing | 2013-07-04 | Paper |
Separating populations with wide data: a spectral analysis
Electronic Journal of Statistics | 2013-05-27 | Paper |
Additive approximation for near-perfect phylogeny construction
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Center-based clustering under perturbation stability
Information Processing Letters | 2012-03-09 | Paper |
| From external to internal regret | 2011-10-12 | Paper |
| Preference elicitation and query learning | 2011-10-12 | Paper |
Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games
Theory of Computing | 2011-05-24 | Paper |
Approximation algorithms and online mechanisms for item pricing
Theory of Computing | 2011-05-24 | Paper |
Combining online algorithms for acceptance and rejection
Theory of Computing | 2011-05-24 | Paper |
On Nash-equilibria of approximation-stable games
Algorithmic Game Theory | 2010-10-19 | Paper |
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
A discriminative model for semi-supervised learning
Journal of the ACM | 2010-07-14 | Paper |
PAC-MDL bounds.
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Learning Theory and Kernel Machines
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Scheduling for flow-time with admission control
Lecture Notes in Computer Science | 2010-03-03 | Paper |
A theory of learning with similarity functions
Machine Learning | 2009-03-31 | Paper |
scientific article; zbMATH DE number 5485574 (Why is no real title available?)
(available as arXiv preprint) | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485549 (Why is no real title available?) | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485581 (Why is no real title available?) | 2009-01-05 | Paper |
Fast learning of \(k\)-term DNF formulas with queries.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
Reducing mechanism design to algorithm design via machine learning
Journal of Computer and System Sciences | 2008-12-12 | Paper |
Clustering with Interactive Feedback
Lecture Notes in Computer Science | 2008-10-14 | Paper |
| Learning, regret minimization, and equilibria | 2008-09-12 | Paper |
A Theory of Similarity Functions for Learning and Clustering
Lecture Notes in Computer Science | 2008-08-19 | Paper |
Separating Populations with Wide Data: A Spectral Analysis
Algorithms and Computation | 2008-05-27 | Paper |
Approximation Algorithms for Orienteering and Discounted-Reward TSP
SIAM Journal on Computing | 2008-04-22 | Paper |
Open Problems in Efficient Semi-supervised PAC Learning
Learning Theory | 2008-01-03 | Paper |
Kernels as features: on kernels, margins, and low-dimensional mappings
Machine Learning | 2006-11-22 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Admission Control to Minimize Rejections
Internet Mathematics | 2005-04-11 | Paper |
Correlation clustering
Machine Learning | 2005-01-19 | Paper |
| scientific article; zbMATH DE number 2119754 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119638 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119762 (Why is no real title available?) | 2004-11-29 | Paper |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 | 2004-01-29 | Paper |
Fast planning through planning graph analysis
Artificial Intelligence | 2003-08-28 | Paper |
Static optimality and dynamic search-optimality in lists and trees
Algorithmica | 2003-08-17 | Paper |
Microchoice bounds and self bounding learning algorithms
Machine Learning | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1830730 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1256655 (Why is no real title available?) | 2002-01-17 | Paper |
| scientific article; zbMATH DE number 1263205 (Why is no real title available?) | 2001-08-27 | Paper |
A decomposition theorem for task systems and bounds for randomized server problems
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1559591 (Why is no real title available?) | 2001-03-01 | Paper |
On-line learning and the metrical task system problem
Machine Learning | 2000-12-18 | Paper |
An Online Algorithm for Improving Performance in Navigation
SIAM Journal on Computing | 2000-10-18 | Paper |
Universal portfolios with and without transaction costs.
Machine Learning | 2000-06-07 | Paper |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Theoretical Computer Science | 2000-06-04 | Paper |
A constant-factor approximation algorithm for the \(k\)-MST problem
Journal of Computer and System Sciences | 2000-02-17 | Paper |
| scientific article; zbMATH DE number 1263203 (Why is no real title available?) | 1999-09-15 | Paper |
| scientific article; zbMATH DE number 1256763 (Why is no real title available?) | 1999-05-18 | Paper |
A Constant-Factor Approximation Algorithm for the Geometric<i>k</i>-MST Problem in the Plane
SIAM Journal on Computing | 1999-02-22 | Paper |
Learning with unreliable boundary queries
Journal of Computer and System Sciences | 1999-01-24 | Paper |
A polynomial-time algorithm for learning noisy linear threshold functions
Algorithmica | 1998-11-11 | Paper |
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
SIAM Journal on Computing | 1998-09-21 | Paper |
On Learning Read-k-Satisfy-j DNF
SIAM Journal on Computing | 1998-09-21 | Paper |
Selection of relevant features and examples in machine learning
Artificial Intelligence | 1998-08-13 | Paper |
A note on learning from multiple-instance examples
Machine Learning | 1998-04-02 | Paper |
Learning an intersection of a constant number of halfspaces over a uniform distribution
Journal of Computer and System Sciences | 1997-12-08 | Paper |
| scientific article; zbMATH DE number 1024063 (Why is no real title available?) | 1997-09-17 | Paper |
Navigating in Unfamiliar Geometric Terrain
SIAM Journal on Computing | 1997-08-07 | Paper |
| scientific article; zbMATH DE number 871902 (Why is no real title available?) | 1996-10-21 | Paper |
| scientific article; zbMATH DE number 866653 (Why is no real title available?) | 1996-04-17 | Paper |
New approximation algorithms for graph coloring
Journal of the ACM | 1995-09-19 | Paper |
Coloring Random and Semi-Random k-Colorable Graphs
Journal of Algorithms | 1995-09-17 | Paper |
| scientific article; zbMATH DE number 774005 (Why is no real title available?) | 1995-08-07 | Paper |
Learning in the presence of finitely or infinitely many irrelevant attributes
Journal of Computer and System Sciences | 1995-07-05 | Paper |
Linear approximation of shortest superstrings
Journal of the ACM | 1994-11-03 | Paper |
Learning Boolean functions in an infinite attribute space
Machine Learning | 1993-04-01 | Paper |
Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
Information Processing Letters | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 65704 (Why is no real title available?) | 1992-09-27 | Paper |
