| 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 |
| Shortest Paths Among Obstacles in the Plane Revisited
|
2021 |
Wang, Haitao |
| Efficient Fully Dynamic Elimination Forests with Applications to Detecting Long Paths and Cycles
|
2021 |
Chen, Jiehua |
| A Constant Factor Approximation for Navigating through Connected Obstacles in the Plane
|
2021 |
Kumar, Neeraj |
| Hamiltonicity of random subgraphs of the hypercube
|
2021 |
Condon, Padraig |
| A Tight Condition for Triangle Factors in Pseudorandom Graphs
|
2021 |
Morris, Patrick |
| Beyond Submodular Maximization via One-Sided Smoothness
|
2021 |
Ghadiri, Mehrdad |
| On Multi-Dimensional Gains from Trade Maximization
|
2021 |
Cai, Yang |
| Beating Greedy for Approximating Reserve Prices in Multi-Unit VCG Auctions
|
2021 |
Derakhshan, Mahsa |
| Online Combinatorial Auctions
|
2021 |
Deng, Yuan |
Tag hinzufügen