| Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
|
2023 |
Bhattacharya, Sayan |
| Maintaining Expander Decompositions via Sparse Cuts
|
2023 |
Hua, Yiding |
| Closing the Gap Between Directed Hopsets and Shortcut Sets
|
2023 |
Bernstein, Aaron |
| Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction
|
2023 |
Nalam, Chaitanya |
| The Price of Stability for First Price Auction
|
2023 |
Jin, Yaonan |
| Competitive Information Design for Pandora's Box
|
2023 |
Ding, Bolin |
| Interdependent Public Projects
|
2023 |
Cohen, Avi |
| A Tight Analysis of Slim Heaps and Smooth Heaps
|
2023 |
Sinnamon, Corwin |
| Approximate Trace Reconstruction from a Single Trace
|
2023 |
Chen, Xi |
| Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-Degree Extension in Time O(n Log n) over All Finite Fields
|
2023 |
Ben-Sasson, Eli |
| 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 |
Tag hinzufügen