☰

Alon Orlitsky - Publications

Affiliations: 
Electrical Engineering (Communication Theory and Systems) University of California, San Diego, La Jolla, CA 
Area:
Electronics and Electrical Engineering
Website:
https://www.ece.ucsd.edu/node/456
Tree Info Similar researchers PubMed Report error

64 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2017 Acharya J, Orlitsky A, Suresh AT, Tyagi H. Estimating Renyi Entropy of Discrete Distributions Ieee Transactions On Information Theory. 63: 38-56. DOI: 10.1109/Tit.2016.2620435  0.515
2016 Orlitsky A, Suresh AT, Wu Y. Optimal prediction of the number of unseen species. Proceedings of the National Academy of Sciences of the United States of America. PMID 27830649 DOI: 10.1073/Pnas.1607774113  0.326
2015 Acharya J, Das H, Milenkovic O, Orlitsky A, Pan S. String reconstruction from substring compositions Siam Journal On Discrete Mathematics. 29: 1340-1371. DOI: 10.1137/140962486  0.724
2015 Acharya J, Orlitsky A, Suresh AT, Tyagi H. The complexity of estimating Rényi entropy Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2015: 1855-1869.  0.477
2014 Acharya J, Jafarpour A, Orlitsky A, Suresh AT. Sublinear algorithms for outlier detection and generalized closeness testing Ieee International Symposium On Information Theory - Proceedings. 3200-3204. DOI: 10.1109/ISIT.2014.6875425  0.433
2014 Acharya J, Jafarpour A, Orlitsky A, Suresh AT. Poissonization and universal compression of envelope classes Ieee International Symposium On Information Theory - Proceedings. 1872-1876. DOI: 10.1109/ISIT.2014.6875158  0.48
2014 Acharya J, Jafarpour A, Orlitsky A, Suresh AT. Efficient compression of monotone and m-modal distributions Ieee International Symposium On Information Theory - Proceedings. 1867-1871. DOI: 10.1109/ISIT.2014.6875157  0.46
2014 Acharya J, Jafarpour A, Orlitsky A, Suresh AT. Sorting with adversarial comparators and application to density estimation Ieee International Symposium On Information Theory - Proceedings. 1682-1686. DOI: 10.1109/ISIT.2014.6875120  0.456
2014 Acharya J, Das H, Milenkovic O, Orlitsky A, Pan S. Quadratic-backtracking algorithm for string reconstruction from substring compositions Ieee International Symposium On Information Theory - Proceedings. 1296-1300. DOI: 10.1109/ISIT.2014.6875042  0.474
2014 Acharya J, Jafarpour A, Orlitsky A, Suresh AT. Near-optimal-sample estimators for spherical Gaussian mixtures Advances in Neural Information Processing Systems. 2: 1395-1403.  0.464
2013 Acharya J, Das H, Jafarpour A, Orlitsky A, Suresh AT. Tight bounds for universal compression of large alphabets Ieee International Symposium On Information Theory - Proceedings. 2875-2879. DOI: 10.1109/ISIT.2013.6620751  0.524
2013 Acharya J, Jafarpour A, Orlitsky A, Suresh AT. Optimal probability estimation with applications to prediction and classification Journal of Machine Learning Research. 30: 764-796.  0.466
2013 Acharya J, Jafarpour A, Orlitsky A, Suresh AT. A competitive test for uniformity of monotone distributions Journal of Machine Learning Research. 31: 57-65.  0.464
2012 Acharya J, Das H, Jafarpour A, Orlitsky A, Pan S. Estimating multiple concurrent processes Ieee International Symposium On Information Theory - Proceedings. 1628-1632. DOI: 10.1109/ISIT.2012.6283551  0.447
2012 Acharya J, Das H, Orlitsky A. Tight bounds on profile redundancy and distinguishability Advances in Neural Information Processing Systems. 4: 3257-3265.  0.528
2011 Acharya J, Das H, Orlitsky A, Pan S. Algebraic computation of pattern maximum likelihood Ieee International Symposium On Information Theory - Proceedings. 400-404. DOI: 10.1109/ISIT.2011.6034155  0.566
2011 Acharya J, Jafarpour A, Orlitsky A. Expected query complexity of symmetric boolean functions 2011 49th Annual Allerton Conference On Communication, Control, and Computing, Allerton 2011. 26-29. DOI: 10.1109/Allerton.2011.6120145  0.455
2011 Acharya J, Das H, Jafarpour A, Orlitsky A, Pan S. Competitive closeness testing Journal of Machine Learning Research. 19: 47-68.  0.412
2010 Dhulipala AK, Fragouli C, Orlitsky A. Silence-based communication Ieee Transactions On Information Theory. 56: 350-366. DOI: 10.1109/Tit.2009.2034813  0.751
2010 Acharya J, Das H, Milenkovic O, Orlitsky A, Pan S. On reconstructing a string from its substring compositions Ieee International Symposium On Information Theory - Proceedings. 1238-1242. DOI: 10.1109/ISIT.2010.5513668  0.479
2010 Acharya J, Das H, Orlitsky A, Pan S, Santhanam NP. Classification using pattern probability estimators Ieee International Symposium On Information Theory - Proceedings. 1493-1497. DOI: 10.1109/ISIT.2010.5513570  0.707
2010 Acharya J, Das H, Mohimani H, Orlitsky A, Pan S. Exact calculation of pattern probabilities Ieee International Symposium On Information Theory - Proceedings. 1498-1502. DOI: 10.1109/ISIT.2010.5513565  0.505
2009 Acharya J, Orlitsky A, Pan S. Recent results on pattern maximum likelihood Proceedings - 2009 Ieee Information Theory Workshop On Networking and Information Theory, Itw 2009. 251-255. DOI: 10.1109/ITWNIT.2009.5158581  0.569
2009 Acharya J, Orlitsky A, Pan S. The maximum likelihood probability of unique-singleton, ternary, and length-7 patterns Ieee International Symposium On Information Theory - Proceedings. 1135-1139. DOI: 10.1109/ISIT.2009.5206016  0.551
2008 Das H, Orlitsky A, Santhanam NP, Zhang J. Further results on relative redundancy Ieee International Symposium On Information Theory - Proceedings. 1940-1943. DOI: 10.1109/ISIT.2008.4595327  0.686
2007 Santhanam NP, Orlitsky A, Viswanathan K. New tricks for old dogs: Large alphabet probability estimation 2007 Ieee Information Theory Workshop, Itw 2007, Proceedings. 638-643. DOI: 10.1109/ITW.2007.4313149  0.601
2007 Dhulipala AK, Fragouli C, Orlitsky A. Single versus multiple rounds for distributed function computation Ieee International Symposium On Information Theory - Proceedings. 636-640. DOI: 10.1109/ISIT.2007.4557296  0.744
2007 Orlitsky A, Santhanam NP, Viswanathan K. Population estimation with performance guarantees Ieee International Symposium On Information Theory - Proceedings. 2026-2030. DOI: 10.1109/ISIT.2007.4557157  0.579
2007 Moision B, Orlitsky A, Siegel PH. On codes with local joint constraints Linear Algebra and Its Applications. 422: 442-454. DOI: 10.1016/J.Laa.2006.11.002  0.322
2006 Dhulipala AK, Orlitsky A. Universal compression of Markov and related sources over arbitrary alphabets Ieee Transactions On Information Theory. 52: 4182-4190. DOI: 10.1109/Tit.2006.880013  0.783
2006 Orlitsky A, Santhanam NP, Viswanathan K, Zhang J. Limit results on pattern entropy Ieee Transactions On Information Theory. 52: 2954-2964. DOI: 10.1109/TIT.2006.876351  0.704
2006 Orlitsky A, Santhanam N, Zhang J. Relative redundancy for large alphabets Ieee International Symposium On Information Theory - Proceedings. 2672-2676. DOI: 10.1109/ISIT.2006.262138  0.687
2006 Dhulipala AK, Fragouli C, Orlitsky A. Silence based communication for sensor networks Ieee International Symposium On Information Theory - Proceedings. 212-216. DOI: 10.1109/ISIT.2006.261835  0.748
2006 Orlitsky A, Santhanam N, Viswanathan K, Zhang J. Theoretical and experimental results on modeling low probabilities 2006 Ieee Information Theory Workshop, Itw 2006. 242-246.  0.66
2005 Orlitsky A, Viswanathan K, Zhang J. Stopping set distribution of LDPC code ensembles Ieee Transactions On Information Theory. 51: 929-953. DOI: 10.1109/TIT.2004.842571  0.542
2005 Orlitsky A, Santhanam N, Viswanathan K, Zhang J. Convergence of profile based estimators Ieee International Symposium On Information Theory - Proceedings. 2005: 1843-1847. DOI: 10.1109/ISIT.2005.1523664  0.673
2005 Jevtić N, Orlitsky A, Santhanam NP. A lower bound on compression of unknown alphabets Theoretical Computer Science. 332: 293-311. DOI: 10.1016/J.Tcs.2004.10.038  0.789
2005 Orlitsky A, Santhanam NP. On the redundancy of Gaussian distributions 43rd Annual Allerton Conference On Communication, Control and Computing 2005. 2: 1016-1025.  0.659
2004 Klautau A, Jevtić N, Orlitsky A. On nearest-neighbor error-correcting output codes with application to all-pairs multiclass support vector machines Journal of Machine Learning Research. 4: 1-15. DOI: 10.1162/153244304322765612  0.763
2004 Orlitsky A, Santhanam NP, Viswanathan K, Zhang J. Limit results on pattern entropy 2004 Ieee Information Theory Workshop - Proceedings, Itw. 99-104. DOI: 10.1109/Tit.2006.876351  0.736
2004 Orlitsky A, Santhanam NP. Speaking of infinity Ieee Transactions On Information Theory. 50: 2215-2230. DOI: 10.1109/Tit.2004.834734  0.689
2004 Orlitsky A, Santhanam NP, Zhang J. Universal compression of memoryless sources over unknown alphabets Ieee Transactions On Information Theory. 50: 1469-1481. DOI: 10.1109/Tit.2004.830761  0.758
2004 Orlitsky A, Sajama, Santhanam N, Viswanathan K, Zhang J. Algorithms for modeling distributions over large alphabets Ieee International Symposium On Information Theory - Proceedings. 306.  0.676
2004 Orlitsky A, Santhanam NP, Zhang J. Relative redundancy: A more stringent performance guarantee for universal compression Ieee International Symposium On Information Theory - Proceedings. 25.  0.688
2004 Dhulipala AK, Orlitsky A. On the redundancy of HMM patterns Ieee International Symposium On Information Theory - Proceedings. 9.  0.771
2003 Orlitsky A, Santhanam NP, Zhang J. Always Good Turing: asymptotically optimal probability estimation. Science (New York, N.Y.). 302: 427-31. PMID 14564004 DOI: 10.1126/Science.1088284  0.723
2003 Orlitsky A, Santhanam NP. Performance of universal codes over infinite alphabets Data Compression Conference Proceedings. 2003: 402-410. DOI: 10.1109/DCC.2003.1194031  0.598
2003 Freund Y, Orlitsky A, Santhanam P, Zhang J. Universal coding of zipf distributions Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 2777: 736-737.  0.497
2003 Orlitsky A, Viswanathan K, Zhang J. On capacity-achieving sequences of degree distributions Ieee International Symposium On Information Theory - Proceedings. 269.  0.476
2003 Orlitsky A, Santhanam NP, Zhang J. Always Good-Turing: Asymptotically optimal probability estimation Annual Symposium On Foundations of Computer Science - Proceedings. 179-188.  0.615
2003 Orlitsky A, Santhanam NP, Zhang J. Bounds on compression of unknown alphabets Ieee International Symposium On Information Theory - Proceedings. 111.  0.702
2002 Orlitsky A. Scalar versus vector quantization: Worst case analysis Ieee Transactions On Information Theory. 48: 1393-1409. DOI: 10.1109/Tit.2002.1003829  0.323
2002 Orlitsky A, Urbanke R, Viswanathan K, Zhang J. Stopping sets and the girth of tanner graphs Ieee International Symposium On Information Theory - Proceedings. 2.  0.469
2002 Jevtić N, Orlitsky A, Santhanam N. Universal compression of unknown alphabets Ieee International Symposium On Information Theory - Proceedings. 320.  0.602
2002 Zhang J, Orlitsky A. Finite-length analysis of LDPC codes with large left degrees Ieee International Symposium On Information Theory - Proceedings. 3.  0.496
1996 Alon N, Orlitsky A. Source coding and graph entropies Ieee Transactions On Information Theory. 42: 1329-1339. DOI: 10.1109/18.532875  0.337
1995 Roychowdhury V, Siu KY, Orlitsky A, Kailath T. Vector Analysis of Threshold Functions Information and Computation. 120: 22-31. DOI: 10.1006/Inco.1995.1095  0.303
1994 Roychowdhury VP, Orlitsky A, Siu KY. Lower Bounds on Threshold and Related Circuits via Communication Complexity Ieee Transactions On Information Theory. 40: 467-474. DOI: 10.1109/18.312169  0.348
1993 Bar-Yehuda R, Chor B, Kushilevitz E, Orlitsky A. Privacy, Additional Information, and Communication Ieee Transactions On Information Theory. 39: 1930-1943. DOI: 10.1109/18.265501  0.317
1993 Naor M, Orlitsky A, Shor P. Three Results on Interactive Communication Ieee Transactions On Information Theory. 39: 1608-1615. DOI: 10.1109/18.259644  0.345
1991 Orlitsky A. Worst-Case Interactive Communication II: Two Messages are Not Optimal Ieee Transactions On Information Theory. 37: 995-1005. DOI: 10.1109/18.86993  0.314
1990 Orlitsky A. Worst-Case Interactive Communication I: Two Messages are Almost Optimal Ieee Transactions On Information Theory. 36: 1111-1126. DOI: 10.1109/18.57210  0.333
1990 Orlitsky A, Gamal AE. Average and Randomized Communication Complexity Ieee Transactions On Information Theory. 36: 3-16. DOI: 10.1109/18.50368  0.326
1990 Brandman Y, Hennessy J, Orlitsky A. A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/ORCircuits Ieee Transactions On Computers. 39: 282-287. DOI: 10.1109/12.45216  0.301
Show low-probability matches.