Sublinear-time Compression
Sublinear-Time Compression is a data compression framework that belongs to the class of universal coding methods, distinguished by its ability to achieve compression in time sublinear relative to the input size through adaptive sampling and probabilistic modeling.
5
Publications
297
Citations
9
Authors
11
Institutions
Publications per year
2017–2026
0
Parents
5
On Ultrametricity, Data Coding, and Computation
Fionn Murtagh · Journal of Classification · 2004 · 115 citations
Linear-time, incremental hierarchy inference for compression
Craig G. Nevill-Manning, Ian H. Witten · 2002 · 107 citations
Gary Davies · European Journal of Marketing · 1994 · 40 citations
RadixZip: linear time compression of token streams
Binh Vo, Gurmeet Singh Manku · Very Large Data Bases · 2007 · 12 citations
1–5 of 5
9
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 9
11
National University of Singapore
Singapore, Singapore
1 h-index
1 publications
23 citations

Kyoto University
Kyoto, Japan
1 h-index
1 publications
23 citations
Google (United States)
Mountain View, United States
1 h-index
2 publications
24 citations

University of Manchester
Manchester, United Kingdom
1 h-index
1 publications
40 citations

National Institute of Informatics
Tokyo, Japan
1 h-index
1 publications
23 citations
Kyoto University Institute for Chemical Research
Kyoto, Japan
1 h-index
1 publications
23 citations

University of Waikato
Hamilton, New Zealand
1 h-index
1 publications
107 citations
Genome Institute of Singapore
Singapore, Singapore
1 h-index
1 publications
23 citations
1–8 of 11
EJM · 1 publications · 40 citations
1
h-index
1 publications · 23 citations
1
h-index
Conference · 1 publications · 12 citations
1
h-index
1 publications · 115 citations
1
h-index
1–4