On the public citation graph

Recursive construction for 3-regular expanders

https://doi.org/10.1007/bf01302963
0 signed · 53 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02126799openalex-snapshot
Ramanujan graphs
inferredcites →https://doi.org/10.1007/bf02579338openalex-snapshot
Sorting inc logn parallel steps
inferredcites →https://doi.org/10.1016/0020-0190(79)90027-9openalex-snapshot
A note on time-space tradeoffs for computing continuous functions
inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
inferredcites →https://doi.org/10.1016/0022-0000(89)90035-4openalex-snapshot
Optimal parallel selection has complexity O(Log Log N)
inferredcites →https://doi.org/10.1016/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
inferredcites →https://doi.org/10.1016/s0022-0000(76)80041-4openalex-snapshot
Graph-theoretic properties in computational complexity
inferredcites →https://doi.org/10.1137/0206022openalex-snapshot
Superconcentrators
inferredcites →https://doi.org/10.1137/0216066openalex-snapshot
Sorting and Selecting in Rounds
inferredcites →https://doi.org/10.1145/12130.12154openalex-snapshot
Explicit expanders and the Ramanujan conjectures
inferredcites →https://doi.org/10.1145/28395.28410openalex-snapshot
Deterministic simulation in LOGSPACE

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-29297-7_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_31openalex-snapshot
Computing Cycle Covers without Short Cycles
inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_14openalex-snapshot
Notes on the Complexity of Switching Networks
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_16openalex-snapshot
Algorithmes d’approximation
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_16openalex-snapshot
Approximationsalgorithmen
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_18openalex-snapshot
On Construction of Almost-Ramanujan Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_5openalex-snapshot
Combinatorial Algorithms for Distributed Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_16openalex-snapshot
Approximationsalgorithmen
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_6openalex-snapshot
On the Resolution Complexity of Graph Non-isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_16openalex-snapshot
Approximationsalgorithmen
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_16openalex-snapshot
Algoritmi approssimati
inferred← citeshttps://doi.org/10.1007/bf01279452openalex-snapshot
On the longest circuit in an alterable digraph
inferred← citeshttps://doi.org/10.1007/s00446-013-0203-2openalex-snapshot
Combinatorial algorithms for distributed graph coloring
inferred← citeshttps://doi.org/10.1007/s00493-006-0029-7openalex-snapshot
Lifts, Discrepancy and Nearly Optimal Spectral Gap*
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferred← citeshttps://doi.org/10.1016/j.peva.2021.102238openalex-snapshot
Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion
inferred← citeshttps://doi.org/10.1016/j.vlsi.2005.12.012openalex-snapshot
New theoretical results on quadratic placement
inferred← citeshttps://doi.org/10.1017/s0963548307008851openalex-snapshot
An Elementary Construction of Constant-Degree Expanders
inferred← citeshttps://doi.org/10.1109/focs.2004.19openalex-snapshot
Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap
inferred← citeshttps://doi.org/10.1109/lics.2017.8005108openalex-snapshot
Definability of semidefinite programming and lasserre lower bounds for CSPs
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892006openalex-snapshot
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
inferred← citeshttps://doi.org/10.1137/s009753970444630xopenalex-snapshot
A Probabilistic Study on Combinatorial Expanders and Hashing
inferred← citeshttps://doi.org/10.1142/s1793830909000154openalex-snapshot
ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS
inferred← citeshttps://doi.org/10.1145/1290672.1290675openalex-snapshot
Optimal parallel selection
inferred← citeshttps://doi.org/10.1145/3406325.3451049openalex-snapshot
Expander random walks: a Fourier-analytic approach
inferred← citeshttps://doi.org/10.1214/16-ejp4687openalex-snapshot
Total variation and separation cutoffs are not equivalent and neither one implies the other
inferred← citeshttps://doi.org/10.1214/ejp.v16-869openalex-snapshot
Explicit Expanders with Cutoff Phenomena
inferred← citeshttps://doi.org/10.1215/00127094-2010-029openalex-snapshot
Cutoff phenomena for random walks on random regular graphs
inferred← citeshttps://doi.org/10.17863/cam.100142openalex-snapshot
Symmetric Arithmetic Circuits
inferred← citeshttps://doi.org/10.17863/cam.21645openalex-snapshot
Total variation and separation cutoffs are not equivalent and neither one implies the other
inferred← citeshttps://doi.org/10.2307/3062153openalex-snapshot
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders
inferred← citeshttps://doi.org/10.48550/arxiv.1003.3515openalex-snapshot
Explicit expanders with cutoff phenomena
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05409openalex-snapshot
Lasserre Lower Bounds and Definability of Semidefinite Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1905.10284openalex-snapshot
Hardness of Distributed Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.math/0406038openalex-snapshot
Entropy waves, the zig-zag graph product, and new constant-degree
inferred← citeshttps://doi.org/10.5555/2095116.2095245openalex-snapshot
Rumor spreading and vertex expansion
inferred← citeshttps://doi.org/10.5555/3329995.3330043openalex-snapshot
Definability of semidefinite programming and lasserre lower bounds for CSPs
inferred← citeshttps://doi.org/10.5555/644108.644110openalex-snapshot
Optimal parallel selection
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.