| 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 |
| 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 |
| 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 |
Tag hinzufügen