On the public citation graph
Using a multiple storage quad tree on a hierarchical VLSI compaction scheme
0 signed · 51 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(86)90225-3openalex-snapshot
Linear time geometrical design rule checker based on quadtree representation of VLSI mask layouts
inferredcites →https://doi.org/10.1016/0010-4485(87)90264-8openalex-snapshot
Algorithm for incremental compaction of geometrical layouts
inferredcites →https://doi.org/10.1016/0167-9260(85)90027-6openalex-snapshot
Automatic design rule adaptation of leaf cell layouts
inferredcites →https://doi.org/10.1016/0167-9260(87)90022-8openalex-snapshot
New algorithms for increased efficiency in hierarchical design rule checking
inferredcites →https://doi.org/10.1109/43.9189openalex-snapshot
A new framework of design rules for compaction of VLSI layouts
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/dac.1983.1585636openalex-snapshot
Improved Compaction by Minimized Length of Wires
inferredcites →https://doi.org/10.1109/dac.1984.1585785openalex-snapshot
A Hiererachical, Error-Tolerant Compactor
inferredcites →https://doi.org/10.1109/dac.1984.1585786openalex-snapshot
Chip Layout Optimization Using Critical Path Weighting
inferredcites →https://doi.org/10.1109/dac.1986.1586077openalex-snapshot
Two-Dimensional Compaction by 'Zone Refining'
inferredcites →https://doi.org/10.1109/iscas.1988.15435openalex-snapshot
An edge-oriented compaction scheme based on multiple storage quad tree
inferredcites →https://doi.org/10.1109/tcad.1983.1270022openalex-snapshot
An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints
inferredcites →https://doi.org/10.1109/tcad.1984.1270052openalex-snapshot
Graph-Optimization Techniques for IC Layout and Compaction
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.1109/tcad.1987.1270329openalex-snapshot
Algorithmic Aspects of One-Dimensional Layout Compaction
inferredcites →https://doi.org/10.1109/tcad.1987.1270333openalex-snapshot
VLSI Layout Compaction with Grid and Mixed Constraints
inferredcites →https://doi.org/10.1109/tpami.1981.4767054openalex-snapshot
An Algorithm for Converting Rasters to Quadtrees
inferredcites →https://doi.org/10.1109/tpami.1982.4767246openalex-snapshot
Distance Transform for Images Represented by Quadtrees
inferredcites →https://doi.org/10.1145/317825.317835openalex-snapshot
A fully automatic hierarchical compactor
inferredcites →https://doi.org/10.1145/318013.318033openalex-snapshot
Minplex---a compactor that minimizes the bounding rectangle and individual rectangles in a layout
inferredcites →https://doi.org/10.1145/318013.318133openalex-snapshot
Dual quadtree representation for VLSI designs
inferredcites →https://doi.org/10.1145/356789.356797openalex-snapshot
Data Structures for Range Searching
inferredcites →https://doi.org/10.1145/356924.356930openalex-snapshot
The Quadtree and Related Hierarchical Data Structures
inferredcites →https://doi.org/10.1145/37888.37991openalex-snapshot
A new compaction scheme based on compression ridges
inferredcites →https://doi.org/10.1145/74382.74433openalex-snapshot
Automatic tub region generation for symbolic layout compaction
inferredcites →https://doi.org/10.5555/317825.317835openalex-snapshot
A Fully Automatic Hierarchical Compactor
inferredcites →https://doi.org/10.5555/318013.318032openalex-snapshot
Two-Dimensional Compaction by 'Zone Refining'
inferredcites →https://doi.org/10.5555/318013.318033openalex-snapshot
Minplex - A Compactor that Minimizes the Bounding Rectangle and Individual Rectangles in a Layout
inferredcites →https://doi.org/10.5555/318013.318133openalex-snapshot
Dual Quadtree Representation for VLSI Designs
inferredcites →https://doi.org/10.5555/800033.800787openalex-snapshot
Chip Layout Optimization Using Critical Path Weighting
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/0010-4485(91)90092-bopenalex-snapshot
A knowledge-based program for compacting mask layout of integrated circuits
inferred← citeshttps://doi.org/10.1016/s0167-9260(05)80035-5openalex-snapshot
A new control strategy for an artificial intelligence approach to VLSI layout compaction
inferred← citeshttps://doi.org/10.1049/ip-e.1991.0002openalex-snapshot
Expert compactor: a knowledge-based application in VLSI layout compaction
inferred← citeshttps://doi.org/10.1049/ip-e.1992.0046openalex-snapshot
Designing a complementary design rule checker based on a binary balanced quad list quad tree
inferred← citeshttps://doi.org/10.1049/ip-e.1993.0021openalex-snapshot
Optimal tile partition for space region of integrated circuits geometry
inferred← citeshttps://doi.org/10.1109/43.177399openalex-snapshot
A yield improvement technique for IC layout using local design rules
inferred← citeshttps://doi.org/10.1109/cmpsac.1990.139379openalex-snapshot
A new plane-sweep algorithm based on spatial data structure for overlapped rectangles in 2-D plane
inferred← citeshttps://doi.org/10.1109/icvd.1992.658061openalex-snapshot
Minimum Partition for the Space Region of VLSI Layout
inferred← citeshttps://doi.org/10.1109/icvd.1992.658091openalex-snapshot
Using a Balanced Quad List Quad Tree to Speed Up a Hierarchical VLSI Compaction Scheme
inferred← citeshttps://doi.org/10.1109/iscas.1991.176140openalex-snapshot
A new fast constraint graph generation algorithm for VLSI layout compaction
inferred← citeshttps://doi.org/10.1109/iscas.1995.523737openalex-snapshot
Incremental node extraction algorithms for incremental layout system
inferred← citeshttps://doi.org/10.1109/melcon.1994.381026openalex-snapshot
Fast constraint graph generation algorithms for VLSI layout compaction
inferred← citeshttps://doi.org/10.1109/tencon.1990.152659openalex-snapshot
A sweeping line algorithm based on two dimensional region search
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.2991/icwcsn-16.2017.16openalex-snapshot
File Tracking Method and System Based on Life Cycle Tree
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.