On the public citation graph

Self‐adjusting trees in practice for large text collections

0 signed · 49 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/(sici)1097-024x(199607)26:7<781::aid-spe35>3.0.co;2-bopenalex-snapshot

Splaysort: Fast, Versatile, Practical

inferredcites →https://doi.org/10.1002/spe.4380230403openalex-snapshot

An evaluation of self‐adjusting binary search tree techniques

inferredcites →https://doi.org/10.1006/jagm.1995.1026openalex-snapshot

Self-Adjusting k-ary Search Trees

inferredcites →https://doi.org/10.1007/978-3-642-59412-0_15openalex-snapshot

Organization and Maintenance of Large Ordered Indexes

inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot

Organization and maintenance of large ordered indexes

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.1007/bfb0029563openalex-snapshot

Self-organizing data structures

inferredcites →https://doi.org/10.1016/0020-0190(91)90235-aopenalex-snapshot

Self-adjusting multi-way search trees

inferredcites →https://doi.org/10.1016/0306-4573(94)00047-7openalex-snapshot

Overview of the Second Text Retrieval Conference (TREC-2)

inferredcites →https://doi.org/10.1016/s0020-0190(01)00239-3openalex-snapshot

In-memory hash tables for accumulating text vocabularies

inferredcites →https://doi.org/10.1016/s0020-7373(05)80033-1openalex-snapshot

Source models for natural language text

inferredcites →https://doi.org/10.1109/69.979973openalex-snapshot

Indexing and retrieval for genomic databases

inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot

A dichromatic framework for balanced trees

inferredcites →https://doi.org/10.1142/9789812819536_0023openalex-snapshot

Performance in Practice of String Hashing Functions

inferredcites →https://doi.org/10.1145/274787.274812openalex-snapshot

Randomized binary search trees

inferredcites →https://doi.org/10.1145/290941.291014openalex-snapshot

How reliable are the results of large-scale information retrieval experiments?

inferredcites →https://doi.org/10.1145/322248.322254openalex-snapshot

Expected Length of the Longest Probe Sequence in Hash Code Searching

inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot

Self-adjusting binary search trees

inferredcites →https://doi.org/10.1145/63030.63036openalex-snapshot

Application of splay trees to data compression

inferredcites →https://doi.org/10.1145/78973.78977openalex-snapshot

Skip lists: a probabilistic alternative to balanced trees

inferredcites →https://doi.org/10.5555/313651.313812openalex-snapshot

Splay trees for data compression

What points at this work

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

inferred← citeshttps://doi.org/10.1002/dac.943openalex-snapshot

An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees

inferred← citeshttps://doi.org/10.1002/spe.2515openalex-snapshot

Developing IntegrityCatalog, a software system for managing integrity‐related metadata in digital repositories

inferred← citeshttps://doi.org/10.1002/spe.813openalex-snapshot

When to use splay trees

inferred← citeshttps://doi.org/10.1002/spe.886openalex-snapshot

Rehabilitation of an unloved child: semi‐splaying

inferred← citeshttps://doi.org/10.1007/11569596_79openalex-snapshot

Efficient Adaptive Data Compression Using Fano Binary Search Trees

inferred← citeshttps://doi.org/10.1007/11575832_11openalex-snapshot

Cache-Conscious Collision Resolution in String Hash Tables

inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_1openalex-snapshot

Reducing Splaying by Taking Advantage of Working Sets

inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_17openalex-snapshot

Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage

inferred← citeshttps://doi.org/10.1007/s00778-008-0094-1openalex-snapshot

B-tries for disk-based string management

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.1007/s00799-003-0050-zopenalex-snapshot

Searchable words on the Web

inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.014openalex-snapshot

A priority queue with the time-finger property

inferred← citeshttps://doi.org/10.1093/comjnl/bxh073openalex-snapshot

Self-Adjusting of Ternary Search Tries Using Conditional Rotations and Randomized Heuristics

inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536248openalex-snapshot

Self-optimizing distributed trees

inferred← citeshttps://doi.org/10.1109/pci.2011.19openalex-snapshot

Splaying for Compression: An Experimental Study

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.1145/2838931.2838942openalex-snapshot

Collision Resolution in Hash Tables for Vocabulary Accumulation During Parallel Indexing

inferred← citeshttps://doi.org/10.1145/2964797.2964812openalex-snapshot

Improved Indexing & Searching Throughput

inferred← citeshttps://doi.org/10.1145/3014812.3014836openalex-snapshot

Practical adaptive search trees with performance bounds

inferred← citeshttps://doi.org/10.1145/506309.506312openalex-snapshot

Burst tries

inferred← citeshttps://doi.org/10.1145/563857.563812openalex-snapshot

Performance of Data Structures for Small Sets of Strings

inferred← citeshttps://doi.org/10.1504/ijhpcn.2017.083203openalex-snapshot

An analysis on the performance of hash table-based dictionary implementations with different data usage models

inferred← citeshttps://doi.org/10.21203/rs.3.rs-3136752/v1openalex-snapshot

Shuffle Tree: A Randomized Self-Adjusting Binary Search Tree

inferred← citeshttps://doi.org/10.22215/etd/2006-06665openalex-snapshot

Tries in data retrieval and syntactic pattern recognition

inferred← citeshttps://doi.org/10.22215/etd/2015-10682openalex-snapshot

Biased Nearest Neighbour Search

inferred← citeshttps://doi.org/10.31274/rtd-180813-17140openalex-snapshot

Suffix trees and suffix arrays in primary and secondary storage

inferred← citeshttps://doi.org/10.48550/arxiv.1305.0699openalex-snapshot

Fast, Incremental Inverted Indexing in Main Memory for Web-Scale Collections

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.