The following pages link to Narayana P. Santhanam (Q1770392):
Displaying 9 items.
- A lower bound on compression of unknown alphabets (Q1770393) (← links)
- Stationary and Transition Probabilities in Slow Mixing, Long Memory Markov Processes (Q2986179) (← links)
- Always Good Turing: Asymptotically Optimal Probability Estimation (Q3101376) (← links)
- Speaking of Infinity (Q3547437) (← links)
- Limit results on pattern entropy (Q3547439) (← links)
- Universal Compression of Memoryless Sources Over Unknown Alphabets (Q3547440) (← links)
- (Q5054625) (← links)
- Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions (Q5271791) (← links)
- Agnostic insurability of model classes (Q5744840) (← links)
