Engineering a compressed suffix tree implementation N Välimäki, V Mäkinen, W Gerlach, K Dixit Journal of Experimental Algorithmics (JEA) 14, 4.2-4.23, 2010 | 37 | 2010 |
Compressed suffix tree—a basis for genome-scale sequence analysis N Välimäki, W Gerlach, K Dixit, V Mäkinen Bioinformatics 23 (5), 629-630, 2007 | 35 | 2007 |
Property testing on product distributions: Optimal testers for bounded derivative properties D Chakrabarty, K Dixit, M Jha, C Seshadhri ACM Transactions on Algorithms (TALG) 13 (2), 1-30, 2017 | 30 | 2017 |
Testing the Lipschitz property over product distributions with applications to data privacy K Dixit, M Jha, S Raskhodnikova, A Thakurta Theory of Cryptography Conference, 418-436, 2013 | 29 | 2013 |
Erasure-resilient property testing K Dixit, S Raskhodnikova, A Thakurta, N Varma SIAM Journal on Computing 47 (2), 295-329, 2018 | 21 | 2018 |
Engineering a compressed suffix tree implementation N Välimäki, W Gerlach, K Dixit, V Mäkinen Experimental Algorithms: 6th International Workshop, WEA 2007, Rome, Italy …, 2007 | 18 | 2007 |
Outcome aware ranking in interaction networks S Kameshwaran, V Pandit, S Mehta, N Viswanadham, K Dixit Proceedings of the 19th ACM international conference on Information and …, 2010 | 16 | 2010 |
Effective decision support systems for workforce deployment V Chenthamarakshan, K Dixit, M Gattani, M Goyal, P Gupta, N Kambhatla, ... IBM Journal of Research and Development 54 (6), 5: 1-5: 15, 2010 | 11 | 2010 |
Effective decision support for workforce deployment service systems K Dixit, M Goyal, P Gupta, N Kambhatla, RM Lotlikar, D Majumdar, ... 2009 IEEE International Conference on Services Computing, 104-111, 2009 | 11 | 2009 |
Testing lipschitz property over product distribution and its applications to statistical data privacy K Dixit, M Jha, A Thakurta arXiv preprint arXiv:1209.4056, 2012 | 3 | 2012 |
Service Interaction Networks: Simulation and Applications K Dixit, S Kameshwaran, S Mehta, V Pandit, N Viswanadham IBM Research Report, 2009 | 3 | 2009 |
Towards simultaneously exploiting structure and outcomes in interaction networks for node ranking K Dixit, S Kameshwaran, S Mehta, V Pandit, N Viswanadham IBM Research Report, 2009 | 3 | 2009 |
Optimal lower bounds for Lipschitz testing via monotonicity D Chakrabarty, K Dixit, M Jha, C Seshadhri Private communication, 2013 | 2 | 2013 |
Counting cliques and clique covers in random graphs K Dixit, M Fürer arXiv preprint arXiv:1411.6673, 2014 | 1 | 2014 |
Robust models for property testing K Dixit The Pennsylvania State University, 2015 | | 2015 |
-Testers for Bounded Derivative Properties on Product Distributions K Dixit arXiv preprint arXiv:1404.5545, 2014 | | 2014 |
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. S Comandur, M Jha, K Dixit, D Chakrabarty Sandia National Lab.(SNL-CA), Livermore, CA (United States), 2014 | | 2014 |
Outcome aware ranking in value creation networks S Kameshwaran, V Pandit, S Mehta, A Agarwal, K Dixit Knowledge and information systems 38 (3), 537-565, 2014 | | 2014 |
Outcome aware ranking in value creation networks K Sampath, V Pandit, S Mehta, A Agarwal, K Dixit KAIS, 2012 | | 2012 |
Optimizing Facility Utilization For Service Delivery J Basak, K Dixit, P Gupta, J Heshiki, GR Parija US Patent App. 12/884,136, 2012 | | 2012 |