Who Cited It

Information Retrieval: Data Structures and Algorithms

1992 · 2,431 citations · 6 from inside this corpus

William B. Frakes low, Ricardo Baeza‐Yates

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

Information Retrieval: Data Structures and Algorithms (1992)Information Retrieval: Data S…Compilers: Principles, Techniques, and Tools (1986)Compilers: Principles, Techni…An algorithm for suffix stripping (1980)An algorithm for suffix strip…A STATISTICAL INTERPRETATION OF TERM SPECIFICITY AND ITS APPLICATION IN RETRIEVAL (1972)A STATISTICAL INTERPRETATION …The Art of Computer Programming: Volume 3: Sorting and Searching (1973)The Art of Computer Programmi…Efficient string matching (1975)Efficient string matchingFast Pattern Matching in Strings (1977)Fast Pattern Matching in Stri…Universal classes of hash functions (1979)Universal classes of hash fun…A fast string searching algorithm (1977)A fast string searching algor…Suffix Arrays: A New Method for On-Line String Searches (1993)Suffix Arrays: A New Method f…Linear pattern matching algorithms (1973)Linear pattern matching algor…Sorting and Searching (1973)Sorting and SearchingA Space-Economical Suffix Tree Construction Algorithm (1976)A Space-Economical Suffix Tre…Data clustering (1999)Data clusteringApproximate nearest neighbors (1998)Approximate nearest neighborsAn Information-Theoretic Definition of Similarity (1998)An Information-Theoretic Defi…Naive (Bayes) at forty: The independence assumption in information retrieval (1998)Naive (Bayes) at forty: The i…Suffix Arrays: A New Method for On-Line String Searches (1993)Suffix Arrays: A New Method f…Automatic retrieval and clustering of similar words (1998)Automatic retrieval and clust…
18 of 18 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.
this paper works it cites works citing it node size = global citations · hover for the full title

Citation edge evidence

Each row is directed from the citing work to the cited work. Source status remains readable without the interactive graph.

What this paper cites, inside the corpus

PaperYearCited
Compilers: Principles, Techniques, and Tools19868,175
An algorithm for suffix stripping19808,157
A STATISTICAL INTERPRETATION OF TERM SPECIFICITY AND ITS APPLICATION IN RETRIEVAL19724,514
The Art of Computer Programming: Volume 3: Sorting and Searching19733,978
Efficient string matching19752,965
Fast Pattern Matching in Strings19772,961
Universal classes of hash functions19792,577
A fast string searching algorithm19772,299
Suffix Arrays: A New Method for On-Line String Searches19931,966
Linear pattern matching algorithms19731,829
Sorting and Searching19731,537
A Space-Economical Suffix Tree Construction Algorithm19761,521

What cites it, inside the corpus

PaperYearCited
Data clustering199913,263
Approximate nearest neighbors19984,240
An Information-Theoretic Definition of Similarity19983,673
Naive (Bayes) at forty: The independence assumption in information retrieval19982,114
Suffix Arrays: A New Method for On-Line String Searches19931,966
Automatic retrieval and clustering of similar words19981,563

Links

Download BibTeX · Download RIS · OpenAlex record

Topics

Algorithms and Data CompressionComputer Science
Advanced Database Systems and QueriesComputer Science
Data Management and AlgorithmsComputer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

  • supports2 author record(s) attached.
  • supports223 reference(s) recorded.
  • neutralThe DOI carries no year to check against.
  • supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:49+00:00.

sha256 a2172c1bbe00c44b…