Alon Orlitsky

According to our database, Alon Orlitsky authored at least 125 papers between 1984 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Linear Regression using Heterogeneous Data Batches.

Ayush Jain, Rajat Sen, Weihao Kong, Abhimanyu Das, Alon Orlitsky

CoRR, 2023

2022

Robust estimation algorithms don't need to know the corruption level.

Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar

CoRR, 2022

TURF: Two-Factor, Universal, Robust, Fast Distribution Learning Algorithm.

Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar

Proceedings of the International Conference on Machine Learning, 2022

2021

Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free.

Ayush Jain, Alon Orlitsky

Proceedings of the 38th International Conference on Machine Learning, 2021

Compressed Maximum Likelihood.

Yi Hao, Alon Orlitsky

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Discrete Distributions.

Yi Hao, Alon Orlitsky

CoRR, 2020

A General Method for Robust Learning from Batches.

Ayush Jain, Alon Orlitsky

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Linear-Sample Learning of Low-Rank Distributions.

Ayush Jain, Alon Orlitsky

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Distributions.

Yi Hao, Alon Orlitsky

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm.

Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

On Learning Parametric Non-Smooth Continuous Distributions.

Sudeep Kamath, Alon Orlitsky, Venkatadheeraj Pichapati, Ehsan Zobeidi

Proceedings of the IEEE International Symposium on Information Theory, 2020

Optimal Robust Learning of Discrete Distributions from Batches.

Ayush Jain, Alon Orlitsky

Proceedings of the 37th International Conference on Machine Learning, 2020

Data Amplification: Instance-Optimal Property Estimation.

Yi Hao, Alon Orlitsky

Proceedings of the 37th International Conference on Machine Learning, 2020

Optimal Sequential Maximization: One Interview is Enough!

Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati

Proceedings of the 37th International Conference on Machine Learning, 2020

Towards Competitive N-gram Smoothing.

Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky, Venkatadheeraj Pichapati

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Robust Learning of Discrete Distributions from Batches.

Ayush Jain, Alon Orlitsky

CoRR, 2019

Unified Sample-Optimal Property Estimation in Near-Linear Time.

Yi Hao, Alon Orlitsky

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

The Broad Optimality of Profile Maximum Likelihood.

Yi Hao, Alon Orlitsky

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Doubly-Competitive Distribution Estimation.

Yi Hao, Alon Orlitsky

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Maximum Selection and Sorting with Adversarial Comparators.

Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

J. Mach. Learn. Res., 2018

Data Amplification: A Unified and Competitive Approach to Property Estimation.

Yi Hao, Alon Orlitsky, Ananda Theertha Suresh, Yihong Wu

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

On Learning Markov Chains.

Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Adaptive Estimation of Generalized Distance to Uniformity.

Yi Hao, Alon Orlitsky

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

The Limits of Maxing, Ranking, and Preference Learning.

Moein Falahatgar, Ayush Jain, Alon Orlitsky, Venkatadheeraj Pichapati, Vaishakh Ravindrakumar

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Estimating Renyi Entropy of Discrete Distributions.

Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi

IEEE Trans. Inf. Theory, 2017

The power of absolute discounting: all-dimensional distribution estimation.

Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky, Venkatadheeraj Pichapati

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Maxing and Ranking with Few Assumptions.

Moein Falahatgar, Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati, Vaishakh Ravindrakumar

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Maximum Selection and Ranking under Noisy Comparisons.

Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh

Proceedings of the 34th International Conference on Machine Learning, 2017

A Unified Maximum Likelihood Approach for Estimating Symmetric Properties of Discrete Distributions.

Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

A Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation.

Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh

Electron. Colloquium Comput. Complex., 2016

Maximum Selection and Sorting with Adversarial Comparators and an Application to Density Estimation.

Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

CoRR, 2016

Near-Optimal Smoothing of Structured Conditional Probability Matrices.

Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Learning Markov distributions: Does estimation trump compression?

Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh

Proceedings of the IEEE International Symposium on Information Theory, 2016

Estimating the number of defectives with group testing.

Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

String Reconstruction from Substring Compositions.

Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan

SIAM J. Discret. Math., 2015

Competitive Distribution Estimation.

Alon Orlitsky, Ananda Theertha Suresh

CoRR, 2015

The Complexity of Estimating Rényi Entropy.

Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Competitive Distribution Estimation: Why is Good-Turing Good.

Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Universal compression of power-law distributions.

Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh

Proceedings of the IEEE International Symposium on Information Theory, 2015

On Learning Distributions from their Samples.

Sudeep Kamath, Alon Orlitsky, Dheeraj Pichapati, Ananda Theertha Suresh

Proceedings of The 28th Conference on Learning Theory, 2015

Faster Algorithms for Testing under Conditional Sampling.

Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Universal compression of Gaussian sources with unknown parameters.

Alon Orlitsky, Narayana P. Santhanam

CoRR, 2014

Universal Compression of Envelope Classes: Tight Characterization via Poisson Sampling.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

CoRR, 2014

Near-Optimal-Sample Estimators for Spherical Gaussian Mixtures.

Ananda Theertha Suresh, Alon Orlitsky, Jayadev Acharya, Ashkan Jafarpour

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Sublinear algorithms for outlier detection and generalized closeness testing.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Poissonization and universal compression of envelope classes.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Efficient compression of monotone and m-modal distributions.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Sorting with adversarial comparators and application to density estimation.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Quadratic-backtracking algorithm for string reconstruction from substring compositions.

Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Guest Editorial: In-Network Computation: Exploring the Fundamental Limits.

Panganamala Ramana Kumar, Eyal Kushilevitz, D. Manjunath, Muriel Médard, Alon Orlitsky, R. Srikant

IEEE J. Sel. Areas Commun., 2013

Tight bounds for universal compression of large alphabets.

Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Optimal Probability Estimation with Applications to Prediction and Classification.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the COLT 2013, 2013

A Competitive Test for Uniformity of Monotone Distributions.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, 2013

2012

Competitive Classification and Closeness Testing.

Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh

Proceedings of the COLT 2012, 2012

Tight Bounds on Profile Redundancy and Distinguishability.

Jayadev Acharya, Hirakendu Das, Alon Orlitsky

Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

On the query computation and verification of functions.

Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Estimating multiple concurrent processes.

Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Competitive Closeness Testing.

Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan

Proceedings of the COLT 2011, 2011

Algebraic computation of pattern maximum likelihood.

Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Expected query complexity of symmetric boolean functions.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Silence-based communication.

Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky

IEEE Trans. Inf. Theory, 2010

Classification using pattern probability estimators.

Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam

Proceedings of the IEEE International Symposium on Information Theory, 2010

Exact calculation of pattern probabilities.

Jayadev Acharya, Hirakendu Das, Hosein Mohimani, Alon Orlitsky, Shengjun Pan

Proceedings of the IEEE International Symposium on Information Theory, 2010

On reconstructing a string from its substring compositions.

Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Recent results on pattern maximum likelihood.

Jayadev Acharya, Alon Orlitsky, Shengjun Pan

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

The maximum likelihood probability of unique-singleton, ternary, and length-7 patterns.

Shengjun Pan, Jayadev Acharya, Alon Orlitsky

Proceedings of the IEEE International Symposium on Information Theory, 2009

The maximum likelihood probability of skewed patterns.

Alon Orlitsky, Shengjun Pan

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Further results on relative redundancy.

Hirakendu Das, Alon Orlitsky, Narayana P. Santhanam, Junan Zhang

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Population estimation with performance guarantees.

Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan

Proceedings of the IEEE International Symposium on Information Theory, 2007

Single versus multiple rounds for distributed function computation.

Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Limit Results on Pattern Entropy.

Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang

IEEE Trans. Inf. Theory, 2006

Universal Compression of Markov and Related Sources Over Arbitrary Alphabets.

Anand K. Dhulipala, Alon Orlitsky

IEEE Trans. Inf. Theory, 2006

Theoretical and Experimental Results on Modeling Low Probabilities.

Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Relative redundancy for large alphabets.

Alon Orlitsky, Narayana Santhanam, Junan Zhang

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Silence Based Communication for Sensor Networks.

Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Modifying Distances.

Alon Orlitsky

Proceedings of the Semi-Supervised Learning, 2006

2005

Stopping set distribution of LDPC code ensembles.

Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang

IEEE Trans. Inf. Theory, 2005

A lower bound on compression of unknown alphabets.

Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam

Theor. Comput. Sci., 2005

Innovation and pattern entropy of stationary processes.

Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Narayana Zhang

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Convergence of profile based estimators.

Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Junan Zhang

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Supervised dimensionality reduction using mixture models.

Sajama, Alon Orlitsky

Proceedings of the Machine Learning, 2005

Estimating and computing density based distance metrics.

Sajama, Alon Orlitsky

Proceedings of the Machine Learning, 2005

2004

Universal compression of memoryless sources over unknown alphabets.

Alon Orlitsky, Narayana P. Santhanam, Junan Zhang

IEEE Trans. Inf. Theory, 2004

Speaking of infinity [i.i.d. strings].

Alon Orlitsky, Narayana P. Santhanam

IEEE Trans. Inf. Theory, 2004

On Modeling Profiles Instead of Values.

Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang

Proceedings of the UAI '04, 2004

Semi-parametric Exponential Family PCA.

Sajama, Alon Orlitsky

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Relative redundancy: a more stringent performance guarantee for universal compression.

Alon Orlitsky, Narayana P. Santhanam, Junan Zhang

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Algorithms for modeling distributions over large alphabets.

Alon Orlitsky, Sajama, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On the redundancy of HMM patterns.

Anand K. Dhulipala, Alon Orlitsky

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

One-way communication and error-correcting codes.

Alon Orlitsky, Krishnamurthy Viswanathan

IEEE Trans. Inf. Theory, 2003

On Nearest-Neighbor Error-Correcting Output Codes with Application to All-Pairs Multiclass Support Vector Machines.

Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky

J. Mach. Learn. Res., 2003

Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers.

Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky

Proceedings of the Machine Learning, 2003

Always Good Turing: Asymptotically Optimal Probability Estimation.

Alon Orlitsky, Narayana P. Santhanam, Junan Zhang

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Performance of universal codes over infinite alphabets.

Alon Orlitsky, Narayana P. Santhanam

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

Universal Coding of Zipf Distributions.

Yoav Freund, Alon Orlitsky, Prasad Santhanam, Junan Zhang

Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002

Scalar versus vector quantization: Worst case analysis.

Alon Orlitsky

IEEE Trans. Inf. Theory, 2002

Combined binary classifiers with applications to speech recognition.

Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky

Proceedings of the 7th International Conference on Spoken Language Processing, ICSLP2002, 2002

2001

Coding for computing.

Alon Orlitsky, James R. Roche

IEEE Trans. Inf. Theory, 2001

On codes that avoid specified differences.

Bruce E. Moision, Alon Orlitsky, Paul H. Siegel

IEEE Trans. Inf. Theory, 2001

2000

Server-assisted speech recognition over the Internet.

Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky

Proceedings of the IEEE International Conference on Acoustics, 2000

1998

Zero-Error Information Theory.

János Körner, Alon Orlitsky

IEEE Trans. Inf. Theory, 1998

Design of Shapes for Precise Image Registration.

Alfred M. Bruckstein, Lawrence O'Gorman, Alon Orlitsky

IEEE Trans. Inf. Theory, 1998

1996

Source coding and graph entropies.

Noga Alon, Alon Orlitsky

IEEE Trans. Inf. Theory, 1996

On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures.

Alon Orlitsky, Santosh S. Venkatesh

Discret. Appl. Math., 1996

1995

Vector Analysis of Threshold Functions

Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath

Inf. Comput., July, 1995

Repeated communication and Ramsey graphs.

Noga Alon, Alon Orlitsky

IEEE Trans. Inf. Theory, 1995

1994

Lower bounds on threshold and related circuits via communication complexity.

Vwani P. Roychowdhury, Alon Orlitsky, Kai-Yeung Siu

IEEE Trans. Inf. Theory, 1994

A lower bound on the expected length of one-to-one codes.

Noga Alon, Alon Orlitsky

IEEE Trans. Inf. Theory, 1994

1993

Three results on interactive communication.

Moni Naor, Alon Orlitsky, Peter W. Shor

IEEE Trans. Inf. Theory, 1993

Privacy, additional information and communication.

Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky

IEEE Trans. Inf. Theory, 1993

Interactive Communication of Balanced Distributions and of Correlated Files.

Alon Orlitsky

SIAM J. Discret. Math., 1993

Asymptotic Component Densities in Programmable Gate Arrays Realizing All Circuits of a Given Size.

Toby Berger, A. Hekstra, Alon Orlitsky

Algorithmica, 1993

1992

Average-case interactive communication.

Alon Orlitsky

IEEE Trans. Inf. Theory, 1992

1991

Worst-case interactive communication - II: Two messages are not optimal.

Alon Orlitsky

IEEE Trans. Inf. Theory, 1991

Interactive Communication: Balanced Distributions, Correlated Files, and Average-Case Complexity

Alon Orlitsky

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

A Geometric Approach to Threshold Circuit Complexity.

Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990

Average and randomized communication complexity.

Alon Orlitsky, Abbas El Gamal

IEEE Trans. Inf. Theory, 1990

Worst-case interactive communication I: Two messages are almost optimal.

Alon Orlitsky

IEEE Trans. Inf. Theory, 1990

A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits.

Yigal Brandman, Alon Orlitsky, John L. Hennessy

IEEE Trans. Computers, 1990

Two Messages are Almost Optimal for Conveying Information.

Alon Orlitsky

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

On the Circuit Complexity of Neural Networks.

Vwani P. Roychowdhury, Alon Orlitsky, Kai-Yeung Siu, Thomas Kailath

Proceedings of the Advances in Neural Information Processing Systems 3, 1990

1989

Feeback in Discrete Communication.

Alon Orlitsky

Proceedings of the Distributed Computing And Cryptography, 1989

1988

Self-avoiding random loops.

Lester E. Dubins, Alon Orlitsky, James A. Reeds, Lawrence A. Shepp

IEEE Trans. Inf. Theory, 1988

1984

Communication with Secrecy Constraints

Alon Orlitsky, Abbas El Gamal

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Interactive Data Comparison

Abbas El Gamal, Alon Orlitsky

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984