The SCEAS System
| |||||||

## Search the dblp DataBase
Travis Gagie:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Travis Gagie
**Dynamic Shannon Coding.**[Citation Graph (0, 0)][DBLP] Data Compression Conference, 2004, pp:540- [Conf] - Travis Gagie
**Dynamic Asymmetric Communication.**[Citation Graph (0, 0)][DBLP] DCC, 2006, pp:447- [Conf] - Travis Gagie
**Dynamic Shannon Coding.**[Citation Graph (0, 0)][DBLP] ESA, 2004, pp:359-370 [Conf] - Travis Gagie
**New Ways to Construct Binary Search Trees.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:537-543 [Conf] - Travis Gagie
**Dynamic Asymmetric Communication.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:310-318 [Conf] - Travis Gagie
**Restructuring binary search trees revisited.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:95, n:3, pp:418-421 [Journal] - Travis Gagie
**Compressing probability distributions.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:97, n:4, pp:133-137 [Journal] - Travis Gagie
**Large alphabets and incompressibility.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:99, n:6, pp:246-251 [Journal] - Travis Gagie
**Dynamic Shannon coding.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:2-3, pp:113-117 [Journal] - Travis Gagie, Giovanni Manzini
**Move-to-Front, Distance Coding, and Inversion Frequencies Revisited.**[Citation Graph (0, 0)][DBLP] CPM, 2007, pp:71-82 [Conf] - Travis Gagie, Giovanni Manzini
**Space-Conscious Compression.**[Citation Graph (0, 0)][DBLP] MFCS, 2007, pp:206-217 [Conf] - Travis Gagie
**On the space complexity of one-pass compression**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Travis Gagie
**Dynamic Shannon Coding**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Travis Gagie
**A nearly tight memory-redundancy trade-off for one-pass compression**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Travis Gagie
**Empirical entropy in context**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **On the Value of Multiple Read/Write Streams for Data Compression.**[Citation Graph (, )][DBLP]**Low-Memory Adaptive Prefix Coding.**[Citation Graph (, )][DBLP]**Sorting streamed multisets.**[Citation Graph (, )][DBLP]**Lightweight Data Indexing and Compression in External Memory.**[Citation Graph (, )][DBLP]**Fast and Compact Prefix Codes.**[Citation Graph (, )][DBLP]**Range Quantile Queries: Another Virtue of Wavelet Trees.**[Citation Graph (, )][DBLP]**Worst-Case Optimal Adaptive Prefix Coding.**[Citation Graph (, )][DBLP]**A Better Bouncer's Algorithm.**[Citation Graph (, )][DBLP]**Grammar-Based Compression in a Streaming Model.**[Citation Graph (, )][DBLP]**Minimax Trees in Linear Time with Applications.**[Citation Graph (, )][DBLP]**Compressing Probability Distributions**[Citation Graph (, )][DBLP]**Dynamic Asymmetric Communication**[Citation Graph (, )][DBLP]**Sorting a Low-Entropy Sequence**[Citation Graph (, )][DBLP]**Large Alphabets and Incompressibility**[Citation Graph (, )][DBLP]**Bounds for Compression in Streaming Models**[Citation Graph (, )][DBLP]**A New Algorithm for Building Alphabetic Minimax Trees**[Citation Graph (, )][DBLP]**Low-Memory Adaptive Prefix Coding**[Citation Graph (, )][DBLP]**Minimax Trees in Linear Time**[Citation Graph (, )][DBLP]**Worst-Case Optimal Adaptive Prefix Coding**[Citation Graph (, )][DBLP]**New Algorithms and Lower Bounds for Sequential-Access Data Compression**[Citation Graph (, )][DBLP]**Another Virtue of Wavelet Trees**[Citation Graph (, )][DBLP]**Fast and Compact Prefix Codes**[Citation Graph (, )][DBLP]**Tight Bounds for Online Stable Sorting**[Citation Graph (, )][DBLP]**Lightweight Data Indexing and Compression in External Memory**[Citation Graph (, )][DBLP]**Alphabet Partitioning for Compressed Rank/Select with Applications**[Citation Graph (, )][DBLP]**Grammar-Based Compression in a Streaming Model**[Citation Graph (, )][DBLP]**A Lower Bound on the Complexity of Approximating the Entropy of a Markov Source**[Citation Graph (, )][DBLP]**Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case**[Citation Graph (, )][DBLP]
Search in 0.378secs, Finished in 0.380secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |