Search the dblp DataBase

Publications of Author

1. Dharmendra S. Modha, Narayana P. Santhanam
   Making the Correct Mistakes. [Citation Graph (0, 0)][DBLP]
   DCC, 2006, pp:302-311 [Conf]
   
2. Alon Orlitsky, Narayana P. Santhanam
   Performance of universal codes over infinite alphabets. [Citation Graph (0, 0)][DBLP]
   DCC, 2003, pp:402-412 [Conf]
   
3. 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]
   
4. 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]
   
5. 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]
   
6. 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]
   
7. 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]
   
8. 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]
   
9. 
   Information-theoretic limits of selecting binary graphical models in high dimensions [Citation Graph (, )][DBLP]