| 301 |
Tight Distributed Listing of Cliques
Keren Censor-Hillel, Yi-Jun Chang, ... (+2 more)
|
👻
Ghosted
|
cs.DC
|
22 |
5 years ago |
| 302 |
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS
Soheil Behnezhad, Sanjeev Khanna
|
👻
Ghosted
|
cs.DS
|
22 |
4 years ago |
| 303 |
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
Arjan Cornelissen, Yassine Hamoudi
|
👻
Ghosted
|
quant-ph
|
22 |
4 years ago |
| 304 |
An Improved Classical Singular Value Transformation for Quantum Machine Learning
Ainesh Bakshi, Ewin Tang
|
👻
Ghosted
|
quant-ph
|
22 |
3 years ago |
| 305 |
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
Monika Henzinger, Jason Li, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
22 |
2 years ago |
| 306 |
On the insertion time of random walk cuckoo hashing
Alan Frieze, Tony Johansson
|
👻
Ghosted
|
cs.DS
|
21 |
10 years ago |
| 307 |
About the Structure of the Integer Cone and its Application to Bin Packing
Klaus Jansen, Kim-Manuel Klein
|
👻
Ghosted
|
cs.DS
|
21 |
10 years ago |
| 308 |
Opting Into Optimal Matchings
Avrim Blum, Ioannis Caragiannis, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
21 |
10 years ago |
| 309 |
On the discrepancy of random low degree set systems
Nikhil Bansal, Raghu Meka
|
👻
Ghosted
|
cs.DS
|
21 |
7 years ago |
| 310 |
Stochastic Matching with Few Queries: New Algorithms and Tools
Soheil Behnezhad, Alireza Farhadi, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
21 |
7 years ago |
| 311 |
A Truthful Cardinal Mechanism for One-Sided Matching
Rediet Abebe, Richard Cole, ... (+2 more)
|
👻
Ghosted
|
cs.GT
|
21 |
7 years ago |
| 312 |
Tight Bounds for the Subspace Sketch Problem with Applications
Yi Li, Ruosong Wang, David P. Woodruff
|
👻
Ghosted
|
cs.DS
|
21 |
7 years ago |
| 313 |
The Communication Complexity of Set Intersection and Multiple Equality Testing
Dawei Huang, Seth Pettie, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
21 |
7 years ago |
| 314 |
Approximating pathwidth for graphs of small treewidth
Carla Groenland, Gwenaël Joret, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
21 |
6 years ago |
| 315 |
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring
Peter Davies
|
👻
Ghosted
|
cs.DC
|
21 |
4 years ago |
| 316 |
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition
Tuukka Korhonen, Daniel Lokshtanov
|
👻
Ghosted
|
cs.DS
|
21 |
3 years ago |
| 317 |
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time
Shay Mozes, Cyril Nikolaev, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
20 |
10 years ago |
| 318 |
A New Algorithm for the Robust Semi-random Independent Set Problem
Theo McKenzie, Hermish Mehta, Luca Trevisan
|
👻
Ghosted
|
cs.DS
|
20 |
8 years ago |
| 319 |
Adaptive Shivers Sort: An Alternative Sorting Algorithm
Vincent Jugé
|
👻
Ghosted
|
cs.DS
|
20 |
7 years ago |
| 320 |
Testing matrix product states
Mehdi Soleimanifar, John Wright
|
👻
Ghosted
|
quant-ph
|
20 |
4 years ago |
| 321 |
Fast Distributed Brooks' Theorem
Manuela Fischer, Yannic Maus, Magnús M. Halldórsson
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 322 |
Bandit Algorithms for Prophet Inequality and Pandora's Box
Khashayar Gatmiry, Thomas Kesselheim, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 323 |
Approximating Knapsack and Partition via Dense Subset Sums
Mingyang Deng, Ce Jin, Xiao Mao
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 324 |
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
Hsien-Chih Chang, Jonathan Conroy, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
20 |
3 years ago |
| 325 |
Improved List Size for Folded Reed-Solomon Codes
Shashank Srivastava
|
👻
Ghosted
|
cs.IT
|
20 |
1 year ago |
| 326 |
Set Membership with a Few Bit Probes
Mohit Garg, Jaikumar Radhakrishnan
|
👻
Ghosted
|
cs.DS
|
19 |
11 years ago |
| 327 |
Characterisation of Strongly Stable Matchings
Pratik Ghosal, Adam Kunysz, Katarzyna Paluch
|
👻
Ghosted
|
cs.DS
|
19 |
11 years ago |
| 328 |
Partial resampling to approximate covering integer programs
Antares Chen, David G. Harris, Aravind Srinivasan
|
👻
Ghosted
|
cs.DS
|
19 |
11 years ago |
| 329 |
Firefighting on Trees Beyond Integrality Gaps
David Adjiashvili, Andrea Baggio, Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
19 |
10 years ago |
| 330 |
Competitive Algorithms for Generalized k-Server in Uniform Metrics
Nikhil Bansal, Marek Elias, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
19 |
9 years ago |
| 331 |
Branch-and-Bound Solves Random Binary IPs in Polytime
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
|
👻
Ghosted
|
math.OC
|
19 |
6 years ago |
| 332 |
Deterministic Replacement Path Covering
Karthik C. S., Merav Parter
|
👻
Ghosted
|
cs.DS
|
19 |
6 years ago |
| 333 |
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
|
👻
Ghosted
|
cs.DS
|
19 |
5 years ago |
| 334 |
Algorithmic Extensions of Dirac's Theorem
Fedor V. Fomin, Petr A. Golovach, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
19 |
5 years ago |
| 335 |
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results
Lin Chen, Jiayi Lian, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
19 |
3 years ago |
| 336 |
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
Daniel Lokshtanov, Fahad Panolan, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
18 |
9 years ago |
| 337 |
Geometric Rescaling Algorithms for Submodular Function Minimization
Daniel Dadush, László A. Végh, Giacomo Zambelli
|
👻
Ghosted
|
math.OC
|
18 |
9 years ago |
| 338 |
Exact Distance Oracles for Planar Graphs with Failing Vertices
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
|
👻
Ghosted
|
cs.DS
|
18 |
8 years ago |
| 339 |
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
Sayan Bhattacharya, Janardhan Kulkarni
|
👻
Ghosted
|
cs.DS
|
18 |
7 years ago |
| 340 |
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
Rohan Ghuge, Viswanath Nagarajan
|
👻
Ghosted
|
cs.DS
|
18 |
7 years ago |
| 341 |
The Min-Cost Matching with Concave Delays Problem
Yossi Azar, Runtian Ren, Danny Vainstein
|
👻
Ghosted
|
cs.DS
|
18 |
5 years ago |
| 342 |
Improved Approximation for Two-Edge-Connectivity
Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli
|
👻
Ghosted
|
cs.DS
|
18 |
3 years ago |
| 343 |
Fully Dynamic Consistent $k$-Center Clustering
Jakub Łącki, Bernhard Haeupler, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
18 |
3 years ago |
| 344 |
Parameterized algorithms for block-structured integer programs with large entries
Jana Cslovjecsek, Martin Koutecký, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
18 |
2 years ago |
| 345 |
Best-Response Dynamics in Combinatorial Auctions with Item Bidding
Paul Dütting, Thomas Kesselheim
|
👻
Ghosted
|
cs.GT
|
17 |
10 years ago |
| 346 |
On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer
Xi Chen, George Matikas, ... (+2 more)
|
👻
Ghosted
|
cs.GT
|
17 |
9 years ago |
| 347 |
The Bane of Low-Dimensionality Clustering
Vincent Cohen-Addad, Arnaud de Mesmay, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
17 |
8 years ago |
| 348 |
Distributed Algorithms Made Secure: A Graph Theoretic Approach
Merav Parter, Eylon Yogev
|
👻
Ghosted
|
cs.DS
|
17 |
8 years ago |
| 349 |
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
Uriel Feige, Janardhan Kulkarni, Shi Li
|
👻
Ghosted
|
cs.DS
|
17 |
8 years ago |
| 350 |
Sample Efficient Toeplitz Covariance Estimation
Yonina C. Eldar, Jerry Li, ... (+2 more)
|
👻
Ghosted
|
eess.SP
|
17 |
7 years ago |