Computer Algorithms: C++ E Horowitz, S Sahni, S Rajasckaran WH Freeman & Co, 1996 | 2879* | 1996 |
Neural networks, fuzzy logic and genetic algorithm: synthesis and applications (with cd) S Rajasekaran, GAV Pai PHI Learning Pvt. Ltd., 2003 | 1041 | 2003 |
Accelerating materials property predictions using machine learning G Pilania, C Wang, X Jiang, S Rajasekaran, R Ramprasad Scientific reports 3 (1), 1-6, 2013 | 680 | 2013 |
One-time credit card number generator and single round-trip authentication S Rajasekaran, R Varadarajan US Patent 6,908,030, 2005 | 231 | 2005 |
Optimal and sublogarithmic time randomized parallel sorting algorithms S Rajasekaran, JH Reif SIAM Journal on Computing 18 (3), 594-607, 1989 | 208 | 1989 |
Enhancements to multi-party authentication and other protocols S Rajasekaran, J Reno, R Varadarajan, S Vyas, DP Park, R Jerdonek US Patent 7,111,789, 2006 | 197 | 2006 |
Minimotif Miner: a tool for investigating protein function S Balla, V Thapar, S Verma, TB Luong, T Faghri, CH Huang, ... Nature methods 3 (3), 175-177, 2006 | 161 | 2006 |
Exact algorithms for planted motif problems S Rajasekaran, S Balla, CH Huang Journal of Computational Biology 12 (8), 1117-1128, 2005 | 148 | 2005 |
Fast and practical algorithms for planted (l, d) motif search J Davila, S Balla, S Rajasekaran IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (4), 544-552, 2007 | 145 | 2007 |
A transaction mapping algorithm for frequent itemsets mining M Song, S Rajasekaran IEEE transactions on knowledge and data engineering 18 (4), 472-481, 2006 | 142 | 2006 |
Autoprune: Automatic network pruning by regularizing auxiliary parameters X Xiao, Z Wang, S Rajasekaran Advances in neural information processing systems 32, 2019 | 126 | 2019 |
Efficient parallel hierarchical clustering algorithms S Rajasekaran IEEE transactions on parallel and distributed systems 16 (6), 497-502, 2005 | 114 | 2005 |
Efficient techniques for sharing a secret S Rajasekaran US Patent 7,167,565, 2007 | 95 | 2007 |
Sorting, selection, and routing on the array with reconfigurable optical buses S Rajasekaran, S Sahni IEEE Transactions on Parallel and Distributed Systems 8 (11), 1123-1132, 1997 | 91 | 1997 |
Handbook of parallel computing: models, algorithms and applications S Rajasekaran, J Reif CRC press, 2007 | 89 | 2007 |
Randomized routing, selection, and sorting on the OTIS-mesh S Rajasekaran, S Sahni IEEE Transactions on Parallel and Distributed Systems 9 (9), 833-840, 1998 | 87 | 1998 |
Minimotif Miner 3.0: database expansion and significantly improved reduction of false-positive predictions from consensus sequences T Mi, JC Merlin, S Deverasetty, MR Gryk, TJ Bill, AW Brooks, LY Lee, ... Nucleic acids research 40 (D1), D252-D260, 2012 | 85 | 2012 |
Optimal routing algorithms for mesh-connected processor arrays D Krizanc, S Rajasekaran, T Tsantilas VLSI Algorithms and Architectures: 3rd Aegean Workshop on Computing, AWOC 88 …, 1988 | 81 | 1988 |
Optimal routing algorithms for mesh-connected processor arrays S Rajasekaran, T Tsantilas Algorithmica 8, 21-38, 1992 | 78 | 1992 |
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem H Dinh, S Rajasekaran, VK Kundeti BMC bioinformatics 12, 1-10, 2011 | 77 | 2011 |