On the public citation graph
The I/O-complexity of Ordered Binary-Decision Diagram manipulation
0 signed · 61 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/3-540-56503-5_57openalex-snapshot
Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs
inferredcites →https://doi.org/10.1007/3-540-57568-5_273openalex-snapshot
Memory paging for connectivity and path problems in graphs
inferredcites →https://doi.org/10.1007/3-540-60220-8_74openalex-snapshot
The buffer tree: A new technique for optimal I/O-algorithms
inferredcites →https://doi.org/10.1007/3-540-60220-8_75openalex-snapshot
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
inferredcites →https://doi.org/10.1007/bf01185207openalex-snapshot
Algorithms for parallel memory, I: Two-level memories
inferredcites →https://doi.org/10.1007/bf01530929openalex-snapshot
The input/output complexity of transitive closure
inferredcites →https://doi.org/10.1007/bf01940646openalex-snapshot
Blocking for external graph searching
inferredcites →https://doi.org/10.1016/0020-0190(93)90256-9openalex-snapshot
Reduction of OBDDs in linear time
inferredcites →https://doi.org/10.1109/2.268881openalex-snapshot
An introduction to disk drive modeling
inferredcites →https://doi.org/10.1109/hicss.1993.270758openalex-snapshot
Paradigms for optimal sorting with multiple disks
inferredcites →https://doi.org/10.1109/iccad.1988.122451openalex-snapshot
Logic verification using binary decision diagrams in a logic synthesis environment
inferredcites →https://doi.org/10.1109/sfcs.1993.366816openalex-snapshot
External-memory computational geometry
inferredcites →https://doi.org/10.1109/spdp.1995.530667openalex-snapshot
Supporting I/O-efficient scientific computation in TPIE
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/113379.113382openalex-snapshot
Large-scale sorting in parallel memories (extended abstract)
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/127601.127704openalex-snapshot
Breadth-first manipulation of SBDD of Boolean functions for vector processing
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/165231.165247openalex-snapshot
Deterministic distribution sort in shared and distributed memory multiprocessors
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.5555/191326.191593openalex-snapshot
Efficient breadth-first manipulation of binary decision diagrams
inferredcites →https://doi.org/10.5555/259794.259802openalex-snapshot
Dynamic variable ordering for ordered binary decision diagrams
inferredcites →https://doi.org/10.5555/259794.259803openalex-snapshot
Breadth-first manipulation of very large binary-decision diagrams
inferredcites →https://doi.org/10.5555/313651.313681openalex-snapshot
External-memory graph algorithms
inferredcites →https://doi.org/10.7146/brics.v3i12.19975openalex-snapshot
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
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-44634-6_43openalex-snapshot
On External-Memory Planar Depth First Search
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_37openalex-snapshot
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_8openalex-snapshot
External-memory algorithms with applications in GIS
inferred← citeshttps://doi.org/10.1007/978-3-030-99527-0_16openalex-snapshot
Adiar Binary Decision Diagrams in External Memory
inferred← citeshttps://doi.org/10.1007/978-3-031-45332-8_4openalex-snapshot
Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_7openalex-snapshot
Random Access on Narrow Decision Diagrams in External Memory
inferred← citeshttps://doi.org/10.1007/978-3-032-15700-3_17openalex-snapshot
Multi-variable Quantification of BDDs in External Memory using Nested Sweeping
inferred← citeshttps://doi.org/10.1007/s00224-002-1066-2openalex-snapshot
Bulk Synchronous Parallel Algorithms for the External Memory Model
inferred← citeshttps://doi.org/10.1007/s00453-003-1021-xopenalex-snapshot
The Buffer Tree: A Technique for Designing Batched External Data Structures
inferred← citeshttps://doi.org/10.1007/s00453-006-1208-zopenalex-snapshot
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.001openalex-snapshot
On external-memory MST, SSSP and multi-way planar graph separation
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00020-5openalex-snapshot
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
inferred← citeshttps://doi.org/10.1109/ddecs57882.2023.10139480openalex-snapshot
HermesBDD: A Multi-Core and Multi-Platform Binary Decision Diagram Package
inferred← citeshttps://doi.org/10.1109/sequen.1997.666927openalex-snapshot
Sequence sorting in secondary storage
inferred← citeshttps://doi.org/10.1137/s0097539703428324openalex-snapshot
An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
inferred← citeshttps://doi.org/10.1145/1137856.1137884openalex-snapshot
I/O-efficient batched union-find and its applications to terrain analysis
inferred← citeshttps://doi.org/10.1145/1868237.1868249openalex-snapshot
I/O-efficient batched union-find and its applications to terrain analysis
inferred← citeshttps://doi.org/10.1145/258533.258647openalex-snapshot
On sorting strings in external memory (extended abstract)
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1145/509907.509950openalex-snapshot
Cache-oblivious priority queue and graph algorithm applications
inferred← citeshttps://doi.org/10.1145/945394.945395openalex-snapshot
I/O-Efficient Algorithms for Problems on Grid-Based Terrains
inferred← citeshttps://doi.org/10.1145/945394.945396openalex-snapshot
Breaking cycles for minimizing crossings
inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.5555/1070432.1070538openalex-snapshot
Lower bounds for external algebraic decision trees
inferred← citeshttps://doi.org/10.70675/a967539azced0z446ez8cf6z3adfb8f1a16dopenalex-snapshot
Génération de maillages adaptatifs à partir de données volumiques de grande taille
inferred← citeshttps://doi.org/10.7146/brics.v3i12.19975openalex-snapshot
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
inferred← citeshttps://doi.org/10.7146/brics.v3i26.20007openalex-snapshot
BDD Algortihms and Cache Misses
inferred← citeshttps://doi.org/10.7146/brics.v3i28.20009openalex-snapshot
The Buffer Tree: A New Technique for Optimal I/O Algorithms
inferred← citeshttps://doi.org/10.7146/brics.v3i29.20010openalex-snapshot
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
inferred← citeshttps://doi.org/10.7146/brics.v3i32.20012openalex-snapshot
Regular Trace Event Structures
inferred← citeshttps://doi.org/10.7146/brics.v3i36.20018openalex-snapshot
On a Question of Arto Salomaa: The Equational Theory of Regular Expressions over a Singleton Alphabet is not Finitely Based
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.