Alon Orlitsky

Available identifiers

zbMath Open orlitsky.alonMaRDI QIDQ874994

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4614093	2019-01-30	Paper
The Complexity of Estimating Rényi Entropy	2017-10-05	Paper
Silence-Based Communication	2017-07-27	Paper
Estimating Renyi Entropy of Discrete Distributions	2017-05-02	Paper
Always Good Turing: Asymptotically Optimal Probability Estimation	2011-11-28	Paper
Limit results on pattern entropy	2008-12-21	Paper
Universal Compression of Memoryless Sources Over Unknown Alphabets	2008-12-21	Paper
Speaking of Infinity	2008-12-21	Paper
Stopping Set Distribution of LDPC Code Ensembles	2008-12-21	Paper
One-way communication and error-correcting codes	2008-12-21	Paper
Universal Compression of Markov and Related Sources Over Arbitrary Alphabets	2008-12-21	Paper
On codes with local joint constraints	2007-04-10	Paper
Scalar versus vector quantization: worst case analysis	2005-05-11	Paper
A lower bound on compression of unknown alphabets	2005-04-06	Paper
10.1162/153244304322765612	2004-11-01	Paper
On codes that avoid specified differences	2002-08-04	Paper
Coding for computing	2002-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4252734	2000-04-26	Paper
Zero-error information theory	1999-11-21	Paper
Design of shapes for precise image registration	1999-11-21	Paper
On edge-colored interior planar graphs on a circle and the expected number of RNA secondary structures	1999-08-22	Paper
Source coding and graph entropies	1997-07-31	Paper
https://portal.mardi4nfdi.de/entity/Q4858433	1996-09-23	Paper
Repeated communication and Ramsey graphs	1996-02-12	Paper
Vector analysis of threshold functions	1995-09-17	Paper
https://portal.mardi4nfdi.de/entity/Q4839051	1995-07-13	Paper
A lower bound on the expected length of one-to-one codes	1995-03-01	Paper
Lower bounds on threshold and related circuits via communication complexity	1994-11-28	Paper
Privacy, additional information and communication	1994-10-26	Paper
Three results on interactive communication	1994-10-03	Paper
Interactive Communication of Balanced Distributions and of Correlated Files	1994-08-14	Paper
Asymptotic component densities in programmable gate arrays realizing all circuits of a given size	1993-04-01	Paper
Average-case interactive communication	1992-10-12	Paper
Worst-case interactive communication. I. Two messages are almost optimal	1992-06-27	Paper
Worst-case interactive communication. II. Two messages are not optimal	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3210143	1991-01-01	Paper
Average and randomized communication complexity	1990-01-01	Paper
On the evolution of islands	1989-01-01	Paper
Self-avoiding random loops	1988-01-01	Paper

Research outcomes over time

This page was built for person: Alon Orlitsky