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