On the public citation graph
Worst-case efficient external-memory priority queues
0 signed · 73 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-19487-8_1openalex-snapshot
An implicit binomial queue with constant insertion time
inferredcites →https://doi.org/10.1007/3-540-58218-5_22openalex-snapshot
The parallel hierarchical memory model
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/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf01185207openalex-snapshot
Algorithms for parallel memory, I: Two-level memories
inferredcites →https://doi.org/10.1016/s0304-3975(99)00006-7openalex-snapshot
Heaps and heapsort on secondary storage
inferredcites →https://doi.org/10.1093/comjnl/34.5.428openalex-snapshot
Performance of Priority Queue Structures in a Virtual Memory Environment
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/2.268880openalex-snapshot
The I/O subsystem/spl minus/a candidate for improvement
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/tse.1984.5010255openalex-snapshot
Virtual Memory Behavior of Some Sorting Algorithms
inferredcites →https://doi.org/10.1137/0207026openalex-snapshot
Implementation and Analysis of Binomial Queue Algorithms
inferredcites →https://doi.org/10.1145/113379.113382openalex-snapshot
Large-scale sorting in parallel memories (extended abstract)
inferredcites →https://doi.org/10.1145/142111.964620openalex-snapshot
Application-Controlled Physical Memory using External Page-Cache Management
inferredcites →https://doi.org/10.1145/143371.143511openalex-snapshot
Application-controlled physical memory using external page-cache management
inferredcites →https://doi.org/10.1145/165854.165867openalex-snapshot
Tools for the development of application-specific virtual memory management
inferredcites →https://doi.org/10.1145/167962.165867openalex-snapshot
Tools for the development of application-specific virtual memory management
inferredcites →https://doi.org/10.1145/174644.174645openalex-snapshot
Fishspear: a priority queue algorithm
inferredcites →https://doi.org/10.1145/235141.235145openalex-snapshot
The influence of caches on the performance of heaps
inferredcites →https://doi.org/10.1145/242223.242300openalex-snapshot
Strategic directions in storage I/O issues in large-scale computing
inferredcites →https://doi.org/10.1145/258533.258647openalex-snapshot
On sorting strings in external memory (extended abstract)
inferredcites →https://doi.org/10.1145/359460.359478openalex-snapshot
A data structure for manipulating priority queues
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_17openalex-snapshot
Engineering an External Memory Minimum Spanning Tree Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-35589-8_51openalex-snapshot
I/O-Efficient Hierarchical Watershed Decomposition of Grid Terrain Models
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-46439-5_29openalex-snapshot
A Unified Approach for Indexed and Non-indexed Spatial Joins
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_10openalex-snapshot
A Framework for Index Bulk Loading and Dynamization
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_19openalex-snapshot
LEDA-SM: Extending LEDA to Secondary Memory
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_27openalex-snapshot
An Experimental Study of Priority Queues in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_35openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48518-x_19openalex-snapshot
Fast Priority Queues for Cached Memory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_62openalex-snapshot
Accessing Multiple Sequences Through Set Associative Caches
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_28openalex-snapshot
A Functional Approach to External Graph 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-319-20086-6_3openalex-snapshot
A Bulk-Parallel Priority Queue in External Memory with STXXL
inferred← citeshttps://doi.org/10.1007/978-3-319-38851-9_5openalex-snapshot
Lempel-Ziv Decoding in External Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-02011-7_4openalex-snapshot
On Computational Models for Flash Memory Devices
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_36openalex-snapshot
Fault Tolerant External Memory Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_11openalex-snapshot
A Survey on Priority Queues
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_68openalex-snapshot
Equivalence between Priority Queues and Sorting in External Memory
inferred← citeshttps://doi.org/10.1007/s00453-001-0088-5openalex-snapshot
A Functional Approach to External Graph Algorithms
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-015-0032-8openalex-snapshot
RAM-Efficient External Memory Sorting
inferred← citeshttps://doi.org/10.1007/s10619-017-7207-zopenalex-snapshot
HiNode: an asymptotically space-optimal storage model for historical queries on graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.12.008openalex-snapshot
The complexity of flow on fat terrains and its i/o-efficient computation
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.1023/a:1025526421410openalex-snapshot
Efficient Flow Computation on Massive Grid Terrain Datasets
inferred← citeshttps://doi.org/10.1109/etcc69750.2026.11682012openalex-snapshot
PAACS: A Priority-Aware Admission Control Scheme for CR-IIoT Networks
inferred← citeshttps://doi.org/10.1109/ipps.1997.580979openalex-snapshot
A parallel priority data structure with applications
inferred← citeshttps://doi.org/10.1117/12.483912openalex-snapshot
Efficient Buffer Management for Scalable Media-on-Demand
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/2523616.2523625openalex-snapshot
Memory-efficient groupby-aggregate using compressed buffer trees
inferred← citeshttps://doi.org/10.1145/351827.384259openalex-snapshot
An experimental study of priority queues in external memory
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/512161.512180openalex-snapshot
Flow computation on massive grids
inferred← citeshttps://doi.org/10.1145/944618.944626openalex-snapshot
Planar point location for large data sets
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/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.22028/d291-25687openalex-snapshot
LEDA-SM: External Memory Algorithms and Data Structures in theory and practice
inferred← citeshttps://doi.org/10.7936/k7wm1bp0openalex-snapshot
Fuzzycast: Media Broadcasting for Multiple Asynchronous Receivers
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.