paper_id stringlengths 5 42 | title stringlengths 18 153 | authors stringclasses 65
values | year int64 2.02k 2.03k | venue stringclasses 4
values | doi stringclasses 65
values | dblp_key stringclasses 65
values | dblp_url stringclasses 65
values | pdf_path stringclasses 65
values | dag stringlengths 13.8k 236k | num_nodes int64 11 72 | num_edges int64 14 236 |
|---|---|---|---|---|---|---|---|---|---|---|---|
approximating_subset_sum | Approximating Subset Sum Ratio faster than Subset Sum | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Approximating Subset Sum Ratio faster than Subset Sum", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Comparison to Subset Sum", "summary": "Subset Sum Ratio is an optimization variant of Equal Subset Sum. Prior to this work, the best approximation scheme... | 23 | 27 |
approximation_algorithms_weighted | Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation for Weighted Nash Social Welfare", "summary": "While the unweighted Nash Social Welfare problem is well-studied an... | 17 | 24 |
arborescences_colorful_forests | Arborescences, Colorful Forests, and Popularity | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Arborescences, Colorful Forests, and Popularity", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Polynomial-Time Algorithm for Popular Arborescences", "summary": "This paper resolves the open problem of computing a popular arborescence in a directed graph where vertices ha... | 25 | 28 |
bandit_algorithms_prophet | Bandit Algorithms for Prophet Inequality and Pandora’s Box | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Bandit Algorithms for Prophet Inequality and Pandora’s Box", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Bandit Algorithms for Prophet Inequality and Pandora's Box", "summary": "The paper introduces multi-armed bandit algorithms for the Prophet Inequality and Pandora's ... | 13 | 28 |
beyond_quadratic_time | Beyond the Quadratic Time Barrier for Network Unreliability | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Beyond the Quadratic Time Barrier for Network Unreliability", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "The Quadratic Time Barrier", "summary": "Prior algorithms for network unreliability implicitly or explicitly enumerate near-minimum cuts. Since a simple cycle gra... | 21 | 29 |
bin_packing_random-order | Bin Packing under Random-Order: Breaking the Barrier of 3/2 | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Bin Packing under Random-Order: Breaking the Barrier of 3/2", "paper_url": null, "nodes": [{"id": "overview", "type": "overview", "title": "Breaking the 3/2 Barrier for Best-Fit Bin Packing under Random-Order", "summary": "This paper studies the Best-Fit algorithm for online bin packing under random-or... | 21 | 28 |
breaking_barrier_approximate | Breaking the 3/4 Barrier for Approximate Maximin Share | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Breaking the 3/4 Barrier for Approximate Maximin Share", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Breaking the 3/4 Barrier for Approximate Maximin Share", "summary": "This paper studies the fair allocation of indivisible goods among agents with additive valuations us... | 18 | 36 |
cactus_representations_polylogarithmic | Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Almost-Linear Time Algorithms for Steiner Cactus and Hypercactus", "summary": "The paper presents the first almost-linear time algorithms for c... | 22 | 30 |
code_sparsification_applications | Code Sparsification and its Applications | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Code Sparsification and its Applications", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Code Sparsification and its Applications", "summary": "This paper introduces the concept of code sparsification, generalizing graph cut sparsification to linear codes. The main result... | 21 | 24 |
combinatorial_approach_factorization | Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Combinatorial Framework for Approximate Tensorization", "summary": "The paper introduces a combinatorial framework to prove approximate tensori... | 26 | 30 |
combinatorial_contracts_beyond | Combinatorial Contracts Beyond Gross Substitutes | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Combinatorial Contracts Beyond Gross Substitutes", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Combinatorial Contracts Beyond Gross Substitutes", "summary": "This paper investigates the combinatorial contracting problem where a principal incentivizes an agen... | 27 | 35 |
composition_nested_embeddings | Composition of nested embeddings with an application to outlier removal | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Composition of nested embeddings with an application to outlier removal", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Composition of nested embeddings and outlier removal", "summary": "This paper studies the problem of embedding a metric space into Euclidean space while... | 21 | 27 |
computations_polynomial_evaluation | Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper introduces a new complexity hypothesis, POSETH, which strengthens SETH by allowing ... | 19 | 41 |
controlling_tail_risk | Controlling Tail Risk in Online Ski-Rental | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Controlling Tail Risk in Online Ski-Rental", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Controlling Tail Risk in Online Ski-Rental", "summary": "This paper investigates the classic online ski-rental problem with an added constraint: bounding the 'tail risk', which is t... | 23 | 30 |
count_cfi_graphs | Count on CFI graphs for #P-hardness | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Count on CFI graphs for #P-hardness", "paper_url": null, "nodes": [{"id": "node_03", "type": "definition", "title": "Graph Motif Parameter", "summary": "A graph motif parameter is a finite linear combination of homomorphism counts from a set of pairwise non-isomorphic graphs.", "formal_statement": "A g... | 26 | 34 |
delaunay_bifiltrations_functions | DELAUNAY BIFILTRATIONS OF FUNCTIONS ON POINT CLOUDS | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "DELAUNAY BIFILTRATIONS OF FUNCTIONS ON POINT CLOUDS", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Delaunay Bifiltrations", "summary": "The paper introduces the sublevel Delaunay-Čech bifiltration, a computable and topologically faithful multi-scale represent... | 18 | 22 |
dependent_rounding_strong | Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Dependent Rounding and Scheduling Approximation", "summary": "The paper introduces a new depen... | 17 | 24 |
detecting_hidden_communities | Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "This paper presents two algorithms for community detection in the Stochastic Block Model (S... | 22 | 29 |
deterministic_sparse_pattern | Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Deterministic Near-Linear Time Constellation Algorithm", "summary": "This paper presents a deterministic near-linear time algorithm for the Constellation pr... | 20 | 28 |
deterministically_approximating_total | On Deterministically Approximating Total Variation Distance | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "On Deterministically Approximating Total Variation Distance", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Deterministic FPTAS for TV Distance", "summary": "This paper presents a deterministic fully polynomial-time approximation scheme (FPTAS) for computing t... | 24 | 37 |
dynamic_dictionary_subconstant | Dynamic Dictionary with Subconstant Wasted Bits per Key | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Dynamic Dictionary with Subconstant Wasted Bits per Key", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Space-Time Tradeoff for Dictionaries with Subconstant Redundancy", "summary": "Prior state-of-the-art hash tables achieve $O(\\log^{(k)} n)$ wasted bits per key but i... | 24 | 25 |
dynamic_dynamic_time | Dynamic Dynamic Time Warping | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Dynamic Dynamic Time Warping", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Dynamic DTW", "summary": "This paper studies the dynamic version of the Dynamic Time Warping (DTW) distance problem. It presents a dynamic data structure with update and query time $O... | 19 | 25 |
edge-disjoint_paths_expanders | Edge-disjoint paths in expanders: online with removals | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Edge-disjoint paths in expanders: online with removals", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Online Edge-Disjoint Paths with Removals in Expanders", "summary": "The paper presents a deterministic, polynomial-time algorithm for maintaining edge-disjoint paths in ... | 16 | 23 |
effect_sparsity | Understanding the effect of sparsity on neural networks robustness | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Understanding the effect of sparsity on neural networks robustness", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Sparsity and Robustness", "summary": "This paper investigates whether sparsity itself degrades neural network robustness. By evaluating networks ... | 11 | 19 |
efficient_quantum_state | Efficient Quantum State Synthesis with One Query | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Efficient Quantum State Synthesis with One Query", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Efficient Quantum State Synthesis with One Query", "summary": "This paper presents a polynomial-time quantum algorithm that makes a single query to a classical oracle to const... | 19 | 23 |
euclidean_bottleneck_steiner | Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Open Question on FPT Status of EBST", "summary": "While the $\\ell_1$ and $\\ell_\\infty$ variants of the Bottleneck Steiner Tree problem were known to be FPT,... | 16 | 20 |
exact_shortest_paths | Exact Shortest Paths with Rational Weights on the Word RAM | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Exact Shortest Paths with Rational Weights on the Word RAM", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Exact Shortest Paths with Rational Weights on the Word RAM", "summary": "This paper investigates the exact single-source shortest paths (SSSP) problem for graphs wit... | 20 | 26 |
extremal_functions_acyclic | On the Extremal Functions of Acyclic Forbidden 0–1 Matrices | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "On the Extremal Functions of Acyclic Forbidden 0–1 Matrices", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Extremal Functions of Acyclic Forbidden 0-1 Matrices", "summary": "The paper investigates the extremal function of acyclic forbidden 0-1 matrices. It es... | 17 | 29 |
factoring_pattern-free_permutations | Factoring Pattern-Free Permutations into Separable ones | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Factoring Pattern-Free Permutations into Separable ones", "paper_url": null, "nodes": [{"id": "node_03", "type": "theorem", "title": "Main Theorem: Factorisation of Pattern-Free Permutations", "summary": "The paper proves that any permutation avoiding a fixed pattern can be factored into a bounded numb... | 22 | 22 |
fast_2-approximate_all-pairs | Fast 2-Approximate All-Pairs Shortest Paths | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Fast 2-Approximate All-Pairs Shortest Paths", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Fast 2-Approximate All-Pairs Shortest Paths", "summary": "The paper presents faster algorithms for 2-approximate All-Pairs Shortest Paths (APSP) in undirected graphs. For unweighte... | 18 | 21 |
fast_accurate_approximations | Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Fast and Accurate Approximations of Optimal Transport", "summary": "The paper presents three approximation algorithms for geome... | 22 | 28 |
fast_sampling | Fast Sampling of Protein Conformational Dynamics | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Fast Sampling of Protein Conformational Dynamics", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Fast Sampling of Protein Conformational Dynamics using FRESEAN", "summary": "The paper presents a method to efficiently sample protein conformational dynamics by using anharmo... | 13 | 15 |
faster_algorithms_bounded | Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Faster Algorithms for Bounded Knapsack and Subset Sum", "summary": "The paper presents faster pseudopolynomial-time... | 26 | 34 |
faster_exact_approximation | Faster exact and approximation algorithms for packing and covering matroids via push-relabel | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Faster exact and approximation algorithms for packing and covering matroids via push-relabel", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Faster algorithms for matroid packing and covering via push-relabel", "summary": "This paper develops faster exact and approximatio... | 24 | 32 |
faster_rectangular_matrix | Faster Rectangular Matrix Multiplication by Combination Loss Analysis | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Faster Rectangular Matrix Multiplication by Combination Loss Analysis", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "This paper improves the upper bounds on the exponent of rectangular matrix multiplication, $\\omega(\\kappa)$. It achi... | 21 | 33 |
faster_sublinear-time_edit | Faster Sublinear-Time Edit Distance | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Faster Sublinear-Time Edit Distance", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "Computing exact edit distance takes $O(n^2)$ time, which is tight under SETH. The Landau-Vishkin algorithm takes $O(n+k^2)$ time. To achieve subli... | 22 | 30 |
flip_graph_connectivity | Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Flip Graph Connectivity", "summary": "This paper studies the connectivity and diameter of triangle flip graphs for arrangements of pseudol... | 26 | 29 |
fully_dynamic_approximation | Fully dynamic approximation schemes on planar and apex-minor-free graphs | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Fully dynamic approximation schemes on planar and apex-minor-free graphs", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Dynamic Baker's Technique", "summary": "Baker's technique is a fundamental tool for static approximation schemes on planar graphs. Extending it to fu... | 24 | 33 |
fully_dynamic_min-cut | Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time", "paper_url": null, "nodes": [{"id": "motivation", "type": "motivation", "title": "Motivation and Prior Work", "summary": "Previously, the best worst-case update time for fully dynamic exact $c$-edge connectivity for $c > 2$ was $\\tild... | 27 | 28 |
fully_dynamic_shortest | Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview", "summary": "The paper presents the first fully dynamic algorithm for maintaining shortest paths against an adaptive adversary in subquadratic upd... | 27 | 31 |
grid-minor_theorem_revisited | THE GRID-MINOR THEOREM REVISITED | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "THE GRID-MINOR THEOREM REVISITED", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Product Structure for Minor-Free Graphs", "summary": "The paper proves a qualitative strengthening of the Grid-Minor Theorem using graph product structure. It shows that any graph... | 21 | 28 |
hardness_finding_balanced | On the hardness of finding balanced independent sets in random bipartite graphs | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "On the hardness of finding balanced independent sets in random bipartite graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Statistical-Computational Gap for Balanced Independent Sets", "summary": "The paper studies the problem of finding large balanced independent se... | 30 | 59 |
hierarchy_hereditary_sorting | The Hierarchy of Hereditary Sorting Operators | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "The Hierarchy of Hereditary Sorting Operators", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "The Hierarchy of Hereditary Sorting Operators", "summary": "This paper studies a general model of sorting where the allowed operations in a single step form a hereditary permutat... | 20 | 24 |
higher-order_cheeger_inequality | Higher-Order Cheeger Inequality for Partitioning with Buffers | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Higher-Order Cheeger Inequality for Partitioning with Buffers", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Overcoming the Square-Root Loss", "summary": "Standard spectral partitioning algorithms suffer from a 'square-root loss' in their approximation guarantees, whic... | 17 | 21 |
how_many_neurons | How Many Neurons Does it Take to Approximate the Maximum? | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "How Many Neurons Does it Take to Approximate the Maximum?", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of \"How Many Neurons Does it Take to Approximate the Maximum?\"", "summary": "This paper investigates the depth-width trade-offs required for a neural netwo... | 20 | 39 |
identity_problem_nilpotent | The Identity Problem in nilpotent groups of bounded class | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "The Identity Problem in nilpotent groups of bounded class", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper proves that the Identity Problem and the Group Problem are decidable in polynomial time for finitely generated subsemigr... | 26 | 55 |
impossibilities_obviously_strategy-proof | Impossibilities for Obviously Strategy-Proof Mechanisms | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Impossibilities for Obviously Strategy-Proof Mechanisms", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of OSP Impossibilities in Auctions", "summary": "The paper investigates the approximation power of deterministic obviously strategy-proof (OSP) mechanisms for ... | 17 | 26 |
improved_approximation_algorithms | Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Improved Approximation Algorithms for JRP with Outliers and Fairness", "summary": "This paper introduces the ... | 24 | 33 |
improved_approximations_ultrametric | Improved Approximations for Ultrametric Violation Distance | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Improved Approximations for Ultrametric Violation Distance", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Improved Approximations for Ultrametric Violation Distance", "summary": "This paper studies the Ultrametric Violation Distance problem, which asks for th... | 25 | 61 |
improved_bounds_point | Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Astronomical Exponents in Prior Work", "summary": "Previous bounds for the Second Selection Theorem had an astronomical exponent of $(4d+1)^... | 24 | 39 |
induced-minor-free_graphs_separator | Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Induced-Minor-Free Graphs", "summary": "The paper establishes a separator theorem for graphs excluding... | 22 | 27 |
linear-sized_sparsifiers_near-linear | Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory", "summary": "The paper introduces a new framework for discrepancy minimization that relies on... | 26 | 33 |
maintaining_matroid_intersections | Maintaining Matroid Intersections Online | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Maintaining Matroid Intersections Online", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Maintaining Matroid Intersections Online (Main Theorem)", "summary": "The paper studies the online matroid intersection maintenance problem with recourse, where elements of a partitio... | 18 | 28 |
near-optimal_min-sum_motion | Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment", "paper_url": null, "nodes": [{"id": "node_motivation", "type": "motivation", "title": "Motivation and Gap in Multi-Robot Motion Planning", "summary": "While finding a feasible motion plan for two simple robots in a ... | 18 | 28 |
near-optimal_quantum_algorithms | Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel–Ziv Factorization | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel–Ziv Factorization", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Near-Optimal Quantum Algorithms for String Problems", "summary": "This paper presents near-optimal quantum algorithms for two... | 25 | 36 |
new_sdp_roundings | New SDP Roundings and Certifiable Approximation for Cubic Optimization | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "New SDP Roundings and Certifiable Approximation for Cubic Optimization", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of New SDP Roundings for Cubic Optimization", "summary": "This paper introduces new rounding schemes for Sum-of-Squares (SoS) SDP relaxations to... | 20 | 28 |
odd_cycle_transversal | Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Complexity of OCT on H-free graphs", "summary": "OCT is a classic vertex deletion problem that is NP-hard in general. For $H$-free graphs, it was known to be po... | 17 | 24 |
optimal_algorithm_higher-order | An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Optimal Order-k Voronoi Diagram Algorithm", "summary": "This paper presents the first optimal randomized algor... | 20 | 23 |
optimal_bounds_private | Optimal Bounds on Private Graph Approximation | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Optimal Bounds on Private Graph Approximation", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Optimal Bounds on Private Graph Approximation", "summary": "This paper presents novel differentially private algorithms for approximating the spectrum and cut sizes of weighted g... | 25 | 28 |
optimal_thresholds_latin | OPTIMAL THRESHOLDS FOR LATIN SQUARES, STEINER TRIPLE SYSTEMS, AND EDGE COLORINGS | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "OPTIMAL THRESHOLDS FOR LATIN SQUARES, STEINER TRIPLE SYSTEMS, AND EDGE COLORINGS", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Optimal Thresholds for Latin Squares, Steiner Triple Systems, and Edge Colorings", "summary": "The paper determines the optimal threshold $\\Th... | 18 | 20 |
optimality_glauber_dynamics | Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Optimality of Glauber dynamics for Ising models", "summary": "The paper provides evidence that Glauber dynamics is optimal... | 17 | 29 |
parameterized_algorithms_block-structured | Parameterized algorithms for block-structured integer programs with large entries | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Parameterized algorithms for block-structured integer programs with large entries", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Parameterized algorithms for block-structured integer programs with large entries", "summary": "This paper shows that two-stage stochastic and... | 23 | 34 |
positivity_certificates_linear | POSITIVITY CERTIFICATES FOR LINEAR RECURRENCES | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "POSITIVITY CERTIFICATES FOR LINEAR RECURRENCES", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Positivity Certificates for Linear Recurrences", "summary": "This paper presents an algorithm to prove or disprove the positivity of solutions to linear recurrences ... | 16 | 22 |
prior-independent_auctions_heterogeneous | Prior-Independent Auctions for Heterogeneous Bidders | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Prior-Independent Auctions for Heterogeneous Bidders", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Prior-Independent Auctions for Heterogeneous Bidders", "summary": "The paper studies prior-independent auction design for heterogeneous bidders. It introduces a novel \"ei... | 22 | 30 |
quasi-monte_carlo_data | A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations", "summary": "The paper introduces a novel data structure for kernel density estimation (KDE) wi... | 21 | 23 |
randomized_communication_implicit | Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Implicit Representations and Communication Complexity", "summary": "Finding implicit representations for graphs of bounded si... | 24 | 36 |
recovering_original_simplicity | Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Succinct and Deterministic Quantum Algorithm for the Welded Tree Problem", "summary": "This paper presents a simple... | 14 | 32 |
representative_set_statements | Representative set statements for delta-matroids and the Mader delta-matroid | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Representative set statements for delta-matroids and the Mader delta-matroid", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Representative set statements for delta-matroids and Mader networks", "summary": "The paper generalizes the representative sets lemma from linear m... | 22 | 27 |
revenue_maximization_buyers | Revenue Maximization for Buyers with Costly Participation | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Revenue Maximization for Buyers with Costly Participation", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Revenue Maximization with Costly Participation", "summary": "The paper studies revenue-maximizing mechanisms for selling a single item to buyers who incur private cos... | 25 | 29 |
robust_1-bit_compressed | Robust 1-bit Compressed Sensing with Iterative Hard Thresholding | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Robust 1-bit Compressed Sensing with Iterative Hard Thresholding", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Suboptimal Sample Complexity in Prior Noisy 1bCS", "summary": "Existing algorithms for noisy 1-bit compressed sensing either require exact knowledge of the n... | 19 | 24 |
robust_sparsification_matroid | Robust Sparsification for Matroid Intersection with Applications | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Robust Sparsification for Matroid Intersection with Applications", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of DCS for Matroid Intersection", "summary": "The paper introduces the Density Constrained Subset (DCS), a sparsifier for the matroid intersection pro... | 22 | 34 |
santa_claus_meets | Santa Claus meets Makespan and Matroids: Algorithms and Reductions | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Santa Claus meets Makespan and Matroids: Algorithms and Reductions", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Makespan and Santa Claus Reductions", "summary": "This paper explores the relationship between makespan minimization on unrelated parallel machin... | 23 | 29 |
set_covering_eyes | Set Covering with Our Eyes Wide Shut | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Set Covering with Our Eyes Wide Shut", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Universal Prophet Algorithms for Covering Problems", "summary": "This paper introduces a generic reduction framework that translates random-order online algorithms for a broad... | 22 | 35 |
shortcut_partitions_minor-free | Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Shortcut Partitions in Minor-Free Graphs", "summary": "The paper constructs a deterministic shortcut partition for $K_r... | 23 | 33 |
simple_delegated_choice | Simple Delegated Choice | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Simple Delegated Choice", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Simple Delegated Choice", "summary": "This paper studies a discrete choice delegation problem where an uninformed principal restricts the choices of an informed but biased agent. The autho... | 18 | 24 |
simpler_higher_lower | Simpler and Higher Lower Bounds for Shortcut Sets | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Simpler and Higher Lower Bounds for Shortcut Sets", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Simpler and Higher Lower Bounds for Shortcut Sets", "summary": "This paper studies the shortcut set problem, which asks how much the diameter of a directed graph ... | 19 | 28 |
single-source_unsplittable_flows | Single-Source Unsplittable Flows in Planar Graphs | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Single-Source Unsplittable Flows in Planar Graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Single-Source Unsplittable Flows in Planar Graphs", "summary": "This paper studies the single-source unsplittable flow (SSUF) problem, where flow from a source to... | 21 | 36 |
smoothed_complexity_swap | Smoothed Complexity of SWAP in Local Graph Partitioning | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Smoothed Complexity of SWAP in Local Graph Partitioning", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Smoothed Complexity of SWAP and 2-FLIP", "summary": "The paper establishes the first quasipolynomial upper bound for the smoothed complexity of the SWAP alg... | 21 | 31 |
sorting_pattern-avoiding_permutations | Sorting Pattern-Avoiding Permutations via 0–1 Matrices Forbidding Product Patterns | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Sorting Pattern-Avoiding Permutations via 0–1 Matrices Forbidding Product Patterns", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Sorting Pattern-Avoiding Permutations", "summary": "This paper investigates the time complexity of sorting permutations that avoi... | 19 | 23 |
sorting_selection_rounds | Sorting and Selection in Rounds with Adversarial Comparisons | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Sorting and Selection in Rounds with Adversarial Comparisons", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Sorting and Selection with Adversarial Comparisons", "summary": "This paper studies sorting and selection algorithms under an adaptive adversarial comp... | 26 | 33 |
sparse_induced_subgraphs | Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "Courcelle's theorem allows solving CMSO2 problems on graphs of bounded treewid... | 24 | 38 |
sparse_regular_expression | Sparse Regular Expression Matching | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Sparse Regular Expression Matching", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Sparse Regular Expression Matching", "summary": "The paper introduces a density parameter to capture the amount of nondeterminism in simulating a nondeterministic finite automat... | 21 | 24 |
strongly_polynomial_frame | Strongly Polynomial Frame Scaling to High Precision | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Strongly Polynomial Frame Scaling to High Precision", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Strongly Polynomial Frame Scaling to High Precision", "summary": "The paper presents a deterministic, strongly polynomial time algorithm for the frame scaling problem with ... | 23 | 30 |
sub-exponential_lower_bounds | Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Sub-Exponential Lower Bounds for Branch-and-Bound", "summary": "This paper establishes the first sub-exponential lower... | 22 | 43 |
sublinear_time_low-rank | Sublinear Time Low-Rank Approximation of Toeplitz Matrices | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Sublinear Time Low-Rank Approximation of Toeplitz Matrices", "paper_url": null, "nodes": [{"id": "overview", "type": "overview", "title": "Sublinear Time Low-Rank Approximation of Toeplitz Matrices", "summary": "The paper presents a sublinear time algorithm for computing a near-optimal low-rank approxi... | 13 | 16 |
supermodular_contracts_dense | On Supermodular Contracts and Dense Subgraphs | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "On Supermodular Contracts and Dense Subgraphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Supermodular Contracts and Dense Subgraphs", "summary": "This paper investigates combinatorial contract design when the principal's utility is supermodular. It provides a strongl... | 19 | 23 |
tight_approximability_max | Tight approximability of MAX 2-SAT and relatives, under UGC | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Tight approximability of MAX 2-SAT and relatives, under UGC", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Tight approximability of MAX 2-SAT and relatives", "summary": "The paper proves Austrin's Simplicity Conjecture, establishing that the Lewin-Livnat-Zwick (LLZ) algo... | 20 | 23 |
tight_lower_bound | Tight Lower Bound on Equivalence Testing in Conditional Sampling Model | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Tight Lower Bound on Equivalence Testing in Conditional Sampling Model", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "This paper resolves the query complexity of equivalence testing for discrete distributions in the conditional samplin... | 18 | 28 |
time_complexity_fully | The Time Complexity of Fully Sparse Matrix Multiplication | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "The Time Complexity of Fully Sparse Matrix Multiplication", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Time Complexity of Fully Sparse Matrix Multiplication", "summary": "This paper investigates the time complexity of multiplying sparse matrices, parameterized by both ... | 23 | 35 |
tree_containment_minimum | Tree Containment Above Minimum Degree is FPT | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Tree Containment Above Minimum Degree is FPT", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "Finding subgraphs based on degree conditions is a fundamental problem in extremal graph theory. While Chvátal's Lemma provides a tight co... | 25 | 33 |
universality_spectral_independence | Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Universality of Spectral Independence and Fast Mixing", "summary": "The paper establishes that spectral independence is a universal prope... | 16 | 21 |
unreasonable_effectiveness_single | On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Single Vector Krylov Methods for Low-Rank Approximation", "summary": "This paper proves that single vector and small bl... | 31 | 51 |
vc_set_systems | VC Set Systems in Minor-free (Di)Graphs and Applications | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "VC Set Systems in Minor-free (Di)Graphs and Applications", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of VC Set Systems in Minor-free Graphs", "summary": "This paper systematically studies VC set systems in both undirected and directed minor-free graphs. It in... | 23 | 36 |
vertical_decomposition_3d | Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Vertical Decomposition in 3D and 4D and Applications", "summary": "This paper resolves several open problems regarding the comple... | 22 | 28 |
viderman_algorithm_quantum | Viderman’s algorithm for quantum LDPC codes | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "Viderman’s algorithm for quantum LDPC codes", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Need for Quantum Erasure-Conversion Algorithms", "summary": "Existing quantum LDPC decoders (like SSFlip) are greedy bit-flip algorithms. Viderman's algorithm offers a fundamenta... | 20 | 27 |
whole_new_ball | A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions | null | 2,024 | SODA 2024 | null | null | null | null | {"paper_title": "A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper Overview", "summary": "The paper presents a primal accelerated first-order method for minimizing the ma... | 16 | 20 |
amm_combinatorial_securities | Designing Automated Market Makers for Combinatorial Securities: A Geometric Viewpoint | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Designing Automated Market Makers for Combinatorial Securities: A Geometric Viewpoint", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of AMMs via Computational Geometry", "summary": "This paper establishes a novel connection between the design of automated market... | 28 | 45 |
beyond_2approx_kcenter | Beyond 2-approximation for $k$-Center in Graphs | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Beyond 2-approximation for $k$-Center in Graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Beyond 2-approximation for k-Center", "summary": "This paper breaks the long-standing factor-2 approximation barrier for the k-Center problem in unweighted, undirec... | 19 | 24 |
bilateral_trade_broker | Gains-from-Trade in Bilateral Trade with a Broker | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Gains-from-Trade in Bilateral Trade with a Broker", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Gains-from-Trade in Bilateral Trade with a Broker", "summary": "This paper investigates bilateral trade where a buyer and seller interact exclusively through a profit-maximiz... | 22 | 28 |
bubble_up_cuckoo | Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Gap in Online $d$-ary Cuckoo Hashing", "summary": "Prior work on online $d$-ary cuckoo hashing either required $d = \\Theta(\\log \\epsilon^{-1})$ for fa... | 18 | 24 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.