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