| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128552 | 2024-04-15 | Paper |
| Advancing subgroup fairness via sleeping experts | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075740 | 2022-05-11 | Paper |
| Approximation Stability and Proxy Objectives | 2022-02-04 | Paper |
| Approximate Convex Hull of Data Streams | 2021-07-28 | Paper |
| Foundations of data science | 2021-06-23 | Paper |
| On Price versus Quality | 2021-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5149007 | 2021-02-05 | Paper |
| Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries | 2020-11-04 | Paper |
| Foundations of Data Science | 2020-02-11 | Paper |
| Computing Stackelberg equilibria of large general-sum games | 2020-02-04 | Paper |
| Lifelong learning in costly feature spaces | 2020-01-29 | Paper |
| Sparse Approximation via Generating Point Sets | 2019-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633885 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633921 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645648 | 2019-01-10 | Paper |
| Sparse Approximation via Generating Point Sets | 2018-07-16 | Paper |
| Opting Into Optimal Matchings | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608043 | 2018-03-15 | Paper |
| Learnability of DNF with representation-specific queries | 2017-05-16 | Paper |
| Differentially private data analysis of social networks via restricted sensitivity | 2017-05-16 | Paper |
| The minimum latency problem | 2016-09-01 | Paper |
| Weakly learning DNF and characterizing statistical query learning using Fourier analysis | 2016-09-01 | Paper |
| An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs | 2016-06-01 | Paper |
| Online Allocation and Pricing with Economies of Scale | 2016-01-08 | Paper |
| Online algorithms for market clearing | 2015-12-04 | Paper |
| Noise-tolerant learning, the parity problem, and the statistical query model | 2015-11-12 | Paper |
| Routing without regret | 2015-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921789 | 2014-10-13 | Paper |
| Noise-tolerant learning, the parity problem, and the statistical query model | 2014-09-26 | Paper |
| Welfare and Profit Maximization with Production Costs | 2014-07-30 | Paper |
| Clustering under approximation stability | 2014-02-17 | Paper |
| A learning theory approach to noninteractive database privacy | 2014-02-17 | Paper |
| Fast Private Data Release Algorithms for Sparse Queries | 2013-10-04 | Paper |
| Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior | 2013-07-04 | Paper |
| Separating populations with wide data: a spectral analysis | 2013-05-27 | Paper |
| Additive Approximation for Near-Perfect Phylogeny Construction | 2012-11-02 | Paper |
| Center-based clustering under perturbation stability | 2012-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093198 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174120 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002759 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002785 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002821 | 2011-05-24 | Paper |
| On Nash-Equilibria of Approximation-Stable Games | 2010-10-19 | Paper |
| Approximation algorithms for deadline-TSP and vehicle routing with time-windows | 2010-08-15 | Paper |
| A discriminative model for semi-supervised learning | 2010-07-14 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| A theory of learning with similarity functions | 2009-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549721 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302085 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302092 | 2009-01-05 | Paper |
| Fast learning of \(k\)-term DNF formulas with queries. | 2008-12-21 | Paper |
| Reducing mechanism design to algorithm design via machine learning | 2008-12-12 | Paper |
| Clustering with Interactive Feedback | 2008-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524713 | 2008-09-12 | Paper |
| A Theory of Similarity Functions for Learning and Clustering | 2008-08-19 | Paper |
| Separating Populations with Wide Data: A Spectral Analysis | 2008-05-27 | Paper |
| Approximation Algorithms for Orienteering and Discounted-Reward TSP | 2008-04-22 | Paper |
| Open Problems in Efficient Semi-supervised PAC Learning | 2008-01-03 | Paper |
| Kernels as features: on kernels, margins, and low-dimensional mappings | 2006-11-22 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| Admission Control to Minimize Rejections | 2005-04-11 | Paper |
| Correlation clustering | 2005-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828909 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829029 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829037 | 2004-11-29 | Paper |
| Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems | 2004-01-29 | Paper |
| Fast planning through planning graph analysis | 2003-08-28 | Paper |
| Static optimality and dynamic search-optimality in lists and trees | 2003-08-17 | Paper |
| Microchoice bounds and self bounding learning algorithms | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778551 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230341 | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234076 | 2001-08-27 | Paper |
| A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527040 | 2001-03-01 | Paper |
| On-line learning and the metrical task system problem | 2000-12-18 | Paper |
| An Online Algorithm for Improving Performance in Navigation | 2000-10-18 | Paper |
| Universal portfolios with and without transaction costs. | 2000-06-07 | Paper |
| Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems | 2000-06-04 | Paper |
| A constant-factor approximation algorithm for the \(k\)-MST problem | 2000-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234074 | 1999-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228499 | 1999-05-18 | Paper |
| A Constant-Factor Approximation Algorithm for the Geometrick-MST Problem in the Plane | 1999-02-22 | Paper |
| Learning with unreliable boundary queries | 1999-01-24 | Paper |
| A polynomial-time algorithm for learning noisy linear threshold functions | 1998-11-11 | Paper |
| On Learning Read-k-Satisfy-j DNF | 1998-09-21 | Paper |
| New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen | 1998-09-21 | Paper |
| Selection of relevant features and examples in machine learning | 1998-08-13 | Paper |
| A note on learning from multiple-instance examples | 1998-04-02 | Paper |
| Learning an intersection of a constant number of halfspaces over a uniform distribution | 1997-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341754 | 1997-09-17 | Paper |
| Navigating in Unfamiliar Geometric Terrain | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875171 | 1996-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873672 | 1996-04-17 | Paper |
| New approximation algorithms for graph coloring | 1995-09-19 | Paper |
| Coloring Random and Semi-Random k-Colorable Graphs | 1995-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4839059 | 1995-08-07 | Paper |
| Learning in the presence of finitely or infinitely many irrelevant attributes | 1995-07-05 | Paper |
| Linear approximation of shortest superstrings | 1994-11-03 | Paper |
| Learning Boolean functions in an infinite attribute space | 1993-04-01 | Paper |
| Rank-\(r\) decision trees are a subclass of \(r\)-decision lists | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010315 | 1992-09-27 | Paper |
