The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Alon Orlitsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yoav Freund, Alon Orlitsky, Prasad Santhanam, Junan Zhang
    Universal Coding of Zipf Distributions. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:736-737 [Conf]
  2. Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath
    A Geometric Approach to Threshold Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 1991, pp:97-111 [Conf]
  3. Alon Orlitsky, Narayana P. Santhanam
    Performance of universal codes over infinite alphabets. [Citation Graph (0, 0)][DBLP]
    DCC, 2003, pp:402-412 [Conf]
  4. Abbas El Gamal, Alon Orlitsky
    Interactive Data Comparison [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:100-108 [Conf]
  5. Alon Orlitsky
    Interactive Communication: Balanced Distributions, Correlated Files, and Average-Case Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:228-238 [Conf]
  6. Alon Orlitsky, James R. Roche
    Coding for Computing. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:502-511 [Conf]
  7. Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
    Always Good Turing: Asymptotically Optimal Probability Estimation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:179-188 [Conf]
  8. Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
    Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers. [Citation Graph (0, 0)][DBLP]
    ICML, 2003, pp:353-360 [Conf]
  9. Sajama, Alon Orlitsky
    Estimating and computing density based distance metrics. [Citation Graph (0, 0)][DBLP]
    ICML, 2005, pp:760-767 [Conf]
  10. Sajama, Alon Orlitsky
    Supervised dimensionality reduction using mixture models. [Citation Graph (0, 0)][DBLP]
    ICML, 2005, pp:768-775 [Conf]
  11. Sajama, Alon Orlitsky
    Semi-parametric Exponential Family PCA. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  12. Vwani P. Roychowdhury, Alon Orlitsky, Kai-Yeung Siu, Thomas Kailath
    On the Circuit Complexity of Neural Networks. [Citation Graph (0, 0)][DBLP]
    NIPS, 1990, pp:953-959 [Conf]
  13. Alon Orlitsky
    Two Messages are Almost Optimal for Conveying Information. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:219-232 [Conf]
  14. Alon Orlitsky, Abbas El Gamal
    Communication with Secrecy Constraints [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:217-224 [Conf]
  15. T. Berger, A. Hekstra, Alon Orlitsky
    Asymptotic Component Densities in Programmable Gate Arrays Realizing All Circuits of a Given Size. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:2, pp:101-127 [Journal]
  16. Alon Orlitsky, Santosh S. Venkatesh
    On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:2, pp:151-178 [Journal]
  17. Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath
    Vector Analysis of Threshold Functions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:1, pp:22-31 [Journal]
  18. Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
    On Nearest-Neighbor Error-Correcting Output Codes with Application to All-Pairs Multiclass Support Vector Machines. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2003, v:4, n:, pp:1-15 [Journal]
  19. Alon Orlitsky
    Interactive Communication of Balanced Distributions and of Correlated Files. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:4, pp:548-564 [Journal]
  20. Yigal Brandman, Alon Orlitsky, John L. Hennessy
    A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:2, pp:282-287 [Journal]
  21. Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam
    A lower bound on compression of unknown alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:293-311 [Journal]
  22. Noga Alon, Alon Orlitsky
    A lower bound on the expected length of one-to-one codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:5, pp:1670-0 [Journal]
  23. Noga Alon, Alon Orlitsky
    Repeated communication and Ramsey graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:5, pp:1276-1289 [Journal]
  24. Noga Alon, Alon Orlitsky
    Source coding and graph entropies. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1329-1339 [Journal]
  25. Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky
    Privacy, additional information and communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:6, pp:1930-1943 [Journal]
  26. Alfred M. Bruckstein, Lawrence O'Gorman, Alon Orlitsky
    Design of Shapes for Precise Image Registration. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:7, pp:3156-3162 [Journal]
  27. Lester E. Dubins, Alon Orlitsky, James A. Reeds, Lawrence A. Shepp
    Self-avoiding random loops. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:6, pp:1509-1516 [Journal]
  28. János Körner, Alon Orlitsky
    Zero-Error Information Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2207-2229 [Journal]
  29. Bruce E. Moision, Alon Orlitsky, Paul H. Siegel
    On codes that avoid specified differences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:433-442 [Journal]
  30. Moni Naor, Alon Orlitsky, Peter W. Shor
    Three results on interactive communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1608-1615 [Journal]
  31. Alon Orlitsky
    Scalar versus vector quantization: Worst case analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1393-1409 [Journal]
  32. Alon Orlitsky
    Worst-case interactive communication I: Two messages are almost optimal. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:5, pp:1111-1126 [Journal]
  33. Alon Orlitsky
    Worst-case interactive communication - II: Two messages are not optimal. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:995-1005 [Journal]
  34. Alon Orlitsky
    Average-case interactive communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:5, pp:1534-1547 [Journal]
  35. Alon Orlitsky, Abbas El Gamal
    Average and randomized communication complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:1, pp:3-16 [Journal]
  36. Alon Orlitsky, James R. Roche
    Coding for computing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:3, pp:903-917 [Journal]
  37. Alon Orlitsky, Narayana P. Santhanam
    Speaking of infinity [i.i.d. strings]. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:10, pp:2215-2230 [Journal]
  38. Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang
    Limit Results on Pattern Entropy. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:7, pp:2954-2964 [Journal]
  39. Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
    Universal compression of memoryless sources over unknown alphabets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:7, pp:1469-1481 [Journal]
  40. Alon Orlitsky, Krishnamurthy Viswanathan
    One-way communication and error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:7, pp:1781-1788 [Journal]
  41. Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang
    Stopping set distribution of LDPC code ensembles. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:929-953 [Journal]
  42. Vwani P. Roychowdhury, Alon Orlitsky, Kai-Yeung Siu
    Lower bounds on threshold and related circuits via communication complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:467-474 [Journal]
  43. A. K. Dhulipala, Alon Orlitsky
    Universal Compression of Markov and Related Sources Over Arbitrary Alphabets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:9, pp:4182-4190 [Journal]
  44. Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang
    On Modeling Profiles Instead of Values. [Citation Graph (0, 0)][DBLP]
    UAI, 2004, pp:426-435 [Conf]

Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002