Alon Orlitsky - Publications

  1. Communication with secrecy constraints, A. Orlitsky and A. El Gamal, Proc. 16th ACM Symposium on Theory of Computing, May 1984, pp. 217-224.
  2. Interactive data compression, A. Orlitsky and A. El Gamal, Proc. 25th IEEE Symposium on Foundations of Computer Science, October 1984, pp. 100-108.
  3. Communication complexity, A. Orlitsky and A. El Gamal, Complexity in Information Theory, Y. Abu Mustafa (editor), Springer-Verlag, 1986, pp. 16-61.
  4. Communication issues in distributed computing, A. Orlitsky, Ph.D. Thesis, Electrical Engineering Department, Stanford University, 1986.
  5. Self-avoiding random loops, L. A. Dubins, A. Orlitsky, J. A. Reeds and L. A. Shepp, IEEE Trans. Information Theory,, IT-34:6 (November 1988), pp. 1509-1516.
  6. On the evolution of islands, P. G. Doyle, C. Mallows, A. Orlitsky and L. A. Shepp, Israel Journal of Math, 67:1 (1989), pp. 34-41.
  7. Feedback in discrete communication, A. Orlitsky, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 2: Distributed Computing and Cryptography, J. Feigenbaum and M. Merritt (editors), AMS-ACM, 1989, pp. 213-228.
  8. On curbing virus propagation, A. Orlitsky and L. A. Shepp, BL011217-891218-21TM, 1989.
  9. Average and randomized communication complexity, A. Orlitsky and A. El Gamal, IEEE Trans. Information Theory, 36:1 (1990), pp. 3-16.
  10. Monte carlo generation of self-avoiding walks with fixed endpoints and fixed length, N. Madras, A. Orlitsky and L. A. Shepp, Journal of Statistical Physics, 58 (1990), pp. 159-183.
  11. A spectral lower bound technique for the size of decision trees and two-level and/or circuits, Y. Brandman, A. Orlitsky and J. Hennessy, IEEE Tran. on Computers, 39:2 (1990), pp. 282-287.
  12. Worst-case interactive communication I: Two messages are almost optimal, A. Orlitsky, IEEE Trans. on Information Theory, 36 (5) (1990), pp. 1111-1126.
  13. Worst-case interactive communication II: Two messages are not optimal, A. Orlitsky, IEEE Trans. on Information Theory, 37:4 (July 1991), pp. 995-1005.
  14. Counting intermodulation products for AMPS cellular radio frequency assignments, J. E. Mazo and A. Orlitsky, BL011217-920207-02TM, 1992.
  15. Average-case interactive communication, A. Orlitsky, IEEE Trans. on Information Theory, 38:4 (July 1992), pp. 1534-1547.
  16. Secrecy enhancement via public discussion, A. Orlitsky and A. Wigderson, IEEE Int'l Symp. on Inf. Theory, January 1993.
  17. Asymptotic component densities in programmable gate arrays realizing all circuits of a given size, T. Berger, H. Hekstra and A. Orlitsky, Algorithmica, 9:2 (February 1993), pp. 101-127.
  18. On data compression with side information, A. Orlitsky, IEEE Int'l Information Theory Workshop, 1993.
  19. Three results on interactive communication, M. Naor, A. Orlitsky and P. Shor, IEEE Trans. Information Theory, 39:5 (September 1993), pp. 1608-1615.
  20. Interactive communication of balanced distributions and of correlated files, A. Orlitsky, SIAM J. of Dis. Math., 6:4 (November 1993), pp. 548-564.
  21. Privacy, additional information, and communication, R. Bar-Yehuda, B. Chor, E. Kushilevitz and A. Orlitsky, IEEE Trans. Information Theory, 39:6 (November 1993), pp. 1930-1943.
  22. Lower bounds on threshold and related circuits via communication complexity, V. P. Roychowdhury, A. Orlitsky and K. Y. Siu, IEEE Trans. on Inf. Theory, 4:2 (March 1994), pp. 467-474.
  23. Neural models and spectral methods, V. P. Roychowdhury, K. Y. Siu and A. Orlitsky, Theoretical Advances in Neural Computation and Learning, V. P. Roychowdhury, K. Y. Siu and A. Orlitsky (editors), Kluwer Academic Publishing, 1994.
  24. A lower bound on the expected length of one-to-one codes, N. Alon and A. Orlitsky, IEEE Trans. on Inf. Theory, 38:4 (September 1994), pp. 1670-1672.
  25. Vector analysis of threshold functions, V. Roychowdhury, K. Y. Siu, A. Orlitsky and T. Kailath, Information and Computation, 120:1 (July 1995), pp. 22-31.
  26. Repeated communication and self-complementary ramsey graphs, N. Alon and A. Orlitsky, IEEE Trans. on Inf. Theory, 41:5 (September 1995), pp. 1276-1289.
  27. Coding for computing, A. Orlitsky and J. R. Roche, 36th Annual Symposium on Foundations of Computer Science, November 1995, pp. 502-511.
  28. Design of shapes for precise image registration, A. M. Bruckstein, A. Orlitsky and L. O'Gorman, IEEE Trans. Information Theory, Submitted 1995.
  29. Source coding and graphs entropies, N. Alon and A. Orlitsky, IEEE Trans. on Information Theory, To appear, 1996.
  30. On edge-colored interior planar graphs on a circle and the expected number of RNA secondary structures, A. Orlitsky and S. S. Venkatesh, Discrete Applied Math., 64:2 (January 1996).
  31. Two UNIX privacy flaws, A. Orlitsky, E. Telatar and, BL011317-96031909TM,.
  32. Corrrecting peak shifts using binary codes, A. Orlitsky, In Preparation 1995.
  33. On the communication complexity of relations, A. Orlitsky, In Preparation 1995.
  34. A discrete approach to quantization and source coding, A. Orlitsky, In preparation 1995.
  35. Theoretical advances in neural computation and learning, V. P. Roychowdhury, K. Y. Siu and A. Orlitsky, editors, Kluwer Academic Publishing, 1994.
  36. Interactive data compression, A. El Gamal and A. Orlitsky, IEEE International Symposium on Information Theory, June 1985.
  37. Communication complexity, A. Orlitsky and A. El Gamal, IEEE International Symposium on Information Theory, October 1986.
  38. Optimal computer organization for basic machine models, T. Berger, A. Hekstra and A. Orlitsky, IEEE Int'l Symp. on Inf. Theory, June 1988.
  39. Feedback in discrete communication, IEEE Int'l Symp. on Inf. Theory, January 1990.
  40. Two messages are almost optimal for conveying information, A. Orlitsky, Proceedings of the 9th Annual ACM Symp. on Principles of Distributed Computing, August 1990, pp. 219-232.
  41. Improved bounds on interactive communication, A. Orlitsky and M. Naor, IEEE int'l Symp. on Inf. Theory, June 1991.
  42. Interactive communication of balanced distributions, A. Orlitsky, IEEE Int'l Symp. on Inf. Theory, June 1991.
  43. Interactive communication: balanced distributions, correlated files, and average-case complexity, A. Orlitsky, Proc. 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 228-238.
  44. On the circuit complexity of neural networks, V. P. Roychowdhury, K. Y. Siu, A. Orlitsky and T. Kailath, Advances in Neural Information Processing Systems 3, R. P. Lippmann, J. E. Moody and D. S. Touretzky (editors), Morgan Kaufman Publishers, Inc., 1991, pp. 953-959.
  45. A geometric approach to threshold-circuit complexity, V. P. Roychowdhury, K. Y. Siu, A. Orlitsky and T. Kailath, Proceedings of the 4th Annual Workshop on Computational Learning Theory, L. G. Valiant and M. K. Warmuth (editors), Morgan Kaufman Publishers, Inc., 1991, pp. 97-111.
  46. Average-case interactive communication, A. Orlitsky, Sequences II, R. Capocelli, A. De Santis and U. Vaccaro (editors), Springer-Verlag, 1991, pp. 79-103.
  47. Data compression with side information and graph entropy, A. Orlitsky, IEEE Int'l Symp. on Inf. Theory, January 1993.
  48. Zero-error channel and source coding, N. Alon and A. Orlitsky, IEEE Int'l Symp. on Inf. Theory, June 1994.
  49. A lower bound on the expected length of one-to-one codes, N. Alon and A. Orlitsky, IEEE Int'l Symp. on Inf. Theory, June 1994.
  50. Open and solved graph problems in data compression, A. Orlitsky, Hypergraphs and Symmetric Structures Janos Bolyai Math. Soc., June 1995.
  51. Coding for computing, A. Orlitsky and J. R. Roche, IEEE Int's Symp. on Inf. Theory, September 1995.