| Approximating the Median under the Ulam Metric
|
2021 |
Chakraborty, Diptarka |
| The Growth Rate over Trees of any Family of Sets Defined by a Monadic Second Order Formula is Semi-Computable
|
2021 |
Rosenfeld, Matthieu |
| Estimating the Nash Social Welfare for Coverage and other Submodular Valuations
|
2021 |
Li, Wenzheng |
| Approximate Nearest Neighbors Beyond Space Partitions
|
2021 |
Andoni, Alexandr |
| Robust Learning of Mixtures of Gaussians
|
2021 |
Kane, Daniel M. |
| Local Statistics, Semidefinite Programming, and Community Detection
|
2021 |
Banks, Jess |
| On the Competitive Analysis and High Accuracy Optimality of Profile Maximum Likelihood
|
2021 |
Han, Yanjun |
| In which Matching Markets does the Short Side enjoy an Advantage?
|
2021 |
Kanoria, Yash |
| Analytic Quantum Weak Coin Flipping Protocols with Arbitrarily Small Bias
|
2021 |
Arora, Atul Singh |
| Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover
|
2021 |
Bansal, Nikhil |
| Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions
|
2021 |
Chandrasekaran, Karthekeyan |
| New Data Structures for Orthogonal Range Reporting and Range Minima Queries
|
2021 |
Nekrich, Yakov |
| An Efficient ∊-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization
|
2021 |
Cai, Yang |
| Non-Excludable Dynamic Mechanism Design
|
2021 |
Balseiro, Santiago R. |
| Competitive Allocation of a Mixed Manna
|
2021 |
Chaudhury, Bhaskar Ray |
| Fast Convergence of Fictitious Play for Diagonal Payoff Matrices
|
2021 |
Abernethy, Jacob |
| Spectral Sparsification of Metrics and Kernels
|
2021 |
Quanrud, Kent |
| (Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems
|
2021 |
Chan, Timothy M. |
| Unlinking, Splitting, and some other NP-hard Problems in Knot Theory
|
2021 |
Koenig, Dale |
| An O(n5/4) Time ∊-Approximation Algorithm for RMS Matching in a Plane
|
2021 |
Lahn, Nathaniel |
Tag hinzufügen