2009 | ||
---|---|---|
31 | EE | Travis Gagie: New Algorithms and Lower Bounds for Sequential-Access Data Compression CoRR abs/0902.0133: (2009) |
30 | EE | Travis Gagie: Another Virtue of Wavelet Trees CoRR abs/0903.4726: (2009) |
29 | EE | Travis Gagie: Compressed depth sequences. Theor. Comput. Sci. 410(8-10): 958-962 (2009) |
2008 | ||
28 | EE | Travis Gagie, Giovanni Manzini: Dictionary-Based Data Compression. Encyclopedia of Algorithms 2008 |
27 | EE | Travis Gagie: A New Algorithm for Building Alphabetic Minimax Trees CoRR abs/0810.5064: (2008) |
26 | EE | Travis Gagie, Marek Karpinski, Yakov Nekrich: Low-Memory Adaptive Prefix Coding CoRR abs/0811.3602: (2008) |
25 | EE | Pawel Gawrychowski, Travis Gagie: Minimax Trees in Linear Time CoRR abs/0812.2868: (2008) |
24 | EE | Travis Gagie, Yakov Nekrich: Worst-Case Optimal Adaptive Prefix Coding CoRR abs/0812.3306: (2008) |
23 | EE | Travis Gagie: Dynamic asymmetric communication. Inf. Process. Lett. 108(6): 352-355 (2008) |
22 | EE | Travis Gagie: Sorting streamed multisets. Inf. Process. Lett. 108(6): 418-421 (2008) |
2007 | ||
21 | EE | Travis Gagie, Giovanni Manzini: Move-to-Front, Distance Coding, and Inversion Frequencies Revisited. CPM 2007: 71-82 |
20 | Travis Gagie: Sorting streamed multisets. ICTCS 2007: 130-138 | |
19 | EE | Travis Gagie, Giovanni Manzini: Space-Conscious Compression. MFCS 2007: 206-217 |
18 | EE | Travis Gagie: A nearly tight memory-redundancy trade-off for one-pass compression CoRR abs/0708.1877: (2007) |
17 | EE | Travis Gagie: Empirical entropy in context CoRR abs/0708.2084: (2007) |
16 | EE | Travis Gagie: Bounds for Compression in Streaming Models CoRR abs/0711.3338: (2007) |
15 | EE | Travis Gagie: Dynamic Shannon coding. Inf. Process. Lett. 102(2-3): 113-117 (2007) |
2006 | ||
14 | EE | Travis Gagie: Dynamic Asymmetric Communication. DCC 2006: 447 |
13 | EE | Travis Gagie: Dynamic Asymmetric Communication. SIROCCO 2006: 310-318 |
12 | EE | Travis Gagie: On the space complexity of one-pass compression CoRR abs/cs/0611099: (2006) |
11 | EE | Travis Gagie: Compressing probability distributions. Inf. Process. Lett. 97(4): 133-137 (2006) |
10 | EE | Travis Gagie: Large alphabets and incompressibility. Inf. Process. Lett. 99(6): 246-251 (2006) |
2005 | ||
9 | EE | Travis Gagie: Dynamic Shannon Coding CoRR abs/cs/0503085: (2005) |
8 | EE | Travis Gagie: Compressing Probability Distributions CoRR abs/cs/0506016: (2005) |
7 | EE | Travis Gagie: Dynamic Asymmetric Communication CoRR abs/cs/0506025: (2005) |
6 | EE | Travis Gagie: Sorting a Low-Entropy Sequence CoRR abs/cs/0506027: (2005) |
5 | EE | Travis Gagie: Large Alphabets and Incompressibility CoRR abs/cs/0506056: (2005) |
4 | EE | Travis Gagie: Restructuring binary search trees revisited. Inf. Process. Lett. 95(3): 418-421 (2005) |
2004 | ||
3 | EE | Travis Gagie: Dynamic Shannon Coding. Data Compression Conference 2004: 540 |
2 | EE | Travis Gagie: Dynamic Shannon Coding. ESA 2004: 359-370 |
2003 | ||
1 | EE | Travis Gagie: New Ways to Construct Binary Search Trees. ISAAC 2003: 537-543 |
1 | Pawel Gawrychowski | [25] |
2 | Marek Karpinski | [26] |
3 | Giovanni Manzini | [19] [21] [28] |
4 | Yakov Nekrich | [24] [26] |