Publication:5365049
From MaRDI portal
zbMath1375.68229MaRDI QIDQ5365049
Srinivasa Rao Satti, Oren Weimann, Kunihiko Sadakane, Rajeev Raman, Philip Bille, Gad M. Landau
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133066
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)
Related Items
XML compression via directed acyclic graphs, Block graphs in practice, Compressed matching for feature vectors, Fingerprints in compressed strings, Colored range queries and document retrieval, On compressing and indexing repetitive sequences, Fast relative Lempel-Ziv self-index for similar sequences, Pattern Matching on Elastic-Degenerate Text with Errors, Compressed subsequence matching and packed tree coloring, The complexity of compressed membership problems for finite automata, Detecting regularities on grammar-compressed strings, Approximate pattern matching in LZ77-compressed texts, Compressed automata for dictionary matching, Tree compression with top trees, Faster Compressed Suffix Trees for Repetitive Collections, Succinct Color Searching in One Dimension
