On the public citation graph
A priority queue in which initialization and queue operations takeO(loglogD) time
0 signed · 120 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/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bf01931680openalex-snapshot
Analysis of an algorithm for priority queue administration
inferredcites →https://doi.org/10.1016/0020-0190(75)90001-0openalex-snapshot
Priority queues with update and finding minimum spanning trees
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1093/comjnl/17.4.324openalex-snapshot
The Art of Computer Programming, Volume 3, Sorting and Searching
inferredcites →https://doi.org/10.1109/sfcs.1975.26openalex-snapshot
Preserving order in a forest in less than logarithmic time
inferredcites →https://doi.org/10.1137/0207026openalex-snapshot
Implementation and Analysis of Binomial Queue Algorithms
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
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.eorms0816openalex-snapshot
Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1002/net.3230250207openalex-snapshot
A capacity scaling algorithm for the constrained maximum flow problem
inferred← citeshttps://doi.org/10.1006/inco.2002.3143openalex-snapshot
Compact Recognizers of Episode Sequences
inferred← citeshttps://doi.org/10.1006/jagm.1996.0814openalex-snapshot
Dynamic Text Indexing under String Updates
inferred← citeshttps://doi.org/10.1006/jagm.1998.0934openalex-snapshot
The Optimal Alphabetic Tree Problem Revisited
inferred← citeshttps://doi.org/10.1006/jagm.2002.1214openalex-snapshot
Sparse Dynamic Programming for Longest Common Subsequence from Fragments
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0035openalex-snapshot
Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/11575832_29openalex-snapshot
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
inferred← citeshttps://doi.org/10.1007/11880561_22openalex-snapshot
Efficient Algorithms for Pattern Matching with General Gaps and Character Classes
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_1openalex-snapshot
Multiple Genome Alignment: Chaining Algorithms Revisited
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_79openalex-snapshot
Output-sensitive generation of the perspective view of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_32openalex-snapshot
Two- and three- dimensional point location in rectangular subdivisions
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_157openalex-snapshot
Computing the agreement of trees with bounded degrees
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_7openalex-snapshot
Longest Common Subsequence from Fragments via Sparse Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-6932-3_1openalex-snapshot
Device-Level Topological Placement with Symmetry Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_17openalex-snapshot
Efficient Algorithms for Sequence Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_25openalex-snapshot
Sparse Normalized Local Alignment
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_68openalex-snapshot
Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions
inferred← citeshttps://doi.org/10.1007/978-3-540-39763-2_1openalex-snapshot
A Local Chaining Algorithm and Its Applications in Comparative Genomics
inferred← citeshttps://doi.org/10.1007/978-3-642-28490-8_44openalex-snapshot
Visualizing Human Genes on Manifolds Embedded in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1007/978-3-642-31020-1_6openalex-snapshot
Intrinsic Protein Distribution on Manifolds Embedded in Low-Dimensional Space
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_10openalex-snapshot
A History of Distribution-Sensitive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_65openalex-snapshot
Biased Predecessor Search
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_5openalex-snapshot
Computational geometry on a grid an overview
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_8openalex-snapshot
String Editing and Longest Common Subsequences
inferred← citeshttps://doi.org/10.1007/bf01758847openalex-snapshot
Output-sensitive generation of the perspective view of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1007/bf02067242openalex-snapshot
On graphs preserving rectilinear shortest paths in the presence of obstacles
inferred← citeshttps://doi.org/10.1007/bf02526034openalex-snapshot
Sorting helps for voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf02973462openalex-snapshot
Fast evaluation of Bounded Slice-line Grid
inferred← citeshttps://doi.org/10.1007/bfb0015757openalex-snapshot
The nearest neighbor problem on bounded domains
inferred← citeshttps://doi.org/10.1007/bfb0032070openalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1007/s002240000069openalex-snapshot
Parallel Algorithms for the Circuit Value Update Problem
inferred← citeshttps://doi.org/10.1007/s002360050126openalex-snapshot
Partitioning a sequence into few monotone subsequences
inferred← citeshttps://doi.org/10.1007/s00453-001-0013-yopenalex-snapshot
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems
inferred← citeshttps://doi.org/10.1007/s00453-005-1152-3openalex-snapshot
Sparse Normalized Local Alignment
inferred← citeshttps://doi.org/10.1007/s10791-008-9054-zopenalex-snapshot
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90075-3openalex-snapshot
Log-logarithmic worst-case range queries are possible in space Θ(N)
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90022-popenalex-snapshot
Bounded ordered dictionaries in O(log log N) time and O(n) space
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90240-aopenalex-snapshot
Range-restricted mergeable priority queues
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90020-5openalex-snapshot
New trie data structures which support very fast search operations
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90200-topenalex-snapshot
New clique and independent set algorithms for circle graphs
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90065-5openalex-snapshot
The k most vital arcs in the shortest path problem
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90074-fopenalex-snapshot
The k most vital arcs in the shortest path problem
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90034-vopenalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90135-3openalex-snapshot
Dynamic programming with convexity, concavity and sparsity
inferred← citeshttps://doi.org/10.1016/j.cor.2006.07.009openalex-snapshot
A double scaling algorithm for the constrained maximum flow problem
inferred← citeshttps://doi.org/10.1016/j.cor.2012.01.010openalex-snapshot
A faster polynomial algorithm for the constrained maximum flow problem
inferred← citeshttps://doi.org/10.1016/j.jda.2004.08.011openalex-snapshot
Chaining algorithms for multiple genome comparison
inferred← citeshttps://doi.org/10.1016/j.tre.2023.103287openalex-snapshot
Freight transport using additional railcars attached to intercity passenger trains with transshipment and railcar circulation: Tabu-search-based Lagrangian heuristic
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00090-2openalex-snapshot
On building the transitive reduction of a two-dimensional poset
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00074-7openalex-snapshot
Routing a vehicle of capacity greater than one
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00072-9openalex-snapshot
Sorting by bounded block-moves
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1061/(asce)cp.1943-5487.0000675openalex-snapshot
Bounding Box Approach to Network Pruning for Efficient Path Search through Large Networks
inferred← citeshttps://doi.org/10.1089/cmb.1998.5.197openalex-snapshot
Alignments Without Low-Scoring Regions
inferred← citeshttps://doi.org/10.1093/bioinformatics/18.12.1673openalex-snapshot
A hierarchical approach to aligning collinear regions of genomes
inferred← citeshttps://doi.org/10.1109/43.969434openalex-snapshot
Fast evaluation of sequence pair in block placement by longest common subsequence computation
inferred← citeshttps://doi.org/10.1109/78.80784openalex-snapshot
Comparison of algorithms for standard median filtering
inferred← citeshttps://doi.org/10.1109/90.664266openalex-snapshot
Efficient fair queueing algorithms for packet-switched networks
inferred← citeshttps://doi.org/10.1109/aspdac.2001.913361openalex-snapshot
FAST-SP: a fast algorithm for block placement based on sequence pair
inferred← citeshttps://doi.org/10.1109/icasic.2003.1277493openalex-snapshot
Fast evaluation of symmetric-feasible sequence-pairs for analog topological placement
inferred← citeshttps://doi.org/10.1109/iscas.2003.1206227openalex-snapshot
Evaluating a bounded slice-line grid assignment in O(nlogn) time
inferred← citeshttps://doi.org/10.1109/iscas.2007.378437openalex-snapshot
Topological Placement with Multiple Symmetry Groups of Devices for Analog Layout Design
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365697openalex-snapshot
Finding the k shortest paths
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814588openalex-snapshot
Efficient regular data structures and algorithms for location and proximity problems
inferred← citeshttps://doi.org/10.1109/tcad.2003.822132openalex-snapshot
On the Exploration of the Solution Space in Analog Placement With Symmetry Constraints
inferred← citeshttps://doi.org/10.1109/tcad.2013.2244642openalex-snapshot
Fully Dynamic Evaluation of Sequence Pair
inferred← citeshttps://doi.org/10.1109/tcad.2020.2975177openalex-snapshot
Exploring Multiple Analog Placements With Partial-Monotonic Current Paths and Symmetry Constraints Using PCP-SP
inferred← citeshttps://doi.org/10.1137/0221062openalex-snapshot
Fully Dynamic Algorithms for 2-Edge Connectivity
inferred← citeshttps://doi.org/10.1137/1033048openalex-snapshot
Some Recent Advances in Network Flows
inferred← citeshttps://doi.org/10.1137/s0097539795290477openalex-snapshot
Finding the k Shortest Paths
inferred← citeshttps://doi.org/10.1137/s0097539797322425openalex-snapshot
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
inferred← citeshttps://doi.org/10.1142/s0129054108005607openalex-snapshot
EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHING
inferred← citeshttps://doi.org/10.1145/103418.103454openalex-snapshot
Fully dynamic algorithms for edge connectivity problems
inferred← citeshttps://doi.org/10.1145/10515.10524openalex-snapshot
On the application of shared retrieval to orthogonal range queries
inferred← citeshttps://doi.org/10.1145/1227161.1278376openalex-snapshot
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
inferred← citeshttps://doi.org/10.1145/215399.215406openalex-snapshot
Parallel algorithms for the circuit value update problem
inferred← citeshttps://doi.org/10.1145/279069.279137openalex-snapshot
Alignments without low-scoring regions
inferred← citeshttps://doi.org/10.1145/343647.343713openalex-snapshot
Fast evaluation of sequence pair in block placement by longest common subsequence computation
inferred← citeshttps://doi.org/10.1186/1748-7188-6-4openalex-snapshot
Fast local fragment chaining using sum-of-pair gap costs
inferred← citeshttps://doi.org/10.1201/9781420036275.ch15openalex-snapshot
Chaining Algorithms and Applications in Comparative Genomics
inferred← citeshttps://doi.org/10.1287/ijoc.8.1.41openalex-snapshot
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
inferred← citeshttps://doi.org/10.1287/moor.25.1.76.15208openalex-snapshot
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
inferred← citeshttps://doi.org/10.1287/opre.40.1.s5openalex-snapshot
The Scaling Network Simplex Algorithm
inferred← citeshttps://doi.org/10.13021/mars/4533openalex-snapshot
Revealed Path Choice Behavior and Network Pruning for Efficient Path Finding
inferred← citeshttps://doi.org/10.1504/ijiids.2014.066640openalex-snapshot
The genetic landscape on manifolds from human genes
inferred← citeshttps://doi.org/10.18725/oparu-365openalex-snapshot
Algorithms and a software system for comparative genome analysis
inferred← citeshttps://doi.org/10.22215/etd/2012-09696openalex-snapshot
Exploiting non-uniform query distributions in data structuring problems
inferred← citeshttps://doi.org/10.2312/eggh/eggh87/003-019openalex-snapshot
New Algorithms for Computer Graphics
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2017.44openalex-snapshot
On-the-Fly Array Initialization in Less Space
inferred← citeshttps://doi.org/10.5555/313651.313661openalex-snapshot
Chaining multiple-alignment fragments in sub-quadratic time
inferred← citeshttps://doi.org/10.70675/94e7cc62zc488z43e2zbcabz36c757b3d57eopenalex-snapshot
Algorithms for the comparisons of genomic sequences applied to bacterial genomes
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.