Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010, Proceedings > Lightweight Data Indexing and Compression in External Memory
LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010, Proceedings |
Alejandro López-Ortiz
Springer Berlin Heidelberg
LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010, Proceedings
Lightweight Data Indexing and Compression in External Memory
Authors

Paolo Ferragina; Travis Gagie; Giovanni Manzini

ARI Id

1664851673870_3780446

Access

Not Available Free

Pages

697-710

DOI

10.1007/978-3-642-12200-2_60

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-12200-2_60

Table of Contents of Book
Showing 1 to 20 of 62 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Continuous and Discrete Methods in Computer Science
Cristopher Moore
1-1
Colorful Strips
Greg Aloupis; Jean Cardinal; Sébastien Collette; Shinji Imahori; Matias Korman; Stefan Langerman et al.
2-13
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
Jonathan Backer; J. Mark Keil
14-25
Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
Qianping Gu; Navid Imani
26-37
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
Eric Angel; Evripidis Bampis; Nicolas Thibault
38-48
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width
Martin Fürer
49-59
Average Parameterization and Partial Kernelization for Computing Medians
Nadja Betzler; Jiong Guo; Christian Komusiewicz; Rolf Niedermeier
60-71
Sharp Separation and Applications to Exact and Parameterized Algorithms
Fedor V. Fomin; Daniel Lokshtanov; Fabrizio Grandoni; Saket Saurabh
72-83
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight
Tsunehiko Kameda; Ichiro Suzuki; John Z. Zhang
84-95
The Language Theory of Bounded Context-Switching
Salvatore La Torre; Parthasarathy Madhusudan; Gennaro Parlato
96-107
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
Diego Recalde; Cyriel Rutten; Petra Schuurman; Tjark Vredeveld
108-119
Packet Routing on the Grid
Britta Peis; Martin Skutella; Andreas Wiese
120-130
Faithful Representations of Graphs by Islands in the Extended Grid
Michael D. Coury; Pavol Hell; Jan Kratochvíl; Tomáš Vyskočil
131-142
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
Gero Greiner; Riko Jacob
143-156
Sparse Recovery Using Sparse Random Matrices
Piotr Indyk
157-157
Optimal Succinctness for Range Minimum Queries
Johannes Fischer
158-169
Compact Rich-Functional Binary Relation Representations
Jérémy Barbay; Francisco Claude; Gonzalo Navarro
170-183
Radix Cross-Sections for Length Morphisms
Sylvain Lombardy; Jacques Sakarovitch
184-195
Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata
Viliam Geffert; Giovanni Pighizzini
196-207
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 62 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings