The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Travis Gagie: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Travis Gagie
    Dynamic Shannon Coding. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2004, pp:540- [Conf]
  2. Travis Gagie
    Dynamic Asymmetric Communication. [Citation Graph (0, 0)][DBLP]
    DCC, 2006, pp:447- [Conf]
  3. Travis Gagie
    Dynamic Shannon Coding. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:359-370 [Conf]
  4. Travis Gagie
    New Ways to Construct Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:537-543 [Conf]
  5. Travis Gagie
    Dynamic Asymmetric Communication. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:310-318 [Conf]
  6. Travis Gagie
    Restructuring binary search trees revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:3, pp:418-421 [Journal]
  7. Travis Gagie
    Compressing probability distributions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:133-137 [Journal]
  8. Travis Gagie
    Large alphabets and incompressibility. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:6, pp:246-251 [Journal]
  9. Travis Gagie
    Dynamic Shannon coding. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:2-3, pp:113-117 [Journal]
  10. Travis Gagie, Giovanni Manzini
    Move-to-Front, Distance Coding, and Inversion Frequencies Revisited. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:71-82 [Conf]
  11. Travis Gagie, Giovanni Manzini
    Space-Conscious Compression. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:206-217 [Conf]
  12. Travis Gagie
    On the space complexity of one-pass compression [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  13. Travis Gagie
    Dynamic Shannon Coding [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  14. 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]
  15. Travis Gagie
    Empirical entropy in context [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  16. On the Value of Multiple Read/Write Streams for Data Compression. [Citation Graph (, )][DBLP]


  17. Low-Memory Adaptive Prefix Coding. [Citation Graph (, )][DBLP]


  18. Sorting streamed multisets. [Citation Graph (, )][DBLP]


  19. Lightweight Data Indexing and Compression in External Memory. [Citation Graph (, )][DBLP]


  20. Fast and Compact Prefix Codes. [Citation Graph (, )][DBLP]


  21. Range Quantile Queries: Another Virtue of Wavelet Trees. [Citation Graph (, )][DBLP]


  22. Worst-Case Optimal Adaptive Prefix Coding. [Citation Graph (, )][DBLP]


  23. A Better Bouncer's Algorithm. [Citation Graph (, )][DBLP]


  24. Grammar-Based Compression in a Streaming Model. [Citation Graph (, )][DBLP]


  25. Minimax Trees in Linear Time with Applications. [Citation Graph (, )][DBLP]


  26. Compressing Probability Distributions [Citation Graph (, )][DBLP]


  27. Dynamic Asymmetric Communication [Citation Graph (, )][DBLP]


  28. Sorting a Low-Entropy Sequence [Citation Graph (, )][DBLP]


  29. Large Alphabets and Incompressibility [Citation Graph (, )][DBLP]


  30. Bounds for Compression in Streaming Models [Citation Graph (, )][DBLP]


  31. A New Algorithm for Building Alphabetic Minimax Trees [Citation Graph (, )][DBLP]


  32. Low-Memory Adaptive Prefix Coding [Citation Graph (, )][DBLP]


  33. Minimax Trees in Linear Time [Citation Graph (, )][DBLP]


  34. Worst-Case Optimal Adaptive Prefix Coding [Citation Graph (, )][DBLP]


  35. New Algorithms and Lower Bounds for Sequential-Access Data Compression [Citation Graph (, )][DBLP]


  36. Another Virtue of Wavelet Trees [Citation Graph (, )][DBLP]


  37. Fast and Compact Prefix Codes [Citation Graph (, )][DBLP]


  38. Tight Bounds for Online Stable Sorting [Citation Graph (, )][DBLP]


  39. Lightweight Data Indexing and Compression in External Memory [Citation Graph (, )][DBLP]


  40. Alphabet Partitioning for Compressed Rank/Select with Applications [Citation Graph (, )][DBLP]


  41. Grammar-Based Compression in a Streaming Model [Citation Graph (, )][DBLP]


  42. A Lower Bound on the Complexity of Approximating the Entropy of a Markov Source [Citation Graph (, )][DBLP]


  43. Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case [Citation Graph (, )][DBLP]


Search in 0.378secs, Finished in 0.380secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002