paper_id string | title string | authors string | year int64 | venue string | doi string | dblp_key string | dblp_url string | pdf_path string | dag string | num_nodes int64 | num_edges int64 | num_figures int64 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
BhattacharyyaKSSZ10 | Optimal Testing of Reed-Muller Codes | Arnab Bhattacharyya 0001; Swastik Kopparty; Grant Schoenebeck; Madhu Sudan 0001; David Zuckerman | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.54 | conf/focs/BhattacharyyaKSSZ10 | https://dblp.org/rec/conf/focs/BhattacharyyaKSSZ10 | data/papers/FOCS_2010/BhattacharyyaKSSZ10/paper.pdf | {"paper_title": "Optimal Testing of Reed-Muller Codes", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contribution", "summary": "The paper gives an asymptotically optimal analysis of the standard Reed-Muller / Gowers norm test for degree-d polynomials over \\(\\mat... | 56 | 182 | 0 |
Gopalan10 | A Fourier-Analytic Approach to Reed-Muller Decoding | Parikshit Gopalan | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.71 | conf/focs/Gopalan10 | https://dblp.org/rec/conf/focs/Gopalan10 | data/papers/FOCS_2010/Gopalan10/paper.pdf | "{\"paper_title\": \"Demand Driven Acquisition (DDA)\", \"paper_url\": null, \"nodes\": [{\"id\": \"(...TRUNCATED) | 34 | 92 | 0 |
HaeuplerSS10 | New Constructive Aspects of the Lovasz Local Lemma | Bernhard Haeupler; Barna Saha; Aravind Srinivasan | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.45 | conf/focs/HaeuplerSS10 | https://dblp.org/rec/conf/focs/HaeuplerSS10 | data/papers/FOCS_2010/HaeuplerSS10/paper.pdf | "{\"paper_title\": \"New Constructive Aspects of the Lovász Local Lemma\", \"paper_url\": null, \"n(...TRUNCATED) | 53 | 167 | 0 |
HardtR10 | A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis | Moritz Hardt; Guy N. Rothblum | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.85 | conf/focs/HardtR10 | https://dblp.org/rec/conf/focs/HardtR10 | data/papers/FOCS_2010/HardtR10/paper.pdf | "{\"paper_title\": \"Privacy-Aware Human Mobility Prediction via Adversarial Networks\", \"paper_url(...TRUNCATED) | 40 | 125 | 6 |
LovettP10 | A Lower Bound for Dynamic Approximate Membership Data Structures | Shachar Lovett; Ely Porat | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.81 | conf/focs/LovettP10 | https://dblp.org/rec/conf/focs/LovettP10 | data/papers/FOCS_2010/LovettP10/paper.pdf | "{\"paper_title\": \"A lower bound for dynamic approximate membership data structures\", \"paper_url(...TRUNCATED) | 46 | 136 | 0 |
PanigrahyTW10 | Lower Bounds on Near Neighbor Search via Metric Expansion | Rina Panigrahy; Kunal Talwar; Udi Wieder | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.82 | conf/focs/PanigrahyTW10 | https://dblp.org/rec/conf/focs/PanigrahyTW10 | data/papers/FOCS_2010/PanigrahyTW10/paper.pdf | "{\"paper_title\": \"Lower Bounds on Near Neighbor Search via Metric Expansion\", \"paper_url\": nul(...TRUNCATED) | 51 | 163 | 0 |
Santhanam10 | Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability | Rahul Santhanam | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.25 | conf/focs/Santhanam10 | https://dblp.org/rec/conf/focs/Santhanam10 | data/papers/FOCS_2010/Santhanam10/paper.pdf | "{\"paper_title\": \"Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiabilit(...TRUNCATED) | 40 | 117 | 0 |
AndoniKO10 | Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity | Alexandr Andoni; Robert Krauthgamer; Krzysztof Onak | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.43 | conf/focs/AndoniKO10 | https://dblp.org/rec/conf/focs/AndoniKO10 | data/papers/FOCS_2010/AndoniKO10/paper.pdf | "{\"paper_title\": \"Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Comple(...TRUNCATED) | 52 | 173 | 0 |
ArbitmanNS10 | Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation | Yuriy Arbitman; Moni Naor; Gil Segev 0001 | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.80 | conf/focs/ArbitmanNS10 | https://dblp.org/rec/conf/focs/ArbitmanNS10 | data/papers/FOCS_2010/ArbitmanNS10/paper.pdf | "{\"paper_title\": \"Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Represe(...TRUNCATED) | 46 | 141 | 3 |
AwasthiBS10 | Stability Yields a PTAS for k-Median and k-Means Clustering | Pranjal Awasthi; Avrim Blum; Or Sheffet | 2,010 | FOCS 2010 | 10.1109/FOCS.2010.36 | conf/focs/AwasthiBS10 | https://dblp.org/rec/conf/focs/AwasthiBS10 | data/papers/FOCS_2010/AwasthiBS10/paper.pdf | "{\"paper_title\": \"Stability yields a PTAS for k-Median and k-Means Clustering\", \"paper_url\": n(...TRUNCATED) | 48 | 161 | 3 |
End of preview. Expand in Data Studio
tcs_dags
Structured theorem-dependency graphs extracted from theoretical computer science papers. Configs identify the conference and year; splits identify the model used to construct the graph.
Cycle-repair provenance
Every FOCS/STOC 2026 graph in the gemini_3_8_flash split was checked procedurally for directed cycles during DAG construction and again after validation. When a cycle was detected, the repair model proposed an explicit edge patch; the patched graph was accepted only after it passed the acyclicity and structural checks.
39 published DAGs required cycle-edge removal: 16 from FOCS 2026 and 23 from STOC 2026. The published graphs are the repaired, acyclic versions. Questions associated with these papers were generated from those repaired DAGs.
The num_cycle_repair_rounds field counts every structural repair round, including repairs unrelated to cycles. The lists below are narrower: they include only papers whose cycle_repair_log records at least one nonempty before.cyclic_components value. Each DAG row retains the full log, including the affected nodes and edges, the proposed patch, and the post-repair validation result.
FOCS 2026: 16 of 67 published DAGs
- A Polynomial Coreset for Furthest Neighbor in Planar Metrics (
A_Polynomial_Coreset_for_Furthest_Neighbor_in_Planar_Metrics) — 3 cyclic components; 3 edges removed - Almost Optimal Multiple Source Shortest Paths and Reachability (
Almost_Optimal_Multiple_Source_Shortest_Paths_and_Reachability) — 1 cyclic component; 1 edge removed - Approximately Efficient Multidimensional Bilateral Trade (
Approximately_Efficient_Multidimensional_Bilateral_Trade) — 1 cyclic component; 1 edge removed - Approximating the Permanent of a Random Matrix with Polynomially Small Mean: Zeros and Universality (
Approximating_the_Permanent_of_a_Random_Matrix_with_Polynomially_Small_Mean_Zeros_and_Universality) — 1 cyclic component; 3 edges removed - Approximation Algorithms for Matroid-Intersection Coloring with Applications to Rota’s Basis Conjecture (
Approximation_Algorithms_for_Matroid-Intersection_Coloring_with_Applications_to_Rotas_Basis_Conjecture) — 1 cyclic component; 1 edge removed - Bellman-Ford in Almost-Linear Time for Dense Graphs (
Bellman-Ford_in_Almost-Linear_Time_for_Dense_Graphs) — 1 cyclic component; 1 edge removed - Branch-width of connectivity functions is fixed-parameter tractable (
Branch-width_of_connectivity_functions_is_fixed-parameter_tractable) — 2 cyclic components; 3 edges removed - Distances in Planar Graphs are Almost for Free! (
Distances_in_Planar_Graphs_are_Almost_for_Free) — 1 cyclic component; 1 edge removed - Faster Approximate Fixed Points of $\ell_\infty$-Contractions (
Faster_Approximate_Fixed_Points_of_ell_infty-Contractions) — 1 cyclic component; 6 edges removed - Hard CNF Instances for Ideal Proof Systems: The ROABP Case (
Hard_CNF_Instances_for_Ideal_Proof_Systems_The_ROABP_Case) — 3 cyclic components; 5 edges removed - Instance-Optimality of Bidirectional PageRank Estimation (
Instance-Optimality_of_Bidirectional_PageRank_Estimation) — 1 cyclic component; 1 edge removed - Non-existence probabilities and lower tails in the critical regime via Belief Propagation (
Non-existence_probabilities_and_lower_tails_in_the_critical_regime_via_Belief_Propagation) — 2 cyclic components; 2 edges removed - NP-Hardness and a PTAS for the Pinwheel Problem (
NP-Hardness_and_a_PTAS_for_the_Pinwheel_Problem) — 2 cyclic components; 5 edges removed - Online Algorithms via Minimax and Posterior Matching (
Online_Algorithms_via_Minimax_and_Posterior_Matching) — 2 cyclic components; 4 edges removed - Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory (
Stronger_Memory-Query_Tradeoffs_for_Convex_Optimization_The_Limitations_of_Subquadratic_Memory) — 1 cyclic component; 1 edge removed - Strongly Refuting Random CSP without Literals (
Strongly_Refuting_Random_CSP_without_Literals) — 2 cyclic components; 4 edges removed
STOC 2026: 23 of 59 published DAGs
- Determination of the fifth Busy Beaver value (
Determination_of_the_fifth_Busy_Beaver_value) — 1 cyclic component; 1 edge removed - Efficient Quantum Hermite Transform (
Efficient_Quantum_Hermite_Transform) — 1 cyclic component; 1 edge removed - Fast Mixing of Quantum Spin Chains at All Temperatures (
Fast_Mixing_of_Quantum_Spin_Chains_at_All_Temperatures) — 1 cyclic component; 2 edges removed - Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow (
Faster_All-Pairs_Minimum_Cut_Bypassing_Exact_Max-Flow) — 2 cyclic components; 2 edges removed - Few Single-Qubit Measurements Suffice to Certify Any Quantum State (
Few_Single-Qubit_Measurements_Suffice_to_Certify_Any_Quantum_State) — 2 cyclic components; 3 edges removed - Hesse’s Redemption: Efficient Convex Polynomial Programming (
Hesses_Redemption_Efficient_Convex_Polynomial_Programming) — 2 cyclic components; 2 edges removed - Ideals, Macaulay Bases, and PCPs (
Ideals_Macaulay_Bases_and_PCPs) — 2 cyclic components; 9 edges removed - Improved Bounds for Coin Flipping, Leader Election, and Random Selection (
Improved_Bounds_for_Coin_Flipping_Leader_Election_and_Random_Selection) — 1 cyclic component; 2 edges removed - Learning CNF formulas from uniform random solutions in the local lemma regime (
Learning_CNF_formulas_from_uniform_random_solutions_in_the_local_lemma_regime) — 1 cyclic component; 1 edge removed - Lower Bounds against the Ideal Proof System in Finite Fields (
Lower_Bounds_against_the_Ideal_Proof_System_in_Finite_Fields) — 1 cyclic component; 1 edge removed - MIPco=coRE (
MIPcocoRE) — 1 cyclic component; 1 edge removed - Near Optimal Hardness of Approximating k-CSP (
Near_Optimal_Hardness_of_Approximating_k-CSP) — 2 cyclic components; 3 edges removed - No exponential quantum speedup for SIS∞ anymore (
No_exponential_quantum_speedup_for_SIS_anymore) — 1 cyclic component; 2 edges removed - Non-Adaptive Cryptanalytic Time-Space Lower Bounds via a Shearer-like Inequality for Permutations (
Non-Adaptive_Cryptanalytic_Time-Space_Lower_Bounds_via_a_Shearer-like_Inequality_for_Permutations) — 1 cyclic component; 1 edge removed - Perfect Network Resilience in Polynomial Time (
Perfect_Network_Resilience_in_Polynomial_Time) — 2 cyclic components; 2 edges removed - Reviving Thorup's Shortcut Conjecture (
Reviving_Thorups_Shortcut_Conjecture) — 1 cyclic component; 1 edge removed - S-unit equations in modules and linear-exponential Diophantine equations (
S-unit_equations_in_modules_and_linear-exponential_Diophantine_equations) — 1 cyclic component; 3 edges removed - Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back (
Sample_Complexity_of_Agnostic_Multiclass_Classification_Natarajan_Dimension_Strikes_Back) — 1 cyclic component; 2 edges removed - Semi-Streaming Matching in a Single Pass: A New Framework for Lower Bounds via Blueprints (
Semi-Streaming_Matching_in_a_Single_Pass_A_New_Framework_for_Lower_Bounds_via_Blueprints) — 1 cyclic component; 1 edge removed - Sparsifying Suprema of Gaussian Processes (
Sparsifying_Suprema_of_Gaussian_Processes) — 2 cyclic components; 2 edges removed - Testing noisy low-degree polynomials for sparsity (
Testing_noisy_low-degree_polynomials_for_sparsity) — 1 cyclic component; 1 edge removed - The Skolem Problem in rings of positive characteristic (
The_Skolem_Problem_in_rings_of_positive_characteristic) — 1 cyclic component; 1 edge removed - What Can Be Computed Locally Revisited - First-Order Logic on Sparse Graphs in Distributed Computing - (
What_Can_Be_Computed_Locally_Revisited_-_First-Order_Logic_on_Sparse_Graphs_in_Distributed_Computing_-) — 1 cyclic component; 1 edge removed
- Downloads last month
- 323