Alon Orlitsky - RankMe

145 papers A* 36A 4B 33Misc 1Journal 60Unranked 10

Year	Rank	Type	Title / Venue / Authors
2024	A*	`conf`	Linear Regression using Heterogeneous Data Batches. NeurIPS Ayush Jain, Rajat Sen, Weihao Kong, Abhimanyu Das, Alon Orlitsky
2023	J	`jnl`	Linear Regression using Heterogeneous Data Batches. CoRR Ayush Jain, Rajat Sen, Weihao Kong, Abhimanyu Das, Alon Orlitsky
2022	J	`jnl`	Robust estimation algorithms don't need to know the corruption level. CoRR Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar
2022	J	`jnl`	TURF: A Two-factor, Universal, Robust, Fast Distribution Learning Algorithm. CoRR Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar
2022	A*	`conf`	TURF: Two-Factor, Universal, Robust, Fast Distribution Learning Algorithm. ICML Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar
2021	A*	`conf`	Compressed Maximum Likelihood. ICML Yi Hao, Alon Orlitsky
2021	A*	`conf`	Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free. ICML Ayush Jain, Alon Orlitsky
2020	A*	`conf`	A General Method for Robust Learning from Batches. NeurIPS Ayush Jain, Alon Orlitsky
2020	J	`jnl`	A General Method for Robust Learning from Batches. CoRR Ayush Jain, Alon Orlitsky
2020	A*	`conf`	Data Amplification: Instance-Optimal Property Estimation. ICML Yi Hao, Alon Orlitsky
2020	A*	`conf`	Linear-Sample Learning of Low-Rank Distributions. NeurIPS Ayush Jain, Alon Orlitsky
2020	J	`jnl`	Linear-Sample Learning of Low-Rank Distributions. CoRR Ayush Jain, Alon Orlitsky
2020	B	`conf`	On Learning Parametric Non-Smooth Continuous Distributions. ISIT Sudeep Kamath, Alon Orlitsky, Venkatadheeraj Pichapati, Ehsan Zobeidi
2020	A*	`conf`	Optimal Robust Learning of Discrete Distributions from Batches. ICML Ayush Jain, Alon Orlitsky
2020	A*	`conf`	Optimal Sequential Maximization: One Interview is Enough! ICML Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati
2020	J	`jnl`	Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Discrete Distributions. CoRR Yi Hao, Alon Orlitsky
2020	A*	`conf`	Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Distributions. NeurIPS Yi Hao, Alon Orlitsky
2020	A*	`conf`	SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm. NeurIPS Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar
2020	J	`jnl`	SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm. CoRR Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar
2020	A	`conf`	Towards Competitive N-gram Smoothing. AISTATS Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky, Venkatadheeraj Pichapati
2019	J	`jnl`	Data Amplification: A Unified and Competitive Approach to Property Estimation. CoRR Yi Hao, Alon Orlitsky, Ananda Theertha Suresh, Yihong Wu
2019	J	`jnl`	Data Amplification: Instance-Optimal Property Estimation. CoRR Yi Hao, Alon Orlitsky
2019	A*	`conf`	Doubly-Competitive Distribution Estimation. ICML Yi Hao, Alon Orlitsky
2019	J	`jnl`	Robust Learning of Discrete Distributions from Batches. CoRR Ayush Jain, Alon Orlitsky
2019	A*	`conf`	The Broad Optimality of Profile Maximum Likelihood. NeurIPS Yi Hao, Alon Orlitsky
2019	J	`jnl`	The Broad Optimality of Profile Maximum Likelihood. CoRR Yi Hao, Alon Orlitsky
2019	A*	`conf`	Unified Sample-Optimal Property Estimation in Near-Linear Time. NeurIPS Yi Hao, Alon Orlitsky
2019	J	`jnl`	Unified Sample-Optimal Property Estimation in Near-Linear Time. CoRR Yi Hao, Alon Orlitsky
2018	B	`conf`	Adaptive Estimation of Generalized Distance to Uniformity. ISIT Yi Hao, Alon Orlitsky
2018	A*	`conf`	Data Amplification: A Unified and Competitive Approach to Property Estimation. NeurIPS Yi Hao, Alon Orlitsky, Ananda Theertha Suresh, Yihong Wu
2018	J	`jnl`	Maximum Selection and Sorting with Adversarial Comparators. J. Mach. Learn. Res. Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2018	A*	`conf`	On Learning Markov Chains. NeurIPS Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati
2018	J	`jnl`	On Learning Markov Chains. CoRR Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati
2018	A*	`conf`	The Limits of Maxing, Ranking, and Preference Learning. ICML Moein Falahatgar, Ayush Jain, Alon Orlitsky, Venkatadheeraj Pichapati, Vaishakh Ravindrakumar
2017	A*	`conf`	A Unified Maximum Likelihood Approach for Estimating Symmetric Properties of Discrete Distributions. ICML Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh
2017	J	`jnl`	Estimating Renyi Entropy of Discrete Distributions. IEEE Trans. Inf. Theory Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi
2017	A*	`conf`	Maximum Selection and Ranking under Noisy Comparisons. ICML Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh
2017	J	`jnl`	Maximum Selection and Ranking under Noisy Comparisons. CoRR Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh
2017	—	`conf`	Maxing and Ranking with Few Assumptions. NIPS Moein Falahatgar, Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati, Vaishakh Ravindrakumar
2017	—	`conf`	The power of absolute discounting: all-dimensional distribution estimation. NIPS Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky, Venkatadheeraj Pichapati
2016	J	`jnl`	A Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation. CoRR Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh
2016	J	`jnl`	A Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation. Electron. Colloquium Comput. Complex. Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh
2016	B	`conf`	Estimating the number of defectives with group testing. ISIT Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh
2016	B	`conf`	Learning Markov distributions: Does estimation trump compression? ISIT Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh
2016	J	`jnl`	Maximum Selection and Sorting with Adversarial Comparators and an Application to Density Estimation. CoRR Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2016	—	`conf`	Near-Optimal Smoothing of Structured Conditional Probability Matrices. NIPS Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky
2015	J	`jnl`	Competitive Distribution Estimation. CoRR Alon Orlitsky, Ananda Theertha Suresh
2015	—	`conf`	Competitive Distribution Estimation: Why is Good-Turing Good. NIPS Alon Orlitsky, Ananda Theertha Suresh
2015	A*	`conf`	Faster Algorithms for Testing under Conditional Sampling. COLT Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh
2015	J	`jnl`	Faster Algorithms for Testing under Conditional Sampling. CoRR Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapathi, Ananda Theertha Suresh
2015	A*	`conf`	On Learning Distributions from their Samples. COLT Sudeep Kamath, Alon Orlitsky, Dheeraj Pichapati, Ananda Theertha Suresh
2015	J	`jnl`	String Reconstruction from Substring Compositions. SIAM J. Discret. Math. Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan
2015	A*	`conf`	The Complexity of Estimating Rényi Entropy. SODA Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi
2015	J	`jnl`	Universal Compression of Power-Law Distributions. CoRR Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh
2015	B	`conf`	Universal compression of power-law distributions. ISIT Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh
2014	B	`conf`	Efficient compression of monotone and m-modal distributions. ISIT Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2014	—	`conf`	Near-Optimal-Sample Estimators for Spherical Gaussian Mixtures. NIPS Ananda Theertha Suresh, Alon Orlitsky, Jayadev Acharya, Ashkan Jafarpour
2014	J	`jnl`	Near-optimal-sample estimators for spherical Gaussian mixtures. CoRR Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2014	B	`conf`	Poissonization and universal compression of envelope classes. ISIT Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2014	B	`conf`	Quadratic-backtracking algorithm for string reconstruction from substring compositions. ISIT Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan
2014	B	`conf`	Sorting with adversarial comparators and application to density estimation. ISIT Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2014	J	`jnl`	String Reconstruction from Substring Compositions. CoRR Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan
2014	B	`conf`	Sublinear algorithms for outlier detection and generalized closeness testing. ISIT Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2014	J	`jnl`	The Complexity of Estimating Rényi Entropy. CoRR Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi
2014	J	`jnl`	Universal Compression of Envelope Classes: Tight Characterization via Poisson Sampling. CoRR Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2014	J	`jnl`	Universal compression of Gaussian sources with unknown parameters. CoRR Alon Orlitsky, Narayana P. Santhanam
2013	A	`conf`	A Competitive Test for Uniformity of Monotone Distributions. AISTATS Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2013	J	`jnl`	Guest Editorial: In-Network Computation: Exploring the Fundamental Limits. IEEE J. Sel. Areas Commun. Panganamala Ramana Kumar, Eyal Kushilevitz, D. Manjunath, Muriel Médard, Alon Orlitsky, R. Srikant
2013	A*	`conf`	Optimal Probability Estimation with Applications to Prediction and Classification. COLT Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2013	B	`conf`	Tight bounds for universal compression of large alphabets. ISIT Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
2012	A*	`conf`	Competitive Classification and Closeness Testing. COLT Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh
2012	B	`conf`	Estimating multiple concurrent processes. ISIT Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan
2012	J	`jnl`	On Modeling Profiles instead of Values CoRR Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang
2012	B	`conf`	On the query computation and verification of functions. ISIT Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh
2012	—	`conf`	Tight Bounds on Profile Redundancy and Distinguishability. NIPS Jayadev Acharya, Hirakendu Das, Alon Orlitsky
2011	B	`conf`	Algebraic computation of pattern maximum likelihood. ISIT Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan
2011	A*	`conf`	Competitive Closeness Testing. COLT Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan
2011	—	`conf`	Expected query complexity of symmetric boolean functions. Allerton Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky
2010	B	`conf`	Classification using pattern probability estimators. ISIT Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam
2010	B	`conf`	Exact calculation of pattern probabilities. ISIT Jayadev Acharya, Hirakendu Das, Hosein Mohimani, Alon Orlitsky, Shengjun Pan
2010	B	`conf`	On reconstructing a string from its substring compositions. ISIT Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan
2010	J	`jnl`	Silence-based communication. IEEE Trans. Inf. Theory Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky
2009	B	`conf`	Recent results on pattern maximum likelihood. ITW Jayadev Acharya, Alon Orlitsky, Shengjun Pan
2009	B	`conf`	The maximum likelihood probability of skewed patterns. ISIT Alon Orlitsky, Shengjun Pan
2009	B	`conf`	The maximum likelihood probability of unique-singleton, ternary, and length-7 patterns. ISIT Shengjun Pan, Jayadev Acharya, Alon Orlitsky
2008	B	`conf`	Further results on relative redundancy. ISIT Hirakendu Das, Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
2007	B	`conf`	Population estimation with performance guarantees. ISIT Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan
2007	B	`conf`	Single versus multiple rounds for distributed function computation. ISIT Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky
2006	J	`jnl`	Limit Results on Pattern Entropy. IEEE Trans. Inf. Theory Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang
2006	—	`ch.`	Modifying Distances. Semi-Supervised Learning Alon Orlitsky
2006	B	`conf`	Relative redundancy for large alphabets. ISIT Alon Orlitsky, Narayana Santhanam, Junan Zhang
2006	B	`conf`	Silence Based Communication for Sensor Networks. ISIT Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky
2006	B	`conf`	Theoretical and Experimental Results on Modeling Low Probabilities. ITW Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang
2006	J	`jnl`	Universal Compression of Markov and Related Sources Over Arbitrary Alphabets. IEEE Trans. Inf. Theory Anand K. Dhulipala, Alon Orlitsky
2005	J	`jnl`	A lower bound on compression of unknown alphabets. Theor. Comput. Sci. Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam
2005	B	`conf`	Convergence of profile based estimators. ISIT Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Junan Zhang
2005	A*	`conf`	Estimating and computing density based distance metrics. ICML Sajama, Alon Orlitsky
2005	B	`conf`	Innovation and pattern entropy of stationary processes. ISIT Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Narayana Zhang
2005	J	`jnl`	Stopping set distribution of LDPC code ensembles. IEEE Trans. Inf. Theory Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang
2005	A*	`conf`	Supervised dimensionality reduction using mixture models. ICML Sajama, Alon Orlitsky
2004	B	`conf`	Algorithms for modeling distributions over large alphabets. ISIT Alon Orlitsky, Sajama, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang
2004	B	`conf`	Limit results on pattern entropy. ITW Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang
2004	A	`conf`	On Modeling Profiles Instead of Values. UAI Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang
2004	B	`conf`	On the redundancy of HMM patterns. ISIT Anand K. Dhulipala, Alon Orlitsky
2004	B	`conf`	Relative redundancy: a more stringent performance guarantee for universal compression. ISIT Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
2004	—	`conf`	Semi-parametric Exponential Family PCA. NIPS Sajama, Alon Orlitsky
2004	J	`jnl`	Speaking of infinity [i.i.d. strings]. IEEE Trans. Inf. Theory Alon Orlitsky, Narayana P. Santhanam
2004	J	`jnl`	Universal compression of memoryless sources over unknown alphabets. IEEE Trans. Inf. Theory Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
2003	A*	`conf`	Always Good Turing: Asymptotically Optimal Probability Estimation. FOCS Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
2003	A*	`conf`	Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers. ICML Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
2003	J	`jnl`	On Nearest-Neighbor Error-Correcting Output Codes with Application to All-Pairs Multiclass Support Vector Machines. J. Mach. Learn. Res. Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
2003	J	`jnl`	One-way communication and error-correcting codes. IEEE Trans. Inf. Theory Alon Orlitsky, Krishnamurthy Viswanathan
2003	B	`conf`	Performance of universal codes over infinite alphabets. DCC Alon Orlitsky, Narayana P. Santhanam
2003	A*	`conf`	Universal Coding of Zipf Distributions. COLT Yoav Freund, Alon Orlitsky, Prasad Santhanam, Junan Zhang
2002	A	`conf`	Combined binary classifiers with applications to speech recognition. INTERSPEECH Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
2002	J	`jnl`	Scalar versus vector quantization: Worst case analysis. IEEE Trans. Inf. Theory Alon Orlitsky
2001	J	`jnl`	Coding for computing. IEEE Trans. Inf. Theory Alon Orlitsky, James R. Roche
2001	J	`jnl`	On codes that avoid specified differences. IEEE Trans. Inf. Theory Bruce E. Moision, Alon Orlitsky, Paul H. Siegel
2000	Misc	`conf`	Server-assisted speech recognition over the Internet. ICASSP Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
1998	J	`jnl`	Design of Shapes for Precise Image Registration. IEEE Trans. Inf. Theory Alfred M. Bruckstein, Lawrence O'Gorman, Alon Orlitsky
1998	J	`jnl`	Zero-Error Information Theory. IEEE Trans. Inf. Theory János Körner, Alon Orlitsky
1996	J	`jnl`	On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures. Discret. Appl. Math. Alon Orlitsky, Santosh S. Venkatesh
1996	J	`jnl`	Source coding and graph entropies. IEEE Trans. Inf. Theory Noga Alon, Alon Orlitsky
1995	A*	`conf`	Coding for Computing. FOCS Alon Orlitsky, James R. Roche
1995	J	`jnl`	Repeated communication and Ramsey graphs. IEEE Trans. Inf. Theory Noga Alon, Alon Orlitsky
1995	J	`jnl`	Vector Analysis of Threshold Functions Inf. Comput. Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath
1994	J	`jnl`	A lower bound on the expected length of one-to-one codes. IEEE Trans. Inf. Theory Noga Alon, Alon Orlitsky
1994	J	`jnl`	Lower bounds on threshold and related circuits via communication complexity. IEEE Trans. Inf. Theory Vwani P. Roychowdhury, Alon Orlitsky, Kai-Yeung Siu
1993	J	`jnl`	Asymptotic Component Densities in Programmable Gate Arrays Realizing All Circuits of a Given Size. Algorithmica Toby Berger, A. Hekstra, Alon Orlitsky
1993	J	`jnl`	Interactive Communication of Balanced Distributions and of Correlated Files. SIAM J. Discret. Math. Alon Orlitsky
1993	J	`jnl`	Privacy, additional information and communication. IEEE Trans. Inf. Theory Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky
1993	J	`jnl`	Three results on interactive communication. IEEE Trans. Inf. Theory Moni Naor, Alon Orlitsky, Peter W. Shor
1992	J	`jnl`	Average-case interactive communication. IEEE Trans. Inf. Theory Alon Orlitsky
1991	A*	`conf`	A Geometric Approach to Threshold Circuit Complexity. COLT Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath
1991	A*	`conf`	Interactive Communication: Balanced Distributions, Correlated Files, and Average-Case Complexity FOCS Alon Orlitsky
1991	J	`jnl`	Worst-case interactive communication - II: Two messages are not optimal. IEEE Trans. Inf. Theory Alon Orlitsky
1990	J	`jnl`	A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits. IEEE Trans. Computers Yigal Brandman, Alon Orlitsky, John L. Hennessy
1990	J	`jnl`	Average and randomized communication complexity. IEEE Trans. Inf. Theory Alon Orlitsky, Abbas El Gamal
1990	—	`conf`	On the Circuit Complexity of Neural Networks. NIPS Vwani P. Roychowdhury, Alon Orlitsky, Kai-Yeung Siu, Thomas Kailath
1990	A*	`conf`	Two Messages are Almost Optimal for Conveying Information. PODC Alon Orlitsky
1990	J	`jnl`	Worst-case interactive communication I: Two messages are almost optimal. IEEE Trans. Inf. Theory Alon Orlitsky
1989	—	`conf`	Feeback in Discrete Communication. Distributed Computing And Cryptography Alon Orlitsky
1988	J	`jnl`	Self-avoiding random loops. IEEE Trans. Inf. Theory Lester E. Dubins, Alon Orlitsky, James A. Reeds, Lawrence A. Shepp
1984	A*	`conf`	Communication with Secrecy Constraints STOC Alon Orlitsky, Abbas El Gamal
1984	A*	`conf`	Interactive Data Comparison FOCS Abbas El Gamal, Alon Orlitsky