On the public citation graph

Search Data Structures for Skewed Strings

https://doi.org/10.1007/3-540-44867-5_7
0 signed · 38 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.1002/9781118032770openalex-snapshot
Average Case Analysis of Algorithms on Sequences
inferredcites →https://doi.org/10.1002/j.1538-7305.1983.tb03469.xopenalex-snapshot
Two New Kinds of Biased Search Trees
inferredcites →https://doi.org/10.1006/jcss.1996.0025openalex-snapshot
Onk-Dimensional Balanced Binary Trees
inferredcites →https://doi.org/10.1007/3-540-08342-1_25openalex-snapshot
Dynamic Binary Search
inferredcites →https://doi.org/10.1007/3-540-48518-x_18openalex-snapshot
Adaptive Algorithms for Cache-efficient Trie Search
inferredcites →https://doi.org/10.1007/3-540-48523-6_34openalex-snapshot
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-642-67838-7_35openalex-snapshot
Multidimensional B-tree: An efficient dynamic file structure for exact match queries
inferredcites →https://doi.org/10.1007/978-3-642-69900-9openalex-snapshot
Data Structures and Algorithms 3
inferredcites →https://doi.org/10.1007/bf00288968openalex-snapshot
A new data structure for representing sorted lists
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1007/bf01940876openalex-snapshot
Randomized search trees
inferredcites →https://doi.org/10.1016/s0169-023x(01)00038-6openalex-snapshot
Web log data warehousing and mining for intelligent web caching
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1109/12.30849openalex-snapshot
Multidimensional balanced binary trees
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/tc.1984.1676438openalex-snapshot
Multidimensional Height-Balanced Trees
inferredcites →https://doi.org/10.1137/0202005openalex-snapshot
Binary Search Trees of Bounded Balance
inferredcites →https://doi.org/10.1137/0214041openalex-snapshot
Biased Search Trees
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/321479.321481openalex-snapshot
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
inferredcites →https://doi.org/10.1145/363958.363987openalex-snapshot
Randomized binary searching with tree structures
inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot
Self-adjusting binary search trees
inferredcites →https://doi.org/10.1145/78973.78977openalex-snapshot
Skip lists: a probabilistic alternative to balanced trees
inferredcites →https://doi.org/10.2307/2670026openalex-snapshot
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
inferredcites →https://doi.org/10.5555/314161.314321openalex-snapshot
Fast algorithms for sorting and searching strings
inferredcites →https://doi.org/10.5555/314613.314840openalex-snapshot
The analysis of hybrid trie structures

What points at this work

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

inferred← citeshttps://doi.org/10.3217/jucs-024-04-0488openalex-extracted
Parallel Fast Sort Algorithm for Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_422openalex-snapshot
Text Indexing
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_52openalex-snapshot
A General Technique for Managing Strings in Comparison-Driven Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-38610-7_56openalex-snapshot
Modified Merge Sort Algorithm for Large Scale Data Sets
inferred← citeshttps://doi.org/10.1007/s00778-010-0183-9openalex-snapshot
Engineering scalable, cache and space efficient tries for strings
inferred← citeshttps://doi.org/10.1109/apcase.2015.24openalex-snapshot
Benchmark Tests on Improved Merge for Big Data Processing
inferred← citeshttps://doi.org/10.1109/iwmse.2009.5071381openalex-snapshot
Combining digital access and parallel partition for quicksort and quickselect
inferred← citeshttps://doi.org/10.1137/110836377openalex-snapshot
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing
inferred← citeshttps://doi.org/10.1145/1671970.1921704openalex-snapshot
Redesigning the string hash table, burst trie, and BST to exploit cache
inferred← citeshttps://doi.org/10.1155/2018/8679579openalex-snapshot
Fully Flexible Parallel Merge Sort for Multicore Architectures
inferred← citeshttps://doi.org/10.3390/sym9090176openalex-snapshot
Parallelization of Modified Merge Sort Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0406openalex-snapshot
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing
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.