On the public citation graph
The VLSI Complexity of Selected Graph Problems
0 signed · 35 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.1007/978-3-642-68402-9_11openalex-snapshot
On the Complexity of VLSI Computations
inferredcites →https://doi.org/10.1007/978-3-642-68402-9_32openalex-snapshot
A Systolic Data Structure Chip for Connectivity Problems
inferredcites →https://doi.org/10.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1109/sfcs.1980.1openalex-snapshot
A combinatorial limit to the computing power of V.L.S.I. circuits
inferredcites →https://doi.org/10.1109/sfcs.1981.13openalex-snapshot
Census functions: An approach to VLSI upper bounds
inferredcites →https://doi.org/10.1109/tc.1983.1676221openalex-snapshot
A Combinatorial Limit to the Computing Power of VLSI Circuits
inferredcites →https://doi.org/10.1137/0213052openalex-snapshot
Information Transfer under Different Sets of Protocols
inferredcites →https://doi.org/10.1145/2422.322421openalex-snapshot
Information Transfer in Distributed Computing with Applications to VLSI
inferredcites →https://doi.org/10.1145/322186.322200openalex-snapshot
Lower Bounds on Information Transfer in Distributed Computations
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/800076.802483openalex-snapshot
The entropic limitations on VLSI computations(Extended Abstract)
inferredcites →https://doi.org/10.1145/800076.802485openalex-snapshot
A model of computation for VLSI with related complexity results
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)
inferredcites →https://doi.org/10.1145/800141.804666openalex-snapshot
The chip complexity of binary arithmetic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcom.1994.1008openalex-snapshot
One-Way Communication Complexity of Computing a Collection of Rational Functions
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_103openalex-snapshot
Communication complexity of computing a collection of rational functions
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_18openalex-snapshot
A framework for analyzing locality and portability issues in parallel computing
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_43openalex-snapshot
Minimum vertex cover, distributed decision-making, and communication complexity
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_114openalex-snapshot
Bandwidth efficient parallel computation
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_5openalex-snapshot
Locality in Computing Connected Components
inferred← citeshttps://doi.org/10.1007/bf01840437openalex-snapshot
Area-time lower-bound techniques with applications to sorting
inferred← citeshttps://doi.org/10.1007/bf02575818openalex-snapshot
On the VLSI complexity of some arithmetic and numerical problems
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90035-uopenalex-snapshot
Communication complexity and combinatorial lattice theory
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90068-zopenalex-snapshot
Area-time trade-offs for matrix-vector multiplication
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73240-7openalex-snapshot
Parallel Computer Models and Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1109/12.5998openalex-snapshot
Modified-mesh connected parallel computers
inferred← citeshttps://doi.org/10.1109/18.333867openalex-snapshot
Data fusion with minimal communication
inferred← citeshttps://doi.org/10.1109/icpads.1994.589892openalex-snapshot
Semigroup computation and its applications on mesh-connected computers with hyperbus broadcasting
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21924openalex-snapshot
Lattices, mobius functions and communications complexity
inferred← citeshttps://doi.org/10.1109/tc.1987.1676928openalex-snapshot
Optimal Graph Algorithms on a Fixed-Size Linear Array
inferred← citeshttps://doi.org/10.1145/197912.197992openalex-snapshot
Bandwidth efficient parallel computation
inferred← citeshttps://doi.org/10.1145/62212.62228openalex-snapshot
On the communication complexity of graph properties
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2020.32openalex-snapshot
Connectivity Lower Bounds in Broadcast Congested Clique
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.