| Competitive closeness testing J Acharya, H Das, A Jafarpour, A Orlitsky, S Pan Proceedings of the 24th Annual Conference on Learning Theory, 47-68, 2011 | 65 | 2011 |
| String reconstruction from substring compositions J Acharya, H Das, O Milenkovic, A Orlitsky, S Pan SIAM Journal on Discrete Mathematics 29 (3), 1340-1371, 2015 | 55 | 2015 |
| Competitive classification and closeness testing J Acharya, H Das, A Jafarpour, A Orlitsky, S Pan, A Suresh Conference on Learning Theory, 22.1-22.18, 2012 | 49 | 2012 |
| A unified maximum likelihood approach for estimating symmetric properties of discrete distributions J Acharya, H Das, A Orlitsky, AT Suresh International Conference on Machine Learning, 11-21, 2017 | 35 | 2017 |
| Exact calculation of pattern probabilities J Acharya, H Das, H Mohimani, A Orlitsky, S Pan 2010 IEEE International Symposium on Information Theory, 1498-1502, 2010 | 23 | 2010 |
| Tight bounds on profile redundancy and distinguishability J Acharya, H Das, A Orlitsky Advances in Neural Information Processing Systems 25, 2012 | 22 | 2012 |
| A unified maximum likelihood approach for optimal distribution property estimation J Acharya, H Das, A Orlitsky, AT Suresh arXiv preprint arXiv:1611.02960, 2016 | 19 | 2016 |
| Tight bounds for universal compression of large alphabets J Acharya, H Das, A Jafarpour, A Orlitsky, AT Suresh 2013 IEEE International Symposium on Information Theory, 2875-2879, 2013 | 19 | 2013 |
| On reconstructing a string from its substring compositions J Acharya, H Das, O Milenkovic, A Orlitsky, S Pan 2010 IEEE International Symposium on Information Theory, 1238-1242, 2010 | 16 | 2010 |
| Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types H Das, A Vardy 2009 IEEE International Symposium on Information Theory, 1248-1252, 2009 | 14 | 2009 |
| Competitive tests and estimators for properties of distributions H Das University of California, San Diego, 2012 | 13 | 2012 |
| Classification using pattern probability estimators J Acharya, H Das, A Orlitsky, S Pan, NP Santhanam 2010 IEEE International Symposium on Information Theory, 1493-1497, 2010 | 12 | 2010 |
| Selecting among advertisements competing for a slot associated with electronic content delivered over a network based upon predicted latency J Malkin, M Grbovic, P Krishnamurthy, K Mariappan, H Das US Patent App. 14/320,280, 2015 | 9 | 2015 |
| Quadratic-backtracking algorithm for string reconstruction from substring compositions J Acharya, H Das, O Milenkovic, A Orlitsky, S Pan 2014 IEEE International Symposium on Information Theory, 1296-1300, 2014 | 9 | 2014 |
| On the query computation and verification of functions H Das, A Jafarpour, A Orlitsky, S Pan, AT Suresh 2012 IEEE International Symposium on Information Theory Proceedings, 2711-2715, 2012 | 9 | 2012 |
| Estimating multiple concurrent processes J Acharya, H Das, A Jafarpour, A Orlitsky, S Pan 2012 IEEE International Symposium on Information Theory Proceedings, 1628-1632, 2012 | 6 | 2012 |
| Algebraic computation of pattern maximum likelihood J Acharya, H Das, A Orlitsky, S Pan 2011 IEEE International Symposium on Information Theory Proceedings, 400-404, 2011 | 5 | 2011 |
| Large scale ad latency analysis M Grbovic, J Malkin, H Das 2013 IEEE International Conference on Big Data, 762-767, 2013 | 2 | 2013 |
| An implementation of ray tracing in CUDA L Chen, H Das, S Pan CSE, 2009 | 1 | 2009 |
| Further results on relative redundancy H Das, A Orlitsky, NP Santhanam, J Zhang 2008 IEEE International Symposium on Information Theory, 1940-1943, 2008 | | 2008 |
Jayadev AcharyaAssistant Professor, Cornell UniversityΗ διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cornell.edu
