1. M. Nicolae and S. Rajasekaran, On pattern matching with k mismatches and few don't cares,Information Processing Letters 118, February 2017, pp. 78-82.
2. S. Saha and S. Rajasekaran, NRGC: a novel referential genome compression algorithm, Bioin-formatics, August 2016.
3. A.-A. Mamun, S. Pal, and S. Rajasekaran, KCMBT: a k-mer Counter based on Multiple Burst Trees, Bioinformatics, June 9, 2016, DOI: 10.1093/bioinformatics/btw345.
4. Abdullah-Al Mamun, Robert Aseltine, and Sanguthevar Rajasekaran, Efficient Record Linkage Algorithms Using Complete Linkage Clustering, PLoS ONE11(4):e0154446, April 28,2016, doi:10.1371/journal.pone.0154446.
5. S. Sharma, M. Hedden, O. Toledo, K. F. Lyon, S. Brooks, R. P. David, J. Limtong, J.Newsome, S. Rajasekaran, V. Thapar, E. Williams, and M. R. Schiller, The functional human C-terminome, PLOS ONE 2016, Apr 6;11(4):e0152731. doi: 10.1371/journal.pone.0152731.
6. M. Nicolae, and S. Rajasekaran, LFQC: A lossless compression algorithm for FASTQ files,Bioinformatics (2015) doi: 10.1093/bioinformatics/btv384, June 20, 2015.
7. S. Saha and S. Rajasekaran, ERGC: An efficient referential genome compression algorithm,Bioinformatics (2015) doi: 10.1093/bioinformatics/btv399 , July 2, 2015.
8. S. Saha and S. Rajasekaran, EC: an efficient error correction algorithm for short reads, BMC Bioinformatics, 16 (Suppl 17):S2, 7 December 2015.
9. K. Lyon, C.L. Strong, S. Schooler, R. Young, N. Roy, B. Ozar, M. Bachmeier, S. Rajasekaran, and M.R. Schiller, Natural variability of minimotifs in 1,092 people indicates that minimotifs are targets of evolution, Nucleic Acids Research, pii, gkv580, 2015.
10. M. A. Hamdalla, R.A. Ammar, and S. Rajasekaran, A molecular structure matching approach
to efficient identification of endogenous mammalian biochemical structures, BMC Bioinformatics, 16(Suppl 5):S11, doi:10.1186/1471-2105-16-S5-S11.
11. S. Saha, S. Rajasekaran, and R. Ramprasad, Novel randomized feature selection algorithms, International Journal of Foundations of Computer Science, 26(3): 321-342, 2015.
12. M. Nicolae and S. Rajasekaran, On String Matching with Mismatches, Algorithms, 2015, 2, 248-270, doi:10.3390/a8020248.
13. M. Al-Bzoor, Y. Zhu, J. Liu, R.A. Ammar, J.-H. Cui, and S. Rajasekaran, An adaptive power controlled routing protocol for underwater sensor network, International Journal of Sensor Networks, 18(3/4):238-249, 2015.
14. S. Rajasekaran and M. Nicolae, An error correcting parser for context free grammars that takes less than cubic time, CoRR abs/1406.3405, 2014.
15. S. Rajasekaran and S. Pathak, Efficient Algorithms for the Closest Pair Problem and Applications, CoRR abs/1407.5609, 2014.
16. S. Rajasekaran and M. Nicolae, An Elegant Algorithm for the Construction of Suffix Arrays, Journal of Discrete Algorithms 27, July 2014, pp. 21-28; DOI: 10.1016/j.jda.2014.03.001.
17. S. Saha and S. Rajasekaran, Efficient and scalable scaffolding using optical restriction maps, BMC Genomics 2014, 15(Suppl 5):S5; doi:10.1186/1471-2164-15-S5-S5.
18. D. Sharma, S. Rajasekaran, and S. Pathak, An Experimental Comparison of PMSprune and Other Algorithms for Motif Search, International Journal of Bioinformatics Research and Applications (IJBRA), 10(6), 2014, pp. 559-573.
19. M. Nicolae and S. Rajasekaran, qPMS9: An Efficient Algorithm for Quorum Planted Motif Search, Scientific Reports 5, Article Number 7813, January 2015, doi:10.1038/srep07813.
20. M. Hamdalla, S. Rajasekaran, D.F. Grant, and I.I. Mandoiu, Metabolic Pathway Predictions for Metabolomics: A Molecular Structure Matching Approach, Journal of Chemical Information and Modeling 55(3), 2015, pp. 709-718.
21. K.M. Konwar, S. Rajasekaran, and A.A. Shvartsman, Robust network supercomputing with unreliable workers, Journal of Parallel and Distributed Computing 75, 2015, pp. 81-92.
22. V. Kundeti, S. Rajasekaran, and H. Dinh, Border Length Minimization Problem on a Square Array, Journal of Computational Biology 21(6), 2014, pp. 446-455.
23. A. Al Mamun, R. Aseltine, and S. Rajasekaran, RLT-S: A Web System for Record Linkage, PLOS ONE 10(5): e0124449. doi:10.1371/journal.pone.012444.
24. S. Saha and S. Rajasekaran, A Unified Bug Testing Software for Biological and Other Systems, Journal of Applied Bioinformatics & Computational Biology 3:1, 2014, doi: 10.4172/2329-9533.1000105.
25. S. Bandyopadhyay, S. Sahni, and S. Rajasekaran, PMS6: a fast algorithm for motif discovery, International Journal of Bioinformatics Research and Applications (IJBRA) 10(4):369-383, 2014, doi: 10.1504/IJBRA.2014.062990.
26. M. Nicolae and S. Rajasekaran, Efficient Sequential and Parallel Algorithms for Planted Motif Search, Highly Accessed, BMC Bioinformatics 15: 34, 2014.
27. A.A. Mamun, T. Mi, R. Aseltine, and S. Rajasekaran, Efficient sequential and parallel algorithms for record linkage, Journal of the American Medical Informatics Association (JAMIA), 2013, doi:10.1136/amiajnl-2013-002034.
28. S. Bandyopadhyay, S. Sahni, and S. Rajasekaran, PMS6MC: A Multicore Algorithm for Motif Discovery, Algorithms 6(4): 805-823, 2013.
29. T. Mi and S. Rajasekaran, Efficient algorithms for biological stems search, BMC Bioinfor-matics 14: 161, 2013.
30. S. Ibrahim, M. Al-Bzoor, J. Liu, R.A. Ammar, S. Rajasekaran, and J.-H. Cui, General optimization framework for surface gateway deployment problem in underwater sensor networks, EURASIP J. Wireless Comm. and Networking, 128, 2013.
31. S. Saha, S. Rajasekaran, J. Bi, and S. Pathak, Efficient techniques for genotype-phenotype correlational analysis, BMC Medical Informatics and Decision Making 2013, 13:41, doi:10.1186/1472-6947-13-41.
32. S. Pathak, S. Rajasekaran, and M. Nicolae, EMS1: An elegant algorithm for edit distance based motif search, International Journal of Foundations of Computer Science, 24(4), 2013, 473-486.
33. S. Saha, S. Rajasekaran, J. Bi, and S. Pathak, Efficient Techniques for Genotype-Phenotype Correlational Analysis, BMC Medical Informatics and Decision Making, 2013, 13:41, doi:10.1186/1472-6947-13-41.
34. L. Fiondella, S. Rajasekaran, and S.S. Gokhale, Efficient software reliability analysis with correlated component failures, IEEE Transactions on Reliability 62(1), 2013, pp. 244-255.
35. M.A. Hamdalla, I.I. Mandoiu, D.W. Hill, S. Rajasekaran, and D.F. Grant, BioSM: Metabolomics tool for identifying edogenous mammalian biochemical structures in chemical structure, Journal of Chemical Information and Modeling, January 20, 2013, DOI: 10.1021/ci300512q.
36. G Pilania, C Wang, X Jiang, S Rajasekaran, and R Ramprasad, Accelerating materials property predictions using machine learning, Scientific Reports 3 : 2810, DOI: 10.1038/srep0281030, September 2013.
37. T. Mi, S. Rajasekaran, and R. Aseltine, Efficient algorithms for fast integration on large data sets from multiple sources, BMC Medical Informatics and Decision Making 2012, 12:59.
38. S. Rajasekaran, L. Fiondella, D. Sharma, R.A. Ammar, and N. Lownes, Communication and energy efficient routing protocols for single-hop radio networks, Journal of Parallel and Distributed Computing 72(6): 819-826, 2012.
39. H. Dinh, S. Rajasekaran, and J. Davila, qPMS7: A fast algorithm for finding (l; d)-motifs in DNA and protein sequences, PLoS ONE, 2012, doi:10.1371/journal.pone.0041425.
40. V. Kundeti and S. Rajasekaran, Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models, Natural Computing 11(2), 2012, 199-207, DOI: 10.1007/s11047-012-9313-1.
41. V. Kundeti, S. Rajasekaran, and H. Dinh, An efficient algorithm for Chinese postman walk on bi-directed de Bruijn graphs, Discrete Mathematics, Algorithms and Applications, 4(2), 2012.
42. T. Mi, S. Rajasekaran, J.C. Merlin, M. Gryk, and M.R. Schiller, Achieving high accuracy prediction of mini motifs, PLoS ONE, 2012, doi:10.1371/journal.pone.0045589.
43. J.C. Merlin, S. Rajasekaran, T, Mi, M.R. Schiller, Reducing False-Positive Prediction of Minimotifs with a Genetic Interaction Filter, PLoS ONE 7(3): e32630. doi:10.1371/journal.pone.0032630, 2012.
44. D.P. Sargeant, M.R. Gryk, M.W. Maciejewski, V. Thapar, V. Kundeti, S. Rajasekaran, P. Romero, K. Dunker, S.-C. Li, T. Kaneko, and M.R. Schiller, Secondary Structure, a Missing Component of Sequence-Based Minimotif Definitions, PLoS ONE, 2012, doi:10.1371/journal.pone.0049957.
45. T. Mi, J.C. Merlin, S. Deverasetty, M.R. Gryk, T.J. Bill, A.W. Brooks, L.Y. Lee, V. Rathnayake, C.A. Ross, D.P. Sargeant, C.L. Strong, P. Watts, S. Rajasekaran, and M.R. Schiller,Minimotif Miner 3.0: database expansion and significantly improved reduction of falsepositive predictions from consensus sequences, Nucleic Acids Research, 2012, Vol. 40, Database issue, 6 December 2011, doi:10.1093/nar/gkr1189.
46. H. Dinh and S. Rajasekaran, and V. Kundeti, PMS5: an efficient exact algorithm for the (l; d)-motif finding problem, BMC Bioinformatics 12: 410, 2011.
47. H. Dinh and S. Rajasekaran, A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly, Bioinformatics 27(14),2011, pp. 1901-1907.
48. S. Rajasekaran, V. Kundeti, R. Birge, V. Kumar, and S. Sahni, Efficient algorithms for computing with protein-based volumetric memory processors, IEEE Transactions on Nan- otechnology, 10(4), July 2011, pp. 881-890.
49. S. Rajasekaran and H. Dinh, A speedup technique for (l; d)-motif finding algorithms, BMC Research Notes 2011, 4:54 (8 March 2011).
50. V. Kundeti and S. Rajasekaran, Efficient out-of-core sorting algorithms for the Parallel Disks Model, Journal of Parallel and Distributed Computing 71(11): 1427-1433 (2011).
51. S. Rajasekaran, J.C. Merlin, V. Kundeti, T. Mi, , A. Oommen, J. Vyas, I. Alaniz,K. Chung, F. Chowdhury, S. Deverasatty, T.M. Irvey, D. Lacadmbacal, D. Lara, S. Panchangam, V.Rathnayake, P. Watts and M.R. Schiller, A Computational Tool for Identifying Minimotifs in Protein-Protein Interactions and Improving the Accuracy of Minimotif Predictions, Proteins: Structure, Function, and Bioinformatics, Vol. 70, No. 1, pp. 153-164, October 2010.
52. V. Kundeti and S. Rajasekaran, Efficient Algorithms for Self Assembling Non-Rectangular Nano Structures, Natural Computing, Vol. 10, No. 1, pp. 583-594, April 2011.
53. V. Kundeti and S. Rajasekaran, Fast algorithms for placing large entries along the diagonal of a sparse matrix, Journal of Comptational and Applied Mathematics, Vol. 235, No. 3, pp. 756-764, December 2010.
54. V. Kundeti and S. Rajasekaran, On the Hardness of the Border Length Minimzation Problem on a Rectangular Array, International Journal of Foundations of Computer Science, Vol. 21, No. 6, pp. 1089-1100, December 2010.
55. V. Kundeti, S. Rajasekaran, H. Dinh, M. Vaughn, and V. Thapar, Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs, BMC Bioinformatics, Highly Accessed, Vol. 11, No. 1, pp. 560-588, November 2010.
56. D. Trinca and S. Rajasekaran, Specialized Compression for Coping with Diffraction Effects in Protein-based Volumetric Memories: Solving Some Challenging Instances, Journal of Na-noelectronics and Optoelectronics (JNO), Vol. 5, No. 3, pp. 290-294, 2010.
57. M. Song and S. Rajasekaran, Fast Algorithms for Constant Approximation k-Means Clustering, Transactions on Machine Learning and Data Mining, Vol. 3, No. 2, pp. 67-79, December 2010.
58. S. Rajasekaran, T. Mi, A. Oommen, J.C. Merlin, P. Gradie, and M.R. Schiller, Partitioning of Minimotifs Based on Function with Improved Prediction Accuracy, PLoS ONE 5(8): e12276, 2010.
59. S. Rajasekaran, S. Al Seesi, R.A. Ammar, Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 7(4), 2010, pp.619-27.
60. M. J. Ranaghan, S. Shima, L. Ramos, D. S. Poulin, G. Whited, S. Rajasekaran, J. A. Stuart, A. D. Albert, and R. R. Birge, Photochemical and Thermal Stability of Green and Blue Proteorhodopsins: Implications for Protein-Based Bioelectronic Devices, Journal of Physical Chemistry B, Vol. 114, pp. 14064-14070, 2010.
61. M. Song and S. Rajasekaran, A greedy algorithm for gene selection based on SVM and correlation, International Journal of Bioinformatics Research and Applications 6(3), 2010, pp. 296-307.
62. J. Vyas, R.J. Nowling, T. Meusburger, D. Sargeant, K. Kadaveru, M.R. Gryk, V. Kundeti, S. Rajasekaran, and M.R. Schiller, MimoSA: a system for minimotif annotation, BMC Bioin- formatics, 2010, 11: 328.
63. D. Trinca and S. Rajasekaran, Fast Local-search-based Parallel Algorithms for DNA Probe Placement on Oligonucleotide Arrays, Advanced Modeling and Optimization 12(1), 2010, pp. 45-55.
64. S. Rajasekaran and V. Kundeti, Spectrum Based Techniques for Graph Isomorphism, International Journal of Foundations for Computer Science 20(3), 2009, pp. 479-499.
65. J. Vyas, R.J. Nowling, M.W. Maciejewski, S. Rajasekaran, M.R. Gryk, and M.R. Schiller, A proposed syntax for Minimotif Semantics, version I, BMC Genomics, 2009, 10:360.
66. S. Rajasekaran, Computational Techniques for Motif Search, Frontiers in Bioscience 14, June 1, 2009, pp. 5052-5065.
67. S. Rajasekaran, S. Balla, P. Gradie, M.R. Gryk, K. Kadaveru, V. Kundeti, M.W. Maciejewski, T. Mi, N. Rubino, J. Vyas, and M.R. Schiller, Minimotif miner 2nd release: a database and web system for motif search, Nucleic Acids Research 37, 2009, D185-D190.
68. S. Rajasekaran and S. Sen, Optimal and practical randomized algorithms for sorting on the PDM, IEEE Transactions on Computers 57(4), 2008, pp. 547-561.
69. S. Rajasekaran, M. Song, A relaxation scheme for increasing the parallelism in Jacobi-SVD, Journal of Parallel Distributed Computing 68(6), 2008, pp. 769-777.
70. S. Balla, S. Rajasekaran, and I. Mandoiu, Efficient Algorithms for Degenerate Primer Search, International Journal of Foundations of Computer Science 18, 2007, pp. 899-910.
71. S. Balla and S. Rajasekaran, An Efficient Algorithm for Minimum Degeneracy Primer Selection, IEEE Transactions on Nanobioscience 6(1), 2007, pp. 12-17.
72. J. Davila, S. Balla, and S. Rajasekaran, Fast and Practical Algorithms for Planted (l; d) Motif Search, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2007, pp. 544-552.
73. S. Rajasekaran, R. Ammar, and D.-G. Shin, Efficient Parallel Algorithms for Processing Biological Sequences, International Journal of Computer Applications in Technology (IJCAT) 26(3), 2006, pp. 119-125.
74. J. Luo and S. Rajasekaran, A Framework for Mining Association Rules, International Journal of Computers and Their Applications, March 2006, pp. 39-49.
75. R.D. Trumbower, S. Rajasekaran, and P. Faghri, Identifying Offline Muscle Strength Profiles Sufficient for Short-Duration FES-LCE Exercise: A PAC Learning Model Approach, Journal of Clinical Monitoring and Computing 20, 2006, pp. 209-220.
76. A. A. Mohamed and S. Rajasekaran, Efficient Randomized Algorithms for Text Summarization, Advances in Natural Language Processing, Journal of Research in Computing Science, 2006, pp. 195-200.
77. M. Song and S. Rajasekaran, A Transaction Mapping Algorithm for Frequent Itemsets Mining, IEEE Transactions on Knowledge and Data Engineering (TKDE) 18(4), 2006, pp. 472-481.
78. S. Balla, V. Thapar, S. Verma, T. Luong, T. Faghri, C-H. Huang, S. Rajasekaran, J.J. del Campo, J.H. Shinn, W.A. Mohler, M.W. Maciejewski, M.R. Gryk, B. Piccirillo, S.R. Schiller, and M.R. Schiller, Minimotif Miner, a tool for investigating protein function, Nature Methods 3, 2006, pp.175-177.
79. C.-H. Haung, S. Rajasekaran, L. Yang, and X. He, Finding Hamiltonian Paths in Tournaments on Clusters, Journal of Cluster Computing 9(3), 2006, pp. 345-353.
80. S. Rajasekaran and S. Sen, A generalization of the 0-1 principle for sorting, Information Processing Letters 94(1), 2005, pp. 43-47.
81. S. Rajasekaran, S. Balla, and C.-H. Huang, Exact algorithms for planted motif challenge problems, Journal of Computational Biology 12(8), 2005, pp. 1117-1128.
82. S. Rajasekaran and J. Davila, Packet routing and selection on the POPS network, Journal of Parallel and Distributed Computing 65(8), 2005, pp. 927-933.
83. S. Rajasekaran, V. Thapar, H. Dave, and C.-H. Huang, A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment, Journal of Clinical Monitoring and Computing (JCMC) 19, 2005, pp. 351-359.
84. S. Rajasekaran, S. Balla, C.-H. Huang, V. Thapar, Mike Gryk, Mark Maciejewski, and Marty Schiller, Exact algorithms for motif search, Journal of Clinical Monitoring and Computing (JCMC) 19, 2005, pp. 319-328.
85. C.-H. Huang, V. Lanza, S. Rajasekaran, and W. Dubitzky, Healthgrid { Bridging Life Science and Information Technology, Journal of Clinical Monitoring and Computing 19, 2005, pp. 259-262.
86. S. Rajasekaran, Efficient parallel hierarchical clustering algorithms, IEEE Transactions on Parallel and Distributed Systems, 16(6), June 2005, pp. 497-502.
87. S. Rajasekaran, R. Ammar, B. Cheriyan, and L. Loew, Parallel Techniques for the Virtual Cell, Computing Letters 1(2), 2005, pp. 69-74.
88. J. Luo and S. Rajasekaran, FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases, Computing Letters 1(3), 2005, pp. 129-136.
89. S. Rajasekaran, R. Ammar, K. Reifsnider, L. Achenie, A. Mohamed, G. Zhang, and M. Ahmed, Efficient parallel simulation of direct methanol fuel cell models, to appear in Journal of Fuel Cell Science and Technology 2(2), 2005, pp. 141-144.
90. J. Davila and S. Rajasekaran, Randomized sorting on the POPS network, International Journal of Foundations of Computer Science 16(1), 2005, pp. 105-116.
91. S. Rajasekaran, On the Euclidean minimum spanning tree problem, Computing Letters 1(1),2005, pp. 11-14.
92. Chun-Hsi Huang, Sanguthevar Rajasekaran, High-Performance Parallel Bio-Computing, Parallel Computing, 30(9-10), 2004, pp. 999-1000.
93. J. Luo and S. Rajasekaran, Parallizing 1-dimensional estuarine model, International Journal of Foundations of Computer Science 15(6), 2004, pp. 809-821.
94. S. Rajasekaran, Out-of-core computing on mesh-connected computers, Journal of Parallel and Distributed Computing 64(11), 2004, pp. 1311-1317.
95. C.W. Lee, C.-H. Huang, L. Yang and S. Rajasekaran, Distributed Path-Based Inference in Semantic Networks, Journal of Supercomputing 29(2), 2004, pp. 211-227.
96. L. Fu and S. Rajasekaran, Evaluating holistic aggregators efficiently for very large datasets, Journal of Very Large Data Bases (VLDB), 13(2), 2004, pp. 148-161.
97. D.S.L. Wei, S. Rajasekaran, K. Naik, and S-Y. Kuo, Efficient Algorithms for Selection and Sorting of Large Distributed Files on de Bruijn and Hypercube Structures, International Journal of Foundations of Computer Science 14(6), 2003, pp. 1129-1146.
98. D.S.L. Wei, S. Rajasekaran, Z. Cheng, K. Naik, and S-Y. Kuo, Efficient Selection and Sorting Schemes Using Corteries for Processing Large Distributed Files, Journal of Parallel and Distributed Computing 62(8), 2002, pp. 1295-1313.
99. H. ElGindy and S. Rajasekaran, Sorting and Selection Algorithms on a Linear Array with Optical Bus System, Parallel Processing Letters 9(3), 1999, pp. 373-383.
100. S. Rajasekaran and S. Ramaswami, Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems, Algorithmica 33(4), 2002, pp.436-460.
101. S. Rajasekaran, On Simulated Annealing and Nested Annealing, Journal of Global Optimization 16(1), 2000, pp. 43-56.
102. S. Rajasekaran, X. Jin, and J.L. Spouge, The Efficient Computation of Position-Specific Match Scores with the Fast Fourier Transform, Journal of Computational Biology 9(1), 2002,pp. 23-34.
103. C.-H. Huang and S. Rajasekaran, Parallel pattern identification in biological sequences on clusters, IEEE Transactions on Nanobioscience 2(1), 2003, pp. 29-34.
104. S. Rajasekaran, Efficient Parallel Algorithms for Template Matching, Parallel Processing Letters, 12(3 & 4), 2002, pp. 359-364.
105. S. Rajasekaran, Y. Hu, H. Nick, P.M. Pardalos, S. Sahni, G. Shaw, Efficient Algorithms for Similarity Search, Journal of Combinatorial Optimization, 5(1), 2001, pp. 125-132.
106. S. Rajasekaran, H. Nick, P.M. Pardalos, S. Sahni, G. Shaw, Efficient Algorithms For Local Alignment Search, Journal of Combinatorial Optimization, 5(1), 2001, pp. 117-124.
107. S. Rajasekaran, A Framework for Simple Sorting Algorithms on Parallel Disk Systems, Theory of Computing Systems, 34(2), 2001, pp. 101-114.
108. J.C. Cogolludo and S. Rajasekaran, Permutation Routing on Reconfigurable Meshes, Algorithmica, 31(1), 2001, pp. 44-57.
109. S. Rajasekaran, Selection Algorithms for Parallel Disk Systems, Journal of Parallel and Distributed Computing, 61(4), 2001, pp. 536-544.
110. S. Rajasekaran, An Optimal Parallel Algorithm for Sorting Multisets, Information Processing Letters, 67(3), 1998, pp. 141-143.
111. S. Rajasekaran and I. Lee, Parallel Algorithms for Relational Coarsest Partition Problems, IEEE Transactions on Parallel and Distributed Systems, 9(7), 1998, pp. 687-699.
112. S. Rajasekaran and S. Sahni, Randomized Routing, Selection, and Sorting on the OTIS-Mesh, IEEE Transactions on Parallel and Distributed Systems, 9(9), September 1998, pp. 833-840.
113. S. Rajasekaran, Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses, Journal of Algorithms, 29, 1998, pp. 68-81.
114. S. Rajasekaran and S. Sahni, Deterministic Routing on the Array with Reconfigurable Optical Buses, Parallel Processing Letters 7(3), 1997, pp. 219-224.
115. S. Rajasekaran and T. McKendall, Permutation Routing and Sorting on the Reconfigurable Mesh, International Journal of Foundations of Computer Science 9(2), 1998, pp. 199-211.
116. S. Rajasekaran and S. Yooseph, TAL Parsing in O(M(n2)) Time, Journal of Computer and System Sciences 56(1), 1998, pp. 83-89.
117. S. Rajasekaran and S. Sahni, Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses, IEEE Transactions on Parallel and Distributed Systems 8(11), 1997,
pp. 1123-1131.
118. S. Rajasekaran, W. Chen, and S. Yooseph, Unifying Themes for Selection on Any Network, Journal of Parallel and Distributed Computing 46(1), 1997, pp. 105-111.
119. S. Rajasekaran, Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting, IEEE Transactions on Computers, 45(5), 1996, pp.529-539.
120. S. Rajasekaran and S. Sahni, Sorting and Selection on Distributed Memory Bus Computers, Parallel Algorithms and Applications 8, 1996, pp. 179-193.
121. S. Rajasekaran, TAL Parsing in o(n6) Time, SIAM Journal on Computing, 25(4), 1996, pp.862-873.
122. S. Rajasekaran, kk Routing, kk Sorting, and Cut Through Routing on the Mesh, Journal of Algorithms 19, 1995, pp. 361-382.
123. S. Rajasekaran, Randomized Selection on the Hypercube, Journal of Parallel and Distributed Computing, 37(2), 1996, pp. 187-193.
124. S. Rajasekaran and S. Ramaswami, Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments, Visibility Graphs, and Motion Planning in the Plane, Journal of Parallel and Distributed Computing 26, 1995, pp. 99-115.
125. M.A. Palis, J.C. Liou, S. Rajasekaran, S. Shende, and D.S.L. Wei, Online Scheduling of Dynamic Trees, Parallel Processing Letters, 5(4), 1995, pp. 635-646.
126. S. Rajasekaran and M. Raghavachari, A Randomized Algorithm for Multi packet Routing on the Mesh, Journal of Parallel and Distributed Computing 26, 1995, pp. 257-260.
127. S. Rajasekaran and K. Ross, Fast Algorithms for Generating Discrete Random Variates with Changing Distributions, ACM Transactions on Modeling and Computer Simulation, Vol. 3, No. 1, January 1993, pp. 1-19.
128. M.A. Palis, S. Rajasekaran, and D.S.L. Wei, Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks, Journal of Parallel and Distributed Computing 20, 1994, pp. 145-157.
129. S. Rajasekaran and D.S.L. Wei, Selection, Routing, and Sorting on the Star Graph, Journal of Parallel and Distributed Computing, 41(2), 1997, pp. 225-233.
130. R. Paturi, S. Rajasekaran, and J.H. Reif, The Light Bulb Problem, Information and Computation 117, 1995, pp. 187-192.
131. D. Krizanc, S. Rajasekaran, and S. Shende, A Comparison of Meshes with Static Buses and Unidirectional Wrap-Arounds, Parallel Processing Letters, 3(2), 1993, pp. 109-114.
132. S. Rajasekaran and R. Overholt, Constant Queue Routing on a Mesh, Journal of Parallel and Distributed Computing 15, 1992, pp. 160-166.
133. S. Rajasekaran and J.H. Reif, Nested Annealing: A Provable Improvement to Simulated Annealing, Theoretical Computer Science 99, 1992, pp. 157-176.
134. S. Rajasekaran and S. Sen, On Parallel Integer Sorting, Acta Informatica 29, pp. 1-15, 1992.
135. S. Rajasekaran and T. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays, Algorithmica 8, 1992, pp. 21-38.
136. S. Rajasekaran and J.H. Reif, Optimal and Sub-Logarithmic Time Randomized Parallel Sorting Algorithms, SIAM Journal on Computing, vol.18, no.3, 1989, pp. 594-607.