2009 |
26 | EE | S. M. Sadegh Tabatabaei Yazdi,
Serap A. Savari:
A Combinatorial Study of Linear Deterministic Relay Networks
CoRR abs/0904.2401: (2009) |
2008 |
25 | EE | Gerhard Kramer,
S. M. Sadegh Tabatabaei Yazdi,
Serap A. Savari:
Network coding on line networks with broadcast.
CISS 2008: 781-784 |
24 | EE | Jeehong Yang,
Serap A. Savari,
Oskar Mencer:
An Approach to Graph and Netlist Compression.
DCC 2008: 33-42 |
23 | EE | Serap A. Savari:
On One-to-One Codes for Memoryless Cost Channels.
IEEE Transactions on Information Theory 54(1): 367-379 (2008) |
2007 |
22 | EE | Jeehong Yang,
Serap A. Savari:
Dictionary-based English text compression using word endings.
DCC 2007: 410 |
21 | EE | S. M. Sadegh Tabatabaei Yazdi,
Serap A. Savari,
Kelli Carlson,
Gerhard Kramer:
The Capacity Region of a Collection of Multicast Sessions in an Undirected Ring Network.
ICPP Workshops 2007: 40 |
20 | EE | Gerhard Kramer,
Serap A. Savari:
Communicating Probability Distributions.
IEEE Transactions on Information Theory 53(2): 518-525 (2007) |
2006 |
19 | EE | Gerhard Kramer,
Serap A. Savari:
Edge-Cut Bounds on Network Coding Rates.
J. Network Syst. Manage. 14(1): 49-67 (2006) |
2004 |
18 | | Serap A. Savari:
Compression of words over a partially commutative alphabet.
IEEE Transactions on Information Theory 50(7): 1425-1441 (2004) |
2003 |
17 | EE | Serap A. Savari:
On Compressing Interchange Classes of Events in a Concurrent System.
DCC 2003: 153-162 |
2001 |
16 | EE | Sean Dorward,
Dawei Huang,
Serap A. Savari,
Gerald Schuller,
Bin Yu:
Low Delay Perpetually Lossless Coding of Audio Signals.
Data Compression Conference 2001: 312- |
15 | | Vivek K. Goyal,
Serap A. Savari,
Wei Wang:
On optimal permutation codes.
IEEE Transactions on Information Theory 47(7): 2961-2971 (2001) |
2000 |
14 | | Serap A. Savari:
A probabilistic approach to some asymptotics in noiseless communication.
IEEE Transactions on Information Theory 46(4): 1246-1262 (2000) |
13 | EE | Serap A. Savari,
Cliff Young:
Comparing and Combining Profiles.
J. Instruction-Level Parallelism 2: (2000) |
1999 |
12 | EE | Serap A. Savari:
Variable-to-Fixed Length Codes and Plurally Parsable Dictionaries.
Data Compression Conference 1999: 453-462 |
11 | | Serap A. Savari:
Variable-to-fixed length codes and the conservation of entropy.
IEEE Transactions on Information Theory 45(5): 1612-1620 (1999) |
1998 |
10 | EE | Serap A. Savari:
Variable to Fixed Length Codes for Predictable Sources.
Data Compression Conference 1998: 481-490 |
9 | | Serap A. Savari:
Redundancy of the Lempel-Ziv String Matching Code.
IEEE Transactions on Information Theory 44(2): 787-791 (1998) |
1997 |
8 | | Serap A. Savari:
Redundancy of the Lempel-Ziv-Welch Code.
Data Compression Conference 1997: 191-200 |
7 | | Serap A. Savari:
Redundancy of the Lempel-Ziv incremental parsing rule.
IEEE Transactions on Information Theory 43(1): 9-21 (1997) |
6 | | Serap A. Savari,
Robert G. Gallager:
Generalized Tunstall codes for sources with memory.
IEEE Transactions on Information Theory 43(2): 658-668 (1997) |
1995 |
5 | | Martin Farach,
Michiel O. Noordewier,
Serap A. Savari,
Larry A. Shepp,
Aaron D. Wyner,
Jacob Ziv:
On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence.
SODA 1995: 48-57 |
1994 |
4 | | Serap A. Savari,
Robert G. Gallager:
Arithmetic coding for finite-state noiseless channels.
IEEE Transactions on Information Theory 40(1): 100-107 (1994) |
3 | | Serap A. Savari:
Some notes on Varn coding.
IEEE Transactions on Information Theory 40(1): 181- (1994) |
1993 |
2 | EE | Serap A. Savari:
Average Case Analysis of Five Two-Dimensional Bubble Sorting Algorithms.
SPAA 1993: 336-345 |
1992 |
1 | | Serap A. Savari,
Robert G. Gallager:
Arithmetic Coding for Memoryless Cost Channels.
Data Compression Conference 1992: 92-101 |