Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
large alphabets
Description:
Large alphabets are symbol sets with many possible symbols, studied in information theory, coding, and sequence prediction.
Primary topic:
Algorithms and Data Compression (57%)
Related topics:
Algorithms and Data Compression (57%),
semigroups and automata theory (9%),
Coding theory and cryptography (8%)
OpenAlex ID:
keywords/large-alphabets
Efficient Computation of Frequent and Top-k Elements in Data Streams
2004
·
Ahmed Metwally
, Divyakant Agrawal
, et al.
·
Lecture notes in computer science
·
842
Optimal suffix tree construction with large alphabets
2002
·
M. Farach
·
Annual Symposium on Foundations of Computer Science
·
567
Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding
2013
·
Duda, Jarek
·
arXiv (Cornell University)
·
356
PDF
Space Efficient Linear Time Construction of Suffix Arrays
2003
·
Pang Ko
, Srinivas Aluru
·
Lecture notes in computer science
·
277
Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation
2016
·
Yihong Wu
, Pengkun Yang
·
IEEE Transactions on Information Theory
·
269
PDF
Rank/select operations on large alphabets: a tool for text indexing
2006
·
Alexander Golynski
, J. Ian Munro
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
235
Space efficient linear time construction of suffix arrays
2004
·
Pang Ko
, Srinivas Aluru
·
Journal of Discrete Algorithms
·
219
PDF
Practical Rank/Select Queries over Arbitrary Sequences
2008
·
Francisco Claude
, Gonzalo Navarro
·
Lecture notes in computer science
·
159
Optimal Lower and Upper Bounds for Representing Sequences
2015
·
Djamal Belazzougui
, Gonzalo Navarro
·
ACM Transactions on Algorithms
·
102
PDF
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays
2007
·
Wing-Kai Hon
, Tak-Wah Lam
, et al.
·
Algorithmica
·
98
The wavelet matrix: An efficient wavelet tree for large alphabets
2014
·
Francisco Claude
, Gonzalo Navarro
, et al.
·
Information Systems
·
93
PDF
Competitive distribution estimation: why is Good-Turing good
2015
·
Alon Orlitsky
, Ananda Theertha Suresh
·
neural information processing systems
·
90
On Dejean’s conjecture over large alphabets
2007
·
Arturo Carpi
·
Theoretical Computer Science
·
90
PDF
Expected length of the longest common subsequence for large alphabets
2004
·
Marcos Kiwi
, Martin Loebl
, et al.
·
Advances in Mathematics
·
84
PDF
Word-based self-indexes for natural language text
2012
·
Antonio Fariña
, Nieves R. Brisaboa
, et al.
·
ACM Transactions on Information Systems
·
83
Frameproof Codes
2003
·
Simon R. Blackburn
·
SIAM Journal on Discrete Mathematics
·
83
Optimal Error Correction Against Computationally Bounded Noise
2005
·
Silvio Micali
, Chris Peikert
, et al.
·
Lecture notes in computer science
·
82
PDF
Extractor Codes
2004
·
A. Ta-Shma
, D. Zuckerman
·
IEEE Transactions on Information Theory
·
79
Universal Features for High-Dimensional Learning and Inference
2024
·
Shao-Lun Huang
, Anuran Makur
, et al.
·
Foundations and Trends® in Communications and Information Theory
·
76
PDF
Experimental results on string matching algorithms
1995
·
Thierry Lecroq
·
Software Practice and Experience
·
73
Minimax Estimation of the $L_{1}$ Distance
2018
·
Jiantao Jiao
, Yanjun Han
, et al.
·
IEEE Transactions on Information Theory
·
70
PDF
On the Usefulness of Fibonacci Compression Codes
2009
·
S. T. Klein
, M. K. Ben-Nissan
·
The Computer Journal
·
65
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
2020
·
Chong Shangguan
, Itzhak Tamo
·
ACM Symposium on Theory of Computing (STOC)
·
57
PDF
Efficient Variants of the Backward-oracle-matching Algorithm
2009
·
SIMONE FARO
, THIERRY LECROQ
·
International Journal of Foundations of Computer Science
·
54
VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
2012
·
Ondřej Lengál
, Jiří Šimáček
, et al.
·
Lecture notes in computer science
·
52
PDF
Show more works
View as search
Works count:
334
Citation count:
6,772
Year
Topic
Type