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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
nearly_optimal_bounds | Nearly Optimal Bounds for Stochastic Online Sorting | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Nearly Optimal Bounds for Stochastic Online Sorting", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Nearly Optimal Bounds for Stochastic Online Sorting", "summary": "This paper studies the stochastic online sorting problem, where items drawn uniformly at rando... | 20 | 23 |
nearly_tight_bounds | Nearly Tight Bounds for the Online Sorting Problem | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Nearly Tight Bounds for the Online Sorting Problem", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Nearly Tight Bounds for the Online Sorting Problem", "summary": "This paper almost completely resolves the online sorting problem, where $n$ numbers arriving online must be ... | 22 | 30 |
nearly_tight_sample | Nearly Tight Sample Complexity for Matroid Online Contention Resolution | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Nearly Tight Sample Complexity for Matroid Online Contention Resolution", "paper_url": null, "nodes": [{"id": "motivation", "type": "motivation", "title": "Motivation for Sample-Based Prophet Inequalities", "summary": "Classical prophet inequalities assume full knowledge of the underlying value distrib... | 19 | 23 |
networked_information_aggregation | Networked Information Aggregation via Machine Learning | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Networked Information Aggregation via Machine Learning", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Networked Information Aggregation", "summary": "This paper studies a distributed learning problem where agents in a directed acyclic graph (DAG) sequentially... | 21 | 35 |
new_oracles_labeling | New Oracles and Labeling Schemes for Vertex Cut Queries | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "New Oracles and Labeling Schemes for Vertex Cut Queries", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Vertex Cut Data Structures", "summary": "This paper studies succinct data structures—centralized oracles and distributed labeling schemes—for answering glob... | 20 | 23 |
online_3-taxi_general | Online 3-Taxi on General Metrics | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Online 3-Taxi on General Metrics", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "The hard $k$-taxi problem is a fundamental generalization of the $k$-server problem that is known to be exponentially harder. While the $k=2$ case wa... | 22 | 36 |
online_conformal_prediction | Online Conformal Prediction with Efficiency Guarantees | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Online Conformal Prediction with Efficiency Guarantees", "paper_url": null, "nodes": [{"id": "node_overview", "type": "overview", "title": "Overview of Online Conformal Prediction with Efficiency Guarantees", "summary": "This paper introduces a novel online framework for conformal prediction that expli... | 22 | 46 |
online_joint_replenishment | Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Online JRP with Arbitrary Costs", "summary": "This paper resolves an open problem in the Online Joint Replenishment Problem (JRP) by pro... | 20 | 33 |
online_orthogonal_vectors | Online Orthogonal Vectors Revisited | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Online Orthogonal Vectors Revisited", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Online Orthogonal Vectors Revisited", "summary": "This paper presents new deterministic data structures for the Online Orthogonal Vectors (OnlineOV) problem, improving upper bo... | 24 | 30 |
online_proportional_apportionment | Online Proportional Apportionment | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Online Proportional Apportionment", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Online Proportional Apportionment", "summary": "The paper introduces an online framework for proportional apportionment where seats are allocated sequentially without knowledge of future vot... | 21 | 34 |
optimal_density_bound | An Optimal Density Bound for Discretized Point Patrolling | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "An Optimal Density Bound for Discretized Point Patrolling", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper resolves the $2^i+1$ conjecture for the discretized point patrolling problem (also known as pinwheel covering), proving ... | 21 | 31 |
optimal_random_access | Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of 2D Compressed Indexing Results", "summary": "This paper advances the theory of compressed indexing for 2D strings by providing both alg... | 18 | 23 |
optimal_rounding_two-stage | Optimal Rounding for Two-Stage Bipartite Matching | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Optimal Rounding for Two-Stage Bipartite Matching", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Optimal Rounding for Two-Stage Bipartite Matching", "summary": "This paper studies the two-stage bipartite matching problem, where edges are revealed in two batches and an on... | 28 | 37 |
optimal_type-dependent_liquid | Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Type-Dependent Smoothness for Autobidding", "summary": "This paper investigates the liquid welfare Price of Anarchy (POA) of si... | 21 | 24 |
parameterized_linear_formulation | A parameterized linear formulation of the integer hull | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A parameterized linear formulation of the integer hull", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Universal Matrix for Integer Hulls", "summary": "Prior work by Cook et al. (1986) established that there is a universal matrix $M$ such that the integer hull of $P(b)$... | 16 | 18 |
peeling_rotten_potatoes | Peeling Rotten Potatoes for a Faster Approximation of Convex Cover | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Peeling Rotten Potatoes for a Faster Approximation of Convex Cover", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Faster Approximation for Convex Cover", "summary": "The paper presents an $O(n^8)$-time $O(\\log n)$-approximation algorithm for the Minimum Conv... | 19 | 22 |
perfect_matchings_random | PERFECT MATCHINGS IN RANDOM SPARSIFICATIONS OF DENSE HYPERGRAPHS | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "PERFECT MATCHINGS IN RANDOM SPARSIFICATIONS OF DENSE HYPERGRAPHS", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Perfect Matchings in Random Sparsifications", "summary": "This paper investigates the existence of perfect matchings and F-factors in random sparsi... | 21 | 32 |
phase_transition_sinkhorn-knopp | PHASE TRANSITION OF THE SINKHORN-KNOPP ALGORITHM | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "PHASE TRANSITION OF THE SINKHORN-KNOPP ALGORITHM", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Phase Transition of the Sinkhorn-Knopp Algorithm", "summary": "This paper establishes a sharp phase transition in the iteration complexity of the Sinkhorn-Knopp algorithm for ... | 24 | 28 |
polynomial-time_classical_simulation | Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Classical Simulation of Noisy Quantum Circuits", "summary": "The paper presents a polynomial-time classical algor... | 23 | 26 |
post-quantum_lower_bound | A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Post-Quantum Lower Bound for Distributed LLL", "summary": "This paper establishes a superconstant lower bound of $2^{\\Omega(\\log^* n)}$ for the ... | 21 | 26 |
power_matching_online | The Power of Matching for Online Fractional Hedonic Games | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "The Power of Matching for Online Fractional Hedonic Games", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Online Fractional Hedonic Games", "summary": "This paper studies online coalition formation in fractional hedonic games (FHGs) with the goal of maximizing... | 18 | 24 |
problems_optimization_computational | PROBLEMS FROM OPTIMIZATION AND COMPUTATIONAL ALGEBRA EQUIVALENT TO HILBERT’S NULLSTELLENSATZ | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "PROBLEMS FROM OPTIMIZATION AND COMPUTATIONAL ALGEBRA EQUIVALENT TO HILBERT’S NULLSTELLENSATZ", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper demonstrates that several important problems from optimization and computational alge... | 31 | 60 |
prophet_inequality_samples | Prophet Inequality from Samples: Is the More the Merrier? | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Prophet Inequality from Samples: Is the More the Merrier?", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Prophet Inequality from Samples", "summary": "This paper studies the single-choice prophet inequality problem where the decision-maker only has access to ... | 18 | 28 |
quantum_advantage_solving | Quantum Advantage via Solving Multivariate Polynomials | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Quantum Advantage via Solving Multivariate Polynomials", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Quantum Advantage via Solving Multivariate Polynomials", "summary": "This paper presents a new quantum algorithm that solves a specific average-case NP search problem in... | 19 | 24 |
quantum_chromatic_gap | On the quantum chromatic gap | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "On the quantum chromatic gap", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Unbounded Quantum Chromatic Gap via Pseudo-Telepathy", "summary": "The paper establishes that the gap between the quantum and classical chromatic numbers of graphs can be unbounded, conditional o... | 27 | 55 |
quantum_state_preparation | Quantum State Preparation with Optimal T-Count | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Quantum State Preparation with Optimal T-Count", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Cost of Magic States and Prior Suboptimal Bounds", "summary": "Non-Clifford gates like the T gate are vastly more expensive to implement fault-tolerantly than Clifford gates d... | 19 | 28 |
quasi-polynomial_bound_minimal | A quasi-polynomial bound for the minimal excluded minors for a surface | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A quasi-polynomial bound for the minimal excluded minors for a surface", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Gap in bounds for excluded minors", "summary": "While Robertson and Seymour proved that any surface has a finite set of minimal excluded minors, their ... | 18 | 27 |
rapid_mixing_glauber | Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "This paper establishes a new comparison theorem for the mixing time of Glauber dynamics on monotone systems ... | 25 | 37 |
recognizing_leaf_powers | Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "This paper resolves a long-standing open problem by proving that recognizing leaf powers and pairwise compatibility... | 30 | 64 |
robust_equilibria_shared | Robust Equilibria in Shared Resource Allocation via Strengthening Border’s Theorem | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Robust Equilibria in Shared Resource Allocation via Strengthening Border’s Theorem", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper introduces the Budgeted Robust Border (BRB) mechanism for the repeated non-monetary allocation ... | 21 | 25 |
rumour_spreading_depends | RUMOUR SPREADING DEPENDS ON THE LATENT GEOMETRY AND DEGREE DISTRIBUTION IN SOCIAL NETWORK MODELS | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "RUMOUR SPREADING DEPENDS ON THE LATENT GEOMETRY AND DEGREE DISTRIBUTION IN SOCIAL NETWORK MODELS", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Rumour Spreading in GIRGs", "summary": "This paper investigates the speed of push-pull rumour spreading in Geometri... | 20 | 41 |
selfish_local_online | Selfish, Local and Online Scheduling via Vector Fitting | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Selfish, Local and Online Scheduling via Vector Fitting", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Vector Fitting for Scheduling and Congestion Games", "summary": "The paper introduces a unified dual fitting technique based on a single semidefinite progra... | 20 | 22 |
separations_between_oblivious | Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Oblivious vs Adaptive Separations", "summary": "This paper establishes the first exponential update-time separations betwe... | 24 | 31 |
short_circuit_walks | Short circuit walks in fixed dimension | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Short circuit walks in fixed dimension", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Short Circuit Walks in Fixed Dimension", "summary": "This paper proves that finding a shortest monotone circuit walk to an optimum in a linear program is NP-hard, even in fi... | 24 | 28 |
shortcuts_transitive-closure_spanners | Shortcuts and Transitive-Closure Spanners Approximation | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Shortcuts and Transitive-Closure Spanners Approximation", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Shortcuts and Transitive-Closure Spanners Approximation", "summary": "The paper investigates polynomial-time approximation algorithms for computing shortcuts and transi... | 23 | 35 |
simple_fast_reduction | A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows", "summary": "The paper presents a simple, efficient reduction from Gomory-Hu trees to... | 24 | 34 |
smooth_trade-off_tensor | Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Sharp Bounds for Kikuchi Matrices and Tensor PCA", "summary": "This paper resolves a conjecture regarding the spectral norm of Kikuchi matrice... | 22 | 35 |
space-efficient_k-mismatch_text | Space-Efficient $k$-Mismatch Text Indexes | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Space-Efficient $k$-Mismatch Text Indexes", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Space-Efficient k-Mismatch Text Indexes", "summary": "This paper presents improved space-efficient data structures for the $k$-mismatch text indexing problem. It achieves $O(n \\log^... | 14 | 16 |
sparsifying_cayley_graphs | Sparsifying Cayley Graphs on Every Group | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Sparsifying Cayley Graphs on Every Group", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Sparsifying Cayley Graphs on Every Group", "summary": "The paper proves that every Cayley graph over any finite group admits a spectral sparsifier that preserves only a polylogarithmi... | 19 | 23 |
sparsifying_sums_positive | Sparsifying Sums of Positive Semidefinite Matrices | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Sparsifying Sums of Positive Semidefinite Matrices", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of PSD Matrix Sparsification", "summary": "This paper introduces an instance-specific theory for sparsifying sums of arbitrary positive semidefinite (PSD) matrices.... | 20 | 29 |
strongly_polynomial_parallel | Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Strongly Polynomial Parallel SSSP", "summary": "This paper presents new strongly polynomial parallel algorithms for the single-source shortest p... | 25 | 29 |
sublinear_metric_steiner | Sublinear Metric Steiner Forest via Maximal Independent Set | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Sublinear Metric Steiner Forest via Maximal Independent Set", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Sublinear Metric Steiner Forest", "summary": "This paper presents the first sublinear-time algorithm for the Metric Steiner Forest problem, achieving an... | 21 | 33 |
succinct_dynamic_rank | Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "The Tree-Structure Bottleneck", "summary": "Prior dynamic time-optimal solutions rely on tree structures whose dynamically changing topology requires at... | 21 | 24 |
tight_differentially_private | Tight Differentially Private PCA via Matrix Coherence | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Tight Differentially Private PCA via Matrix Coherence", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Tight Differentially Private PCA via Matrix Coherence", "summary": "This paper presents a novel, efficient algorithm for differentially private Principal Component Analys... | 20 | 25 |
time-biased_random_walks | Time-Biased Random Walks and Robustness of Expanders | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Time-Biased Random Walks and Robustness of Expanders", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Time-Biased Random Walks and Robustness of Expanders", "summary": "This paper investigates the robustness of the spectral gap of random walks on regular graphs... | 19 | 29 |
tree_covers_size | Tree covers of size 2 for the Euclidean plane | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Tree covers of size 2 for the Euclidean plane", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Tree Covers of Size 2", "summary": "This paper resolves the question of the minimum number of trees required to form a constant-stretch tree cover for a set of points... | 20 | 23 |
tree_embedding_high | Tree Embedding in High Dimensions: Dynamic and Massively Parallel | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Tree Embedding in High Dimensions: Dynamic and Massively Parallel", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Dynamic and MPC Tree Embeddings", "summary": "The paper introduces a new framework for constructing probabilistic tree embeddings in general metri... | 19 | 40 |
truly_subcubic_combinatorial | A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "The Curious Case of the 4-Cycle", "summary": "Prior work has classified the complexity of detecting almost all small induced subgraphs relative to cliq... | 23 | 32 |
unbounded_error_correcting | Unbounded Error Correcting Codes | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Unbounded Error Correcting Codes", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Unbounded Error Correcting Codes", "summary": "The paper introduces unbounded error-correcting codes for continuous streams where the message length is unknown. It establishes nearly tight bo... | 24 | 32 |
unconditional_lower_bound | An unconditional lower bound for the active-set method in convex quadratic maximization | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "An unconditional lower bound for the active-set method in convex quadratic maximization", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Closing the Gap to Linear Objectives", "summary": "Finding a polynomial-time pivot rule for the simplex method is a major open problem... | 17 | 20 |
universal_connection_schedules | Universal Connection Schedules for Reconfigurable Networking | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Universal Connection Schedules for Reconfigurable Networking", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Universal Connection Schedules for Reconfigurable Networking", "summary": "This paper introduces the first universal connection schedules for oblivious routing in ... | 21 | 29 |
vizing_theorem_deterministic | Vizing’s Theorem in Deterministic Almost-Linear Time | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Vizing’s Theorem in Deterministic Almost-Linear Time", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Breaking the Deterministic O(m√n) Barrier", "summary": "While randomized algorithms for Vizing's theorem have recently achieved near-linear time, the best deterministic ... | 13 | 19 |
weighted_k-server_admits | Weighted $k$-Server Admits an Exponentially Competitive Algorithm | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Weighted $k$-Server Admits an Exponentially Competitive Algorithm", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "The weighted $k$-server problem is notoriously difficult, with deterministic algorithms having doubly exponential co... | 21 | 30 |
weighted_pseudorandom_generators | Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Weighted Pseudorandom Reductions for ROBPs", "summary": "This paper introduces a new framework called 'weight... | 22 | 30 |
well-separated_pair_decomposition | A well-separated pair decomposition for low density graphs | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A well-separated pair decomposition for low density graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of WSPD and Distance Oracles for Low Density Graphs", "summary": "This paper develops two fundamental algorithmic tools for low density graphs: a well-separ... | 25 | 34 |
you_almost_beat | You (Almost) Can’t Beat Brute Force for 3-Matroid Intersection | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "You (Almost) Can’t Beat Brute Force for 3-Matroid Intersection", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper investigates the $\\ell$-matroid intersection ($\\ell$-MI) problem, particularly for $\\ell=3$. It proves an expone... | 24 | 29 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.