On the public citation graph
Design and implementation of an efficient priority queue
0 signed · 475 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/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_14openalex-snapshot
Efficiency of Equivalence Algorithms
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0205011openalex-snapshot
On Finding Lowest Common Ancestors in Trees
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/322154.322161openalex-snapshot
Applications of Path Compression on Balanced Trees
inferredcites →https://doi.org/10.1145/359581.359603openalex-snapshot
A fast algorithm for computing longest common subsequences
inferredcites →https://doi.org/10.1145/800125.804056openalex-snapshot
On finding lowest common ancestors in trees
inferredcites →https://doi.org/10.3929/ethz-a-000814158openalex-snapshot
The programming language Pascal (Revised Report)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.70035openalex-snapshot
A Lasso‐Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks
inferred← citeshttps://doi.org/10.1006/inco.2001.3053openalex-snapshot
Improved Fast Integer Sorting in Linear Space
inferred← citeshttps://doi.org/10.1006/jagm.2000.1080openalex-snapshot
Floats, Integers, and Single Source Shortest Paths
inferred← citeshttps://doi.org/10.1006/jcss.1996.0008openalex-snapshot
Lower Bounds for the Union–Find and the Split–Find Problem on Pointer Machines
inferred← citeshttps://doi.org/10.1006/jcss.2002.1822openalex-snapshot
Optimal Bounds for the Predecessor Problem and Related Problems
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_22openalex-snapshot
Efficient Algorithms for Handling Molecular Weighted Sequences
inferred← citeshttps://doi.org/10.1007/11415770_11openalex-snapshot
A High-Throughput Approach for Associating microRNAs with Their Activity Conditions
inferred← citeshttps://doi.org/10.1007/11561071_23openalex-snapshot
Predecessor Queries in Constant Time?
inferred← citeshttps://doi.org/10.1007/11591191_7openalex-snapshot
Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees
inferred← citeshttps://doi.org/10.1007/11764298_14openalex-snapshot
Compressed Dictionaries: Space Measures, Data Sets, and Experiments
inferred← citeshttps://doi.org/10.1007/11780441_30openalex-snapshot
Faster Algorithms for Computing Longest Common Increasing Subsequences
inferred← citeshttps://doi.org/10.1007/11786986_34openalex-snapshot
Dynamic Interpolation Search Revisited
inferred← citeshttps://doi.org/10.1007/11818175_18openalex-snapshot
Fast Algorithms for the Free Riders Problem in Broadcast Encryption
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_5openalex-snapshot
Minimum s-t cut of a planar undirected network in o(n log2(n)) time
inferred← citeshttps://doi.org/10.1007/3-540-16766-8_24openalex-snapshot
A generalized topological sorting problem
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_41openalex-snapshot
A Lower Bound on the Complexity of the Union-Split-Find Problem
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_3openalex-snapshot
Exact and Approximate Distances in Graphs — A Survey
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_17openalex-snapshot
Maximum Red/Blue Interval Matching with Application
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_7openalex-snapshot
Improved Shortest Paths on the Word RAM
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_9openalex-snapshot
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_43openalex-snapshot
Shortest Path Algorithms: Engineering Aspects
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_43openalex-snapshot
Dominance in the presence of obstacles
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-53487-3_42openalex-snapshot
The power of collision: Randomized parallel algorithms for chaining and integer sorting
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_75openalex-snapshot
Efficient algorithms for managing the history of evolving databases
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_78openalex-snapshot
A faster algorithm for edge-disjoint paths in planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_205openalex-snapshot
Four results on randomized incremental constructions
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_20openalex-snapshot
Selected topics from computational geometry, data structures and motion planning
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-56402-0_39openalex-snapshot
Kayles on special classes of graphs — An application of Sprague-Grundy theory
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_59openalex-snapshot
Searching among intervals and compact routing tables
inferred← citeshttps://doi.org/10.1007/3-540-57370-4_37openalex-snapshot
Towards efficient inductive synthesis of expressions from input/output examples
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_233openalex-snapshot
Graphical degree sequence problems with connectivity requirements
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_6openalex-snapshot
Concurrency in an O (log log N) priority queue
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_15openalex-snapshot
Lower bounds for dynamic algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_148openalex-snapshot
Linear size binary space partitions for fat objects
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_11openalex-snapshot
Perfect hashing for strings: Formalization and algorithms
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_131openalex-snapshot
Sorting and searching revisted
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_149openalex-snapshot
Lower bounds for static dictionaries on RAMs with bit operations but no multiplication
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_51openalex-snapshot
Priority queues: Small, monotone and trans-dichotomous
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_263openalex-snapshot
O(log log n)‐competitive Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_24openalex-snapshot
A Unified Approach for Domination Problems on Different Network Topologies
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_631openalex-snapshot
Orthogonal Range Searching on Discrete Grids
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_632openalex-snapshot
Predecessor Search, String Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-01470-4_10openalex-snapshot
Parallel Simulation of Virtual Testbed Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-12598-1_6openalex-snapshot
Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-dominated Sorting
inferred← citeshttps://doi.org/10.1007/978-3-032-35418-1_11openalex-snapshot
Oblivious Priority Queue and Single-Source Shortest Path in the External Memory Setting
inferred← citeshttps://doi.org/10.1007/978-3-319-07566-2_22openalex-snapshot
Searching of Gapped Repeats and Subrepetitions in a Word
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_20openalex-snapshot
Colored Range Searching in Linear Space
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_29openalex-snapshot
Algorithms in the Ultra-Wide Word Model
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_5openalex-snapshot
Longest Common Extensions in Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_31openalex-snapshot
Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_25openalex-snapshot
On the Complexity of Dependent And-Parallelism in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_8openalex-snapshot
Rotation and Lighting Invariant Template Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_2openalex-snapshot
Cache-Oblivious Algorithms and Data Structures
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-30551-4_68openalex-snapshot
Dynamic Tree Cross Products
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_4openalex-snapshot
Uniquely Represented Data Structures for Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_35openalex-snapshot
Faster Algorithms for Incremental Topological Ordering
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_7openalex-snapshot
Cache-Oblivious Index for Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_3openalex-snapshot
Orthogonal Range Searching in Linear and Almost-Linear Space
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_7openalex-snapshot
Hypervolume Approximation in Timed Automata Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_46openalex-snapshot
External Memory Range Reporting on a Grid
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_59openalex-snapshot
I/O-Efficient Point Location in a Set of Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-540-85324-4_11openalex-snapshot
Dynamische Verwaltung Virtuellen Speichers für Echtzeitsysteme
inferred← citeshttps://doi.org/10.1007/978-3-642-00563-3_57openalex-snapshot
On Two Variants of the Longest Increasing Subsequence Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_16openalex-snapshot
Processing an Offline Insertion-Query Sequence with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_83openalex-snapshot
Data Structures for Range Median Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_57openalex-snapshot
Optimal Trade-Offs for Succinct String Indexes
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-19094-0_18openalex-snapshot
Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_10openalex-snapshot
Worst Case Efficient Single and Multiple String Matching in the RAM Model
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_26openalex-snapshot
Substring Range Reporting
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_39openalex-snapshot
Distance Oracles for Vertex-Labeled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-23544-3_29openalex-snapshot
An Envelope-Based Approach to Rotation-Invariant Boundary Image Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_19openalex-snapshot
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_22openalex-snapshot
Broadcasting in Heterogeneous Tree Networks with Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_631-1openalex-snapshot
Orthogonal Range Searching on Discrete Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_632-2openalex-snapshot
Predecessor Search, String Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_10openalex-snapshot
Computing Maximum Non-crossing Matching in Convex Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_16openalex-snapshot
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_26openalex-snapshot
Linear-Space Data Structures for Range Minority Query in Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_28openalex-snapshot
Connectivity Oracles for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_28openalex-snapshot
Data Structures on Event Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_29openalex-snapshot
Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_13openalex-snapshot
Fingerprints in Compressed Strings
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-40450-4_63openalex-snapshot
Optimal Color Range Reporting in One Dimension
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_15openalex-snapshot
Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets
inferred← citeshttps://doi.org/10.1007/978-3-642-61340-1_4openalex-snapshot
Computational Geometry and its Application to Computer Graphics
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-43948-7_7openalex-snapshot
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM
inferred← citeshttps://doi.org/10.1007/978-981-96-3538-2_4openalex-snapshot
Analysis of Merge Non-dominated Sorting Algorithm
inferred← citeshttps://doi.org/10.1007/bf01354880openalex-snapshot
Historical queries along multiple lines of time evolution
inferred← citeshttps://doi.org/10.1007/bf01758847openalex-snapshot
Output-sensitive generation of the perspective view of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1007/bf01786986openalex-snapshot
A priority queue in which initialization and queue operations takeO(loglogD) time
inferred← citeshttps://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferred← citeshttps://doi.org/10.1007/bf01932839openalex-snapshot
Order preserving extendible hashing and bucket tries
inferred← citeshttps://doi.org/10.1007/bf01955044openalex-snapshot
Searching among intervals and compact routing tables
inferred← citeshttps://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferred← citeshttps://doi.org/10.1007/bf02526034openalex-snapshot
Sorting helps for voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf02592101openalex-snapshot
Shortest paths algorithms: Theory and experimental evaluation
inferred← citeshttps://doi.org/10.1007/bf02802549openalex-snapshot
An overview of discrete event simulation methodologies and implementation
inferred← citeshttps://doi.org/10.1007/bf02835833openalex-snapshot
On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
inferred← citeshttps://doi.org/10.1007/bf02973462openalex-snapshot
Fast evaluation of Bounded Slice-line Grid
inferred← citeshttps://doi.org/10.1007/bfb0015734openalex-snapshot
Fractional cascading: A data structuring technique with geometric applications
inferred← citeshttps://doi.org/10.1007/bfb0015757openalex-snapshot
The nearest neighbor problem on bounded domains
inferred← citeshttps://doi.org/10.1007/bfb0017140openalex-snapshot
Implementing abstract data structures in hardware
inferred← citeshttps://doi.org/10.1007/bfb0023445openalex-snapshot
Predecessor queries in dynamic integer sets
inferred← citeshttps://doi.org/10.1007/bfb0028545openalex-snapshot
Floats, integers, and single source shortest paths
inferred← citeshttps://doi.org/10.1007/bfb0028575openalex-snapshot
Sorting and searching on the word RAM
inferred← citeshttps://doi.org/10.1007/bfb0032067openalex-snapshot
An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal
inferred← citeshttps://doi.org/10.1007/bfb0032070openalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1007/s00224-020-09966-9openalex-snapshot
Longest Increasing Subsequence under Persistent Comparison Errors
inferred← citeshttps://doi.org/10.1007/s00453-002-0935-zopenalex-snapshot
Optimal Solutions for the Temporal Precedence Problem
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-013-9838-4openalex-snapshot
Data Structures on Event Graphs
inferred← citeshttps://doi.org/10.1007/s00453-016-0199-7openalex-snapshot
Full-Fledged Real-Time Indexing for Constant Size Alphabets
inferred← citeshttps://doi.org/10.1007/s00453-017-0380-7openalex-snapshot
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation
inferred← citeshttps://doi.org/10.1007/s00453-019-00604-6openalex-snapshot
Extensions of Self-Improving Sorters
inferred← citeshttps://doi.org/10.1007/s00453-021-00922-8openalex-snapshot
An Axiomatic Approach to Time-Dependent Shortest Path Oracles
inferred← citeshttps://doi.org/10.1007/s00453-023-01193-1openalex-snapshot
Predecessor on the Ultra-Wide Word RAM
inferred← citeshttps://doi.org/10.1007/s004530010036openalex-snapshot
The Temporal Precedence Problem
inferred← citeshttps://doi.org/10.1007/s004530010040openalex-snapshot
Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input
inferred← citeshttps://doi.org/10.1007/s00530-014-0386-9openalex-snapshot
Envelope-based boundary image matching for smart devices under arbitrary rotations
inferred← citeshttps://doi.org/10.1007/s10710-024-09487-1openalex-snapshot
Hierarchical non-dominated sort: analysis and improvement
inferred← citeshttps://doi.org/10.1007/s10827-007-0038-6openalex-snapshot
Simulation of networks of spiking neurons: A review of tools and strategies
inferred← citeshttps://doi.org/10.1007/s10878-009-9262-5openalex-snapshot
On the generalized constrained longest common subsequence problems
inferred← citeshttps://doi.org/10.1007/s10878-015-9973-8openalex-snapshot
Handling precedence constraints in scheduling problems by the sequence pair representation
inferred← citeshttps://doi.org/10.1007/s11241-014-9216-6openalex-snapshot
Utilization-based admission control for aperiodic tasks under EDF scheduling
inferred← citeshttps://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
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(90)90128-kopenalex-snapshot
A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90193-yopenalex-snapshot
An efficient one-side height minimization algorithm for routing around a rectangle
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90188-fopenalex-snapshot
Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs
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/0022-0000(90)90018-gopenalex-snapshot
Hidden surface removal for rectangles
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90040-4openalex-snapshot
Surpassing the information theoretic bound with fusion trees
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90104-xopenalex-snapshot
An O(mlog logD) algorithm for shortest paths
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90042-7openalex-snapshot
Efficient algorithms for a family of matroid intersection problems
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(83)90023-3openalex-snapshot
Upper bounds for sorting integers on random access machines
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90252-bopenalex-snapshot
Fast geometric approximation techniques and geometric embedding problems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90254-dopenalex-snapshot
The complexity of coloring games on perfect graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00137-9openalex-snapshot
How the character comparison order shapes the shift function of on-line pattern matching algorithms
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90062-9openalex-snapshot
Towards optimal parallel bucket sorting
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90038-2openalex-snapshot
Parallel processing can be harmful: The unusual behavior of interpolation search
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90034-dopenalex-snapshot
A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90025-nopenalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferred← citeshttps://doi.org/10.1016/j.amc.2006.06.128openalex-snapshot
Finding shortest path in the presence of barriers: An alternate approach
inferred← citeshttps://doi.org/10.1016/j.bioeng.2007.02.007openalex-snapshot
Peak alignment using restricted edit distances
inferred← citeshttps://doi.org/10.1016/j.cageo.2006.10.003openalex-snapshot
Efficient algorithms for finding sills in digital topographic maps
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.10.004openalex-snapshot
Adaptive sampling for geometric problems over data streams
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.09.001openalex-snapshot
Orthogonal range searching in linear and almost-linear space
inferred← citeshttps://doi.org/10.1016/j.dam.2010.02.011openalex-snapshot
A General Label Search to investigate classical graph search algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2015.02.014openalex-snapshot
Computing maximum non-crossing matching in convex bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2007.03.002openalex-snapshot
Rotation and lighting invariant template matching
inferred← citeshttps://doi.org/10.1016/j.ic.2010.04.003openalex-snapshot
Fast computation of a longest increasing subsequence and application
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104465openalex-snapshot
Dynamic Interpolation Search revisited
inferred← citeshttps://doi.org/10.1016/j.ins.2022.01.066openalex-snapshot
Efficient time-interval augmented spatial keyword queries on road networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.04.018openalex-snapshot
Speeding up transposition-invariant string matching
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.02.019openalex-snapshot
An algorithm for solving the longest increasing circular subsequence problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.03.003openalex-snapshot
A note on predecessor searching in the pointer machine model
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.03.013openalex-snapshot
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
inferred← citeshttps://doi.org/10.1016/j.is.2026.102811openalex-snapshot
Z-mOPE: a unified model for secure multi-dimensional indexing and query processing via order-preserving encoding
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.09.001openalex-snapshot
Deterministic sorting in O(nloglogn) time and linear space
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.014openalex-snapshot
A locality-preserving cache-oblivious dynamic dictionary
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.008openalex-snapshot
Transposition invariant string matching
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.04.003openalex-snapshot
Integer priority queues with decrease key in constant time and the single source shortest paths problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.016openalex-snapshot
Lower bounds for predecessor searching in the cell probe model
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.01.002openalex-snapshot
Fingerprints in compressed strings
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.05.013openalex-snapshot
Efficient testing and matching of deterministic regular expressions
inferred← citeshttps://doi.org/10.1016/j.jda.2005.01.006openalex-snapshot
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
inferred← citeshttps://doi.org/10.1016/j.jda.2011.03.013openalex-snapshot
Faster algorithms for computing longest common increasing subsequences
inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.011openalex-snapshot
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
inferred← citeshttps://doi.org/10.1016/j.jda.2013.05.002openalex-snapshot
Cross-document pattern matching
inferred← citeshttps://doi.org/10.1016/j.jda.2017.10.004openalex-snapshot
Searching of gapped repeats and subrepetitions in a word
inferred← citeshttps://doi.org/10.1016/j.jnca.2010.03.021openalex-snapshot
A vEB-tree-based architecture for interactive video on demand services in peer-to-peer networks
showing the first 200 of 465 · page through all 465
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.