On the public citation graph

Blocking for external graph searching

https://doi.org/10.1007/bf01940646

0 signed · 69 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-52292-1_14openalex-snapshot

Beyond Steiner's problem: A VLSI oriented generalization

inferredcites →https://doi.org/10.1007/3-540-53832-1_36openalex-snapshot

Bounds on the quality of approximate solutions to the group Steiner problem

inferredcites →https://doi.org/10.1007/978-1-4757-3714-1_3openalex-snapshot

Graphs and Hypergraphs

inferredcites →https://doi.org/10.1007/bf00288886openalex-snapshot

Data encodings and their costs

inferredcites →https://doi.org/10.1007/bf01530929openalex-snapshot

The input/output complexity of transitive closure

inferredcites →https://doi.org/10.1007/bf01776564openalex-snapshot

Bounds on the costs of data encodings

inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot

Graphs and Hypergraphs

inferredcites →https://doi.org/10.1109/sfcs.1988.21966openalex-snapshot

Notes on searching in multidimensional monotone arrays

inferredcites →https://doi.org/10.1109/tc.1982.1676109openalex-snapshot

On Embedding Rectangular Grids in Square Grids

inferredcites →https://doi.org/10.1137/0204038openalex-snapshot

Preserving Proximity in Arrays

inferredcites →https://doi.org/10.1137/0604055openalex-snapshot

Perfect Storage Representations for Families of Data Structures

inferredcites →https://doi.org/10.1145/103418.103422openalex-snapshot

Competitive paging with locality of reference

inferredcites →https://doi.org/10.1145/321978.321990openalex-snapshot

Space and Time Hierarchies for Classes of Control Structures and Data Structures

inferredcites →https://doi.org/10.1145/322154.322160openalex-snapshot

Encoding Data Structures in Trees

inferredcites →https://doi.org/10.1145/359361.359447openalex-snapshot

Preserving average proximity in arrays

inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot

Principles of database and knowledge-base 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-44450-5_20openalex-snapshot

Planar Graph Blocking for External Searching

inferred← citeshttps://doi.org/10.1007/3-540-44472-6_17openalex-snapshot

Finding Generalized Path Patterns for Web Log Data Mining

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-48686-0_5openalex-snapshot

An External Memory Data Structure for Shortest Path Queries (Extended Abstract)

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/3-540-68530-8_1openalex-snapshot

External Memory Algorithms

inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_10openalex-snapshot

External Memory Algorithms

inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot

External Memory Data Structures

inferred← citeshttps://doi.org/10.1007/978-3-540-24596-4_47openalex-snapshot

Crafting Data Structures: A Study of Reference Locality in Refinement-Based Pathfinding

inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_61openalex-snapshot

Mobile Route Planning

inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_13openalex-snapshot

Succinct and I/O Efficient Data Structures for Traversal in Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_118openalex-snapshot

I/O and Space-Efficient Path Traversal in Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot

Chapter 5. Realistic Computer Models

inferred← citeshttps://doi.org/10.1007/978-3-642-25781-0_74openalex-snapshot

Road Crosses High Locality Sorting for Navigation Route Planning

inferred← citeshttps://doi.org/10.1007/bfb0015411openalex-snapshot

The I/O-complexity of Ordered Binary-Decision Diagram manipulation

inferred← citeshttps://doi.org/10.1007/s00224-001-0002-1openalex-snapshot

Blocking in Parallel Multisearch Problems

inferred← citeshttps://doi.org/10.1007/s00224-009-9242-2openalex-snapshot

Optimal Cache-Oblivious Mesh Layouts

inferred← citeshttps://doi.org/10.1007/s00453-002-0969-2openalex-snapshot

Planar Graph Blocking for External Searching

inferred← citeshttps://doi.org/10.1007/s00453-011-9528-zopenalex-snapshot

Succinct and I/O Efficient Data Structures for Traversal in Trees

inferred← citeshttps://doi.org/10.1007/s00453-013-9856-2openalex-snapshot

Worst-Case Optimal Tree Layout in External Memory

inferred← citeshttps://doi.org/10.1007/s00453-015-0086-7openalex-snapshot

I/O-Efficient Path Traversal in Succinct Planar Graphs

inferred← citeshttps://doi.org/10.1007/s10619-017-7191-3openalex-snapshot

Distributed block formation and layout for disk-based management of large-scale graphs

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/s0020-0190(02)00503-3openalex-snapshot

Data replication in static tree structures

inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00217-2openalex-snapshot

An external memory data structure for shortest path queries

inferred← citeshttps://doi.org/10.1090/dimacs/050openalex-snapshot

External Memory Algorithms

inferred← citeshttps://doi.org/10.1109/clustr.2006.311857openalex-snapshot

MSSG: A Framework for Massive-Scale Semantic Graphs

inferred← citeshttps://doi.org/10.1145/1005813.1041511openalex-snapshot

A performance study of data layout techniques for improving data locality in refinement-based pathfinding

inferred← citeshttps://doi.org/10.1145/1377676.1377698openalex-snapshot

I/o-efficient efficient algorithms for computing contours on a terrain

inferred← citeshttps://doi.org/10.1145/2213836.2213895openalex-snapshot

Towards effective partition management for large graphs

inferred← citeshttps://doi.org/10.1145/2628071.2671429openalex-snapshot

Processing Big Data Graphs on Memory-Restricted Systems

inferred← citeshttps://doi.org/10.1145/263661.263688openalex-snapshot

On the analysis of indexing schemes

inferred← citeshttps://doi.org/10.1145/275487.275493openalex-snapshot

A lower bound theorem for indexing schemes and its application to multidimensional range queries

inferred← citeshttps://doi.org/10.1145/275487.275501openalex-snapshot

External memory algorithms

inferred← citeshttps://doi.org/10.1145/277651.277676openalex-snapshot

Blocking in parallel multisearch problems (extended abstract)

inferred← citeshttps://doi.org/10.1145/354756.354841openalex-snapshot

Data replication for external searching in static tree structures

inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot

External memory algorithms and data structures

inferred← citeshttps://doi.org/10.1145/505241.505244openalex-snapshot

On a model of indexability and its bounds for range queries

inferred← citeshttps://doi.org/10.1145/775047.775059openalex-snapshot

ANF

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.14264/uql.2017.648openalex-snapshot

High Performance Density-Based Clustering on Massive Data

inferred← citeshttps://doi.org/10.14778/1453856.1453982openalex-snapshot

Keyword search on external memory data graphs

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.48550/arxiv.0804.0940openalex-snapshot

Optimum Binary Search Trees on the Hierarchical Memory Model

inferred← citeshttps://doi.org/10.48550/arxiv.1308.4469openalex-snapshot

External Memory Algorithms For Path Traversal in Graphs

inferred← citeshttps://doi.org/10.5555/314613.314691openalex-snapshot

I/O-efficient algorithms for contour-line extraction and planar graph blocking

inferred← citeshttps://doi.org/10.5555/602099.602108openalex-snapshot

Out-of-core rendering of massive geometric environments

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.7155/jgaa.00031openalex-snapshot

Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees

inferred← citeshttps://doi.org/10.7939/r3639k82ropenalex-snapshot

Chopping Up Trees to Improve Spatial Locality in Implicit k-Heaps

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.