| A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
|
2023 |
Deligkas, Argyrios |
| Equivalence Test for Read-Once Arithmetic Formulas
|
2023 |
Gupta, Nikhil |
| Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
|
2023 |
Faour, Salwa |
| A Near-Linear Time Sampler for the Ising Model with External Field
|
2023 |
Chen, Xiaoyu |
| The Need for Seed (in the abstract Tile Assembly Model)
|
2023 |
Alseth, Andrew |
| Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth
|
2023 |
Chatterjee, Krishnendu |
| "Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings
|
2023 |
Ezra, Tomer |
| Foundations of Transaction Fee Mechanism Design
|
2023 |
Chung, Hao |
| Near-Linear Sample Complexity for Lp Polynomial Regression
|
2023 |
Meyer, Raphael A. |
| Beating Greedy Matching in Sublinear Time
|
2023 |
Behnezhad, Soheil |
| Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
|
2023 |
Cherapanamjeri, Yeshwanth |
| Testing Convex Truncation
|
2023 |
De, Anindya |
| Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlǎduţ-Zink
|
2023 |
Liu, Shu |
| On the Orbit Closure Intersection Problems for Matrix Tuples under Conjugation and Left-Right Actions
|
2023 |
Ivanyos, Gábor |
| Toeplitz Low-Rank Approximation with Sublinear Query Complexity
|
2023 |
Kapralov, Michael |
| Smaller Low-Depth Circuits for Kronecker Powers
|
2023 |
Alman, Josh |
| A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph
|
2023 |
Dory, Michal |
| Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth
|
2023 |
Cao, Nairen |
| Balanced Allocations with Heterogeneous Bins: The Power of Memory
|
2023 |
Los, Dimitrios |
| Bidder Subset Selection Problem in Auction Design
|
2023 |
Bei, Xiaohui |
Tag hinzufügen