Alon Orlitsky
#41,493
Most Influential Person Now
Information theorist
Alon Orlitsky's AcademicInfluence.com Rankings
Alon Orlitskycomputer-science Degrees
Computer Science
#1782
World Rank
#1847
Historical Rank
Information Theory
#17
World Rank
#18
Historical Rank
Database
#8212
World Rank
#8566
Historical Rank
Alon Orlitskyengineering Degrees
Engineering
#2250
World Rank
#3130
Historical Rank
Electrical Engineering
#737
World Rank
#801
Historical Rank
Download Badge
Computer Science Engineering
Alon Orlitsky's Degrees
- PhD Electrical Engineering Stanford University
- Masters Electrical Engineering Stanford University
Why Is Alon Orlitsky Influential?
(Suggest an Edit or Addition)According to Wikipedia, Alon Orlitsky is an information theorist and the Qualcomm Professor for Information Theory and its Applications at University of California, San Diego. He received a BSc in Mathematics and Electrical Engineering from Ben Gurion University in 1981, and a PhD in Electrical Engineering from Stanford University in 1986. He was a member of Bell Labs from 1986 to 1996, and worked for D. E. Shaw from 1996 to 1997. He joined UCSD in 1997.
Alon Orlitsky's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Coding for computing (1995) (399)
- Stopping set distribution of LDPC code ensembles (2003) (223)
- Zero-Error Information Theory (1998) (221)
- Always Good Turing: Asymptotically Optimal Probability Estimation (2003) (179)
- Universal compression of memoryless sources over unknown alphabets (2004) (155)
- Source coding and graph entropies (1996) (146)
- Optimal prediction of the number of unseen species (2016) (126)
- Worst-case interactive communication I: Two messages are almost optimal (1990) (115)
- On Learning Distributions from their Samples (2015) (109)
- On Modeling Profiles Instead of Values (2004) (93)
- Stopping sets and the girth of Tanner graphs (2002) (87)
- Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length (1990) (84)
- Repeated communication and Ramsey graphs (1994) (82)
- Competitive Distribution Estimation: Why is Good-Turing Good (2015) (80)
- Near-Optimal-Sample Estimators for Spherical Gaussian Mixtures (2014) (80)
- Interactive Communication of Balanced Distributions and of Correlated Files (1993) (78)
- On codes that avoid specified differences (2000) (77)
- Theoretical Advances in Neural Computation and Learning (1994) (70)
- The Complexity of Estimating Rényi Entropy (2015) (69)
- Estimating Renyi Entropy of Discrete Distributions (2014) (65)
- Worst-case interactive communication - II: Two messages are not optimal (1991) (64)
- Privacy, additional information, and communication (1990) (63)
- Competitive Closeness Testing (2011) (62)
- A Unified Maximum Likelihood Approach for Estimating Symmetric Properties of Discrete Distributions (2017) (62)
- On Nearest-Neighbor Error-Correcting Output Codes with Application to All-Pairs Multiclass Support Vector Machines (2003) (58)
- A lower bound on the expected length of one-to-one codes (1994) (57)
- Competitive Classification and Closeness Testing (2012) (56)
- Interactive communication: balanced distributions, correlated files, and average-case complexity (1991) (53)
- Average-case interactive communication (1992) (51)
- Lower bounds on threshold and related circuits via communication complexity (1994) (47)
- String Reconstruction from Substring Compositions (2014) (45)
- A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits (1990) (45)
- Estimating and computing density based distance metrics (2005) (45)
- Supervised dimensionality reduction using mixture models (2005) (43)
- Speaking of infinity [i.i.d. strings] (2004) (43)
- Maximum Selection and Ranking under Noisy Comparisons (2017) (36)
- Maxing and Ranking with Few Assumptions (2017) (33)
- Optimal Probability Estimation with Applications to Prediction and Classification (2013) (31)
- Three results on interactive communication (1993) (31)
- Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers (2003) (31)
- Limit results on pattern entropy (2004) (31)
- Design of Shapes for Precise Image Registration (1998) (30)
- Average and randomized communication complexity (1990) (30)
- Finite-length analysis of LDPC codes with large left degrees (2002) (30)
- The Broad Optimality of Profile Maximum Likelihood (2019) (29)
- Data Amplification: A Unified and Competitive Approach to Property Estimation (2019) (29)
- Semi-parametric Exponential Family PCA (2004) (28)
- Universal compression of unknown alphabets (2002) (28)
- Silence is golden and time is money: power-aware communication for sensor networks (2005) (27)
- Neural Models and Spectral Methods (1994) (27)
- Performance of universal codes over infinite alphabets (2003) (26)
- Communication with secrecy constraints (1984) (26)
- Faster Algorithms for Testing under Conditional Sampling (2015) (25)
- One-way communication and error-correcting codes (2002) (25)
- A Competitive Test for Uniformity of Monotone Distributions (2013) (24)
- Combined binary classifiers with applications to speech recognition (2002) (24)
- Self-avoiding random loops (1988) (23)
- Algorithms for modeling distributions over large alphabets (2004) (23)
- Data Amplification: Instance-Optimal Property Estimation (2019) (23)
- On Learning Markov Chains (2018) (22)
- Silence-Based Communication (2010) (22)
- The Limits of Maxing, Ranking, and Preference Learning (2018) (22)
- Interactive communication (1996) (21)
- Sorting with adversarial comparators and application to density estimation (2014) (21)
- Estimating the number of defectives with group testing (2016) (21)
- Sublinear algorithms for outlier detection and generalized closeness testing (2014) (20)
- A lower bound on compression of unknown alphabets (2005) (20)
- The maximum likelihood probability of unique-singleton, ternary, and length-7 patterns (2009) (20)
- Doubly-Competitive Distribution Estimation (2019) (19)
- A geometric approach to threshold circuit complexity (1991) (19)
- Exact calculation of pattern probabilities (2010) (18)
- Convergence of profile based estimators (2005) (18)
- On reconstructing a string from its substring compositions (2010) (17)
- Unified Sample-Optimal Property Estimation in Near-Linear Time (2019) (17)
- Learning Markov distributions: Does estimation trump compression? (2016) (16)
- Communication complexity (1988) (15)
- Tight Bounds on Profile Redundancy and Distinguishability (2012) (15)
- Tight bounds for universal compression of large alphabets (2013) (14)
- Recent results on pattern maximum likelihood (2009) (14)
- A General Method for Robust Learning from Batches (2020) (14)
- A Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation (2016) (14)
- The Complexity of Estimating R\'enyi Entropy (2014) (13)
- On estimating the probability multiset (2011) (13)
- The maximum likelihood probability of skewed patterns (2009) (13)
- Communication issues in distributed computing (1987) (13)
- Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Discrete Distributions (2020) (11)
- Classification using pattern probability estimators (2010) (11)
- Population estimation with performance guarantees (2007) (11)
- Silence Based Communication for Sensor Networks (2006) (11)
- On codes with local joint constraints (2007) (11)
- Near-Optimal Smoothing of Structured Conditional Probability Matrices (2016) (10)
- On the query computation and verification of functions (2012) (10)
- Interactive Data Comparison (1984) (10)
- One-way communication and error-correcting codes (2002) (9)
- New tricks for old dogs: Large alphabet probability estimation (2007) (9)
- Bounds of compression of unknown alphabets (2003) (9)
- Optimal Robust Learning of Discrete Distributions from Batches (2019) (9)
- Universal Compression of Markov and Related Sources Over Arbitrary Alphabets (2006) (9)
- Expected query complexity of symmetric boolean functions (2011) (8)
- Innovation and pattern entropy of stationary processes (2005) (8)
- Stopping set distribution of LDPC code ensembles (2003) (8)
- Estimating multiple concurrent processes (2012) (8)
- Poissonization and universal compression of envelope classes (2014) (8)
- Secrecy Enhancement via Public Discussion (1993) (8)
- On the Circuit Complexity of Neural Networks (1990) (7)
- Quadratic-backtracking algorithm for string reconstruction from substring compositions (2014) (7)
- Efficient compression of monotone and m-modal distributions (2014) (7)
- Maximum Selection and Sorting with Adversarial Comparators and an Application to Density Estimation (2016) (7)
- Scalar versus vector quantization: Worst case analysis (2002) (7)
- Maximum Selection and Sorting with Adversarial Comparators (2018) (6)
- The power of absolute discounting: all-dimensional distribution estimation (2017) (6)
- Server-assisted speech recognition over the Internet (2000) (6)
- Adaptive Estimation of Generalized Distance to Uniformity (2018) (6)
- Two messages are almost optimal for conveying information (1990) (5)
- Interactive Communication Of Balanced Distributions (1991) (5)
- Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free (2021) (5)
- Estimating the number of unseen species: A bird in the hand is worth $\log n $ in the bush (2015) (5)
- Vector Analysis of Threshold Functions (1995) (5)
- Universal compression of power-law distributions (2015) (5)
- On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures (1996) (5)
- Robust Learning of Discrete Distributions from Batches (2019) (4)
- On the redundancy of HMM patterns (2004) (4)
- SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm (2020) (4)
- Algebraic computation of pattern maximum likelihood (2011) (4)
- Robust estimation algorithms don't need to know the corruption level (2022) (4)
- Universal Compression of Envelope Classes: Tight Characterization via Poisson Sampling (2014) (4)
- Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Distributions (2020) (3)
- Optimal Sequential Maximization: One Interview is Enough! (2020) (2)
- Worst-case rate of scalar vs. vector quantization (2000) (2)
- Speech recognition using discriminative classifiers (2003) (2)
- Relative redundancy: a more stringent performance guarantee for universal compression (2004) (2)
- Relative redundancy for large alphabets (2006) (2)
- Guest Editorial: In-Network Computation: Exploring the Fundamental Limits (2013) (1)
- On the relation between additive smoothing and universal coding [language modeling] (2003) (1)
- Theoretical and Experimental Results on Modeling Low Probabilities (2006) (1)
- Scalar vs. vector quantization: worst-case analysis (2002) (1)
- Universal Coding of Zipf Distributions (2003) (1)
- Nonparametric methods for learning from data (2006) (1)
- ESTIMATED RANK PRUNING FOR SPEECH RECOGNITION (1)
- Feeback in Discrete Communication (1989) (1)
- Estimating the number of unseen species: How far can one foresee? (2015) (1)
- Towards Competitive N-gram Smoothing (2020) (1)
- On the evolution of islands (1989) (1)
- Estimation and modeling techniques for speech recognition (2005) (0)
- Modifying Distances (2006) (0)
- Improved Bounds On Interactive Communication (1991) (0)
- Data Compression with Side Information and Graph Entropy (1993) (0)
- Supplemental Material : Doubly-Competitive Distribution Estimation (2019) (0)
- Further results on relative redundancy (2008) (0)
- D S ] 1 6 A pr 2 01 5 Faster Algorithms for Testing under Conditional Sampling (2018) (0)
- Competitive Distribution Estimation (2015) (0)
- Coding for computing (1995) (0)
- Universal compression of Gaussian sources with unknown parameters (2014) (0)
- ESTIMATED RANK PRUNING AND JAVA-BASED SPEECH (2001) (0)
- A Lower Bound on the Expected Length of 1-1 Codes (2002) (0)
- On Learning Parametric Non-Smooth Continuous Distributions (2020) (0)
- Compressed Maximum Likelihood (2021) (0)
- String Reconstruction from Substring (2015) (0)
- Single versus multiple rounds for distributed function computation (2007) (0)
- Large alphabet probability estimnation (2007) (0)
- Permanents and modeling probability distributions (2019) (0)
- TURF: A Two-factor, Universal, Robust, Fast Distribution Learning Algorithm (2022) (0)
- Zero-error information theory (invited paper) (2000) (0)
- Asymptotic component densities in Programmable Gate Arrays realizing all circuits of a given size (1993) (0)
- Linear-Sample Learning of Low-Rank Distributions (2020) (0)
This paper list is powered by the following services:
Other Resources About Alon Orlitsky
What Schools Are Affiliated With Alon Orlitsky?
Alon Orlitsky is affiliated with the following schools:
