On the public citation graph
The pairing heap: A new form of self-adjusting heap
0 signed · 266 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/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1109/sfcs.1984.715934openalex-snapshot
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
inferredcites →https://doi.org/10.1109/sfcs.1984.715935openalex-snapshot
Efficient Implementation Of Graph Algorithms Using Contraction
inferredcites →https://doi.org/10.1137/0207026openalex-snapshot
Implementation and Analysis of Binomial Queue Algorithms
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/359460.359478openalex-snapshot
A data structure for manipulating priority queues
inferredcites →https://doi.org/10.1145/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
inferredcites →https://doi.org/10.1145/65950.65954openalex-snapshot
Efficient implementation of graph algorithms using contraction
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0509openalex-snapshot
Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1002/rsa.20139openalex-snapshot
Profiles of random trees: Plane‐oriented recursive trees
inferred← citeshttps://doi.org/10.1002/spe.4380231005openalex-snapshot
A performance comparison of event calendar algorithms: An empirical approach
inferred← citeshttps://doi.org/10.1007/11534273_6openalex-snapshot
The Complexity of Implicit and Space Efficient Priority Queues
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_5openalex-snapshot
Improved Upper Bounds for Pairing Heaps
inferred← citeshttps://doi.org/10.1007/3-540-45643-0_10openalex-snapshot
Experimental Evaluation of a New Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_26openalex-snapshot
Randomized Meldable Priority Queues
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_257openalex-snapshot
The K-D heap: An efficient multi-dimensional priority queue
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_210openalex-snapshot
Are Fibonacci heaps optimal?
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_70openalex-snapshot
Fast meldable priority queues
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_59openalex-snapshot
Path balance heuristic for self-adjusting binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_150openalex-snapshot
Priority queues on parallel machines
inferred← citeshttps://doi.org/10.1007/978-1-4471-0765-1_46openalex-snapshot
What can MEMS do for Robotics?
inferred← citeshttps://doi.org/10.1007/978-1-4471-1021-7_46openalex-snapshot
Automatic Task Planning for Robot Vision
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_7openalex-snapshot
Concurrent Data Structures for Tree Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-19909-8_13openalex-snapshot
Computing Long Sequences of Consecutive Fibonacci Integers with TensorFlow
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_2openalex-snapshot
Verified Textbook Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-24866-5_10openalex-snapshot
The Skewed Kruskal Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_27openalex-snapshot
Efficiently Finding All Shortest Absent Subsequences in a String
inferred← citeshttps://doi.org/10.1007/978-3-319-22102-1_21openalex-snapshot
Amortized Complexity Verified
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_36openalex-snapshot
A Linear Potential Function for Pairing Heaps
inferred← citeshttps://doi.org/10.1007/978-3-319-59105-6_49openalex-snapshot
Efficient Simulation of Interacting Particle Systems in Continuous Space and Time
inferred← citeshttps://doi.org/10.1007/978-3-319-67190-1_8openalex-snapshot
Improving the Cache-Efficiency of Shortest Path Search
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_23openalex-snapshot
Three Sorting Algorithms Using Priority Queues
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_10openalex-snapshot
Distribution-Sensitive Binomial Queues
inferred← citeshttps://doi.org/10.1007/978-3-540-70807-0_5openalex-snapshot
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-71615-0_16openalex-snapshot
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_41openalex-snapshot
Optimizing Compilation and Computational Complexity of Constraint Handling Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_36openalex-snapshot
Policy-Based Benchmarking of Weak Heaps and Their Relatives,
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_51openalex-snapshot
The Violation Heap: A Relaxed Fibonacci-Like Heap
inferred← citeshttps://doi.org/10.1007/978-3-642-15781-3_16openalex-snapshot
Pairing Heaps with Costless Meld
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_36openalex-snapshot
On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_17openalex-snapshot
A Unifying Property for Distribution-Sensitive Priority Queues
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-642-40273-9_3openalex-snapshot
Quake Heaps: A Simple Alternative to Fibonacci Heaps
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_53openalex-snapshot
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_25openalex-snapshot
Cache-Oblivious Persistence
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_72openalex-snapshot
Replacing Mark Bits with Randomness in Fibonacci Heaps
inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_17openalex-snapshot
Priority Queues Are Not Good Concurrent Priority Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_7openalex-snapshot
Dynamic Partial Orders and Generalized Heaps
inferred← citeshttps://doi.org/10.1007/978-981-99-5080-5_29openalex-snapshot
The Indian Search Algorithm
inferred← citeshttps://doi.org/10.1007/bf01188580openalex-snapshot
Combinatorial algorithms for DNA sequence assembly
inferred← citeshttps://doi.org/10.1007/bf01758771openalex-snapshot
Three priority queue applications revisited
inferred← citeshttps://doi.org/10.1007/bf01994839openalex-snapshot
Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andN-StepSCAN
inferred← citeshttps://doi.org/10.1007/bf02802549openalex-snapshot
An overview of discrete event simulation methodologies and implementation
inferred← citeshttps://doi.org/10.1007/bfb0027123openalex-snapshot
Building a parallel branch and bound library
inferred← citeshttps://doi.org/10.1007/bfb0028279openalex-snapshot
An empirical analysis of algorithms for constructing a minimum spanning tree
inferred← citeshttps://doi.org/10.1007/s00371-019-01718-2openalex-snapshot
An enhanced sweep and prune algorithm for multi-body continuous collision detection
inferred← citeshttps://doi.org/10.1007/s00453-010-9400-6openalex-snapshot
On Sorting, Heaps, and Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/s00453-011-9489-2openalex-snapshot
Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees
inferred← citeshttps://doi.org/10.1007/s11227-016-1707-xopenalex-snapshot
A novel MPI reduction algorithm resilient to imbalances in process arrival times
inferred← citeshttps://doi.org/10.1007/s12532-009-0002-8openalex-snapshot
Blossom V: a new implementation of a minimum cost perfect matching algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90101-4openalex-snapshot
A tight amortized bound for path reversal
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90218-7openalex-snapshot
The derivation of a tighter bound for top-down skew heaps
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90249-9openalex-snapshot
A systematic analysis of splaying
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00194-8openalex-snapshot
A generalization of binomial queues
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90093-bopenalex-snapshot
Computing k-shortest path for nuclear spent fuel highway transportation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.01.005openalex-snapshot
Proximate point searching
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101620openalex-snapshot
Progressive simplification of polygonal curves
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2013.07.014openalex-snapshot
Chemical supply chain modeling for analysis of homeland security events
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.002openalex-snapshot
The saga of minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.12.024openalex-snapshot
Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach
inferred← citeshttps://doi.org/10.1016/j.future.2021.12.010openalex-snapshot
DONS: Dynamic Optimized Neighbor Selection for smart blockchain networks
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.03.002openalex-snapshot
Parameterized self-adjusting heaps
inferred← citeshttps://doi.org/10.1016/j.jcp.2006.06.042openalex-snapshot
A Complexity O(1) priority queue for event driven molecular dynamics simulations
inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.010openalex-snapshot
The weak-heap data structure: Variants and applications
inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.014openalex-snapshot
A priority queue with the time-finger property
inferred← citeshttps://doi.org/10.1016/j.neucom.2012.10.004openalex-snapshot
Growing neural gas efficiently
inferred← citeshttps://doi.org/10.1016/j.softx.2021.100869openalex-snapshot
JHeaps: An open-source library of priority queues
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114563openalex-snapshot
Priority queues with decreasing keys
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00260-6openalex-snapshot
The number of tests required to search an unordered table
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80204-xopenalex-snapshot
Chapter 7 Fundamental algorithms and data structures
inferred← citeshttps://doi.org/10.1017/9781316888568.003openalex-snapshot
Preliminaries: Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.005openalex-snapshot
Global Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.006openalex-snapshot
More Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.007openalex-snapshot
Minimum-Cost Circulation Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.008openalex-snapshot
Generalized Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.009openalex-snapshot
Multicommodity Flow Algorithms
inferred← citeshttps://doi.org/10.1017/cbo9780511530104openalex-snapshot
Purely Functional Data Structures
inferred← citeshttps://doi.org/10.1017/s095679680000201xopenalex-snapshot
Optimal purely functional priority queues
inferred← citeshttps://doi.org/10.1021/acs.jpca.0c06871openalex-snapshot
Comparison of Queueing Data-Structures for Kinetic Monte Carlo Simulations of Heterogeneous Catalysts
inferred← citeshttps://doi.org/10.1063/5.0083251openalex-snapshot
Kinetic Monte Carlo simulations for heterogeneous catalysis: Fundamentals, current status, and challenges
inferred← citeshttps://doi.org/10.1080/00207160903029810openalex-snapshot
Pairing heaps, scrambled pairing and square-root trees
inferred← citeshttps://doi.org/10.1080/19648189.2008.9693051openalex-snapshot
Contact of granular particles and the simulation of rapid flows using event-driven molecular dynamics
inferred← citeshttps://doi.org/10.1109/cei60616.2023.10527848openalex-snapshot
Research on UAV Multi-Objective Path Planning Problem Based on Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/cw.2018.00020openalex-snapshot
A Robust and Efficient Algorithm for Multi-body Continuous Collision Detection
inferred← citeshttps://doi.org/10.1109/distra.2018.8601019openalex-snapshot
Exploiting Adaptive Ladder Queue into Repast Simulation platform
inferred← citeshttps://doi.org/10.1109/dt.2019.8813457openalex-snapshot
Practical Applicability of Advanced Implementations of Priority Queues in Finding Shortest Paths
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00125openalex-snapshot
Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps
inferred← citeshttps://doi.org/10.1109/ftcs.1994.315646openalex-snapshot
Checking mergeable priority queues
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547539openalex-snapshot
Accelerating Dijkstra's Algorithm Using Multiresolution Priority Queues
inferred← citeshttps://doi.org/10.1109/iceict.2016.7879664openalex-snapshot
Scaling SDN network with self-adjusting architecture
inferred← citeshttps://doi.org/10.1109/icpp.2006.40openalex-snapshot
ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony
inferred← citeshttps://doi.org/10.1109/idt59031.2023.10194445openalex-snapshot
Advanced Priority Queues in the OPTICS Clustering Algorithm
inferred← citeshttps://doi.org/10.1109/indin.2008.4618181openalex-snapshot
A wireless escape system for industrial accidents using Ad Hoc positioning
inferred← citeshttps://doi.org/10.1109/iscid.2012.260openalex-snapshot
An Improved Dijkstra Algorithm Based on Pairing Heap
inferred← citeshttps://doi.org/10.1109/iv.2018.00016openalex-snapshot
The Branching Data Model, the Foundation for Automated Tree Visualization
inferred← citeshttps://doi.org/10.1109/sfcs.2005.75openalex-snapshot
Towards a Final Analysis of Pairing Heaps
inferred← citeshttps://doi.org/10.1109/simsym.1993.639154openalex-snapshot
Dynamic Performance Profiles Of Simulation Calendars
inferred← citeshttps://doi.org/10.1109/tkde.2023.3272574openalex-snapshot
Unified Dense Subgraph Detection: Fast Spectral Theory Based Algorithms
inferred← citeshttps://doi.org/10.1109/tnsm.2017.2761777openalex-snapshot
ParaCon: A Parallel Control Plane for Scaling Up Path Computation in SDN
inferred← citeshttps://doi.org/10.1109/vtcfall.2014.6965831openalex-snapshot
A Novel Routing Algorithm Design of Time Evolving Graph Based on Pairing Heap for MEO Satellite Network
inferred← citeshttps://doi.org/10.1109/wsc.1998.745034openalex-snapshot
GMSim: a tool for compositional GSMP modeling
inferred← citeshttps://doi.org/10.1109/wvl.1992.275762openalex-snapshot
Tidy animations of tree algorithms
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2007.01029.xopenalex-snapshot
A Lagrangian Approach to Dynamic Interfaces through Kinetic Triangulation of the Ambient Space
inferred← citeshttps://doi.org/10.1137/0219060openalex-snapshot
Postorder Disjoint Set Union is Linear
inferred← citeshttps://doi.org/10.1137/1.9781611972863.16openalex-snapshot
Optimal Incremental Sorting
inferred← citeshttps://doi.org/10.1137/1.9781611972900.1openalex-snapshot
Fast Local Search for Steiner Trees in Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973198.7openalex-snapshot
A Back-to-Basics Empirical Study of Priority Queues
inferred← citeshttps://doi.org/10.1137/1.9781611977073.78openalex-snapshot
Selectable Heaps and Optimal Lazy Search Trees
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch24openalex-snapshot
A Tight Analysis of Slim Heaps and Smooth Heaps
inferred← citeshttps://doi.org/10.1137/18m1195188openalex-snapshot
Smooth Heaps and a Dual View of Self-Adjusting Data Structures
inferred← citeshttps://doi.org/10.1142/s0129054106004510openalex-snapshot
A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
inferred← citeshttps://doi.org/10.1142/s012905411450004xopenalex-snapshot
A SIMPLE ARRAY VERSION OF M-HEAP
inferred← citeshttps://doi.org/10.1142/s1793830910000838openalex-snapshot
THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP
inferred← citeshttps://doi.org/10.1145/130956.130959openalex-snapshot
Animating algorithms with XTANGO
inferred← citeshttps://doi.org/10.1145/1376916.1376956openalex-snapshot
Near-optimal dynamic replication in unstructured peer-to-peer networks
inferred← citeshttps://doi.org/10.1145/169059.169078openalex-snapshot
Do algorithm animations assist learning?
inferred← citeshttps://doi.org/10.1145/1810479.1810540openalex-snapshot
Flat combining and the synchronization-parallelism tradeoff
inferred← citeshttps://doi.org/10.1145/2133803.2184448openalex-snapshot
Fast local search for the steiner problem in graphs
inferred← citeshttps://doi.org/10.1145/2749246.2749250openalex-snapshot
Turning Centralized Coherence and Distributed Critical-Section Execution on their Head
inferred← citeshttps://doi.org/10.1145/276304.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferred← citeshttps://doi.org/10.1145/276305.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferred← citeshttps://doi.org/10.1145/276698.276779openalex-snapshot
Information theoretic implications for pairing heaps
inferred← citeshttps://doi.org/10.1145/2903142openalex-snapshot
Deletion Without Rebalancing in Binary Search Trees
inferred← citeshttps://doi.org/10.1145/297096.297111openalex-snapshot
Weight-biased leftist trees and modified skip lists
inferred← citeshttps://doi.org/10.1145/3037697.3037721openalex-snapshot
Black-box Concurrent Data Structures for NUMA Architectures
inferred← citeshttps://doi.org/10.1145/3093315.3037721openalex-snapshot
Black-box Concurrent Data Structures for NUMA Architectures
inferred← citeshttps://doi.org/10.1145/3093336.3037721openalex-snapshot
Black-box Concurrent Data Structures for NUMA Architectures
inferred← citeshttps://doi.org/10.1145/3093337.3037721openalex-snapshot
Black-box Concurrent Data Structures for NUMA Architectures
inferred← citeshttps://doi.org/10.1145/3139645.3139650openalex-snapshot
How to implement any concurrent data structure for modern servers
inferred← citeshttps://doi.org/10.1145/320211.320214openalex-snapshot
On the efficiency of pairing heaps and related data structures
inferred← citeshttps://doi.org/10.1145/320248.320255openalex-snapshot
Distance browsing in spatial databases
inferred← citeshttps://doi.org/10.1145/3360547openalex-snapshot
Modular verification of heap reachability properties in separation logic
inferred← citeshttps://doi.org/10.1145/351827.351828openalex-snapshot
Correspondence-based data structures for double-ended priority queues
inferred← citeshttps://doi.org/10.1145/351827.384250openalex-snapshot
Implementing weighted b-matching algorithms
inferred← citeshttps://doi.org/10.1145/3626183.3659962openalex-snapshot
Multi Bucket Queues: Efficient Concurrent Priority Scheduling
inferred← citeshttps://doi.org/10.1145/3626567openalex-snapshot
Finding the k Shortest Simple Paths: Time and Space trade-offs
inferred← citeshttps://doi.org/10.1145/3704892openalex-snapshot
Formalising Graph Algorithms with Coinduction
inferred← citeshttps://doi.org/10.1145/3731369openalex-snapshot
Functional Data Structures and Algorithms
inferred← citeshttps://doi.org/10.1145/3731369.3731380openalex-snapshot
Beyond Insert and Delete: ∪, ∩, and −
inferred← citeshttps://doi.org/10.1145/3731369.3731386openalex-snapshot
Priority Queues via Braun Trees
inferred← citeshttps://doi.org/10.1145/3731369.3731395openalex-snapshot
Fast String Search by Knuth–Morris–Pratt
showing the first 200 of 250 · page through all 250
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.