On the public citation graph
Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory
0 signed · 148 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1979.tb02972.xopenalex-snapshot
On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
inferredcites →https://doi.org/10.1007/bf02579457openalex-snapshot
Intersection theorems with geometric consequences
inferredcites →https://doi.org/10.1016/0012-365x(77)90044-9openalex-snapshot
Asymptotic lower bounds for Ramsey functions
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(80)90056-2openalex-snapshot
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
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/0097-3165(75)90007-2openalex-snapshot
A problem of Zarankiewicz
inferredcites →https://doi.org/10.1016/0196-6774(87)90014-9openalex-snapshot
Better expanders and superconcentrators
inferredcites →https://doi.org/10.1016/0304-3975(84)90032-xopenalex-snapshot
A geometric construction of a superconcentrator of depth 2
inferredcites →https://doi.org/10.1016/s0022-0000(76)80041-4openalex-snapshot
Graph-theoretic properties in computational complexity
inferredcites →https://doi.org/10.1109/sfcs.1981.23openalex-snapshot
Non-existence of one-dimensional expanding graphs
inferredcites →https://doi.org/10.1109/sfcs.1984.715931openalex-snapshot
Eigenvalues, Expanders And Superconcentrators
inferredcites →https://doi.org/10.1109/sfcs.1986.57openalex-snapshot
Tight complexity bounds for parallel comparison sorting
inferredcites →https://doi.org/10.1137/0210034openalex-snapshot
Parallel Sorting with Constant Time for Comparisons
inferredcites →https://doi.org/10.1137/0605030openalex-snapshot
Explicit Concentrators from Generalized N -Gons
inferredcites →https://doi.org/10.1145/22145.22156openalex-snapshot
Expanders, sorting in rounds and superconcentrators of limited depth
inferredcites →https://doi.org/10.1145/322344.322354openalex-snapshot
Asymptotically tight bounds on time-space trade-offs in a pebble game
inferredcites →https://doi.org/10.1145/800141.804683openalex-snapshot
Time-space tradeoffs for some algebraic problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199712)11:4<315::aid-rsa3>3.0.co;2-1openalex-snapshot
Tiny families of functions with random properties: A quality-size trade-off for hashing
inferred← citeshttps://doi.org/10.1002/9781394284344.ch8openalex-snapshot
On Multivariate Algorithms of Digital Signatures on Secure El Gamal‐Type Mode
inferred← citeshttps://doi.org/10.1002/rsa.20177openalex-snapshot
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
inferred← citeshttps://doi.org/10.1002/rsa.3240010204openalex-snapshot
The number of spanning trees in regular graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240050203openalex-snapshot
Random Cayley graphs and expanders
inferred← citeshttps://doi.org/10.1006/inco.2002.3148openalex-snapshot
Scalable Secure Storage When Half the System Is Faulty
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_9openalex-snapshot
Szemerédi’s Regularity Lemma and Quasi-randomness
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_2openalex-snapshot
Essentially Every Unimodular Matrix Defines an Expander
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_49openalex-snapshot
Scalable Secure Storage when Half the System Is Faulty
inferred← citeshttps://doi.org/10.1007/978-1-4612-1544-8_16openalex-snapshot
Eigenvalues of Ramanujan Graphs
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-1-4614-0110-0_28openalex-snapshot
Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_13openalex-snapshot
Ramsey Theory in the Work of Paul Erdős
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_5openalex-snapshot
On the Monotone Circuit Complexity of Quadratic Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_10openalex-snapshot
Candidate One-Way Functions Based on Expander Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_24openalex-snapshot
A Sample of Samplers: A Computational Perspective on Sampling
inferred← citeshttps://doi.org/10.1007/978-3-642-24806-1_7openalex-snapshot
The Active Element Machine
inferred← citeshttps://doi.org/10.1007/978-3-642-33350-7_6openalex-snapshot
Generating Expander Graphs Using Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_16openalex-snapshot
Ramsey Theory in the Work of Paul Erdős
inferred← citeshttps://doi.org/10.1007/978-3-662-44893-9_7openalex-snapshot
On LDPC Codes Based on Families of Expanding Graphs of Increasing Girth without Edge-Transitive Automorphism Groups
inferred← citeshttps://doi.org/10.1007/bf01206355openalex-snapshot
Parallel comparison algorithms for approximation problems
inferred← citeshttps://doi.org/10.1007/bf01294459openalex-snapshot
On the second eigenvalue of hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01788662openalex-snapshot
Legitimate colorings of projective planes
inferred← citeshttps://doi.org/10.1007/bf02787543openalex-snapshot
Embedding graphs with bounded degree in sparse pseudorandom graphs
inferred← citeshttps://doi.org/10.1007/bf03352998openalex-snapshot
Constructive Bounds for a Ramsey-Type Problem
inferred← citeshttps://doi.org/10.1007/s00453-006-0073-0openalex-snapshot
The Monotone Circuit Complexity of Quadratic Boolean Functions
inferred← citeshttps://doi.org/10.1007/s00454-018-9998-8openalex-snapshot
Pach’s Selection Theorem Does Not Admit a Topological Extension
inferred← citeshttps://doi.org/10.1007/s00454-021-00284-6openalex-snapshot
Number of Directions Determined by a Set in $$\mathbb {F}_{q}^{2}$$ and Growth in $$\mathrm {Aff}(\mathbb {F}_{q})$$
inferred← citeshttps://doi.org/10.1007/s10485-006-9037-4openalex-snapshot
More on Configurations in Priestley Spaces, and Some New Problems
inferred← citeshttps://doi.org/10.1007/s10801-016-0712-8openalex-snapshot
Unimodular graphs and Eisenstein sums
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90101-5openalex-snapshot
Dense expanders and pseudo-random bipartite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00206-copenalex-snapshot
On the number of flats spanned by a set of points in PG(d, q)
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90199-jopenalex-snapshot
Universal traversal sequences for expander graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90089-3openalex-snapshot
A ramsey type problem concerning vertex colourings
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90194-7openalex-snapshot
The conjunctive complexity of quadratic Boolean functions
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50027-0openalex-snapshot
10.1016/b978-044488002-4/50027-0
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101625openalex-snapshot
Extending Erdős–Beck's theorem to higher dimensions
inferred← citeshttps://doi.org/10.1016/j.disc.2013.01.004openalex-snapshot
On the eigenvalues of certain matrices over Zm
inferred← citeshttps://doi.org/10.1016/j.ffa.2015.10.002openalex-snapshot
On distinct perpendicular bisectors and pinned distances in finite fields
inferred← citeshttps://doi.org/10.1016/j.ic.2007.02.006openalex-snapshot
Hardness of fully dense problems
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.10.002openalex-snapshot
The size Ramsey number of a directed path
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.02.001openalex-snapshot
Domination in transitive colorings of tournaments
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114652openalex-snapshot
Generalisations of matrix partitions: Complexity and obstructions
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00482-9openalex-snapshot
On the spectrum of projective norm-graphs
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00040-0openalex-snapshot
Constant time parallel sorting: an empirical view
inferred← citeshttps://doi.org/10.1070/sm8780openalex-snapshot
Sign rank versus Vapnik-Chervonenkis dimension
inferred← citeshttps://doi.org/10.1090/s0002-9939-10-10463-8openalex-snapshot
Non-representability of finite projective planes by convex sets
inferred← citeshttps://doi.org/10.1093/imrn/rnw206openalex-snapshot
Growth Estimates in Positive Characteristic via Collisions
inferred← citeshttps://doi.org/10.1109/12.2270openalex-snapshot
On the construction of communication networks satisfying bounded fan-in of service ports
inferred← citeshttps://doi.org/10.1109/18.119713openalex-snapshot
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
inferred← citeshttps://doi.org/10.1109/fscs.1990.89523openalex-snapshot
Coin-flipping games immune against linear-sized coalitions
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21937openalex-snapshot
Parallel comparison algorithms for approximation problems
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63449openalex-snapshot
Dispersers, deterministic amplification, and weak random sources
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267804openalex-snapshot
The algorithmic aspects of the regularity lemma
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892063openalex-snapshot
Extracting randomness from samplable distributions
inferred← citeshttps://doi.org/10.1109/tit.2013.2257918openalex-snapshot
Upper Bounds on Matching Families in $\BBZ_{pq}^{n}$
inferred← citeshttps://doi.org/10.1111/exsy.12229openalex-snapshot
Correlation clustering methodologies and their fundamental results
inferred← citeshttps://doi.org/10.1112/blms.12077openalex-snapshot
An improved point-line incidence bound over arbitrary fields
inferred← citeshttps://doi.org/10.1112/mtk.12120openalex-snapshot
On the growth rate in SL2(Fp)${\rm SL_2}(\mathbb {F}_p)$, the affine group and sum‐product type implications
inferred← citeshttps://doi.org/10.1112/s002557930900045xopenalex-snapshot
ON EMBEDDINGS OF FINITE METRIC SPACES IN
inferred← citeshttps://doi.org/10.1137/0217015openalex-snapshot
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
inferred← citeshttps://doi.org/10.1137/0222030openalex-snapshot
Coin-Flipping Games Immune against Linear-Sized Coalitions
inferred← citeshttps://doi.org/10.1137/0403002openalex-snapshot
Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
inferred← citeshttps://doi.org/10.1137/0405001openalex-snapshot
A Linear Time Approach to the Set Maxima Problem
inferred← citeshttps://doi.org/10.1145/195058.195410openalex-snapshot
Tiny families of functions with random properties (preliminary version)
inferred← citeshttps://doi.org/10.1145/22145.22156openalex-snapshot
Expanders, sorting in rounds and superconcentrators of limited depth
inferred← citeshttps://doi.org/10.1145/41958.41994openalex-snapshot
Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension
inferred← citeshttps://doi.org/10.1515/9780823295708-025openalex-snapshot
CHAPTER NOTES AND REFERENCES
inferred← citeshttps://doi.org/10.1515/9783110203738.455openalex-snapshot
Chapter 8 Notes and References
inferred← citeshttps://doi.org/10.15407/dopovidi2014.12.044openalex-snapshot
On new expanders of unbounded degree for practical applications in informatics
inferred← citeshttps://doi.org/10.15439/2021f67openalex-snapshot
On computations with Double Schubert Automaton and stable maps of multivariate cryptography
inferred← citeshttps://doi.org/10.15439/978-83-959183-9-1openalex-snapshot
Position and Communication Papers of the 16th Conference on Computer Science and Intelligence Systems
inferred← citeshttps://doi.org/10.1561/0400000063openalex-snapshot
Complexity of Linear Boolean Operators
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.31392/iscs.2021.19.018openalex-snapshot
On computations with double Schubert automaton and stable maps of multivariate cryptography
inferred← citeshttps://doi.org/10.4064/aa8225-10-2016openalex-snapshot
Elementary methods for incidence problems in finite fields
inferred← citeshttps://doi.org/10.4213/sm8780openalex-snapshot
Знаковый ранг и размерность Вапника-Червоненкиса
inferred← citeshttps://doi.org/10.48550/arxiv.1208.5194openalex-snapshot
On the Eigenvalues of Certain Matrices Over $\mathbb{Z}_m$
inferred← citeshttps://doi.org/10.48550/arxiv.1210.5587openalex-snapshot
Concentration properties of semi-vertex transitive graphs and random bi-coset graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0980openalex-snapshot
Upper Bounds on Matching Families in $\mathbb{Z}_{pq}^n$
inferred← citeshttps://doi.org/10.48550/arxiv.1302.4677openalex-snapshot
Domination in transitive colorings of tournaments
inferred← citeshttps://doi.org/10.48550/arxiv.1310.6013openalex-snapshot
Matchings and Hamilton Cycles with Constraints on Sets of Edges
inferred← citeshttps://doi.org/10.48550/arxiv.1503.07648openalex-snapshot
Sign rank versus VC dimension
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05034openalex-snapshot
Unimodular graphs and Eisenstein sums
inferred← citeshttps://doi.org/10.48550/arxiv.1512.06613openalex-snapshot
Growth Estimates in Positive Characteristic via Collisions
inferred← citeshttps://doi.org/10.48550/arxiv.1811.02676openalex-snapshot
Oblivious Set-maxima for Intersection of Convex Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1812.01671openalex-snapshot
On growth rate in $SL_2(\mathbf{F}_p)$, the affine group and sum-product type implications
inferred← citeshttps://doi.org/10.48550/arxiv.1909.03180openalex-snapshot
Simple proofs for Furstenberg sets over finite fields
inferred← citeshttps://doi.org/10.48550/arxiv.1909.04858openalex-snapshot
Regularity and counting lemmas for multidimensional matrices
inferred← citeshttps://doi.org/10.5040/9780755625963.0007openalex-snapshot
Chapter Notes and References
inferred← citeshttps://doi.org/10.5121/jgraphoc.2014.6401openalex-snapshot
On Algorithmic Problems Concerning Graphs of Higher Degree of Symmetry
inferred← citeshttps://doi.org/10.70675/ae746928z5283z4b71zbf96zc49f5007a4e6openalex-snapshot
On dichotomy above Feder and Vardi's logic
inferred← citeshttps://doi.org/10.7282/t3r78j3bopenalex-snapshot
Incidences and extremal problems on finite point sets
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.