On the public citation graph

Indexing Compressed Text

https://doi.org/10.1007/springerreference_64079

0 signed · 52 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/spe.426openalex-snapshot

Second step algorithms in the Burrows–Wheeler compression algorithm

inferredcites →https://doi.org/10.1006/jcss.1996.0023openalex-snapshot

Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files

inferredcites →https://doi.org/10.1007/3-540-40996-3_35openalex-snapshot

Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array

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

Compression of character strings by an adaptive dictionary

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

String Matching in Lempel—Ziv Compressed Strings

inferredcites →https://doi.org/10.1016/j.entcs.2003.12.002openalex-snapshot

Succinct Data Structures

inferredcites →https://doi.org/10.1093/comjnl/40.2_and_3.76openalex-snapshot

Semantically Motivated Improvements for PPM Variants

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

Switching between two universal source coding algorithms

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

Modifications of the Burrows and Wheeler data compression algorithm

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

On the performance of BWT sorting algorithms

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

A Method for the Construction of Minimum-Redundancy Codes

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

A Technique for High-Performance Data Compression

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

Space-efficient static trees and graphs

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

Opportunistic data structures with applications

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

Linear pattern matching algorithms

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

Better OPM/L Text Compression

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

A universal algorithm for sequential data compression

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

Compression of individual sequences via variable-rate coding

inferredcites →https://doi.org/10.1137/0222058openalex-snapshot

Suffix Arrays: A New Method for On-Line String Searches

inferredcites →https://doi.org/10.1137/s0097539702402354openalex-snapshot

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot

Succinct Representation of Balanced Parentheses and Static Trees

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

Arithmetic coding for data compression

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

Fast searching on compressed text allowing errors

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

Inverted files versus signature files for text indexing

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

PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

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

A Space-Economical Suffix Tree Construction Algorithm

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

Linear Algorithm for Data Compression via String Matching

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

Fast and flexible word searching on compressed text

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

An analysis of the Burrows—Wheeler transform

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

Access methods for text

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

A locally adaptive data compression scheme

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

Data compression with finite windows

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

Storing text retrieval systems on CD-ROM: compression and encryption considerations

inferredcites →https://doi.org/10.26021/2003openalex-snapshot

A unifying theory and improvements for existing approaches to text compression

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

Efficient suffix trees on secondary storage

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

An experimental study of an opportunistic index

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

LZW 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/spe.678openalex-snapshot

Revisiting dictionary-based compression

inferred← citeshttps://doi.org/10.1007/11880561_15openalex-snapshot

Mapping Words into Codewords on PPM

inferred← citeshttps://doi.org/10.1007/978-0-387-74935-8_43openalex-snapshot

Transforming the Natural Language Text for Improving Compression Performance

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

Edge-Guided Natural Language Text Compression

inferred← citeshttps://doi.org/10.1016/j.ins.2011.07.039openalex-snapshot

Natural Language Compression on Edge-Guided text preprocessing

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

String matching with alphabet sampling

inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00087-7openalex-snapshot

New text indexing functionalities of the compressed suffix arrays

inferred← citeshttps://doi.org/10.1021/ci700353mopenalex-snapshot

Discovery of Power-Laws in Chemical Space

inferred← citeshttps://doi.org/10.1109/cadsm.2007.4297567openalex-snapshot

Fast Transform for Effective XML Compression

inferred← citeshttps://doi.org/10.1109/icpads.2005.45openalex-snapshot

A Search Scheme Resulting in Mixing Compressed Text Files

inferred← citeshttps://doi.org/10.1137/s0097539702402354openalex-snapshot

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

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

Fast string sorting using order-preserving compression

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

A web search engine model based on index-query bit-level compression

inferred← citeshttps://doi.org/10.4018/jitwe.2011070103openalex-snapshot

Development of a Novel Compressed Index-Query Web Search Engine Model

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

String algorithms and data structures

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.