default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSOSA 2021, Virtual Conference
- Hung Viet Le, Valerie King:
4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021. SIAM 2021, ISBN 978-1-61197-649-6 - Front Matter.
- Jan van den Brand
:
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms. 1-13 - Gerth Stølting Brodal:
Soft Sequence Heaps. 14-24 - Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
New Bounds for the Vertices of the Integer Hull. 25-36 - Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Dispersion for Intervals: A Geometric Approach. 37-44 - Jean Cardinal, John Iacono:
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. 45-56 - Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. 57-67 - David R. Karger, David P. Williamson:
Recursive Random Contraction Revisited. 68-73 - Pawel Gawrychowski, Shay Mozes, Oren Weimann:
A Note on a Recent Algorithm for Minimum Cut. 74-79 - Thatchaphol Saranurak:
A Simple Deterministic Algorithm for Edge Connectivity. 80-85 - Manoj Gupta, Shahbaz Khan:
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching. 86-91 - Yixin Cao:
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. 92-106 - Alon Eden, Michal Feldman, Amos Fiat, Kineret Segal:
An Economics-Based Analysis of RANKING for Online Bipartite Matching. 107-110 - Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang:
Generalized Sorting with Predictions. 111-117 - Alin Bostan, Ryuhei Mori:
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence. 118-132 - William Kuszmaul, Charles E. Leiserson:
Floors and Ceilings in Divide-and-Conquer Recurrences. 133-141 - Raphael A. Meyer, Cameron Musco, Christopher Musco, David P. Woodruff:
Hutch++: Optimal Stochastic Trace Estimation. 142-155 - Michael Kapralov, Gilbert Maystre, Jakab Tardos:
Communication Efficient Coresets for Maximum Matching. 156-164 - Sepehr Assadi, S. Cliff Liu, Robert E. Tarjan:
An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models. 165-171 - Sepehr Assadi, Aditi Dudeja:
A Simple Semi-Streaming Algorithm for Global Minimum Cuts. 172-180 - Moses Charikar, Paul Liu:
Improved Algorithms for Edge Colouring in the W-Streaming Model. 181-183 - Corinna Coupette, Christoph Lenzen:
A Breezing Proof of the KMW Bound. 184-195 - Georg Anegg, Haris Angelidakis, Rico Zenklusen:
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. 196-203 - Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths. 204-209 - Karthik C. S., Inbal Livni Navon:
On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes. 210-223 - Kasper Green Larsen, Jonathan Lindegaard Starup, Jesper Steensgaard:
Further Unifying the Landscape of Cell Probe Lower Bounds. 224-231 - Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan:
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism. 232-242
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-01 23:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
