On the public citation graph
Recursive Star-Tree Parallel Data Structure
0 signed · 204 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.1006/jagm.1993.1018openalex-snapshot
Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
inferredcites →https://doi.org/10.1007/bf01762122openalex-snapshot
Parallel construction of a suffix tree with applications
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bfb0035771openalex-snapshot
Finding triconnected components by local replacements
inferredcites →https://doi.org/10.1007/bfb0040376openalex-snapshot
Deterministic parallel list ranking
inferredcites →https://doi.org/10.1016/0020-0190(85)90025-0openalex-snapshot
On efficient parallel strong orientation
inferredcites →https://doi.org/10.1016/0022-0000(85)90008-xopenalex-snapshot
Routing, merging, and sorting on parallel models of computation
inferredcites →https://doi.org/10.1016/0166-218x(90)90084-popenalex-snapshot
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0196-6774(89)90010-2openalex-snapshot
Fast parallel and serial approximate string matching
inferredcites →https://doi.org/10.1016/0196-6774(90)90011-3openalex-snapshot
Fast algorithms for the unit cost editing distance between trees
inferredcites →https://doi.org/10.1016/0304-3975(86)90153-2openalex-snapshot
Parallel ear decomposition search (EDS) and st-numbering in graphs
inferredcites →https://doi.org/10.1016/0890-5401(89)90003-5openalex-snapshot
Parallel approximation algorithms for bin packing
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1016/s0019-9958(86)80023-7openalex-snapshot
Deterministic coin tossing with applications to optimal parallel list ranking
inferredcites →https://doi.org/10.1109/12.16507openalex-snapshot
PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms
inferredcites →https://doi.org/10.1109/tc.1983.1676138openalex-snapshot
Searching, Merging, and Sorting in Parallel Computation
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0213027openalex-snapshot
Simulation of Parallel Random Access Machines by Circuits
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/0217037openalex-snapshot
Relations between Concurrent-Write Models of Parallel Computation
inferredcites →https://doi.org/10.1137/0217079openalex-snapshot
On Finding Lowest Common Ancestors: Simplification and Parallelization
inferredcites →https://doi.org/10.1137/0220002openalex-snapshot
Deterministic Sampling–A New Technique for Fast Pattern Matching
inferredcites →https://doi.org/10.1145/2166.357211openalex-snapshot
Parallel Generation of Postfix and Tree Forms
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/3318.3478openalex-snapshot
Optimal parallel generation of a computation tree form
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.20012openalex-snapshot
An improved algorithm for the distance constrained p‐center location problem with mutual communication on tree networks
inferred← citeshttps://doi.org/10.1002/qua.24898openalex-snapshot
Tensor product methods and entanglement optimization forab initioquantum chemistry
inferred← citeshttps://doi.org/10.1002/rsa.20130openalex-snapshot
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
inferred← citeshttps://doi.org/10.1006/inco.1997.2642openalex-snapshot
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures
inferred← citeshttps://doi.org/10.1006/inco.1997.2654openalex-snapshot
The Complexity of Parallel Prefix Problems on Small Domains
inferred← citeshttps://doi.org/10.1006/inco.1999.2814openalex-snapshot
Parallel Preprocessing for Path Queries without Concurrent Reading
inferred← citeshttps://doi.org/10.1006/jagm.1996.0829openalex-snapshot
Parallel Shortcutting of Rooted Trees
inferred← citeshttps://doi.org/10.1006/jagm.2000.1093openalex-snapshot
Augmenting Undirected Edge Connectivity in Õ(n2) Time
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1127openalex-snapshot
Fast and Efficient Simulations among CRCW PRAMs
inferred← citeshttps://doi.org/10.1007/11780441_5openalex-snapshot
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
inferred← citeshttps://doi.org/10.1007/11871637_17openalex-snapshot
Optimal String Mining Under Frequency Constraints
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_14openalex-snapshot
Linear-Time Construction of Suffix Arrays
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_8openalex-snapshot
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_43openalex-snapshot
In-Place Planar Convex Hull Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_44openalex-snapshot
The Level Ancestor Problem Simplified
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_277openalex-snapshot
Parallel algorithms for single-layer channel routing
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_3openalex-snapshot
On a parallel-algorithms method for string matching problems (overview)
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_49openalex-snapshot
Prefix graphs and their applications
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_133openalex-snapshot
Shared memory simulations with triple-logarithmic delay
inferred← citeshttps://doi.org/10.1007/978-1-4757-3609-0_6openalex-snapshot
Parallel Graph Algorithms for Coarse-Grained Multicomputers
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_18openalex-snapshot
Range Shortest Unique Substring Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_12openalex-snapshot
The Fast Algorithm for Online k-server Problem on Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-84543-7_2openalex-snapshot
Sorted Range Selection and Range Minima Queries
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_2openalex-snapshot
Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_11openalex-snapshot
The Range 1 Query (R1Q) Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_5openalex-snapshot
Longest Common Extensions in Partial Words
inferred← citeshttps://doi.org/10.1007/978-3-319-78455-7_21openalex-snapshot
Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_28openalex-snapshot
How to Answer a Small Batch of RMQs or LCA Queries in Practice
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_4openalex-snapshot
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-71618-1_61openalex-snapshot
A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_10openalex-snapshot
Labeling Schemes with Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_41openalex-snapshot
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_29openalex-snapshot
On Cartesian Trees and Range Minimum Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_30openalex-snapshot
Practical Algorithms for the Longest Common Extension Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_16openalex-snapshot
Optimal Succinctness for Range Minimum Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_25openalex-snapshot
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_30openalex-snapshot
One-Variable Word Equations in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_5openalex-snapshot
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_47openalex-snapshot
Encodings for Range Selection and Top-k Queries
inferred← citeshttps://doi.org/10.1007/978-981-97-2340-9_25openalex-snapshot
Time Efficient Implementation for Online K-Server Problem on Trees
inferred← citeshttps://doi.org/10.1007/bf01185433openalex-snapshot
Pattern matching in a digitized image
inferred← citeshttps://doi.org/10.1007/bf03036466openalex-snapshot
Parallel integer sorting and simulation amongst CRCW models
inferred← citeshttps://doi.org/10.1007/bfb0036183openalex-snapshot
Efficient parallel computing with memory faults
inferred← citeshttps://doi.org/10.1007/bfb0049432openalex-snapshot
Work-time optimal parallel prefix matching
inferred← citeshttps://doi.org/10.1007/bfb0097993openalex-snapshot
A range minima parallel algorithm for coarse grained multicomputers
inferred← citeshttps://doi.org/10.1007/pl00008269openalex-snapshot
Modeling Parallel Bandwidth: Local versus Global Restrictions
inferred← citeshttps://doi.org/10.1007/s00224-004-1155-5openalex-snapshot
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
inferred← citeshttps://doi.org/10.1007/s00224-005-1281-8openalex-snapshot
Compact Labeling Scheme for XML Ancestor Queries
inferred← citeshttps://doi.org/10.1007/s00453-009-9369-1openalex-snapshot
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem
inferred← citeshttps://doi.org/10.1007/s00453-012-9683-xopenalex-snapshot
On Cartesian Trees and Range Minimum Queries
inferred← citeshttps://doi.org/10.1007/s00453-014-9931-3openalex-snapshot
One-Variable Word Equations in Linear Time
inferred← citeshttps://doi.org/10.1007/s00453-015-0017-7openalex-snapshot
Inference Algorithms for Pattern-Based CRFs on Sequence Data
inferred← citeshttps://doi.org/10.1007/s00453-015-9987-8openalex-snapshot
Optimal Encodings for Range Majority Queries
inferred← citeshttps://doi.org/10.1007/s00453-021-00856-1openalex-snapshot
Encoding Two-Dimensional Range Top-k Queries
inferred← citeshttps://doi.org/10.1007/s10601-012-9124-0openalex-snapshot
LS(Graph): a constraint-based local search for constraint optimization on trees and paths
inferred← citeshttps://doi.org/10.1007/s11590-024-02113-0openalex-snapshot
On efficient algorithms for bottleneck path problems with many sources
inferred← citeshttps://doi.org/10.1007/s11750-007-0037-9openalex-snapshot
Improved algorithms for the multicut and multiflow problems in rooted trees
inferred← citeshttps://doi.org/10.1007/s11786-009-0007-8openalex-snapshot
Finding Range Minima in the Middle: Approximations and Applications
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(94)00058-1openalex-snapshot
New algorithms for the LCA problem and the binary tree reconstruction problem
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90060-4openalex-snapshot
Testing string superprimitivity in parallel
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0137-nopenalex-snapshot
Almost fully-parallel parentheses matching
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00047-3openalex-snapshot
A work-time optimal algorithm for computing all string covers
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.002openalex-snapshot
Entropy-bounded representation of point grids
inferred← citeshttps://doi.org/10.1016/j.dam.2004.10.004openalex-snapshot
Parallel algorithms for separable permutations
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.007openalex-snapshot
Computing longest common extensions in partial words
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.05.018openalex-snapshot
Computing optimal shortcuts for networks
inferred← citeshttps://doi.org/10.1016/j.ins.2006.11.012openalex-snapshot
All maximal-pairs in step–leap representation of melodic sequence
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.008openalex-snapshot
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.10.007openalex-snapshot
Range mode and range median queries in constant time and sub-quadratic space
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.02.014openalex-snapshot
New common ancestor problems in trees and directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.jalgor.2005.08.001openalex-snapshot
Lowest common ancestors in trees and directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103756openalex-snapshot
Quantum data structure for range minimum query
inferred← citeshttps://doi.org/10.1016/j.jda.2004.08.019openalex-snapshot
Constructing suffix arrays in linear time
inferred← citeshttps://doi.org/10.1016/j.jda.2010.08.004openalex-snapshot
The longest common extension problem revisited and applications to approximate string searching
inferred← citeshttps://doi.org/10.1016/j.jda.2014.10.004openalex-snapshot
Extending common intervals searching from permutations to sequences
inferred← citeshttps://doi.org/10.1016/j.jda.2016.09.002openalex-snapshot
Improved Range Minimum Queries
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.109284openalex-snapshot
An efficient algorithm for isometrically embedding weighted trees into low-dimensional ℓ∞ -normed spaces
inferred← citeshttps://doi.org/10.1016/j.scico.2012.11.008openalex-snapshot
Viewing functions as token sequences to highlight similarities in source code
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.012openalex-snapshot
Faster entropy-bounded compressed suffix trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.015openalex-snapshot
Improved algorithms for the range next value problem and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.010openalex-snapshot
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.09.030openalex-snapshot
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.004openalex-snapshot
MinMax -profiles: A unifying view of common intervals, nested common intervals and conserved intervals of K permutations
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.040openalex-snapshot
The range 1 query (R1Q) problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.002openalex-snapshot
Efficient dynamic range minimum query
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.021openalex-snapshot
The nearest colored node in a tree
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.019openalex-snapshot
A simple linear-space data structure for constant-time range minimum query
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.025openalex-snapshot
Range minimum queries in minimal space
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.029openalex-snapshot
Internal shortest absent word queries in constant time and linear space
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00275-7openalex-snapshot
Online timestamped text indexing
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80002-9openalex-snapshot
Finding level-ancestors in trees
inferred← citeshttps://doi.org/10.1017/s0960129515000110openalex-snapshot
The longest common substring problem
inferred← citeshttps://doi.org/10.1021/ct501187jopenalex-snapshot
Tree Tensor Network State with Variable Tensor Order: An Efficient Multireference Method for Strongly Correlated Systems
inferred← citeshttps://doi.org/10.1080/10637199608915553openalex-snapshot
FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH
inferred← citeshttps://doi.org/10.1089/cmb.2014.0093openalex-snapshot
Maximal Acyclic Agreement Forests
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaa070openalex-snapshot
Genesis and Gappa: processing, analyzing and visualizing phylogenetic (placement) data
inferred← citeshttps://doi.org/10.1093/nar/gks408openalex-snapshot
Prospects and limitations of full-text index structures in genome analysis
inferred← citeshttps://doi.org/10.1101/647958openalex-snapshot
Genesis and Gappa: Processing, Analyzing and Visualizing Phylogenetic (Placement) Data
inferred← citeshttps://doi.org/10.1109/cvpr.2012.6247854openalex-snapshot
An efficient branch-and-bound algorithm for optimal human pose estimation
inferred← citeshttps://doi.org/10.1109/dcc.2008.45openalex-snapshot
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
inferred← citeshttps://doi.org/10.1109/icde.2012.71openalex-snapshot
Branch Code: A Labeling Scheme for Efficient Query Answering on Trees
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470440openalex-snapshot
Parallel external memory graph algorithms
inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00018openalex-snapshot
GPU Algorithms for Biconnected Components on Large Graphs
inferred← citeshttps://doi.org/10.1109/ipps.1994.288278openalex-snapshot
Sorting strings and constructing digital search trees in parallel
inferred← citeshttps://doi.org/10.1109/ipps.1995.395933openalex-snapshot
Fast parallel algorithms for minimum and related problems with small integer inputs
inferred← citeshttps://doi.org/10.1109/istcs.1995.377027openalex-snapshot
On the power of randomization for the common PRAM
inferred← citeshttps://doi.org/10.1109/istcs.1995.377051openalex-snapshot
Improved optimal shared memory simulations, and the power of reconsideration
inferred← citeshttps://doi.org/10.1109/itsc.2004.1399043openalex-snapshot
Least-cost path in public transportation systems with fare rebates that are path- and time-dependent
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267787openalex-snapshot
The complexity of parallel prefix problems on small domains
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492664openalex-snapshot
Faster algorithms for the construction of parameterized suffix trees
inferred← citeshttps://doi.org/10.1109/spdp.1995.530690openalex-snapshot
Fast, efficient mutual and self simulations for shared memory and reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/tc.2021.3122843openalex-snapshot
Deadlock Avoidance Algorithms for Recursion-Tree Modeled Requests in Parallel Executions
inferred← citeshttps://doi.org/10.1137/090779759openalex-snapshot
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
inferred← citeshttps://doi.org/10.1137/1.9781611973402.72openalex-snapshot
Near-optimal labeling schemes for nearest common ancestors
inferred← citeshttps://doi.org/10.1137/130936889openalex-snapshot
Random Access to Grammar-Compressed Strings and Trees
inferred← citeshttps://doi.org/10.1137/s0097539791224030openalex-snapshot
The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539794264810openalex-snapshot
Incremental String Comparison
inferred← citeshttps://doi.org/10.1137/s009753979529564xopenalex-snapshot
Contention Resolution in Hashing Based Shared Memory Simulations
inferred← citeshttps://doi.org/10.1142/s0129054199000277openalex-snapshot
PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS
inferred← citeshttps://doi.org/10.1145/113379.113385openalex-snapshot
Tight bounds for the chaining problem
inferred← citeshttps://doi.org/10.1145/113379.113397openalex-snapshot
In-place techniques for parallel convex hull algorithms (preliminary version)
inferred← citeshttps://doi.org/10.1145/1240233.1240242openalex-snapshot
Dynamic text and static pattern matching
inferred← citeshttps://doi.org/10.1145/1536414.1536431openalex-snapshot
A nearly optimal oracle for avoiding failed vertices and edges
inferred← citeshttps://doi.org/10.1145/1807085.1807125openalex-snapshot
Performance guarantees for B-trees with different-sized atomic keys
inferred← citeshttps://doi.org/10.1145/195058.195164openalex-snapshot
Symmetry breaking for suffix tree construction
inferred← citeshttps://doi.org/10.1145/195058.195202openalex-snapshot
Optimal parallel string algorithms
inferred← citeshttps://doi.org/10.1145/1989323.1989385openalex-snapshot
Nearest keyword search in XML documents
inferred← citeshttps://doi.org/10.1145/215399.215403openalex-snapshot
Provably efficient scheduling for languages with fine-grained parallelism
inferred← citeshttps://doi.org/10.1145/225058.225108openalex-snapshot
Large-scale assembly of DNA strings and space-efficient construction of suffix trees
inferred← citeshttps://doi.org/10.1145/2312005.2312045openalex-snapshot
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
inferred← citeshttps://doi.org/10.1145/237814.237829openalex-snapshot
Minimum cuts in near-linear time
inferred← citeshttps://doi.org/10.1145/2484028.2484088openalex-snapshot
Faster and smaller inverted indices with treaps
inferred← citeshttps://doi.org/10.1145/2594538.2594557openalex-snapshot
Categorical range maxima queries
inferred← citeshttps://doi.org/10.1145/2907945openalex-snapshot
B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys
inferred← citeshttps://doi.org/10.1145/3108240openalex-snapshot
A Data Structure for Nearest Common Ancestors with Linking
inferred← citeshttps://doi.org/10.1145/331605.331608openalex-snapshot
Minimum cuts in near-linear time
inferred← citeshttps://doi.org/10.1145/3350755.3400227openalex-snapshot
Optimal Parallel Algorithms in the Binary-Forking Model
inferred← citeshttps://doi.org/10.1145/3357713.3384260openalex-snapshot
Lower bound for succinct range minimum query
inferred← citeshttps://doi.org/10.1145/3381449openalex-snapshot
JGraphT—A Java Library for Graph Data Structures and Algorithms
inferred← citeshttps://doi.org/10.1145/3694906.3743333openalex-snapshot
Brief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAM
inferred← citeshttps://doi.org/10.11606/t.45.2000.tde-20210729-115206openalex-snapshot
Algoritmos CGM para busca uni e bidimensional de padrões com e sem escala
inferred← citeshttps://doi.org/10.11606/t.45.2013.tde-13022014-083516openalex-snapshot
Algoritmos para junções em digrafos acíclicos e uma aplicação na Antropologia
inferred← citeshttps://doi.org/10.18745/th.16354openalex-snapshot
Adaptive Constraint Solving for Information Flow Analysis
inferred← citeshttps://doi.org/10.2306/scienceasia1513-1874.2019.45.065openalex-snapshot
A new heuristic for full trie minimization
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.785openalex-snapshot
Efficient Indexing for Structured and Unstructured Data
inferred← citeshttps://doi.org/10.31390/gradschool_theses.3060openalex-snapshot
Implementation and analysis of a Top-K retrieval system for strings
inferred← citeshttps://doi.org/10.3390/a13110276openalex-snapshot
Efficient Data Structures for Range Shortest Unique Substring Queries
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.132openalex-snapshot
Distance Labeling Schemes for Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1109.4460openalex-snapshot
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6023openalex-snapshot
Spaces, Trees and Colors: The Algorithmic Landscape of Document Retrieval on Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1310.4290openalex-snapshot
Extending Common Intervals Searching from Permutations to Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1404.2677openalex-snapshot
Optimal Encodings for Range Majority Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1611.07055openalex-snapshot
A Data Structure for Nearest Common Ancestors with Linking
inferred← citeshttps://doi.org/10.48550/arxiv.1705.04589openalex-snapshot
How to answer a small batch of RMQs or LCA queries in practice
inferred← citeshttps://doi.org/10.48550/arxiv.1707.08807openalex-snapshot
Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.1809.07067openalex-snapshot
Encoding two-dimensional range top-k queries
inferred← citeshttps://doi.org/10.48550/arxiv.2006.00605openalex-snapshot
A Fast Algorithm for Online k-servers Problem on Trees
inferred← citeshttps://doi.org/10.48550/arxiv.2111.02318openalex-snapshot
Nearly Tight Lower Bounds for Succinct Range Minimum Query
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9812007openalex-snapshot
Minimum Cuts in Near-Linear Time
inferred← citeshttps://doi.org/10.5282/edoc.7505openalex-snapshot
Data Structures for Efficient String Algorithms
inferred← citeshttps://doi.org/10.5555/313651.313681openalex-snapshot
External-memory graph algorithms
inferred← citeshttps://doi.org/10.5555/314464.314661openalex-snapshot
Optimal randomized parallel algorithms for computing the row maxima of a totally monotone matrix
inferred← citeshttps://doi.org/10.5555/365411.365795openalex-snapshot
Finding least common ancestors in directed acyclic graphs
inferred← citeshttps://doi.org/10.70675/18ce7a23z98c1z4e42z8548zb14f02e6965bopenalex-snapshot
Recherche de similarité dans du code source
inferred← citeshttps://doi.org/10.7301/z0hd7t0fopenalex-snapshot
Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs
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.