On the public citation graph

LCP Array Construction in External Memory

https://doi.org/10.1145/2851491
0 signed · 55 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45061-0_73openalex-snapshot
Simple Linear Work Suffix Array Construction
inferredcites →https://doi.org/10.1007/3-540-48194-x_17openalex-snapshot
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
inferredcites →https://doi.org/10.1007/978-3-319-19929-0_27openalex-snapshot
Tighter Bounds for the Sum of Irreducible LCP Values
inferredcites →https://doi.org/10.1007/978-3-319-19929-0_28openalex-snapshot
Parallel External Memory Suffix Sorting
inferredcites →https://doi.org/10.1007/978-3-319-23826-5_9openalex-snapshot
Induced Sorting Suffixes in External Memory with Better Design and Less Space
inferredcites →https://doi.org/10.1007/978-3-540-27810-8_32openalex-snapshot
Two Space Saving Tricks for Linear Time LCP Array Computation
inferredcites →https://doi.org/10.1007/978-3-540-92182-0_14openalex-snapshot
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
inferredcites →https://doi.org/10.1007/978-3-642-02441-2_17openalex-snapshot
Permuted Longest-Common-Prefix Array
inferredcites →https://doi.org/10.1007/978-3-642-13509-5_21openalex-snapshot
Sampled Longest Common Prefix Array
inferredcites →https://doi.org/10.1007/978-3-642-22300-6_32openalex-snapshot
Inducing the LCP-Array
inferredcites →https://doi.org/10.1007/978-3-642-33122-0_26openalex-snapshot
Lightweight LCP Construction for Next-Generation Sequencing Datasets
inferredcites →https://doi.org/10.1007/978-3-642-38527-8_14openalex-snapshot
Lightweight Lempel-Ziv Parsing
inferredcites →https://doi.org/10.1007/978-3-642-38905-4_20openalex-snapshot
External Memory Generalized Suffix and LCP Arrays Construction
inferredcites →https://doi.org/10.1007/978-3-642-45030-3_46openalex-snapshot
RAM-Efficient External Memory Sorting
inferredcites →https://doi.org/10.1007/s00453-011-9535-0openalex-snapshot
Lightweight Data Indexing and Compression in External Memory
inferredcites →https://doi.org/10.1007/s11786-016-0281-1openalex-snapshot
Engineering a Lightweight External Memory Suffix Array Construction Algorithm
inferredcites →https://doi.org/10.1016/j.jda.2012.07.007openalex-snapshot
Computing the longest common prefix array based on the Burrows–Wheeler transform
inferredcites →https://doi.org/10.1016/s1570-8667(03)00065-0openalex-snapshot
Replacing suffix trees with enhanced suffix arrays
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/dcc.2014.78openalex-snapshot
Lempel-Ziv Parsing in External Memory
inferredcites →https://doi.org/10.1109/sc.2014.37openalex-snapshot
Fast Parallel Computation of Longest Common Prefixes
inferredcites →https://doi.org/10.1109/tc.2010.188openalex-snapshot
Two Efficient Algorithms for Linear Time Suffix Array Construction
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/1.9781611972917.3openalex-snapshot
Fast and Lightweight LCP-Array Construction Algorithms
inferredcites →https://doi.org/10.1137/1.9781611972931.8openalex-snapshot
Inducing Suffix and LCP Arrays in External Memory
inferredcites →https://doi.org/10.1145/1216370.1216371openalex-snapshot
A survey on peer-to-peer key management for mobile ad hoc networks
inferredcites →https://doi.org/10.1145/1216370.1216372openalex-snapshot
Compressed full-text indexes
inferredcites →https://doi.org/10.1145/1217856.1217858openalex-snapshot
Linear work suffix array construction
inferredcites →https://doi.org/10.1145/1227161.1402296openalex-snapshot
Better external memory suffix array construction
inferredcites →https://doi.org/10.1145/1242471.1242472openalex-snapshot
A taxonomy of suffix array construction algorithms
inferredcites →https://doi.org/10.1145/1327452.1327492openalex-snapshot
MapReduce
inferredcites →https://doi.org/10.1145/2442516.2442536openalex-snapshot
Parallel suffix array and least common prefix for the GPU
inferredcites →https://doi.org/10.1145/2517327.2442536openalex-snapshot
Parallel suffix array and least common prefix for the GPU
inferredcites →https://doi.org/10.1145/2518175openalex-snapshot
Suffix Array Construction in External Memory Using D-Critical Substrings
inferredcites →https://doi.org/10.1145/2699665openalex-snapshot
Induced Sorting Suffixes in External Memory
inferredcites →https://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferredcites →https://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferredcites →https://doi.org/10.5555/1361730.1361733openalex-snapshot
STXXL: standard template library for XXL data sets
inferredcites →https://doi.org/10.5555/2370956.2370966openalex-snapshot
Compact Suffix Array A Space-Efficient Full-Text Index

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6openalex-snapshot
Algorithms for Big Data
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_14openalex-snapshot
Scalable Text Index Construction
inferred← citeshttps://doi.org/10.1007/978-3-319-46049-9_20openalex-snapshot
LCP Array Construction Using O(sort(n)) (or Less) I/Os
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_15openalex-snapshot
Lightweight BWT and LCP Merging via the Gap Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_45openalex-snapshot
Longest Common Prefixes with k-Mismatches and Applications
inferred← citeshttps://doi.org/10.1016/j.jda.2016.03.003openalex-snapshot
Lightweight LCP construction for very large collections of strings
inferred← citeshttps://doi.org/10.1016/j.jda.2016.11.003openalex-snapshot
Burrows–Wheeler transform and LCP array construction in constant space
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.009openalex-snapshot
Tighter bounds for the sum of irreducible LCP values
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.11.001openalex-snapshot
Lightweight merging of compressed indices based on BWT variants
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00031openalex-snapshot
Computing Lexicographic Parsings
inferred← citeshttps://doi.org/10.1145/3297723openalex-snapshot
Better External Memory LCP Array Construction
inferred← citeshttps://doi.org/10.1186/s13015-017-0117-9openalex-snapshot
Generalized enhanced suffix array construction in external memory
inferred← citeshttps://doi.org/10.14778/3598581.3598586openalex-snapshot
Text Indexing for Long Patterns: Anchors are All you Need
inferred← citeshttps://doi.org/10.47749/t/unicamp.2017.987504openalex-snapshot
Engineering augmented suffix sorting algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1609.04618openalex-snapshot
From H&M to Gap for Lightweight BWT Merging
inferred← citeshttps://doi.org/10.70675/8a9c38e9zc387z49fcz9371z57c005ba3d3dopenalex-snapshot
La restructuration des documents graphiques destructurés
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.