| Near-Linear Time Approximations for Cut Problems via Fair Cuts
|
2023 |
Li, Jason |
| Fast Discrepancy Minimization with Hereditary Guarantees
|
2023 |
Larsen, Kasper Green |
| Optimal Pricing Schemes for an Impatient Buyer
|
2023 |
Deng, Yuan |
| A Tight Quasi-polynomial Bound for Global Label Min-Cut
|
2023 |
Jaffke, Lars |
| Tiny Pointers
|
2023 |
Bender, Michael A. |
| Hierarchies of Minion Tests for PCSPs through Tensors
|
2023 |
Ciardo, Lorenzo |
| Sharp Threshold Sequence and Universality for Ising Perceptron Models
|
2023 |
Nakajima, Shuta |
| Fully Dynamic Exact Edge Connectivity in Sublinear Time
|
2023 |
Goranci, Gramoz |
| Dynamic Algorithms for Maximum Matching Size
|
2023 |
Behnezhad, Soheil |
| Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Cover
|
2023 |
Kogan, Shimon |
| Pricing Query Complexity of Revenue Maximization
|
2023 |
Leme, Renato Paes |
| Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
|
2023 |
Chalermsook, Parinya |
| On Complex Roots of the Independence Polynomial
|
2023 |
Bencs, Ferenc |
| Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths
|
2023 |
Chechik, Shiri |
| Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
|
2023 |
Bhattacharya, Sayan |
| Fair Allocation of a Multiset of Indivisible Items
|
2023 |
Gorantla, Pranay |
| Stronger 3SUM-Indexing Lower Bounds
|
2023 |
Chung, Eldon |
| A Nearly-tight Analysis of Multipass Pairing Heaps
|
2023 |
Sinnamon, Corwin |
| Tight Bounds for Monotone Minimal Perfect Hashing
|
2023 |
Assadi, Sepehr |
| Short Synchronizing Words for Random Automata
|
2023 |
Chapuy, Guillaume |
Tag hinzufügen