1. S. Rajasekaran and S. Saha, and X. Cai, Novel Exact and Approximate Algorithms for the Closest Pair Problem, Proc. IEEE International Conference on Data Mining (ICDM 2017), New Orleans, November 18-21, 2017.

2. S. Rajasekaran and S. Saha, Efficient Algorithms for the Three Locus Problem in Genomewide

Association Study, Proc. IEEE International Conference on Data Mining (ICDM 2016), Indianapolis, USA, December 12-15, 2016.

3. S. Rajasekaran and S. Saha, Efficient Algorithms for the Two Locus Association Problem in GWAS and Related Problems, Proc. 25th ACM International Conference on Information and Knowledge Management (CIKM 2016), Indianapolis, October 24-28, 2016.

4. S. Pal, S. Pathak, and S. Rajasekaran, On Speeding-up Parallel Jacobi Iterations for SVDs, Proc. 18th IEEE International Conference on High Performance Computing and Communi-cations (HPCC 2016), Sydney, December 2016.

5. P. Xiao, S. Pal, and S. Rajasekaran, qPMS10: A Randomized Algorithm for Efficiently Solving Quorum Planted Motif Search Problem, Proc. IEEE International Conference on Bioinfor- matics and Biomedicine (IEEE BIBM 2016), Shenzhen, China, December 2016.

6. S. Rajasekaran and M. Nicolae, An error correcting parser for context-free grammars that takes less than cubic time, Proc. 10th International Conference on Language and Automata Theory and Applications (LATA), Prague, Czech Republic, March 14-18, 2016, Springer Lecture Notes in Computer Science.

7. S. Saha and S. Rajasekaran, POMP: A powerful splice mapper for RNA-seq data, Proc. The 7th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM BCB), Seattle, WA, October 2-5, 2016.

8. A.-A. Mamun and S. Rajasekaran, An Efficient Minimum Spanning Tree Algorithm, Proc. IEEE International Symposium on Computers and Communications, ISCC, 2016, June 27-30, Messina, Italy.

9. S. Tolba, R. Ammar, and S. Rajasekaran, Taking Swarms to the Field: Constrained Spiral Flocking for Underwater Search, Proc. IEEE International Symposium on Computers and Communications, ISCC, 2016, June 27-30, Messina, Italy.

10. A. Al-Mamun, S. Pal, and S. Rajasekaran, Efficient techniques for k-mer counting, Proc. IEEE International Conference on Computational Advances in Bio and medical Sciences (ICCABS), October 15-17, Miami, FL, 2015, 1 page.

11. S. Pal and S. Rajasekaran, Improved Algorithms for Finding Edit Distance Based Motifs, Proc. IEEE International Conference on Bioinformatics and Biomedicine, November 9-12, 2015, Washington, D.C.

12. S.Tolba, R.A. Ammar, and S. Rajasekaran, Taking Swarms to the Field: A Framework for Underwater Mission Planning, ISCC 2015.

13. S. Saha and S. Rajasekaran, REFECT: A novel paradigm for correcting short reads, Proc. The 6th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB), Sept. 9-12, Atlanta, GA, 2015.

14. S. Saha and S. Rajasekaran, NRRC: A Non-referential Reads Compression Algorithm, Proc. ISBRA, 2015, pp. 297-308.

15. Sherif Tolba, Reda Ammar, and Sanguthevar Rajasekaran, Taking Swarms to the Field: A Framework for Underwater Mission Planning, Proc. ISCC 2015, Larnaca, Cyprus, July 6-9, pp. 1007-1013.

16. Robert Martin, Yibo Zhu, Lina Pu, Fei Dou, Zheng Peng, Jun-Hong Cui, Sanguthevar Rajasekaran, Aqua-Sim Next Generation: A NS-3 Based Simulator for Underwater Sensor Networks. Proc. 10th International Conference on Underwater Networks and Systems (WUWNet2015), October 22-24, Washington DC, 2015, 18:1-18:2.

17. M. Alharbi and S. Rajasekaran, Conjunctive combined causal rules mining, Proc. IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), December 7-10, Abu Dhabi, UAE, 2015.

18. M. Alharbi and S. Rajasekaran, Disjunctive combined causal rules mining, Proc. IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), December 7-10, Abu Dhabi, UAE, 2015.

19. A. Algwaiz, S. Rajasekaran, and R.A. Ammar, Predicting E. Coli promoters using formal grammars, Proc. IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), December 7-10, Abu Dhabi, UAE, 2015.

20. S. Saha and S. Rajasekaran, Efficient algorithms for the compression of FASTQ files, Proc. IEEE BIBM, 2014, pp. 82-85.

21. A. Al Mamun, R. Aseltine, and S. Rajasekaran, Poster: Efficient Record Linkage Techniques, Proc. ICCABS, 2014, 1 page.

22. S. Saha and S. Rajasekaran, Efficient algorithms for error correction and compression of NGS data, Proc. ICCABS 2014, 1 page.

23. Ayman Alharbi, Hesham Alhumyani, Reda Ammar, Jun-Hong Cui, and Sanguthevar Rajasekaran, Efficient Pipeline Architectures for Underwater Big Data Analytics, Proc. IEEE ISSPIT 2014.

24. M. Alharbi, S. Pathak, and S. Rajasekaran, Frequent Itemsets Mining on Weighted Uncertain Data, IEEE ISSPIT 2014.

25. A. Ebaid, R. Ammar, and S. Rajasekaran, Energy-Aware Heuristics for Scheduling Parallel Applications on High Performance Computing Platforms, IEEE ISSPIT 2014.

26. M. Al-Bzoor, R. Ammar, J-H. Cui, and S. Rajasekaran, Coordinated Multi-Surface Gateway Redeployment for Enhanced Performance in Underwater Sensor Networks, Proc. International Symposium on Computers and Communications, 2014.

27. M. Alharbi, P. Periaswamy, and S. Rajasekaran, Disjunctive rules mining from uncertain databases, Proc. International Symposium on Computers and Communications, 2014.

28. M. Hamdalla, R. Ammar and S. Rajasekaran, A Molecular Structure Matching Approach to Efficient Identification of Endogenous Mammalian Biochemical Structures, Proc. ISBRA, 2014.

29. S. Bandyopadhyay, S. Sahni, S. Rajasekaran: PMS6MC: A multicore algorithm for motif discovery, Proc. ICCABS 2013, 5 pages.

30. S. Rajasekaran, S. Saha: Efficient algorithms for sequence assembly, Proc. ICCABS 2013, one page.

31. S. Rajasekaran and S. Saha, A Novel Deterministic Sampling Technique to Speedup Clustering Algorithms, Proc. 9th International Conference on Advanced Data Mining and Applications (ADMA), Hangzhou, China, December 14-16, 2013, pp. 34-46.

32. T. Mi and S. Rajasekaran, A two-pass exact algorithm for selection on parallel disk systems, Proc. IEEE Symposium on Computers and Communications, 2013.

33. S. Saha, R. Ramprasad, and S. Rajasekaran, A novel randomized feature selection algorithm, Proc. International Conference on Data Mining (DMIN), 2013.

34. M. Al-Bzoor, Y. Zhu, J. Liu, R.A. Ammar, J.-H. Cui, and S. Rajasekaran, An adaptive surface sink redeployment strategy for underwater sensor networks, Proc. IEEE Symposium on Computers and Communications, 2013.

35. M. Maghraby, R.A. Ammar, and S. Rajasekaran, Fast GPU Algorithms for Implementing The Red-Black Gauss-Seidel Method for Solving Partial Differential Equations, Proc. IEEE Symposium on Computers and Communications, 2013.

36. R. Kilany, R.A. Ammar, and S. Rajasekaran, Document classification: a novel approach based on SVM, Proc. 5th International Conference on Bioinformatics and Computational Biology (BICoB), March 2-6, Honolulu, HI, 2013.

37. 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 Journal on Wireless Communications and Networking, May 2013.

38. S.A. Mohamed, S. Rajasekaran, and R.A. Ammar, Integrating Clonal Selection and Deterministic Sampling for Efficient Associative Classification, Proc. IEEE Congress on Evolutionary Computation (CEC), 2013.

39. S. Pathak, V.K. Kundeti, M.R. Schiller, and S. Rajasekaran, A structure based algorithm for improving motifs prediction, Proc. International Conference on Pattern Recognition in Bioinformatics (PRIB), Springer-Verlag LNBI, 2013, pp. 242-252.

40. S. Bandyopadhyay, S. Sahni, and S. Rajasekaran, PMS6: A fast algorithm for motif discovery, Proc. Second International Conference on Computational Advances in Bio and medical Sciences (ICCABS), 2012, 6 pages.

41. M. Hamdalla, D.F. Grant, I.I. Mandoiu, D.W. Hill, S. Rajasekaran, and R.A. Ammar, The use of graph matching algorithms to identify biochemical substructures in synthetic chemical compounds: Application to metabolomics, Proc. Second International Conference on Computational Advances in Bio and medical Sciences (ICCABS), 2012, 6 pages.

42. A. Ebaid, R.A. Ammar, and S. Rajasekaran, Energy consumption of a duplication based scheduling approach: a case study, Proc. IEEE Symposium on Signal Processing and Information Technology, December 2012, Ho Chi Minh City, Vietnam.

43. S.A. Mohamed, S. Rajasekaran, and R.A. Ammar, Artificial Immune Systems: Models, Applications, and Challenges, Proc. 27th ACM Symposium on Applied Computing (SAC'12), Riva del Garda, Italy March 2012.

44. S.A. Mohamed, S. Rajasekaran, and R.A. Ammar, An Artificial Immune System Approach to Associative Classification. ICCSA (1) 2012, 161-171. Workshop on Bio-inspired Computing and Applications (BIOCA 2012).

45. S.A. Mohamed, S. Rajasekaran, and R.A. Ammar, AC-CS: An Immune-Inspired Associative Classification Algorithm, ICARIS 2012, pp. 139-151.

46. S.A. Mohamed, S. Rajasekaran, and R.A. Ammar, ML-DS: A Novel Deterministic Sampling Algorithm for Association Rules Mining, Proc. ICDM 2012, pp. 224-235.

47. H. Dinh and S. Rajasekaran, Workshop: An efficient data structure for exact-match overlap graphs and next generation sequence assembly, IEEE ICCABS 2012, page 1.

48. M. Al-Bzoor, Y. Zhu, J. Liu, R.A. Ammar, J.-H. Cui, and S. Rajasekaran, Adaptive Power Controlled Routing for Underwater Sensor Networks, Proc. WASA, 2012, pp. 549-560.

49. J. Liu, X. Han, M. Al-Bzoor, M. Zuba, J.-H. Cui, R.A. Ammar, and S. Rajasekaran, PADP: Prediction assisted dynamic surface gateway placement for mobile underwater networks, Proc. ISCC 2012, pp.139-144.

50. R. Kilany, R.A. Ammar, and S. Rajasekaran, A novel algorithm for technical articles classification based on gene selection, Proc. ISCC, 2012, pp. 234-238.

51. M. Maghrbay, R.A. Ammar, and S. Rajasekaran, Fast GPU algorithms for endmember extraction from hyperspectral images, Proc. ISCC, 2012, pp. 631-636.

52. S. Tolba, L. Fiondella, R.A. Ammar, S. Rajasekaran, N. Lownes, Q Wang, A wireless sensor deployment toolkit for road network and city-scale protection, Proc. National Security Innovation Competition, April (2nd Quarter/Spring) 2012.

53. S. Rajasekaran, Computational Techniques for Motif Search, 4th International Conference on Contemporary Computing (IC3), August 2011, Noida, India, 2011, p. 4.

54. S. Rajasekaran, H Dinh V. Kundeti, Workshop: Efficient sequential and parallel algorithms for sequence assembly, ICCABS 2011: 274.

55. M. Maghraby, R.A. Ammar, and S. Rajasekaran, Improving N-Finder technique for extracting endmembers, Proc. 11th IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), Dec. 14-17, Bilbao, Spain, 2011, pp. 42-49.

56. R. Kilany, R.A. Ammar, and S. Rajasekaran, A correlation-based algorithm for classifying technical articles, Proc. 11th IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), Dec. 14-17, Bilbao, Spain, 2011, pp. 50-53.

57. L. Fiondella, S. Rajasekaran, and S.S. Gokhale, Efficient System Reliability with Correlated Component Failures, Proc. 13th IEEE International High Assurance Systems Engineering Symposium (HASE), Boca Raton, FL, Nov. 10 to 12, 2011, pp. 269-276.

58. N. Lownes, R. Ammar, S. Rajasekaran, L. Fiondella, and Q.Wang, Securing America's Future Transportation Infrastructure: Network Vulnerability and High-Speed Rail, (with N. Lownes, R. Ammar, L. Fiondella, and Q.Wang), Proc. of The DHS Science Conference - Fifth Annual University Network Summit, Washington, DC, Mar 2011. Panel 15 (accepted for publication in Journal of Homeland Security).

59. N. Lownes, Q. Wang, and D.A. Sharma, An Efficient Heuristic for Estimating Transportation Network Vulnerability, Proc. IEEE International Symposium on Computers and Communication, Greece June 28th-July 1st, 2011.

60. L. Fiondella, S. Tolba, A. Byrd, Q. Wang, R. Ammar, S. Rajasekaran, and N. Lownes, Optimal Deployment and Protection of High-Speed Rail, Proc. Of the Fifth Annual Department of Homeland Security Student Day, Washington, DC, pp. 55-56, Mar 2011. Panel 3.

61. Q. Wang, L. Fiondella, A. Byrd, S. Tolba, R. Ammar, S. Rajasekaran, and N. Lownes A Many to Many Theory Approach to Measuring Transportation Network Vulnerability, Proc. of the Fifth Annual Department of Homeland Security Student Day, Washington, DC, pp. 87-88, Mar 2011. Panel 3.

62. M. Hamdalla, D. Grant, S. Rajasekaran, R. Ammar, and D. Hill, Efficient Prediction of Biological Structures from Molecular Formulas, 15th International Conference on Research in Computational Molecular Biology (RECOMB) Poster, Vancouver, BC, March 28-31, 2011.

63. S. Ibrahim, R.A. Ammar, S. Rajasekaran, N. Lownes, Q. Wang, D. Sharma, An efficient heuristic for estimating transportation network vulnerability, Proc. International Symposium on Computers and Communication, 2011: 1092-1098.

64. S. Tolba, L. Fiondella, R.A. Ammar, N. Lownes, S. Rajasekaran, J. Ivan, and Q. Wang, Modeling Attacker-Technology System Interaction in Transportation Networks: P2I3-Model, Proc. 11th IEEE International Conference on Technologies for Homeland Security (HST 2011), Waltham, MA, pp. 306-312, Nov 2011.

65. Q. Wang, L. Fiondella, N. Lownes, J. Ivan, R.A. Ammar, S. Rajasekaran, and S. Tolba, Integrating Equilibrium Assignment in Game-theoretic Approach to Measure Many-to-Many Transportation Network Vulnerability, Proc. 11th IEEE International Conference on Technologies for Homeland Security (HST 2011), Waltham, MA, pp. 351-357, Nov 2011.

66. N.E. Lownes, Q. Wang, S. Ibrahim, R.A. Ammar, S. Rajasekaran, and D.A. Sharma, Many to Many Game Theoretic Approach to Measuring Transportation Network Vulnerability, Proceedings of the 90th Annual Meeting of the Transportation Research Board, Washington, DC, 2011.

67. V. Kundeti and S. Rajasekaran, An Efficient Algorithm for Chinese Postman Walk on Bidirected de Bruijn Graphs, Proceedings of the Combinatorial Optimization and Applications, 4th International Conference (COCOA 2010), pp. 184-196, Kailua-Kona, HI, December 18-20, 2010.

68. V. Kundeti and S. Rajasekaran, Randomized self assembly of rectangular nano structures, Proceedings of the 16th International Conference on DNA Computing and Molecular Programming, Hong Kong, June 14-17, 2010.

69. N. Lownes, R.A. Ammar, and S. Rajasekaran, Transportation Network Risk Modeling, The First Franco-American Symposium on Linear Infrastructures Security, Troyes, France, November 4, 2010.

70. S. Rajasekaran, D. Sharma, R.A. Ammar, and N. Lownes, An Efficient Randomized Routing Protocol for Single-Hop Radio Networks, Proc. International Conference on Parallel Processing (ICPP), San Diego, September, 2010.

71. D. Trinca and S. Rajasekaran, Coping with Diffraction Effects in Protein-based Computing through a Specialized Approximation Algorithm with Constant Overhead, Proc. IEEE NANO, Seoul, Korea, August 17-20, 2010.

72. D. Trinca and S. Rajasekaran, Using a Specialized Compression Scheme based on Antidictionaries for Coping with Diffraction Effects in Protein-based Computing, Proc. 14th International Biotechnology Symposium and Exhibition, imini, Italy, September 14-18, 2010.

73. V. Kundeti, S. Rajasekaran, and H. Dinh, On the Border Length Minimization Problem (BLMP) on a Square Array, Proc. ACM International Conference on Bioinformatics and Computational Biology (BCB), Niagara Falls, August 2010.

74. D. Sharma, S. Rajasekaran, R.A. Ammar, N. Lownes, and S. Ibrahim, Multi-level Sensor Deployment Algorithm for Wireless Sensor Networks, Proc. 1st International Conference on Advanced Computing and Communication, September 15-17, 2010, Orlando, Florida.

75. M. El-Maghraby, R.A. Ammar, S. Rajasekaran, I. Abou El-Bagd, W. Sheta, S. Nassar, and Ayman El-Dessouki Towards a Fast Surface Energy Balance Algorithm for Land, Proc. 1st International Conference on Advanced Computing and Communication, September 15-17, 2010, Orlando, Florida.

76. M. Maghrbay, R.A. Ammar, and S. Rajasekaran, A Randomized Automatic Pixel Purity Index Technique, Proceedings of the 25th International Conference on Computers and Their Applications, Honolulu, Hawaii, March 24-26, 2010, pp. 7-12. 77. A. Ebaid, R.A. Ammar, S. Rajasekaran and T.A. Fergany, Task Clustering & Scheduling with Duplication using Recursive Critical Path Approach (RCPA), Proceedings of the IEEE International Symposium on Signal Processing and Information Technology (ISSPIT 2010), Luxor, Egypt, pp. 34-41, December 15-18, 2010.

78. M.F. Ahmed, R.A. Ammar, and S. Rajasekaran, FFTI: Fast In-Place FFT on the Cell Broadband Engine, Proceedings of the 25th International Conference on Computers and Their Applications, Honolulu, Hawaii, March 24-26, 2010, pp. 167-173.

79. S. Rajasekaran, O. Harel, M. Zuba, and G. Matthews, Responsible Data Releases, Proc. Industrial Conference on Data Mining, Leipzig, Germany, July 20-22, 2009, Springer LNCS 5633, pp. 388-400.

80. S. Al Seesi, S. Rajasekaran, and R.A. Ammar, RNA Pseudoknot Folding through Inference and Identification using TAGRNA, Proc. 1st International Conference on Bioinformatics and Computational Biology (BICoB), 2009, LNBI 5462, pp. 90-101.

81. M.F. Ahmed, R.A. Ammar, and S. Rajasekaran, Novel Micro-Threading Techniques on the Cell Broadband Engine, Proceedings of the 14th IEEE Symposium on Computers and Communication, pp. 570-575, Sousse, Tunis, July 5-8, 2009.

82. D. Trinca and S. Rajasekaran, Optimized Bzip2 Compression for Reducing Diffraction Effects in Protein-Based Computing: A Study of Feasibility, Proc. 31st Annual International IEEE EMBS Conference, September 2-6, 2009, Minneapolis, MN.

83. R. Kilany, R.A. Ammar, S. Rajasekaran, and W. Sheta, A New Framework for High Performance Processing of Voluminous Multisource Datasets, Proc. 11th International Business Information Management Conference (11th IBIMA), Cairo, Egypt, January 4-6, 2009.

84. S. Rajasekaran, S. Al Seesi, and R.A. Ammar, Improved algorithms for parsing ESLTAGs: A grammatical model suitable for RNA pseudoknots, Proc. International Symposium on Bioinformatics Research and Applications (ISBRA) 2009, LNBI 5542, Springer, Heidelberg, May 2009, pp. 135-147.

85. V. Kundeti and S. Rajasekaran, Efficient algorithms for self assembling triangular and other nano structures, Proceedings of 5th International Symposium on Bioinformatics Research and Applications (ISBRA), May, 2009, LNBI 5542, pp. 148-158.

86. S. Rajasekaran, Efficient algorithms and system for motif search, Proc. National Symposium on Biocomputing, Annamalai University, India, Feb. 23, 2009, pp. 1-12.

87. V. Kundeti and S. Rajasekaran, Generalized algorithms for generating balanced modulation codes in protein-based volumetric memories, Proceedings of 10th Annual IEEE Congress on Evolutionary Computation (IEEE CEC), May 18-21, 2009, Norway.

88. V. Kundeti and S.Rajasekaran, On the hardness of the border length minimization problem, Proceedings of 9th Annual IEEE International Conference on BioInformatics and BioEngineering (BIBE), June 22-24, 2009, Taichung, Taiwan.

89. D. Sharma and S. Rajasekaran, A simple algorithm for (l; d) motif search, Proc. IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, March 30-April 2, 2009, Nashville, TN.

90. D. Sharma, S. Balla, S. Rajasekaran, and N. DiGirolamo, Degenerate primer selection algorithms, Proc. IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, March 30-April 2, 2009, Nashville, TN.

91. S. Rajasekaran, V. Kumar, S. Sahni, and R. Birge, Efficient Algorithms for Protein-Based Associative Processors and Volumetric Memories, Proc. 8th IEEE International Conference on Nanotechnology (IEEE NANO), August 18-21, Arlington, TX, 2008, pp. 397-400.

92. V. Kundeti and S. Rajasekaran, Efficient PDM Sorting Algorithms, Proceedings of 15th Annual IEEE International Conference on High Performance Computing (IEEE/ACM HiPC), December, 2008, pp. 97-107.

93. V. Kundeti and S. Rajasekaran, A local structual alignment algorithm with variable length alignment fragment pairs, Proceedings of 8th Annual IEEE International Conference on BioInformatics and BioEngineering (IEEE BIBE), October, 2008.

94. T. Mi, R. Aseltine, and S. Rajasekaran, Data integration on multiple data sets, Proc. IEEE International Conference on Bioinformatics and Biomedicine (BIBM), Philadelphia, PA, November 3-5, 2008, pp. 443-446.

95. V. Kundeti, Y. Fei, and S. Rajasekaran, An efficient digital circuit for implementing sequence alignment algorithm in an extended processor, Proceedings of 19th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (IEEE ASAP), July, 2008, pp.156-161.

96. M. Song and S. Rajasekaran, A novel scheme for the detection of an unknown class in classification, Proceedings of the International Conference on Data Mining (DMIN), 2008, pp. 10-13.

97. S. Balla, S. Rajasekaran, and I.I. Mandoiu, Faster Greedy Algorithms for Multiple Degenerate Primer Selection, Proceedings of the 8th IEEE International Conference on Bioinformatics and Bioengineering, Athens, Greece, October 8-10, 2008.

98. S. Al Seesi, S. Rajasekaran, and R.A. Ammar, Pseudoknot identification through learning TAGRNAs, Proc. Pattern Recognition in Bioinformatics (PRIB), 2008, Springer LNCS 5265, pp. 132-143.

99. D. Sharma, V. Thapar, S. Rajasekaran, R.A. Ammar, and M.F. Ahmed, Efficient Sorting Algorithms for the Cell Broadband Engine, Proceedings of the 13th IEEE Symposium on Computers and Communication (ISCC), Marrakesh, Morocco, July 5-9, 2008, pp. 736-741.

100. M.F. Ahmed, R.A. Ammar, and S. Rajasekaran, SPENK: Adding Another Level of Parallelism on the Cell Broadband Engine, Proceedings of the 1st International Forum on Next- Generation Multicore/Manycore Technologies (IFMT), Cairo, Egypt, November 24-25, 2008,pp. 1-10.

101. V. Kundeti and S. Rajasekaran, Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space, Proc. International Conference on Computational Science, Springer- Verlag LNCS, 2008, pp. 893-902.

102. M. Song and S. Rajasekaran, A Novel Scheme for the Detection of an Unknown Class in Classification, to be presented in International Conference on Data Mining, 2008. 103. D. Sharma, V. Thapar, R. Ammar, S. Rajasekaran, and M. Ahmed, Efficient Sorting Algorithms for the Cell Broadband Engine, to be presented in the IEEE International Symposium on Computers and Communication, 2008.

104. S. Rajasekaran, Parallel algorithms for motif search, Proc. ISCA PDCS, 2007, pp. 175-180. 26

105. R. A. Ammar, S. Rajasekaran, A. Hussein, A. Hamdy, Efficient Scheduling of Real-time Tandem Task Graphs on Heterogeneous Clusters with Network Limitations, Proc. IEEE International Conference on Computers and Communications ( ISCC) 2007, pp. 227-232.

106. J. Davila, S. Balla, and S. Rajasekaran, Fast Algorithms for Selecting Specific siRNA in Complete mRNA Data, Proc. WABI, 2007, Springer-Verlag LNBI 4645, pp. 302-309.

107. M. Song and S. Rajasekaran, A Greedy Correlation-Incorporated SVM-Based Algorithm for Gene Selection, Proc. AINA Workshops (1), 2007, pp. 657-661.

108. D. Trinca and S. Rajasekaran, Self-Optimizing Parallel Algorithms for Haplotype Reconstruction and Their Evaluation on the JPT and CHB Genotype Data, Proc. BIBE, 2007, pp. 1294-1298.

109. D. Trinca and S. Rajasekaran, Fast Cryptographic Multi-party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association Rule Mining in Vertically Partitioned Data, Proc. DaWaK, 2007, Springer-Verlag LNAI 4597, pp. 418-427.

110. M.I. Soliman, S. Rajasekaran and R.A. Ammar, A Block JRS Algorithm for Highly Parallel Computation of SVDs, Proc. HPCC, 2007, Springer-Verlag LNCS, pp. 346-357.

111. D. Trinca and S. Rajasekaran, Fast Cryptographic Multi-Party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association: Rule Mining in Vertically Partitioned Data, Proc. Industrial Conference on Data Mining, 2007.

112. D. Trinca and S. Rajasekaran, Towards a Collusion-Resistant Algebraic Multi-Party Protocol for Privacy-Preserving Association Rule Mining in Vertically Partitioned Data, Proc. Third International IEEE Workshop on Information Assurance, April 2007.

113. S. Balla and S. Rajasekaran, Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data, Proc. ISBRA, 2007, pp. 260-269.

114. Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran, Space and Time Efficient Algorithms for Planted Motif Search, Proc. International Conference on Computational Science (2), 2006, pp. 822-829.

115. J. Davila and S. Rajasekaran, Extending Pattern Branching to Handle Challenging Instances, Proc. 6th IEEE International Symposium on Bioinformatics and Bioengineering (BIBE),2006.

116. S. Rajasekaran and M. Song, A Novel Scheme for the Parallel Computation of SVDs, Proc. International Conference on High Performance Computing and Communications (HPCC), Springer-Verlag Lecture Notes in Computer Science 4208, 2006, pp. 129-137.

117. K.M. Konwar, S. Rajasekaran, and A. Shvartsman, Robust Network Supercomputing with Malicious Processes, Proc. 20th International Symposium on Distributed Computing (DISC), Springer-Verlag Lecture Notes in Computer Science, 2006.

118. V. Thapar, A.A. Mohamed, and S. Rajasekaran, A Consensus Text Summarizer Based on Meta-Search Algorithms, Proc. 6th IEEE Symposium on Signal Processing and Information Technology (ISSPIT), August 2006.

119. A.A. Mohamed and S. Rajasekaran, Improving Query-Based Summarization Using Document Graphs, Proc. 6th IEEE Symposium on Signal Processing and Information Technology (ISSPIT), August 2006.

120. S. Demurjian, S. Rajasekaran, R. Ammar. I. Greenshields, T. Doan, and L. He, Applying LSI and Data Reduction to XML for Counter Terrorism, Proc. 27th IEEE Aerospace Conference, Big Sky, MT, March 2006.

121. S. Rajasekaran and M. Song, A Novel Scheme for the Parallel Computation of SVDs, Proc. HPCC, 2006, pp. 129-137.

122. S. Rajasekaran, R. Ammar, S. Demurjian, A. Abdel-Raouf, T. Doan, J. Lian, M. Song, and A. Mohamed, Strategies to Process High Volumes of Data in Support of Counter-terrorism, IEEE Aerospace Conference, March 2005.

123. M. Song and S. Rajasekaran, Fast k-Means Algorithms with Constant Approximation, Proc. International Symposium on Algorithms and Computations (ISAAC), Springer-Verlag LNCS 3827, 2005, pp. 1029-1038.

124. S. Rajasekaran and S. Sen, A Simple Optimal Randomized Algorithm for Sorting on the PDM, Proc. International Symposium on Algorithms and Computations (ISAAC), Springer-Verlag LNCS 3827, 2005, pp. 543-552.

125. S. Rajasekaran and S. Sen, PDM Sorting Algorithms that Take a Small Number of Passes, Proc. International Parallel and Distributed Processing Symposium (IPDPS), 2005.

126. S. Rajasekaran, S. Balla, C.-H. Huang, V. Thapar, M. Gryk, M. Maciejewsky, and M. Schiller, Efficient algorithms for motif search, Proc. Third Asia-Pacific Bioinformatics Conference (APBC), 2005, pp. 239-248.

127. S. Rajasekaran, S. Balla, and C.-H. Huang, Exact algorithms for planted motif challenge problems, Proc. Third Asia-Pacific Bioinformatics Conference (APBC), 2005, pp. 249-259.

128. M. Song and S. Rajasekaran, TM algorithm for frequent itemset mining, KDD, Proc. ACM Symp. on Applied Computing special session on data mining, 2005.

129. Chun-Hsi Huang and Sanguthevar Rajasekaran, BioGrid: Bridging Life Science and Information Technology, Proc. of the 5-th IEEE/ACM Cluster Computing and the Grid (3rd BioGrid Workshop), May 9-12, 2005, Cardiff, UK.

130. Sanguthevar Rajasekaran, Efficient Algorithms for Motif Search, Keynote speech, Second International Conference on Intelligent Computing & Information Systems (ICICIS), Cairo, Egypt, March 5-7, 2005.

131. J. Luo and S. Rajasekaran, A Framework for Mining Association Rules, Proc. Ninth International Conference on Knowledge-Based Intelligent Information & Engineering Systems (KES) 4, Springer-Verlag LNCS/LNAI 3684, 2005, pp. 509-517.

132. A. Amin, R. A. Ammar, and S. Rajasekaran, Maximizing Reliability While Scheduling Real-Time Task-Graphs on a Cluster of Computers, Proc. Tenth IEEE International Symposium on Computers and Communications (ISCC), 2005, pp. 1001-1006.

133. A. A. Mohamed and S. Rajasekaran, A Text Summarizer Based on Meta-Search, Proc. 5th IEEE Symposium on Signal Processing and Information Technology (ISSPIT), December 2005, pp. 670- 674.

134. Alaa Amin, Reda Ammar and Sanguthevar Rajasekaran, A Randomized Algorithm to Schedule Real-Time Task Graphs to Satisfy a Multi-Criteria Objective Function, Proc. IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), Rome, Italy, December 2004.

135. S. Rajasekaran, R. Ammar, B. Cheriyan, and L. Loew, Parallel techniques for the virtual cell, Proc. International Symposium on Signal Processing and Information Technology (ISSPIT), 2004.

136. S. Rajasekaran, V. Thapar, H. Dave, and C.-H. Huang, A randomized algorithm for distance matrix calculations in multiple sequence alignment, Proc. International Conference on Knowledge Exploration in Life Science Informatics (KELSI), July 16, 2004, Springer-Verlag, pp. 33-45.

137. C.-W. Lee, C.-H. Huang, S. Rajasekaran, L. Yang, and D. Frank Hsu, Distributed Path-Based Inference in Semantic Networks, Proc. of 7th IEEE Int'l Symp. on Parallel Architectures, Algorithms and Networks (I-SPAN), 232-237, May 10-12 2004, Hong Kong, China.

138. S. Rajasekaran, Efficient parallel hierarchical clustering algorithms, Proc. Tenth IEEE International Conference on Parallel and Distributed Computing Systems (PDCS), 2004.

139. J. Luo and S. Rajasekaran, FIT: A fast algorithm for discovering frequent itemsets in large databases, Proc. 8th International Conference on Knowledge-Based Intelligent Information & Engineering Systems (KES 2004), Springer-Verlag.

140. S. Rajasekaran and J. Davila, Packet routing and selection on the POPS network, Proc.Tenth IEEE International Conference on Parallel and Distributed Systems (ICPADS), 2004.

141. J. Davila and S. Rajasekaran, Randomized sorting on the POPS network, Proc. International Conference on Parallel and Distributed Computing Systems (PDCS), 2004.

142. S. Rajasekaran, R. Ammar, K. Reifsnider, L. Achenie, A. Mohamed, G. Zhang, and M. Ahmed, Efficient parallel simulation of direct methanol fuel cell models, Proc. 19th ISCA International Conference on Computers and their Applications, 2004, pp. 75-78.

143. L. Yin, C.-H. Huang, and S. Rajasekaran, Parallel data mining of Bayesian networks from gene expression data, RECOMB Currents in Computational Computational Molecular Biology, 2004, pp. 122-123.

144. C.-H. Huang, S. Rajasekaran, and L. Yin, Cooperative biomedical knowledge inference, RE-COMB Currents in Computational Computational Molecular Biology, 2004, pp. 556-557.

145. R. Trumbower, P. Faghri, and S. Rajasekaran, Rigid link-segment models as predictors of semi-reclined leg cycling kinematics, Proc. RESNA Conference, Orlando, June 20-22, 2004.

146. C.-H. Huang and S. Rajasekaran, Biomedical Computations on the Grid - Organizing Chairs' Note, Proc. of the 4-th IEEE/ACM Symposium on Cluster Computing and the Grid (CCGrid)- Second BioGrid Workshop, published in CD-ROM, Apr. 19-22, 2004, Chicago, IL.

147. S. Rajasekaran, R. Ammar, D.-G. Shin, and G. Zhang, Efficient Parallel Algorithms for Processing Biological Sequences, Proc. IEEE International Symposium on Signal Processing and Information Technology, 2003.

148. J. Lim and S. Rajasekaran, Parallel cache management protocol and algorithm for cooperative web servers, Proc. IEEE International Conference on Communications (ICC), Alaska, May 2003.

149. C.-W. Lee, C.-H. Huang, and S. Rajasekaran, TROJAN: A Scalable Parallel Semantic Network System, Proc. of 15th IEEE Int'l Conference on Tools with Artificial Intelligence (IC- TAI), 219-223, Nov. 3-5 2003, Sacramento, CA.

150. J. Lim and S. Rajasekaran, Directly Selected and Limited Look up Cache Algorithm for Dynamic Web Contents, Proc. 9th International Conference on Networks, Parallel and Dis- tributed Processing, and Applications, October 2002, Tsukuba, Japan.

151. J. Lim and S. Rajasekaran, Parallel Cache Management Protocol for Static and DynamicWeb Contents, Proc. IADIS International WWW/Internet 2002 Conference (ICWI), November 2002, Lisbon, Portugal, pp. 20-28.

152. J. Lim and S. Rajasekaran, Distributed Cache Content Management Protocol for Cooperative Web Servers, Proc. 14th International Conference on Parallel and Distributed Computing and Systems, November 2002, Cambridge, U.S.A.

153. L. Fu and S. Rajasekaran, Novel Algorithms for Computing Medians and Other Quantiles of Disk Resident Data, Proc. International Database Engineering and Applications Symposium (IDEAS), 2001.

154. J. Luo, S. Rajasekaran, and C. Qiu, Parallelizing Wave Simulation Model by Using PVM, Proc. 8th Annual European PVM/MPI Conference, 2001.

155. S. Rajasekaran and X. Jin, A Practical Realization of Parallel Disks, Proc. Workshop on High Performance Scientific and Engineering Computing with Applications, 2000.

156. S. Rajasekaran, P. Sheng, L Jun, A Simple Parallel Algorithm for Solving Banded Systems, Proc. International Conference on Parallel and Distributed Computing Systems (PDCS), 1999.

157. * (Invited) S. Rajasekaran, H. Nick, P.M. Pardalos, S. Sahni, G. Shaw, Algorithms for Local Alignment Search, presented in the DIMACS Workshop on Discrete Problems with Medical Applications, 1999.

158. * (Invited) S. Rajasekaran, K. Naik, D. Wei, Frequency Assignment Algorithms for Cellular Networks, Proc. DIMACS Workshop on Mobile Networks and Computing, 1999.

159. * (Invited) X. Liu, P.M. Pardalos, S. Rajasekaran, and M.G.C. Resende, A GRASP for Frequency Assignment in Mobile Radio Networks, Proc. DIMACS Workshop on Mobile Networks and Computing, 1999.

160. S. Rajasekaran, A Framework For Simple Sorting Algorithms On Parallel Disk Systems, Proc. 10th Annual ACM Symposium on Parallel Algorithms and Architectures, 1998.

161. S. Rajasekaran, Selection Algorithms for Parallel Disk Systems, Proc. International Conference on High-Performance Computing, 1998.

162. S. Rajasekaran and S. Sahni, Randomized Routing, Selection, and Sorting on the OTIS-Mesh,Proc. European Symposium on Parallel and Distributed Systems, 1998.

163. S. Rajasekaran and S. Sahni, Computing on the Array with Reconfigurable Optical Buses, Proc. World Multiconference on Systemics, Cybernetics, and Informatics, Caracas, 1997, Volume 1, pp. 459-466.

164. * (Invited) S. Rajasekaran, Basic Algorithms for Computing on Optical Models, IMA Workshop on Parallel Processing for Discrete Problems, 1997.

165. * (Invited) S. Rajasekaran, Computing on Optical Models, DIMACS Workshop on Randomization Methods in Algorithm Design, 1997.

166. S. Rajasekaran and D.S.L. Wei, Designing Efficient Distributed Algorithms Using Sampling Techniques, Proc. International Parallel Processing Symposium, 1997.

167. S. Rajasekaran and S. Sahni, Sorting and Routing on the Array with Reconfigurable Optical Buses, Proc. 3rd International Conference on Algorithms and Parallel Processing, Singapore, 1996, pp. 105-112.

168. B. Thorndyke, P.A. Fishwick, and S. Rajasekaran, A Randomized Approach to Hybrid Monte-Carlo Simulation, Proc. SCS Simulation Multiconference, 1996, pp. 13-17.

169. D. S. L. Wei, S. Rajasekaran, and S. Kuo, Efficient Selection and Sorting Schemes for Processing Large Distributed Files in Finite Projectives Planes, Proc. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA) 1996, Vol. I, pp. 69-78.

170. S. Rajasekaran and S. Yooseph, TAL Parsing in O(M(n2)) Time, Proc. Meeting of the Association for Computational Linguistics, 1995.

171. S. Rajasekaran and S. Sahni, Sorting and Selection on the Distributed Memory Bus Computer, Proc. International Conference on Parallel Processing, 1995.

172. S. Rajasekaran, W. Chen, and S. Yooseph, Unifying Themes for Parallel Selection, Proc. Fifth International Symposium on Algorithms and Computation, August 1994. Springer- Verlag Lecture Notes in Computer Science 834, pp. 92-100.

173. I. Lee and S. Rajasekaran, A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation, Proc. 6th International Conference on Computer Aided Verification, June 1994. Springer-Verlag Lecture Notes in Computer Science 818, 1994, pp. 404-414.

174. * (Invited) S. Rajasekaran, Packet Routing on Meshes with Buses, presented in the DIMACS Workshop on Organizing and Moving Data in Parallel Computers, January 26-28, 1994.

175. S. Rajasekaran and S. Ramaswami, Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems, Proc. 10th Annual ACM Computational Geometry Conference, June 1994, pp. 57-66.

176. J.C. Cogolludo and S. Rajasekaran, Permutation Routing on Reconfigurable Meshes, Proc. Fourth Annual International Symposium on Algorithms and Computation, Hong Kong, December 1993. Springer-Verlag Lecture Notes in Computer Science 762, 1993, pp. 157-166.

177. S. Rajasekaran, Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection, Proc. First Annual European Symposium on Algorithms, Oct. 1993. Springer-Verlag Lecture Notes in Computer Science 726, 1993, pp. 272-283.

178. I. Lee and S. Rajasekaran, Fast Parallel Algorithms for Model Checking using BDDs, Proc. International Parallel Processing Symposium, pp. 444-448, April 1993.

179. S. Rajasekaran and D.S.L. Wei, Selection, Routing, and Sorting on the Star Graph, Proc. International Parallel Processing Symposium, pp. 661-665, April 1993.

180. S. Rajasekaran and S. Ramaswami, Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments, Visibility Graphs, and Motion Planning in the Plane, Proc. Allerton Conference on Communication, Control, and Computing, July 1992.

181. M. Kaufmann, S. Rajasekaran, and J.F. Sibeyn, Matching the Bisection Bound for Routing and Sorting on the Mesh, Proc. 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 31-40, July 1992.

182. S. Rajasekaran and M. Raghavachari, Optimal Randomized Algorithms for Multipacket and Cut Through Routing on the Mesh, Proc. IEEE Symposium on Parallel and Distributed Processing, December 1991, Dallas, Texas, pp. 305-311.

183. M.A. Palis, S. Rajasekaran, and D.S.L. Wei, Emulation of PRAMs on Leveled Networks, Proc. International Conference on Parallel Processing, 1991.

184. S. Rajasekaran and R. Overholt, Constant Queue Routing on a Mesh, Proc. Symposium on Theoretical Aspects of Computer Science, Feb. 1991, Hamburg, Germany. Springer-Verlag Lecture Notes in Computer Science 480, pp. 444-455.

185. S. Rajasekaran, Randomized Parallel Selection, Proc. Tenth conference on Foundations of Software Technology and Theoretical Computer Science, Dec. 1990, Bangalore, India. Springer-Verlag Lecture Notes in Computer Science 472, pp. 215-224.

186. T. Alameldin, M. Palis, S. Rajasekaran, and N. Badler, On the Complexity of Computing Reachable Workspaces for Redundant Manipulators, Proc. SPIE Intelligent Robots and Computer Vision IX: Algorithms and Techniques, 1990.

187. M.A. Palis, S. Rajasekaran, and D.S.L. Wei, Optimal Routing Algorithms for a New Class of Interconnection Networks, Proc. International Parallel Processing Symposium, April 1990.

188. S. Rajasekaran and J.H. Reif, Nested Annealing: A Provable Improvement to Simulated Annealing, Proc. 15th International Colloquium on Automata, Languages, and Programming, July 1988. Springer-Verlag Lecture Notes in Computer Science 317, pp.455-472.

189. D. Krizanc, S. Rajasekaran and T. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays, Proc. Third International Aegean Workshop on Parallel Computation and VLSI theory. Springer-Verlag Lecture Notes in Computer Science 319, pp. 411-422, 1988.

190. S. Rajasekaran and T. Tsantilas, An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-Like Routing Networks, Proc. 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, Dec. 1987. Springer- Verlag Lecture Notes in Computer Science 287, pp. 226-241.

191. * (Invited) S. Rajasekaran and S. Sahni, Arrays with Reconfigurable Optical Buses, Workshop on Parallel Processing of Discrete Problems, Institute for Mathematics and its Applications Minneapolis MN (May 12-16, 1997).

192. * (Invited) S. Rajasekaran and S. Sahni, Computing on the Array with Reconfigurable Optical Buses, International Conference in Computer Science, Caracuss, Venezuela, July 1997.

193. * (Invited) S. Rajasekaran, Sorting and Selection on Interconnection Networks, DIMACS Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computation, Feb. 7-9, 1994.

194. * (Invited) S. Rajasekaran, Packet Routing on Meshes with Buses, DIMACS Workshop onOrganizing and Moving Data in Parallel Computers, January 26-28, 1994.

195. * (Invited) S. Rajasekaran, Mesh Connected Computers with Fixed and Reconfigurable Buses, DIMACS workshop on Models, Architectures, and Technologies for Parallel Computation, Sept 20-22, 1993.

196. * (Invited) S. Rajasekaran, Separability of a Random Graph and Applications, presented in the Fifth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, RANDOM GRAPHS 91, Poznan, Poland, August 1991.

197. R. Paturi, S. Rajasekaran, and J.H. Reif, The Light Bulb Problem, Proc. Second Workshop on Computational Learning Theory, Santa Cruz, pp. 261-268, July 1989.

198. * (Invited) S. Rajasekaran and J.H. Reif, Randomized Parallel Computation, Fundamentals of Computation Theory Conference, Kazen, USSR, August 1987. Springer-Verlag Lecture Notes in Computer Science 278, pp. 364-376.

199. * (Invited) S. Rajasekaran and J.H. Reif, Randomized Parallel Computation, Presented in the 1987 Princeton Workshop on Algorithm, Architecture and Technology Issues in Models of Concurrent Computations.