default search action
Travis Gagie
Person information
- affiliation: Dalhousie University, Halifax, NS, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j69]Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie:
Pfp-fm: an accelerated FM-index. Algorithms Mol. Biol. 19(1): 15 (2024) - [j68]Nieves R. Brisaboa
, Travis Gagie
Two-Dimensional Block Trees. Comput. J. 67(1): 391-406 (2024) - [j67]Brona Brejová, Travis Gagie, Eva Herencsárová, Tomás Vinar:
Maximum-scoring path sets on pangenome graphs of constant treewidth. Frontiers Bioinform. 4 (2024) - [c111]Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Yuri Pirola:
Solving the Minimal Positional Substring Cover Problem in Sublinear Space. CPM 2024: 12:1-12:16 - [c110]Adrián Goga, Lore Depuydt
Faster Maximal Exact Matches with Lazy LCP Evaluation. DCC 2024: 123-132 - [c109]Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li, Norbert Zeh:
Another virtue of wavelet forests. DCC 2024: 559 - [c108]Travis Gagie
How to Find Long Maximal Exact Matches and Ignore Short Ones. DLT 2024: 131-140 - [c107]Travis Gagie, Adrián Goga, Artur Jez, Gonzalo Navarro:
Space-Efficient Conversions from SLPs. LATIN (1) 2024: 146-161 - [c106]Andrej Baláz, Travis Gagie, Adrián Goga, Simon Heumos, Gonzalo Navarro, Alessia Petescia, Jouni Sirén:
Wheeler Maps. LATIN (1) 2024: 178-192 - [c105]Aaron Hong
Another Virtue of Wavelet Forests. SPIRE 2024: 184-191 - [c104]Lore Depuydt, Luca Renders, Simon Van de Vyver, Lennart Veys, Travis Gagie, Jan Fostier:
b-move: Faster Bidirectional Character Extensions in a Run-Length Compressed Index. WABI 2024: 10:1-10:18 - [c103]Dominika Draesslerová, Omar Ahmed, Travis Gagie, Jan Holub, Ben Langmead, Giovanni Manzini, Gonzalo Navarro:
Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests. SEA 2024: 10:1-10:13 - [i125]Dominika Draesslerová, Omar Ahmed, Travis Gagie, Jan Holub, Ben Langmead, Giovanni Manzini, Gonzalo Navarro:
Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests. CoRR abs/2402.06935 (2024) - [i124]Travis Gagie:
How to Find Long Maximal Exact Matches and Ignore Short Ones. CoRR abs/2403.02008 (2024) - [i123]Peter Peresíni, Nathaniel K. Brown, Travis Gagie, Ben Langmead:
MIOV: Reordering MOVI for even better locality. CoRR abs/2407.18956 (2024) - [i122]Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Marinella Sciortino:
Movelet Trees. CoRR abs/2408.04537 (2024) - [i121]Dustin Cobas, Travis Gagie, Gonzalo Navarro:
Fast and Small Subsampled R-indexes. CoRR abs/2409.14654 (2024) - 2023
- [j66]Davide Cozzi
μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data. Bioinform. 39(9) (2023) - [j65]Travis Gagie
Ruler Wrapping. Int. J. Comput. Geom. Appl. 33(1&2): 3-12 (2023) - [j64]Guillermo de Bernardo
Faster compressed quadtrees. J. Comput. Syst. Sci. 131: 86-104 (2023) - [c102]Xing Lyu, Travis Gagie
Sum-of-Local-Effects Data Structures for Separable Graphs. COCOON (1) 2023: 195-206 - [c101]Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli, Travis Gagie:
MONI Can Find k-MEMs. CPM 2023: 26:1-26:14 - [c100]Marco Oliva, Travis Gagie, Christina Boucher:
Recursive Prefix-Free Parsing for Building Big BWTs. DCC 2023: 62-70 - [c99]Alessio Conte, Nicola Cotumaccio
Computing matching statistics on Wheeler DFAs. DCC 2023: 150-159 - [c98]César Martínez-Guardiola
Augmented Thresholds for MONI. DCC 2023: 268-277 - [c97]Travis Gagie:
Flexible Grammar-based Indexes (invited paper). ITAT 2023: 2 - [c96]Paola Bonizzoni
Data Structures for SMEM-Finding in the PBWT. SPIRE 2023: 89-101 - [c95]Nicola Cotumaccio
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. SPIRE 2023: 143-156 - [c94]Travis Gagie
Dynamic Compact Planar Embeddings. SPIRE 2023: 233-245 - [c93]Travis Gagie
A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings. SPIRE 2023: 246-252 - [c92]Aaron Hong, Marco Oliva, Dominik Köppl
Acceleration of FM-Index Queries Through Prefix-Free Parsing. WABI 2023: 13:1-13:16 - [i120]Alessio Conte, Nicola Cotumaccio
Computing matching statistics on Wheeler DFAs. CoRR abs/2301.05338 (2023) - [i119]Xing Lyu, Travis Gagie, Meng He
Sum-of-Local-Effects Data Structures for Separable Graphs. CoRR abs/2305.03240 (2023) - [i118]Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie:
Acceleration of FM-index Queries Through Prefix-free Parsing. CoRR abs/2305.05893 (2023) - [i117]Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza:
Space-time Trade-offs for the LCP Array of Wheeler DFAs. CoRR abs/2306.05684 (2023) - [i116]Christina Boucher, Travis Gagie, Aaron Hong, Yansong Li, Norbert Zeh:
Another virtue of wavelet forests? CoRR abs/2308.07809 (2023) - [i115]Andrej Baláz, Travis Gagie, Adrián Goga, Simon Heumos, Gonzalo Navarro, Alessia Petescia, Jouni Sirén:
Wheeler maps. CoRR abs/2308.09836 (2023) - [i114]Adrián Goga, Lore Depuydt, Nathaniel K. Brown, Jan Fostier, Travis Gagie, Gonzalo Navarro:
Faster Maximal Exact Matches with Lazy LCP Evaluation. CoRR abs/2311.04538 (2023) - [i113]Lore Depuydt, Travis Gagie, Ben Langmead, Giovanni Manzini, Nicola Prezza:
Suffixient Sets. CoRR abs/2312.01359 (2023) - 2022
- [j63]Travis Gagie
Preface to Special Issue for DCC 2020. Inf. Comput. 285(Part): 104880 (2022) - [j62]Massimiliano Rossi
MONI: A Pangenomic Index for Finding Maximal Exact Matches. J. Comput. Biol. 29(2): 169-187 (2022) - [j61]Massimiliano Rossi
Finding Maximal Exact Matches Using the r-Index. J. Comput. Biol. 29(2): 188-194 (2022) - [j60]Paolo Ferragina, Giovanni Manzini, Travis Gagie, Dominik Köppl
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. Proc. VLDB Endow. 15(10): 2175-2187 (2022) - [j59]Alexandre P. Francisco
Graph Compression for Adjacency-Matrix Multiplication. SN Comput. Sci. 3(3): 193 (2022) - [j58]Alexandre P. Francisco
Correction to: Graph Compression for Adjacency-Matrix Multiplication. SN Comput. Sci. 3(3): 228 (2022) - [j57]Antonio Fariña
Efficient and compact representations of some non-canonical prefix-free codes. Theor. Comput. Sci. 907: 11-25 (2022) - [c91]Marco Oliva, Davide Cenzato, Massimiliano Rossi, Zsuzsanna Lipták, Travis Gagie, Christina Boucher:
CSTs for Terabyte-Sized Data. DCC 2022: 93-102 - [c90]Nathaniel K. Brown, Travis Gagie, Massimiliano Rossi:
RLBWT Tricks. DCC 2022: 444 - [c89]Travis Gagie:
Simple Worst-Case Optimal Adaptive Prefix-Free Coding. DCC 2022: 453 - [c88]Travis Gagie:
Simple Worst-Case Optimal Adaptive Prefix-Free Coding. ESA 2022: 57:1-57:5 - [c87]Travis Gagie, Sana Kashgouli, Ben Langmead:
KATKA: A KRAKEN-Like Tool with k Given at Query Time. SPIRE 2022: 191-197 - [c86]Travis Gagie:
On Representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs. SPIRE 2022: 250-256 - [c85]Nathaniel K. Brown
RLBWT Tricks. SEA 2022: 16:1-16:16 - [i112]Travis Gagie:
MONI can find k-MEMs. CoRR abs/2202.05085 (2022) - [i111]Paolo Ferragina, Travis Gagie, Dominik Köppl
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. CoRR abs/2203.14540 (2022) - [i110]Travis Gagie:
An n Hk-compressed searchable partial-sums data structure for static sequences of sublogarithmic positive integers. CoRR abs/2204.07916 (2022) - [i109]Travis Gagie, Sana Kashgouli:
KATKA: A KRAKEN-like tool with k given at query time. CoRR abs/2206.06053 (2022) - [i108]Travis Gagie, Giovanni Manzini, Marinella Sciortino:
Teaching the Burrows-Wheeler Transform via the Positional Burrows-Wheeler Transform. CoRR abs/2208.09840 (2022) - [i107]Adrián Goga, Andrej Baláz, Alessia Petescia, Travis Gagie:
MARIA: Multiple-alignment r-index with aggregation. CoRR abs/2209.09218 (2022) - [i106]Xing Lyu, Travis Gagie:
Rectangular Ruler Wrapping. CoRR abs/2210.01954 (2022) - [i105]César Martínez-Guardiola, Nathaniel K. Brown, Fernando Silva-Coira, Dominik Köppl
Augmented Thresholds for MONI. CoRR abs/2211.07794 (2022) - [i104]Travis Gagie:
Space-efficient RLZ-to-LZ77 conversion. CoRR abs/2211.13254 (2022) - [i103]Nick Fagan, Jorge Hermo González, Travis Gagie:
A fast and simple O(z log n)-space index for finding approximately longest common substrings. CoRR abs/2211.13434 (2022) - [i102]Travis Gagie, Artur Jez, Gonzalo Navarro:
Space-efficient conversions from SLPs. CoRR abs/2212.02327 (2022) - 2021
- [j56]Djamal Belazzougui, Travis Gagie
Range Majorities and Minorities in Arrays. Algorithmica 83(6): 1707-1733 (2021) - [j55]Nieves R. Brisaboa
An index for moving objects with constant-time access to their compressed trajectories. Int. J. Geogr. Inf. Sci. 35(7): 1392-1424 (2021) - [j54]Djamal Belazzougui, Manuel Cáceres
Block trees. J. Comput. Syst. Sci. 117: 1-22 (2021) - [j53]Patrick Hagge Cording, Travis Gagie
Maximal unbordered factors of random strings. Theor. Comput. Sci. 852: 78-83 (2021) - [c84]Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi:
PFP Compressed Suffix Trees. ALENEX 2021: 60-72 - [c83]Travis Gagie, Sebastian Wild:
Succinct Euler-Tour Trees. CCCG 2021: 368-376 - [c82]Dustin Cobas, Travis Gagie, Gonzalo Navarro:
A Fast and Small Subsampled R-Index. CPM 2021: 13:1-13:16 - [c81]Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl
PHONI: Streamed Matching Statistics with Multi-Genome References. DCC 2021: 193-202 - [c80]Marco Oliva, Massimiliano Rossi, Jouni Sirén, Giovanni Manzini, Tamer Kahveci, Travis Gagie, Christina Boucher:
Efficiently Merging r-indexes. DCC 2021: 203-212 - [c79]Travis Gagie, Garance Gourdel, Giovanni Manzini:
Compressing and Indexing Aligned Readsets. WABI 2021: 13:1-13:21 - [i101]Travis Gagie:
$r$-indexing Wheeler graphs. CoRR abs/2101.12341 (2021) - [i100]Dustin Cobas, Travis Gagie, Gonzalo Navarro:
A Fast and Small Subsampled R-index. CoRR abs/2103.15329 (2021) - [i99]Travis Gagie:
Compact Euler Tours of Trees with Small Maximum Degree. CoRR abs/2105.04965 (2021) - [i98]Travis Gagie:
Simple Worst-Case Optimal Adaptive Prefix-Free Coding. CoRR abs/2109.02997 (2021) - [i97]Travis Gagie, Mozhgan Saeidi, Allan Sapucaia:
Ruler Wrapping. CoRR abs/2109.14497 (2021) - [i96]Nathaniel K. Brown, Travis Gagie, Massimiliano Rossi:
RLBWT Tricks. CoRR abs/2112.04271 (2021) - 2020
- [j52]Travis Gagie
Compressed Dynamic Range Majority and Minority Data Structures. Algorithmica 82(7): 2063-2086 (2020) - [j51]Hideo Bannai
More Time-Space Tradeoffs for Finding a Shortest Unique Substring. Algorithms 13(9): 234 (2020) - [j50]Leo Ferres
Fast and compact planar embeddings. Comput. Geom. 89: 101630 (2020) - [j49]Travis Gagie
Computation over compressed data. Inf. Comput. 273: 104515 (2020) - [j48]Travis Gagie
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space. J. ACM 67(1): 2:1-2:54 (2020) - [j47]Alan Kuhnle, Taher Mun, Christina Boucher, Travis Gagie
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment. J. Comput. Biol. 27(4): 500-513 (2020) - [j46]Taher Mun, Alan Kuhnle, Christina Boucher, Travis Gagie
Matching Reads to Many Genomes with the r-Index. J. Comput. Biol. 27(4): 514-518 (2020) - [j45]Hideo Bannai, Travis Gagie
Refining the r-index. Theor. Comput. Sci. 812: 96-108 (2020) - [j44]Travis Gagie
Tree path majority data structures. Theor. Comput. Sci. 833: 107-119 (2020) - [c78]Philip Bille
Decompressing Lempel-Ziv Compressed Text. DCC 2020: 143-152 - [c77]Travis Gagie
Practical Random Access to SLP-Compressed Texts. SPIRE 2020: 221-231 - [i95]Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi:
PFP Data Structures. CoRR abs/2006.11687 (2020) - [i94]Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco, Massimiliano Rossi:
PHONI: Streamed Matching Statistics with Multi-Genome References. CoRR abs/2011.05610 (2020)
2010 – 2019
- 2019
- [j43]Christina Boucher, Travis Gagie
Prefix-free parsing for building big BWTs. Algorithms Mol. Biol. 14(1): 13:1-13:15 (2019) - [j42]Gianni Decaroli, Travis Gagie
A compact index for order-preserving pattern matching. Softw. Pract. Exp. 49(6): 1041-1051 (2019) - [j41]Veli Mäkinen
Sparse Dynamic Programming on DAGs with Small Width. ACM Trans. Algorithms 15(2): 29:1-29:21 (2019) - [j40]Travis Gagie
Path queries on functions. Theor. Comput. Sci. 770: 34-50 (2019) - [c76]Diego Díaz-Domínguez
Simulating the DNA Overlap Graph in Succinct Space. CPM 2019: 26:1-26:20 - [c75]Jarno N. Alanko
Tunneling on Wheeler Graphs. DCC 2019: 122-131 - [c74]Alan Kuhnle, Taher Mun, Christina Boucher, Travis Gagie
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment. RECOMB 2019: 158-173 - [c73]Travis Gagie
Rpair: Rescaling RePair with Rsync. SPIRE 2019: 35-44 - [c72]Diego Arroyuelo, Guillermo de Bernardo
Faster Dynamic Compressed d-ary Relations. SPIRE 2019: 419-433 - [r4]Travis Gagie, Gonzalo Navarro:
Compressed Indexes for Repetitive Textual Datasets. Encyclopedia of Big Data Technologies 2019 - [i93]Diego Díaz-Domínguez, Travis Gagie, Gonzalo Navarro:
Simulating the DNA String Graph in Succinct Space. CoRR abs/1901.10453 (2019) - [i92]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake:
Rpair: Rescaling RePair with Rsync. CoRR abs/1906.00809 (2019) - [i91]Taher Mun, Alan Kuhnle, Christina Boucher, Travis Gagie, Ben Langmead, Giovanni Manzini:
Matching reads to many genomes with the r-index. CoRR abs/1908.01263 (2019) - [i90]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake:
Tree-Shape Grammars for Random Access. CoRR abs/1910.07145 (2019) - [i89]Diego Arroyuelo, Guillermo de Bernardo, Travis Gagie, Gonzalo Navarro:
Faster Dynamic Compressed d-ary Relations. CoRR abs/1911.08971 (2019) - [i88]Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Jens Stoye
25 Years of the Burrows-Wheeler Transform (Dagstuhl Seminar 19241). Dagstuhl Reports 9(6): 55-68 (2019) - 2018
- [j39]Travis Gagie
Guest Editorial: Special Issue on Compact Data Structures. Algorithmica 80(7): 1983-1985 (2018) - [j38]Victoria G. Crawford, Alan Kuhnle, Christina Boucher, Rayan Chikhi, Travis Gagie
Practical dynamic de Bruijn graphs. Bioinform. 34(24): 4189-4195 (2018) - [j37]Andrea Farruggia, Travis Gagie
Relative Suffix Trees. Comput. J. 61(5): 773-788 (2018) - [j36]Hideo Bannai, Travis Gagie
Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. 29(2): 143-164 (2018) - [j35]Djamal Belazzougui, Travis Gagie
Bidirectional Variable-Order de Bruijn Graphs. Int. J. Found. Comput. Sci. 29(8): 1279-1295 (2018) - [j34]Philip Bille
A separation between RLSLPs and LZ77. J. Discrete Algorithms 50: 36-39 (2018) - [c71]Hideo Bannai, Travis Gagie
Online LZ77 Parsing and Matching Statistics with RLBWTs. CPM 2018: 7:1-7:12 - [c70]Nieves R. Brisaboa
Two-Dimensional Block Trees. DCC 2018: 227-236 - [c69]Alexandre P. Francisco
Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication. DCC 2018: 307-314 - [c68]Travis Gagie
Tree Path Majority Data Structures. ISAAC 2018: 68:1-68:12 - [c67]Travis Gagie
On the Approximation Ratio of Lempel-Ziv Parsing. LATIN 2018: 490-503 - [c66]Anna Kuosmanen
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended. RECOMB 2018: 105-121 - [c65]Travis Gagie
Optimal-Time Text Indexing in BWT-runs Bounded Space. SODA 2018: 1459-1477 - [c64]Christina Boucher, Travis Gagie
Prefix-Free Parsing for Building Big BWTs. WABI 2018: 2:1-2:16 - [e1]Travis Gagie, Alistair Moffat, Gonzalo Navarro, Ernesto Cuadros-Vargas:
String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings. Lecture Notes in Computer Science 11147, Springer 2018, ISBN 978-3-030-00478-1 [contents] - [i87]Hideo Bannai, Travis Gagie, Tomohiro I:
Online LZ77 Parsing and Matching Statistics with RLBWTs. CoRR abs/1802.05906 (2018) - [i86]Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
Fast Lempel-Ziv Decompression in Linear Space. CoRR abs/1802.10347 (2018) - [i85]Nieves R. Brisaboa, Travis Gagie, Adrián Gómez-Brandón
Two-Dimensional Block Trees. CoRR abs/1803.01362 (2018) - [i84]Travis Gagie, Giovanni Manzini:
Prefix-Free Parsing for Building Big BWTs. CoRR abs/1803.11245 (2018) - [i83]Diego Díaz-Domínguez, Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Gonzalo Navarro, Simon J. Puglisi:
Assembling Omnitigs using Hidden-Order de Bruijn Graphs. CoRR abs/1805.05228 (2018) - [i82]Travis Gagie, Meng He, Gonzalo Navarro:
Tree Path Majority Data Structures. CoRR abs/1806.01804 (2018) - [i81]Travis Gagie, Gonzalo Navarro, Nicola Prezza:
Fully-Functional Suffix Trees and Optimal Text Searching in BWT-runs Bounded Space. CoRR abs/1809.02792 (2018) - [i80]Travis Gagie, Garance Gourdel, Gonzalo Navarro, Jared Simpson:
The Read-Optimized Burrows-Wheeler Transform. CoRR abs/1809.07320 (2018) - [i79]Nieves R. Brisaboa, Travis Gagie, Adrián Gómez-Brandón, Gonzalo Navarro, José R. Paramá:
Relative compression of trajectories. CoRR abs/1810.05753 (2018) - [i78]Jarno Alanko, Travis Gagie, Gonzalo Navarro, Louisa Seelbach Benkner:
Tunneling on Wheeler Graphs. CoRR abs/1811.02457 (2018) - [i77]Alan Kuhnle, Taher Mun, Christina Boucher, Travis Gagie, Ben Langmead, Giovanni Manzini:
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment. CoRR abs/1811.06933 (2018) - 2017
- [j33]Martin D. Muggli, Alexander Bowe, Noelle R. Noyes, Paul S. Morley
Succinct colored de Bruijn graphs. Bioinform. 33(20): 3181-3187 (2017) - [j32]Travis Gagie
Document retrieval on repetitive string collections. Inf. Retr. J. 20(3): 253-291 (2017) - [j31]Felipe A. Louza
Burrows-Wheeler transform and LCP array construction in constant space. J. Discrete Algorithms 42: 14-22 (2017) - [j30]Travis Gagie
Preface - Compact Data Structures. J. Discrete Algorithms 43: 1 (2017) - [j29]Travis Gagie
Compressed Spaced Suffix Arrays. Math. Comput. Sci. 11(2): 151-157 (2017) - [j28]Travis Gagie
Block Graphs in Practice. Math. Comput. Sci. 11(2): 191-196 (2017) - [j27]Amihood Amir, Alberto Apostolico, Travis Gagie
String cadences. Theor. Comput. Sci. 698: 4-8 (2017) - [j26]Travis Gagie
Wheeler graphs: A framework for BWT-based data structures. Theor. Comput. Sci. 698: 67-78 (2017) - [c63]Djamal Belazzougui, Fabio Cunial, Travis Gagie
Flexible Indexing of Repetitive Collections. CiE 2017: 162-174 - [c62]Travis Gagie
Path Queries on Functions. CPM 2017: 5:1-5:15 - [c61]Luís Felipe I. Cunha, Simone Dantas, Travis Gagie
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. CPM 2017: 19:1-19:9 - [c60]Gianni Decaroli, Travis Gagie
A Compact Index for Order-Preserving Pattern Matching. DCC 2017: 72-81 - [c59]Travis Gagie
Compressed Dynamic Range Majority Data Structures. DCC 2017: 260-269 - [c58]Travis Gagie
An Encoding for Order-Preserving Matching. ESA 2017: 38:1-38:15 - [c57]Golnaz Badkobeh, Travis Gagie
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. SPIRE 2017: 51-67 - [c56]Nieves R. Brisaboa
Efficient Compression and Indexing of Trajectories. SPIRE 2017: 103-115 - [c55]Leo Ferres
Fast and Compact Planar Embeddings. WADS 2017: 385-396 - [i76]Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Antonio Brasil Kowada, Jens Stoye:
Fast and Simple Jumbled Indexing for Binary RLE Strings. CoRR abs/1702.01280 (2017) - [i75]Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro:
Parallel Construction of Compact Planar Embeddings. CoRR abs/1705.00415 (2017) - [i74]Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mäkinen:
Speeding up Dynamic Programming on DAGs through a Fast Approximation of Path Cover. CoRR abs/1705.08754 (2017) - [i73]Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Dmitry Kosolobov, Simon J. Puglisi:
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. CoRR abs/1705.09538 (2017) - [i72]Travis Gagie, Gonzalo Navarro, Nicola Prezza:
Fast Locating with the RLBWT. CoRR abs/1705.10382 (2017) - [i71]Alexandre P. Francisco
Exploiting Computation-Friendly Graph Compression Methods. CoRR abs/1708.07271 (2017) - [i70]Nieves R. Brisaboa, Travis Gagie, Adrián Gómez-Brandón, Gonzalo Navarro, José R. Paramá:
Efficient Compression and Indexing of Trajectories. CoRR abs/1710.01952 (2017) - [i69]Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
A Separation Between Run-Length SLPs and LZ77. CoRR abs/1711.07270 (2017) - 2016
- [c54]Djamal Belazzougui, Travis Gagie
Bidirectional Variable-Order de Bruijn Graphs. LATIN 2016: 164-178 - [c53]Anthony J. Cox, Andrea Farruggia, Travis Gagie
RLZAP: Relative Lempel-Ziv with Adaptive Pointers. SPIRE 2016: 1-14 - [c52]Antonio Fariña
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes. SPIRE 2016: 50-60 - [c51]Djamal Belazzougui, Travis Gagie
Fully Dynamic de Bruijn Graphs. SPIRE 2016: 145-152 - [c50]Travis Gagie
Analyzing Relative Lempel-Ziv Reference Construction. SPIRE 2016: 160-165 - [c49]Golnaz Badkobeh, Travis Gagie
Longest Common Abelian Factors and Large Alphabets. SPIRE 2016: 254-259 - [r3]Travis Gagie, Giovanni Manzini:
Dictionary-Based Data Compression. Encyclopedia of Algorithms 2016: 538-543 - [r2]Travis Gagie:
Rank and Select Operations on Sequences. Encyclopedia of Algorithms 2016: 1776-1780 - [i68]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Practical combinations of repetition-aware data structures. CoRR abs/1604.06002 (2016) - [i67]Anthony J. Cox, Andrea Farruggia, Travis Gagie, Simon J. Puglisi, Jouni Sirén:
RLZAP: Relative Lempel-Ziv with Adaptive Pointers. CoRR abs/1605.04421 (2016) - [i66]Antonio Fariña, Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Alberto Ordóñez Pereira:
Efficient and Compact Representations of Some Non-Canonical Prefix-Free Codes. CoRR abs/1605.06615 (2016) - [i65]Travis Gagie, Aleksi Hartikainen, Kalle Karhu, Juha Kärkkäinen, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén:
Document Retrieval on Repetitive String Collections. CoRR abs/1605.09362 (2016) - [i64]Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Range Majorities and Minorities in Arrays. CoRR abs/1606.04495 (2016) - [i63]Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali:
Fully Dynamic de Bruijn Graphs. CoRR abs/1607.04909 (2016) - [i62]Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro:
Fast and Compact Planar Embeddings. CoRR abs/1610.00130 (2016) - [i61]Travis Gagie, Giovanni Manzini:
Toward a Succinct Index for Order-Preserving Pattern Matching. CoRR abs/1610.02865 (2016) - [i60]Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau:
String Cadences. CoRR abs/1610.03337 (2016) - [i59]Travis Gagie, Meng He, Gonzalo Navarro:
Compressed Dynamic Range Majority Data Structures. CoRR abs/1611.01835 (2016) - [i58]Felipe A. Louza, Travis Gagie, Guilherme P. Telles:
Burrows-Wheeler transform and LCP array construction in constant space. CoRR abs/1611.08198 (2016) - 2015
- [j25]Travis Gagie
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica 73(3): 571-588 (2015) - [j24]Travis Gagie
Approximate pattern matching in LZ77-compressed texts. J. Discrete Algorithms 32: 64-68 (2015) - [j23]Alexandru I. Tomescu
Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly. IEEE ACM Trans. Comput. Biol. Bioinform. 12(6): 1345-1354 (2015) - [j22]Travis Gagie
Efficient and Compact Representations of Prefix Codes. IEEE Trans. Inf. Theory 61(9): 4999-5011 (2015) - [c48]Djamal Belazzougui, Fabio Cunial, Travis Gagie
Composite Repetition-Aware Data Structures. CPM 2015: 26-39 - [c47]Djamal Belazzougui, Travis Gagie
Queries on LZ-Bounded Encodings. DCC 2015: 83-92 - [c46]Travis Gagie
Faster Compressed Quadtrees. DCC 2015: 93-102 - [c45]Travis Gagie
Document Counting in Compressed Space. DCC 2015: 103-112 - [c44]Christina Boucher, Alexander Bowe, Travis Gagie
Variable-Order de Bruijn Graphs. DCC 2015: 383-392 - [c43]Hideo Bannai, Travis Gagie
Diverse Palindromic Factorization Is NP-complete. DLT 2015: 85-96 - [c42]Johannes Fischer, Travis Gagie
Approximating LZ77 via Small-Space Multiple-Pattern Matching. ESA 2015: 533-544 - [c41]Christina Boucher, Alexander Bowe, Travis Gagie
Relative Select. SPIRE 2015: 149-155 - [i57]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Composite repetition-aware data structures. CoRR abs/1502.05937 (2015) - [i56]Travis Gagie:
Approximating LZ77 in Small Space. CoRR abs/1503.02416 (2015) - [i55]Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto:
Diverse Palindromic Factorization is NP-Complete. CoRR abs/1503.04045 (2015) - [i54]Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka:
Approximating LZ77 via Small-Space Multiple-Pattern Matching. CoRR abs/1504.06647 (2015) - [i53]Christina Boucher, Alexander Bowe, Travis Gagie, Giovanni Manzini, Jouni Sirén:
Relative Select. CoRR abs/1506.03262 (2015) - [i52]Travis Gagie, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén:
Relative Compressed Suffix Trees. CoRR abs/1508.02550 (2015) - 2014
- [j21]Jérémy Barbay
Efficient Fully-Compressed Sequence Representations. Algorithmica 69(1): 232-268 (2014) - [j20]Arash Farzan, Travis Gagie
Entropy-bounded representation of point grids. Comput. Geom. 47(1): 1-14 (2014) - [j19]Gabriele Fici
A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28: 41-48 (2014) - [c40]Stephane Durocher, Robert Fraser, Travis Gagie
Indexed Geometric Jumbled Pattern Matching. CPM 2014: 110-119 - [c39]Travis Gagie
Relative Lempel-Ziv with Constant-Time Random Access. DCC 2014: 405 - [c38]Travis Gagie, Christopher Hoobin, Simon J. Puglisi:
Block Graphs in Practice. ICABD 2014: 30-36 - [c37]Travis Gagie, Giovanni Manzini, Daniel Valenzuela:
Compressed Spaced Suffix Arrays. ICABD 2014: 37-45 - [c36]Travis Gagie
LZ77-Based Self-indexing with Faster Pattern Matching. LATIN 2014: 731-742 - [c35]Héctor Ferrada, Travis Gagie, Simon Gog, Simon J. Puglisi:
Relative Lempel-Ziv with Constant-Time Random Access. SPIRE 2014: 13-17 - [c34]Djamal Belazzougui, Travis Gagie, Simon Gog, Giovanni Manzini, Jouni Sirén:
Relative FM-Indexes. SPIRE 2014: 52-64 - [i51]Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa:
A Subquadratic Algorithm for Minimum Palindromic Factorization. CoRR abs/1403.2431 (2014) - [i50]Travis Gagie, Giovanni Manzini, Jouni Sirén:
Reusing an FM-index. CoRR abs/1404.4814 (2014) - [i49]Travis Gagie:
Suffix Arrays for Spaced-SNP Databases. CoRR abs/1407.0114 (2014) - [i48]Travis Gagie, Aleksi Hartikainen, Juha Kärkkäinen, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén:
Document Counting in Practice. CoRR abs/1409.6780 (2014) - [i47]Travis Gagie, Gonzalo Navarro, Yakov Nekrich, Alberto Ordóñez Pereira:
Efficient and Compact Representations of Prefix Codes. CoRR abs/1410.3438 (2014) - [i46]Christina Boucher, Alexander Bowe, Travis Gagie, Simon J. Puglisi, Kunihiko Sadakane:
Variable-Order de Bruijn Graphs. CoRR abs/1411.2718 (2014) - [i45]Travis Gagie, Javier I. González-Nova, Susana Ladra, Gonzalo Navarro, Diego Seco:
Faster Compressed Quadtrees. CoRR abs/1411.2785 (2014) - [i44]Djamal Belazzougui, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei:
Queries on LZ-Bounded Encodings. CoRR abs/1412.0967 (2014) - [i43]Travis Gagie, Simon J. Puglisi:
Searching and Indexing Genomic Databases via Kernelization. CoRR abs/1412.1591 (2014) - 2013
- [j18]Pawel Gawrychowski, Travis Gagie
Minimax trees in linear time with applications. Eur. J. Comb. 34(1): 82-90 (2013) - [j17]Travis Gagie
Colored range queries and document retrieval. Theor. Comput. Sci. 483: 36-50 (2013) - [c33]Travis Gagie
On the Value of Multiple Read/Write Streams for Data Compression. Information Theory, Combinatorics, and Search Theory 2013: 284-297 - [c32]Travis Gagie, Pawel Gawrychowski, Yakov Nekrich:
Heaviest Induced Ancestors and Longest Common Substrings. CCCG 2013 - [c31]Travis Gagie
New Algorithms for Position Heaps. CPM 2013: 95-106 - [c30]Travis Gagie
Document Listing on Repetitive Collections. CPM 2013: 107-119 - [c29]Travis Gagie
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. ESA 2013: 517-528 - [c28]Ferdinando Cicalese, Travis Gagie
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE 2013: 56-63 - [c27]Djamal Belazzougui, Travis Gagie
Better Space Bounds for Parameterized Range Majority and Minority. WADS 2013: 121-132 - [i42]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. CoRR abs/1301.6127 (2013) - [i41]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. CoRR abs/1304.5560 (2013) - [i40]Travis Gagie, Pawel Gawrychowski, Yakov Nekrich:
Heaviest Induced Ancestors and Longest Common Substrings. CoRR abs/1305.3164 (2013) - [i39]Héctor Ferrada, Travis Gagie, Tommi Hirvola, Simon J. Puglisi:
Hybrid Indexes for Repetitive Datasets. CoRR abs/1306.4037 (2013) - [i38]Héctor Ferrada, Travis Gagie, Tommi Hirvola, Simon J. Puglisi:
AliBI: An Alignment-Based Index for Genomic Datasets. CoRR abs/1307.6462 (2013) - [i37]Travis Gagie, Giovanni Manzini, Daniel Valenzuela:
Compressed Spaced Suffix Arrays. CoRR abs/1312.3422 (2013) - 2012
- [j16]Paolo Ferragina
Lightweight Data Indexing and Compression in External Memory. Algorithmica 63(3): 707-730 (2012) - [j15]Travis Gagie
A Note on Sequence Prediction over Large Alphabets. Algorithms 5(1): 50-55 (2012) - [j14]Hideo Bannai, Travis Gagie
An efficient algorithm to test square-freeness of strings compressed by straight-line programs. Inf. Process. Lett. 112(19): 711-714 (2012) - [j13]Travis Gagie
Bounds from a card trick. J. Discrete Algorithms 10: 2-4 (2012) - [j12]Travis Gagie
New algorithms on wavelet trees and applications to information retrieval. Theor. Comput. Sci. 426: 25-41 (2012) - [c26]Travis Gagie
A Faster Grammar-Based Self-index. LATA 2012: 240-251 - [c25]Johannes Fischer, Travis Gagie
Forbidden Patterns. LATIN 2012: 327-337 - [c24]Travis Gagie
Indexed Multi-pattern Matching. LATIN 2012: 399-407 - [i36]Travis Gagie, Pawel Gawrychowski:
Linear-Space Substring Range Counting over Polylogarithmic Alphabets. CoRR abs/1202.3208 (2012) - [i35]Travis Gagie:
On the Value of Multiple Read/Write Streams for Data Compression. CoRR abs/1204.1215 (2012) - [i34]Travis Gagie:
Sequential-Access FM-Indexes. CoRR abs/1205.1195 (2012) - [i33]Djamal Belazzougui, Travis Gagie, Gonzalo Navarro:
Better Space Bounds for Parameterized Range Majority and Minority. CoRR abs/1210.1765 (2012) - [i32]Travis Gagie:
Grammar-Based Construction of Indexes for Binary Jumbled Pattern Matching. CoRR abs/1210.8386 (2012) - [i31]Travis Gagie, Wing-Kai Hon, Tsung-Han Ku:
New Algorithms for Position Heaps. CoRR abs/1212.4613 (2012) - 2011
- [j11]Ferdinando Cicalese, Travis Gagie
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. Discret. Appl. Math. 159(11): 1070-1078 (2011) - [j10]Travis Gagie
Tight bounds for online stable sorting. J. Discrete Algorithms 9(2): 176-181 (2011) - [c23]Travis Gagie
Counting Colours in Compressed Strings. CPM 2011: 197-207 - [c22]Travis Gagie
Faster Approximate Pattern Matching in Compressed Repetitive Texts. ISAAC 2011: 653-662 - [c21]Travis Gagie
Finding Frequent Elements in Compressed 2D Arrays and Strings. SPIRE 2011: 295-300 - [i30]Travis Gagie, Pawel Gawrychowski, Simon J. Puglisi:
Faster Approximate Pattern Matching in Compressed Repetitive Texts. CoRR abs/1109.2930 (2011) - [i29]Travis Gagie, Pawel Gawrychowski:
A Faster LZ77-Based Index. CoRR abs/1109.3954 (2011) - [i28]Travis Gagie, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi:
A Compressed Self-Index for Genomic Databases. CoRR abs/1111.1355 (2011) - 2010
- [j9]Travis Gagie
Move-to-Front, Distance Coding, and Inversion Frequencies revisited. Theor. Comput. Sci. 411(31-33): 2925-2944 (2010) - [c20]Ferdinando Cicalese, Travis Gagie
A Better Bouncer's Algorithm. FUN 2010: 113-120 - [c19]Jérémy Barbay
Alphabet Partitioning for Compressed Rank/Select and Applications. ISAAC (2) 2010: 315-326 - [c18]Arash Farzan, Travis Gagie
Entropy-Bounded Representation of Point Grids. ISAAC (2) 2010: 327-338 - [c17]Travis Gagie
Grammar-Based Compression in a Streaming Model. LATA 2010: 273-284 - [c16]Paolo Ferragina
Lightweight Data Indexing and Compression in External Memory. LATIN 2010: 697-710 - [c15]Travis Gagie
Fast and Compact Prefix Codes. SOFSEM 2010: 419-427 - [c14]Travis Gagie
Colored Range Queries and Document Retrieval. SPIRE 2010: 67-81 - [i27]Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic:
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case. CoRR abs/1006.4136 (2010) - [i26]Travis Gagie, Juha Kärkkäinen:
Counting Colours in Compressed Strings. CoRR abs/1011.3480 (2010) - [i25]Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela:
Pattern Kits. CoRR abs/1011.3491 (2010) - [i24]Travis Gagie, Gonzalo Navarro, Simon J. Puglisi:
New Algorithms on Wavelet Trees and Applications to Information Retrieval. CoRR abs/1011.4532 (2010) - [i23]Travis Gagie:
Bounds from a Card Trick. CoRR abs/1011.4609 (2010)
2000 – 2009
- 2009
- [b1]Travis Gagie:
New algorithms and lower bounds for sequential access data compression. Bielefeld University, 2009 - [j8]Travis Gagie
A New Algorithm for Building Alphabetic Minimax Trees. Fundam. Informaticae 97(3): 321-329 (2009) - [j7]Travis Gagie
Compressed depth sequences. Theor. Comput. Sci. 410(8-10): 958-962 (2009) - [c13]Travis Gagie
On the Value of Multiple Read/Write Streams for Data Compression. CPM 2009: 68-77 - [c12]Travis Gagie
Low-Memory Adaptive Prefix Coding. DCC 2009: 13-22 - [c11]Pawel Gawrychowski, Travis Gagie
Minimax Trees in Linear Time with Applications. IWOCA 2009: 278-288 - [c10]Travis Gagie
Range Quantile Queries: Another Virtue of Wavelet Trees. SPIRE 2009: 1-6 - [c9]Travis Gagie
Worst-Case Optimal Adaptive Prefix Coding. WADS 2009: 315-326 - [i22]Pawel Gawrychowski, Travis Gagie:
Minimax Trees in Linear Time with Applications. Search Methodologies 2009 - [i21]Travis Gagie:
New Algorithms and Lower Bounds for Sequential-Access Data Compression. CoRR abs/0902.0133 (2009) - [i20]Travis Gagie:
Another Virtue of Wavelet Trees. CoRR abs/0903.4726 (2009) - [i19]Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Fast and Compact Prefix Codes. CoRR abs/0905.3107 (2009) - [i18]Travis Gagie, Yakov Nekrich:
Tight Bounds for Online Stable Sorting. CoRR abs/0907.0741 (2009) - [i17]Paolo Ferragina, Travis Gagie, Giovanni Manzini:
Lightweight Data Indexing and Compression in External Memory. CoRR abs/0909.4341 (2009) - [i16]Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Alphabet Partitioning for Compressed Rank/Select with Applications. CoRR abs/0911.4981 (2009) - [i15]Travis Gagie:
Grammar-Based Compression in a Streaming Model. CoRR abs/0912.0850 (2009) - [i14]Travis Gagie:
A Lower Bound on the Complexity of Approximating the Entropy of a Markov Source. CoRR abs/0912.5079 (2009) - 2008
- [j6]Travis Gagie
Dynamic asymmetric communication. Inf. Process. Lett. 108(6): 352-355 (2008) - [j5]Travis Gagie
Sorting streamed multisets. Inf. Process. Lett. 108(6): 418-421 (2008) - [r1]Travis Gagie, Giovanni Manzini:
Dictionary-Based Data Compression. Encyclopedia of Algorithms 2008 - [i13]Travis Gagie:
A New Algorithm for Building Alphabetic Minimax Trees. CoRR abs/0810.5064 (2008) - [i12]Travis Gagie, Marek Karpinski, Yakov Nekrich:
Low-Memory Adaptive Prefix Coding. CoRR abs/0811.3602 (2008) - [i11]Pawel Gawrychowski, Travis Gagie:
Minimax Trees in Linear Time. CoRR abs/0812.2868 (2008) - [i10]Travis Gagie, Yakov Nekrich:
Worst-Case Optimal Adaptive Prefix Coding. CoRR abs/0812.3306 (2008) - 2007
- [j4]Travis Gagie
Dynamic Shannon coding. Inf. Process. Lett. 102(2-3): 113-117 (2007) - [c8]Travis Gagie
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited. CPM 2007: 71-82 - [c7]Travis Gagie:
Sorting streamed multisets. ICTCS 2007: 130-138 - [c6]Travis Gagie
Space-Conscious Compression. MFCS 2007: 206-217 - [i9]Travis Gagie:
A nearly tight memory-redundancy trade-off for one-pass compression. CoRR abs/0708.1877 (2007) - [i8]Travis Gagie:
Empirical entropy in context. CoRR abs/0708.2084 (2007) - [i7]Travis Gagie:
Bounds for Compression in Streaming Models. CoRR abs/0711.3338 (2007) - 2006
- [j3]Travis Gagie
Compressing probability distributions. Inf. Process. Lett. 97(4): 133-137 (2006) - [j2]Travis Gagie
Large alphabets and incompressibility. Inf. Process. Lett. 99(6): 246-251 (2006) - [c5]Travis Gagie
Dynamic Asymmetric Communication. DCC 2006: 447 - [c4]Travis Gagie
Dynamic Asymmetric Communication. SIROCCO 2006: 310-318 - [i6]Travis Gagie:
On the space complexity of one-pass compression. CoRR abs/cs/0611099 (2006) - 2005
- [j1]Travis Gagie
Restructuring binary search trees revisited. Inf. Process. Lett. 95(3): 418-421 (2005) - [i5]Travis Gagie:
Dynamic Shannon Coding. CoRR abs/cs/0503085 (2005) - [i4]Travis Gagie:
Compressing Probability Distributions. CoRR abs/cs/0506016 (2005) - [i3]Travis Gagie:
Dynamic Asymmetric Communication. CoRR abs/cs/0506025 (2005) - [i2]Travis Gagie:
Sorting a Low-Entropy Sequence. CoRR abs/cs/0506027 (2005) - [i1]Travis Gagie:
Large Alphabets and Incompressibility. CoRR abs/cs/0506056 (2005) - 2004
- [c3]Travis Gagie:
Dynamic Shannon Coding. Data Compression Conference 2004: 540 - [c2]Travis Gagie
Dynamic Shannon Coding. ESA 2004: 359-370 - 2003
- [c1]Travis Gagie
New Ways to Construct Binary Search Trees. ISAAC 2003: 537-543
Coauthor Index
[c103] [i125] [i122] [c99] [i120] [i113] [j60] [j57] [i111] [i108] [c84] [c81] [c80] [c79] [j47] [j46] [c77] [i95] [i94] [j43] [j42] [c74] [c73] [i92] [i91] [i90] [i88] [c64] [i84] [i77] [j29] [j26] [c60] [c58] [c52] [r3] [i66] [i61] [c41] [i53] [c37] [c34] [i50] [i37] [j16] [j9] [c16] [i17] [r1] [c8] [c6]
[j68] [c110] [c107] [c106] [c103] [i125] [i122] [i121] [j64] [c93] [i115] [i114] [j60] [j59] [j58] [j57] [i111] [i102] [j56] [j55] [j54] [c84] [c82] [c81] [i100] [j52] [j50] [j49] [j48] [j44] [c77] [i95] [i94] [j40] [c76] [c75] [c73] [c72] [r4] [i93] [i92] [i90] [i89] [i88] [j39] [j37] [c70] [c69] [c68] [c67] [c65] [e1] [i85] [i83] [i82] [i81] [i80] [i79] [i78] [j32] [c62] [c59] [c56] [c55] [i75] [i72] [i71] [i70] [c52] [i66] [i65] [i64] [i62] [i59] [j22] [c46] [c45] [i52] [j21] [j20] [i48] [i47] [i45] [j17] [c30] [c27] [j12] [i33] [c19] [c18] [c15] [c14] [i24] [i19] [i16]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: