
Search the dblp DataBase
Narayana P. Santhanam:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Dharmendra S. Modha, Narayana P. Santhanam
Making the Correct Mistakes. [Citation Graph (0, 0)][DBLP] DCC, 2006, pp:302311 [Conf]
 Alon Orlitsky, Narayana P. Santhanam
Performance of universal codes over infinite alphabets. [Citation Graph (0, 0)][DBLP] DCC, 2003, pp:402412 [Conf]
 Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
Always Good Turing: Asymptotically Optimal Probability Estimation. [Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:179188 [Conf]
 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:13, pp:293311 [Journal]
 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:22152230 [Journal]
 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:29542964 [Journal]
 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:14691481 [Journal]
 Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang
On Modeling Profiles Instead of Values. [Citation Graph (0, 0)][DBLP] UAI, 2004, pp:426435 [Conf]
Informationtheoretic limits of selecting binary graphical models in high dimensions [Citation Graph (, )][DBLP]
Search in 0.022secs, Finished in 0.023secs
