On the public citation graph
Comparisons of quad trees and 4-D trees: new results (VLSI layout)
0 signed · 22 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/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1109/dac.1982.1585523openalex-snapshot
The Quad-CIF Tree: A Data Structure for Hierarchical On-Line Algorithms
inferredcites →https://doi.org/10.1109/icde.1986.7266247openalex-snapshot
Supporting VLSI geometry operations in a database system
inferredcites →https://doi.org/10.1109/tcad.1984.1270061openalex-snapshot
Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools
inferredcites →https://doi.org/10.1109/tcad.1985.1270098openalex-snapshot
Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries
inferredcites →https://doi.org/10.1109/tcad.1986.1270210openalex-snapshot
Multiple Storage Quad Trees: A Simpler Faster Alternative to Bisector List Quad Trees
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/800139.804593openalex-snapshot
A data structure for gridless routing
inferredcites →https://doi.org/10.5555/800263.809229openalex-snapshot
The Quad-CIF Tree: A Data Structure for Hierarchical On-Line Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/0167-9260(93)90004-vopenalex-snapshot
Adaptable quad tree techniques
inferred← citeshttps://doi.org/10.1109/43.489102openalex-snapshot
Hinted quad trees for VLSI geometry DRC based on efficient searching for neighbors
inferred← citeshttps://doi.org/10.1109/aspdac.2000.835079openalex-snapshot
Area routing oriented hierarchical corner stitching with partial bin
inferred← citeshttps://doi.org/10.1109/cse.2014.210openalex-snapshot
A Fast Media Synchronization Mechanism for Streaming Screen Recording Applications
inferred← citeshttps://doi.org/10.1109/glsv.1992.218362openalex-snapshot
Quadtree interconnection network layout
inferred← citeshttps://doi.org/10.1145/368434.368587openalex-snapshot
Area routing oriented hierarchical corner stitching with partial bin
inferred← citeshttps://doi.org/10.1155/1996/82789openalex-snapshot
Nearly Balanced Quad List Quad Tree ‐A Data Structure for VLSI Layout Systems
inferred← citeshttps://doi.org/10.1631/jzus.c1100193openalex-snapshot
Array based HV/VH tree: an effective data structure for layout representation
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.