Serap A. Savari

Home

EECS Department

UMich Engineering

Serap A. Savari

Associate Professor
Department of Electrical Engineering and Computer Science
University of Michigan
Ann Arbor, MI 48109
Office: 4225 EECS
Phone: (734) 763-3561
Email: savari@eecs.umich.edu

Research interests

Information theory, data compression, network coding, computing and communication systems.

Teaching

Winter 2004:
EECS 651. Source Coding.

Fall 2004, 2005:
EECS 501. Probability and Random Processes.

Winter 2005, 2006, Fall 2006:
EECS 401. Probabilistic Methods in Engineering.

Selected Professional Activities

Associate Editor for Source Coding, IEEE Transactions on Information Theory, 2002-2005.

Technical Program Committee, IEEE International Symposium on Information Theory, 2001, 2002, 2004, 2005.

Program Committee, Data Compression Conference, 2000-2007.

Technical Program Committee, IEEE Information Theory Workshop, 2004, 2006.

DIMACS Council, 2001-2003.

Grants

Limits of Information Flow in Networks of Two-Way Channels, NSF Grant CCF-0430201, Sept. 2004-Aug. 2007.

Publications

Journals:

G. Kramer and S. A. Savari. Edge-Cut Bounds on Network Coding Rates. Journal of Network and Systems Management, 14(1), 2006.

S. A. Savari. Compression of works over a Partially Commutative Alphabet. IEEE Transactions on Information Theory, 50(7): 1425-1441, 2004.

V. K Goyal, S. A. Savari, and W. Wang. On Optimal Permutation Codes. IEEE Transactions on Information Theory, 47(7): 2961-2971, 2001.

G. Kramer, J. E. Mazo, and S. A. Savari. Eulogy for Claude Elwood Shannon. ACM SIGMOBILE Mobile Computing and Communications Review, 5(1): 1, 2001.

S. A. Savari. Renewal Theory and Source Coding. Proceedings of the IEEE, 88(11): 1692-1702, 2000.

S. A. Savari. A Probabilistic Approach to Some Asymptotics in Noiseless Communication. IEEE Transactions on Information Theory, 46(4): 1246-1262, 2000.

S. A. Savari and C. Young. Comparing and Combining Profiles. Journal of Instruction-Level Parallelism, 2, 2000.

S. A. Savari. Variable-to-Fixed Length Codes and the Conservation of Entropy. IEEE Transactions on Information Theory, 45(5): 1612-1620, 1999.

S. A. Savari. Redundancy of the Lempel-Ziv String Matching Code. IEEE Transactions on Information Theory, 44(2): 787-791, 1998.

S. A. Savari and R. G. Gallager. Generalized Tunstall Codes for Sources with Memory. IEEE Transactions on Information Theory, 43(2): 658-668, 1997.

S. A. Savari. Redundancy of the Lempel-Ziv Incremental Parsing Rule. IEEE Transactions on Information Theory, 43(1): 9-21, 1997.

S. A. Savari and D. P. Bertsekas. Finite Termination of Asynchronous Iterative Algorithms. Parallel Computing, 22: 39-56, 1996.

S. A. Savari and R. G. Gallager. Arithmetic Coding for Finite-State Noiseless Channels. IEEE Transactions on Information Theory, 40(1): 100-107, 1994.

S. A. Savari. Some Notes on Varn Coding. IEEE Transactions on Information Theory, 40(1): 181-186, 1994.

Volumes/Books:

G. Kramer and S. A. Savari. On Networks of Two-way Channels. In A. Ashikhmin, A. Barg, eds., DIMACS Workshop on Algebraic Coding Theory and Information Theorey, (December 15-18, 2003, Rutgers University, Piscataway, NJ) , DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 68: 133-143, American Mathematical Society, Rhode Island, 2005.

S. A. Savari. Compressing a Representation of Events in a Concurrent System. In P. Gupta, G. Kramer, A. J. van Wijngaarden, eds., Advances in Network Information Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 66: 25-42, American Mathematical Society, Rhode Island, 2004.

Invited Conference and Workshops:

S. A. Savari and G. Kramer. Edge-Cut Bounds on Network Coding Rates. In Information Theory and Applications Inaugural Workshop, La Jolla, CA, February 2006.

G. Kramer and S. A. Savari. Capacity Bounds for Relay Networks. In Information Theory and Applications Inaugural Workshop, La Jolla, CA, February 2006.

M. Drmota, Y. Reznik, S. A. Savari, and W. Szpankowski. Precise Asymptotic Analysis of the Tunstall Code. In Information Theory and Applications Inaugural Workshop, La Jolla, CA, February 2006.

S. A. Savari. On Optimal One-to-One Codes for Memoryless Cost Channels. In Proc. of the 42th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2004.

H. Feng, M. Effros and S. A. Savari. Functional Source Coding for Networks with Receiver Side Information. In Proc. of the 42th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2004.

S. A. Savari. An Example of Complexity. In Proc. of Workshop on Concepts in Information Theory, Breisach, Germany, June 2002.

G. Kramer and S. A. Savari. Quantum Data Compression of Ensembles of Mixed States with Commuting Density Operators. In Proc. of the 966th AMS Meeting, Hoboken, NJ, April 2001.

S. A. Savari. Redundancy of the Lempel-Ziv Codes. In Proc. of the 37th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, September 1999.

Selected Conferences:

J. Yang, S. A. Savari, and O. Mencer. Lossless Compression Using Two-Level and Multilevel Boolean Minimization. In Proc. of the 2006 IEEE Workshop on Signal Processing Systems, Banff, Canada, October 2006.

S. A. Savari and G. Kramer. The Multimessage Unicast Capacity Region for Bidirectional Ring Networks. In
Proc. of the 2006 IEEE International Symposium on Information Theory, Seattle, WA, July 2006.

G. Kramer and S. A. Savari. Progressive d-Separating Edge Set Bounds on Network Coding Rates. In Proc. of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 2005.

G. Kramer and S. A. Savari. Cut Sets and Information Flow in Networks of Two-Way Channels. In Proc. of the 2004 IEEE International Symposium on Information Theory, Chicago, IL, June 2004.

S. A. Savari and A. Naheta. Bounds on the Expected Cost of One-to-One Codes. In Proc. of the 2004 IEEE International Symposium on Information Theory, June 2004.

G. Kramer and S. A. Savari. Quantum Data Compression with Commuting Density Operators. In Proc. of the 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 2002.

S. A. Savari and W. Szpankowski. On the Analysis of Variable-to-Variable Length Codes. In Proc. of the 2002 IEEE International Symposium on Information Theory, June 2002.

S. A. Savari and P. Winkler. Information about Information. In Proc. of the 2001 IEEE International Symposium on Information Theory, Washington, DC, June 2001.

S. Dorward, D. Huang, S. A. Savari, G. Schuller and B. Yu. Low Delay Perceptually Lossless Coding of Audio Signals. In Proc. of the 2001 Data Compression Conference, Snowbird, UT, March 2001.

S. Savari and E. Telatar. The Behavior of Certain Stochastic Processes Arising in Window Protocols. In Proc. of the 1999 IEEE Global Telecommunications Conference, Rio de Janeiro, Brazil, December 1999.

S. A. Savari. Predictable Sources and Renewal Theory. In Proc. of the 1998 IEEE International Symposium on Information Theory, Cambridge, MA, August 1998.

S. A. Savari. Variable-to-Fixed Length Codes for Predictable Sources. In Proc. of the 1998 Data Compression Conference, Snowbird, UT, March 1998.

M. Farach, M. Noordewier, S. Savari, L. Shepp, A. Wyner and J. Ziv. On the Entropy of DNA: Algorithms and Measurements based on Memory and Rapid Convergence. In Proc. of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 1995.

S. A. Savari. Average Case Analysis of Five Two-Dimensional Bubble Sorting Algorithms. In Proc. of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, Velen, Germany, June 1993.

S. A. Savari. Capability Analysis of Distributed Switching Systems in Interprocessor Communications. In Proc. of TriComm '91, Chapel Hill, NC, April 1991.