bibliography savari


  1. S. A. Savari, Capability Analysis of Distributed Switching Systems in Interprocessor Communications, Proceedings of TriComm 91, April 1991.
  2. S. A. Savari and R. G. Gallager, Arithmetic Coding for Memoryless Cost Channels, Proceedings of the 1992 IEEE Data Compression Conference, March 1992.
  3. S. A. Savari, Average Case Analysis of Five Two-Dimensional Bubble Sorting Algorithms, Proceedings Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, June 1993.
  4. S. A. Savari and R. G. Gallager, Arithmetic Coding for Finite-State Noiseless Channels, IEEE Transactions on Information Theory, Vol. 40, 1, pp. 100--107, January 1994.
  5. S. A. Savari, Some Notes on Varn Coding, IEEE Transactions on Information Theory, Vol. 40, 1, pp. 181--186, January 1994.
  6. S. A. Savari and R. G. Gallager, Variable-to-Fixed Length Codes for Sources with Memory, Proceedings 1994 IEEE International Symposium on Information Theory, June 1994.
  7. M. Farach M. Noordewier S. Savari L. Shepp A. Wyner J. Ziv, On the Entropy of DNA: Algorithms and Measurements based on Memory and Rapid Convergence, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1995.
  8. S. A. Savari, Variable-to-Fixed Length Codes and the Conservation of Entropy, Proceedings 1995 IEEE International Symposium on Information Theory, September 1995.
  9. S. A. Savari and D. P. Bertsekas, Finite Termination of Asynchronous Iterative Algorithms, Parallel Computing, Vol. 22, pp. 39--56, 1996.
  10. S. A. Savari, Redundancy of the Lempel-Ziv Incremental Parsing Rule, IEEE Transactions on Information Theory, Vol. 43, 1, pp. 9--21, January 1997.
  11. S. A. Savari and R. G. Gallager, Generalized Tunstall Codes for Sources with Memory, IEEE Transactions on Information Theory, Vol. 43, 2, pp. 658--668, March 1997.
  12. S. A. Savari, Redundancy of the Lempel-Ziv-Welch Code, Proceedings of the 1997 IEEE Data Compression Conference, March 1997.
  13. S. A. Savari, A Probabilistic Approach to Some Asymptotics in Source Coding, Proceedings of Compression and Complexity of SEQUENCES 1997, June 1997.
  14. S. A. Savari, Redundancy of the Lempel-Ziv Codes, Proceedings of the 1997 IEEE International Symposium on Information Theory, July 1997.
  15. S. A. Savari, Redundancy of the Lempel-Ziv String Matching Code, IEEE Transactions on Information Theory, Vol. 44, 2, pp. 787--791, March 1998.
  16. S. A. Savari, Variable-to-Fixed Length Codes for Predictable Sources, Proceedings of the 1998 IEEE Data Compression Conference, March 1998.
  17. S. A. Savari, Predictable Sources and Renewal Theory, Proceedings of the 1998 IEEE International Symposium on Information Theory, August 1998.
  18. S. A. Savari, Variable-to-Fixed Length Codes and Plurally Parsable Dictionaries, Proceedings of the 1999 IEEE Data Compression Conference, March 1998.
  19. S. A. Savari, Variable-to-Fixed Length Codes and the Conservation of Entropy, IEEE Transactions on Information Theory, Vol. 45, 5, pp. 1612--1620, July 1999.
  20. S. A. Savari, Variable-to-Fixed Length Codes and Plurally Parsable Dictionaries, Proceedings of the 1999 IEEE International Symposium on Information Theory, June 1999.
  21. S. Savari and E. Telatar, The Behavior of Stochastic Processes Arising in Window Protocols, Proceedings of the 1999 IEEE International Symposium on Information Theory, June 1999.
  22. S. A. Savari, Redundancy of the Lempel-Ziv Codes, Proceedings of the 37th Annual Allerton Conference on Communication Control and Computing, September 1999.
  23. S. Savari and C. Young, Comparing and Combining Profiles, Proceedings of the 2nd Workshop on Feedback-Directed Optimization, November 1999.
  24. S. Savari and E. Telatar, The Behavior of Certain Stochastic Processes Arising in Window Protocols, Proceedings of the 1999 IEEE Global Telecommunications Conference, December 1999.
  25. S. Savari and C. Young, Comparing and Combining Profiles, Journal of Instruction-Level Parallelism, Vol. 2, May 2000.
  26. S. A. Savari, A Probabilistic Approach to Some Asymptotics in Noiseless Communication, IEEE Transactions on Information Theory, Vol. 46, 4, pp. 1246--1262, July 2000.
  27. S. A. Savari, Renewal Theory and Source Coding, Proceedings of the IEEE, Vol. 88, 11, pp. 1692--1702, November 2000.
  28. G. Kramer J. E. Mazo S. A. Savari, Eulogy for Claude Elwood Shannon, ACM SIGMOBILE Mobile Computing and Communications Review, Vol. 5, 1, pp. 1, January 2001.
  29. S. Dorward D. Huang S. A. Savari G. Schuller B. Yu, Low Delay Perceptually Lossless Coding of Audio Signals, Proceedings of the 1999 IEEE Data Compression Conference, March 2001.
  30. G. Kramer and S. A. Savari, Quantum Data Compression of Ensembles of Mixed States with Commuting Density Operators, 966th AMS Meeting, April 2001.
  31. V. K Goyal S. A. Savari and W. Wang, Optimal Permutation Codes for Uniform Sources, Proceedings of the 2001 IEEE International Symposium on Information Theory, June 2001.
  32. S. A. Savari and P. Winkler, Information about Information, Proceedings of the 2001 IEEE International Symposium on Information Theory, June 2001.
  33. V. K Goyal S. A. Savari and W. Wang, On Optimal Permutation Codes, IEEE Transactions on Information Theory, Vol. 47, 7, pp. 2961--2971, November 2001.
  34. S. A. Savari, An Example of Complexity, Proceedings Workshop on Concepts in Information Theory, June 2002.
  35. G. Kramer and S. A. Savari, Quantum Data Compression with Commuting Density Operators, Proceedings of the 2002 IEEE International Symposium on Information Theory, June 2002.
  36. S. A. Savari and W. Szpankowski, On the Analysis of Variable-to-Variable Length Codes, Proceedings of the 2002 IEEE International Symposium on Information Theory, June 2002.
  37. S. Savari and P. Winkler, Information about Information, submitted.
  38. S. A. Savari and W. Szpankowski, On the Analysis of Variable-to-Variable Length Codes, submitted.
  39. G. Kramer and S. A. Savari, Communicating Probability Distributions as Compressed Quantum Information, submitted.
  40. S. A. Savari, Concurrent Processes and the Interchange Entropy, submitted.
  41. S. A. Savari, On Compressing Interchange Classes of Events in a Concurrent System, submitted.
Go to the Computing Sciences Research Center home page.
Modified: December, 1997.
 Copyright © 1997 Lucent Technologies. All rights reserved.