 | 2009 |
|---|
| 9 |       | Narayana P. Santhanam,
Martin J. Wainwright:
Information-theoretic limits of selecting binary graphical models in high dimensions
CoRR abs/0905.2639: (2009) |
| 2006 |
|---|
| 8 | | Dharmendra S. Modha,
Narayana P. Santhanam:
Making the Correct Mistakes.
DCC 2006: 302-311 |
| 7 | | Alon Orlitsky,
Narayana P. Santhanam,
Krishnamurthy Viswanathan,
Junan Zhang:
Limit Results on Pattern Entropy.
IEEE Transactions on Information Theory 52(7): 2954-2964 (2006) |
| 2005 |
|---|
| 6 | | 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 |
|---|
| 5 | | Alon Orlitsky,
Narayana P. Santhanam,
Krishnamurthy Viswanathan,
Junan Zhang:
On Modeling Profiles Instead of Values.
UAI 2004: 426-435 |
| 4 |  | Alon Orlitsky,
Narayana P. Santhanam:
Speaking of infinity [i.i.d. strings].
IEEE Transactions on Information Theory 50(10): 2215-2230 (2004) |
| 3 | | 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 |
|---|
| 2 | | Alon Orlitsky,
Narayana P. Santhanam:
Performance of universal codes over infinite alphabets.
DCC 2003: 402-412 |
| 1 | | Alon Orlitsky,
Narayana P. Santhanam,
Junan Zhang:
Always Good Turing: Asymptotically Optimal Probability Estimation.
FOCS 2003: 179-188 |
