
BIOINFORMATICS AND COMPUTATIONAL BIOLOGY
43) M. Hamdalla, D. Grant, S. Rajasekaran, R. Ammar, and D. Hill, Efficient prediction of biological structures from molecular formulas, Proc. 15th International Conference on Research in Computational Molecular Biology (RECOMB) Poster, Vancouver, BC, March 2831, 2011.
42) V. Kundeti and S. Rajasekaran, Randomized self assembly of rectangular nano structures, Proc. 16th International Conference on DNA Computing and Molecular Programming, Hong Kong, June 1417, 2010.
41) V. Kundeti, S. Rajasekaran, and H. Dinh, An efficient algorithm for chinese postman walk on bidirected de Bruijn graphs, Proc. 4th International Conference on Combinatorial Optimization and Applications (COCOA), KailuaKona, HI, December 1820, 2010, pp. 184196.
40) D. Trinca and S. Rajasekaran, Coping with diffraction effects in proteinbased computing through a specialized approximation algorithm with constant overhead, Proc. IEEE NANO, Seoul, Korea, August 1720, 2010.
39) D. Trinca and S. Rajasekaran, Using a specialized compression scheme based on antidictionaries for coping with diffraction effects in proteinbased computing, Proc. 14th International Biotechnology Symposium and Exhibition, Rimini, Italy, September 1418, 2010.
38) 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.
37) S. Rajasekaran, O. Harel, M. Zuba, and G. Matthews, Responsible data releases, Proc. Industrial Conference on Data Mining (ICDM), Leipzig, Germany, July 2022, 2009, Springer LNCS 5633, pp. 388400.
36) 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. 90101.
35) D. Trinca and S. Rajasekaran, Optimized bzip2 compression for reducing diffraction effects in proteinbased computing: a study of feasibility, Proc. 31st Annual International IEEE EMBS Conference, September 26, Minneapolis, MN, 2009.
34) S. Rajasekaran, S. Al Seesi, and R.A. Ammar, Improved algorithms for parsing ESLTAGs: a grammatical model suitable for pseudoknots, Proc. 5th International Symposium on Bioinformatics Research and Applications (ISBRA, LNBI 5542, Springer, May 2009, pp. 135147.
33) V. Kundeti and S. Rajasekaran, Efficient algorithms for self assembling triangular and other nano structures, Proc. 5th International Symposium on Bioinformatics Research and Applications (ISBRA), LNBI 5542, May 2009, pp. 148158.
32) S. Rajasekaran, Efficient algorithms and system for motif search, Proc. National Symposium on Biocomputing, Annamalai University, India, February 23, 2009, pp. 112.
31) V. Kundeti and S. Rajasekaran, Generalized algorithms for generating balanced modulation codes in proteinbased volumetric memories, Proc. 10th Annual IEEE Congress on Evolutionary Computation (IEEE CEC), May 1821, Norway, 2009.
30) V. Kundeti and S. Rajasekaran, On the hardness of the border length minimization problem, Proc. 9th Annual IEEE International Conference on Bioinformatics and Bioengineering (BIBE), Taichung, Taiwan, June 2224, 2009.
29) D. Sharma and S. Rajasekaran, A simple algorithm for (l, d) motif search, Proc. IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, Nashville, TN, March 30April 2, 2009.
28) D. Sharma, S. Balla, S. Rajasekaran, and N. DiGirolamo, Degenerate primer selection algorithms, Proc. IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, Nashville, TN, March 30April 2, 2009.
27) S. Rajasekaran, V. Kumar, S. Sahni, and R. Birge, Efficient algorithms for proteinbased associative processors and volumetric memories, Proc. 8th IEEE International Conference Nanotechnology (IEEE NANO), August 1821, Arlington, TX, 2008, pp. 397400.
26) V. Kundeti and S. Rajasekaran, A local structural alignment algorithm with variable length alignment fragment pairs, Proc. 8th Annual IEEE International Conference on Bioinformatics and Bioengineering (BIBE), October 2008.
25) 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 35, 2008, pp. 443446.
24) V. Kundeti, Y. Fei, and S. Rajasekaran, An efficient digital circuit for implementing sequence alignment algorithm in an extended processor, Proc. 19th Annual IEEE International Conference on ApplicationSpecific Systems, Architectures, and Processors (IEEE ASAP), July 2008, pp. 156161.
23) S. Balla, S. Rajasekaran, and I.I. Mandoiu, Faster greedy algorithms for multiple degenerate primer selection, Proc. 8th IEEE International Conference on Bioinformatics and Bioengineering (BIBE), Athens, Greece, October 810, 2008.
22) 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. 132143.
21) V. Kundeti and S. Rajasekaran, Extending the four Russian algorithm to compute the edit script in linear space, Proc. International Conference on Computational Science, SpringerVerlag LNCS, 2008, pp. 893902.
20) S. Rajasekaran, Parallel algorithms for motif search, Proc. ISCA International Conference on Parallel and Distributed Computing Systems (PDCS), 2007, pp. 175180.
19) J. Davila, S. Balla, and S. Rajasekaran, Fast algorithms for selecting specific siRNA in complete mRNA data, Proc. Workshop on Algorithms for Bioinformatics (WABI), Springer LNBI 4645, 2007, pp. 302309.
18) M. Song and S. Rajasekaran, A greedy correlationincorporated SVMbased algorithm for gene selection, Proc. AINA Workshops (1), 2007, pp. 657661.
17) D. Trinca and S. Rajasekaran, Selfoptimizing parallel algorithms for haplotype reconstruction and their evaluation on the JPT and CHB Genotype Data, Proc. IEEE International Conference on Bioinformatics and Bioengineering (BIBE), 2007, pp. 12941298.
16) S. Balla and S. Rajasekaran, Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data, Proc. International Symposium on Bioinformatics Research and Applications (ISBRA), 2007, LNBI, pp. 260269.
15) J. Davila, S. Balla, S. Rajasekaran, Space and Time Efficient Algorithms for Planted Motif Search, Proc. International Conference on Computational Science (2), 2006, pp. 822829.
14) J. Davila and S. Rajasekaran, Extending Pattern
Branching to Handle Challenging Instances, Proc. IEEE 6th Symposium on
Bioinformatics and Bioengineering (BIBE), 2006.
13) J. Davila, S. Balla, and S. Rajasekaran,
Space and
Time Efficient Algorithms for Planted Motif Search, Proc. International
Conference on Computational Science (2), 2006, pp. 822829.
12) S. Rajasekaran, Efficient Algorithms for Motif Search,
Keynote Speech, Second International Conference on Intelligent
Computing and Information Systems (ICICIS), Cairo, Egypt, March 2005.
11) S. Rajasekaran, S. Balla, C.H. Huang, V. Thapar, M.
Gryk, M. Maciejewski, and M. Schiller, Exact Algorithms for Motif Search,
Proc. AsiaPacific Bioinformatics Conference (APBC), 2005, pp.
239248.
10) S. Rajasekaran, S. Balla, and C.H. Huang, Exact
Algorithms for Planted Motif Challenge Problems, Proc. AsiaPacific
Bioinformatics Conference (APBC), 2005, pp. 249258.
9) C.H. Huang and S. Rajasekaran, BioGrid: Bridging Life
Science and Information Technology, Proc. 5th IEEE/ACM Cluster
Computing and the Grid Conference (3rd BioGrid Workshop), May 2005,
Cardiff, UK.
8) S. Rajasekaran, R. Ammar, B. Cheriyan, and L. Loew,
Parallel Techniques for the Virtual Cell, Proc. IEEE International
Symposium on Signal Processing and Information Technology (ISSPIT),
2005.
7) S. Rajasekaran, V. Thapar, H. Dave, and C.H. Huang, A
Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence
Alignment, Proc. Knowledge Exploration and Life Science Informatics (KELSI),
2004, SpringerVerlag LNCS 3303, pp. 3345.
6) C.H. Huang, S. Rajasekaran, and L. Yin, Cooperative
Biomedical Knowledge Inference, Poster Book of the 8th International
Conference Research in Computational Molecular Biology (RECOMB), March
2004, pp. 556557.
5) L. Yin, C.H. Huang, and S. Rajasekaran, Parallel Data
Mining of Bayesian Networks from Gene Expression Data, Poster Book of the
8th International Conference on Research in Computational Molecular
Biology (RECOMB), March 2004, pp. 122123.
4) C.H. Huang and S. Rajasekaran, Biomedical Computations
on the GridOrganizing Chairs' Note, Proc. 4th IEEE/ACM Symposium on
Cluster Computing on the Grid (CCGrid)Second BioGrid Workshop,
published in CDROM, April 2004, Chicago, IL.
3) R. Trumbower, P. Faghri, and S. Rajasekaran, Rigid
LinkSegment Models as Predictors of SemiReclined Leg Cycling Kinematics,
Proc. RESNA Conference, Orlando, June 2004.
2) 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 (ISSPIT),
December 2003.
1) 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.
DATA MINING AND INFORMATION
EXTRACTION
16) M. ElMaghraby, R.A. Ammar, I.A. ElBagd, W. Sheta, S. Nassar, S. Rajasekaran, and A. ElDessouki, Towards a fast surface energy balance algorithm for land, Proc.1st International Conference on Advanced Computing and Communication, September 1517, Orlando, Florida, 2010.
15) M. Maghraby, R.A. Ammar, and S. Rajasekaran, A randomized automatic pixel purity index technique, Proc. 25th International Conference on Computers and Their Applications, Honolulu, Hawaii, March 2426, 2010, pp. 712.
14) 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 (IBIMA), Cairo, Egypt, January 46, 2009.
13) M. Song and S. Rajasekaran, A novel scheme for the detection of an unknown class in classification, Proc. International Conference on Data Mining (DMIN), 2008, pp. 1013.
12) D. Trinca and S. Rajasekaran, Fast Cryptographic MultiParty Protocols for Computing Boolean Scalar Products with Applications to PrivacyPreserving Association: Rule Mining in Vertically Partitioned Data, Proc. Industrial Conference on Data Mining, Springer LNCS, 2007.
11) D. Trinca and S. Rajasekaran, Fast Cryptographic Multiparty Protocols for Computing Boolean Scalar Products with Applications to PrivacyPreserving Association Rule Mining in Vertically Partitioned Data, Proc. DaWaK, 2007, SpringerVerlag LNAI 4597, pp. 418427.
10) S. Rajasekaran and M. Song, A Novel Scheme for the
Parallel Computation of SVDs, Proc. International Conference on High
Performance Computing and Communications (HPCC), 2006, SpringerVerlag
Lecture Notes in Computer Science 4208, pp. 129137.
9) S. Demurjian, S. Rajasekaran, R. Ammar, I.
Greenshields, T. Doan, and L. He, Applying LSI and Data Reduction to XML
for CounterTerrorism, Proc. 27th IEEE Aerospace Conference, Big
Sky, MT, March 2006.
8) A.A. Mohamed and S. Rajasekaran, A Text Summarizer
Based on MetaSearch, Proc. 5th IEEE Symposium on Signal Processing and
Information Technology (ISSPIT), December 2005, pp. 670674.
7) J. Luo and S. Rajasekaran, A Framework for Mining
Association Rules, Proc. 9th International Conference on
KnowledgeBased Intelligent Information and Engineering Systems (KES)
4, 2005, SpringerVerlag LNCS/LNAI 3684, pp. 509517.
6) M. Song and S. Rajasekaran, Fast kmeans Algorithms
with Constant Approximation, Proc. International Symposium on
Algorithms and Computation (ISAAC), 2005, SpringerVerlag Lecture
Notes in Computer Science 3827, pp. 10291038.
5) S. Rajasekaran, R. Ammar, S. Demurjian, A. AbdelRaouf,
T. Doan, J. Lian, M. Song, and A. Mohamed, Strategies to Process High
Volumes of Data in Support of CounterTerrorism, Proc. IEEE Aerospace
Conference, 2005.
4) S. Rajasekaran, Efficient Parallel Hierarchical
Clustering Algorithms, Proc. Parallel and Distributed Computing
Symposium (PDCS), 2004.
3) M. Song and S. Rajasekaran, TM Algorithm for
Frequent Itemset Mining, Proc. ACM Symposium on Applied Computing
Special Session on Data Mining, September 2004.
2) J. Luo and S. Rajasekaran, FIT: A Fast Algorithm for
Discovering Frequent Itemsets in Large Databases, Proc. 8th
International Conference on KnowledgeBased Intelligent Information &
Engineering Systems (KES), SpringerVerlag LNCS 3213, 2004, pp. 189195.
1) 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.
OUTOFCORE COMPUTING
6) V. Kundeti and S. Rajasekaran, Efficient PDM sorting algorithms, Proc. 15th Annual IEEE International Conference on High Performance Computing (IEEE/ACM HiPC), December 2008, pp. 97107.
5) S. Rajasekaran and S. Sen, A Simple Optimal Randomized
Algorithm for Sorting on the PDM, Proc. International Symposium on
Algorithms and Computations (ISAAC), 2005, SpringerVerlag Lecture
Notes in Computer Science 3827, pp. 543552.
4) S. Rajasekaran and S. Sen, PDM Sorting Algorithms that
Take a Small Number of Passes, Proc. International Parallel and
Distributed Processing Symposium (IPDPS), 2005.
3) S. Rajasekaran and X. Jin, A Practical Realization of
Parallel Disks, Proc. Workshop on High Performance Scientific and
Engineering Computing with Applications, 2000.
2) S. Rajasekaran, A Framework For Simple Sorting
Algorithms On Parallel Disk Systems, Proc. 10th Annual ACM Symposium on
Parallel Algorithms and Architectures, 1998.
1) S. Rajasekaran, Selection Algorithms for Parallel Disk
Systems, Proc. International Conference on HighPerformance Computing,
1998.
PARALLEL SORTING, SELECTION, PACKET
ROUTING, ETC.
39) S. Rajasekaran, D. Sharma, R.A. Ammar, and N. Lownes, An efficient randomized routing protocol for singlehop radio networks, Proc. International Conference on Parallel Processing (ICPP), San Diego, September 2010.
38) A. Ebaid, R.A. Ammar, S. Rajasekaran, and T.A. Fergany, Task clustering and scheduling with duplication using recursive critical path approach (RCPA), Proc.IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), Luxor, Egypt, December 1518, 2010, pp. 1518.
37) M.F. Ahmed, R.A. Ammar, and S. Rajasekaran, FFTI: Fast inplace FFT on the cell broadband engine, Proc. 25th International Conference on Computers and Their Applications, Honolulu, Hawaii, March 2426, 2010, pp. 167173.
36) M.F. Ahmed, R.A. Ammar, and S. Rajasekaran, Novel microthreading techniques on the cell broadband engine, Proc. 14th IEEE Symposium on Computers and Communication (ISCC), Sousse, Tunis, July 58, 2009, pp. 570575.
35) D. Sharma, V. Thapar, S. Rajasekaran, R.A. Ammar, and M.F. Ahmed, Efficient sorting algorithms for the cell broadband engine, Proc. 13th IEEE Symposium on Computers and Communication (ISCC), Marrakesh, Morocco, July 59, 2008, pp. 736741.
34) M.F. Ahmed, R.A. Ammar, and S. Rajasekaran, SPENK: adding another level of parallelism on the cell broadband engine, Proc. 1st International Forum on NextGeneration Multicore/Manycore Technologies (IFMT), Cairo, Egypt, November 2425, 2008, pp. 110.
33) M.I. Soliman, S. Rajasekaran and R.A. Ammar, A Block JRS Algorithm for Highly Parallel Computation of SVDs, Proc. HPCC, 2007, SpringerVerlag LNCS, pp. 346357.
32) R.A. Ammar, S. Rajasekaran, A. Hussein, and A. Hamdy, Efficient scheduling of realtime tandem task graphs on heterogeneous clusters with network limitations, Proc. IEEE International Conference on Computers and Communications (ISCC), 2007, pp. 227232.
31) K.M. Konwar, S. Rajasekaran, and A.A. Shvartsman,
Robust Network Supercomputing with Malicious Processes, Proc. 20th
International Symposium on Distributed Computing (DISC), 2006.
30) J. Davila and S. Rajasekaran, Randomized Sorting on
the POPS Network, Proc. Parallel and Distributed Computing Symposium (PDCS),
2004.
29) S. Rajasekaran and J. Davila, Packet Routing and
Selection on the POPS Network, Proc. International Conference on
Parallel and Distributed Systems (ICPADS), 2004.
28) S. Rajasekaran and S. Sahni, Randomized Routing, Selection, and Sorting
on the OTISMesh, Proc. European Symposium on Parallel and Distributed
Systems, 1998.
27) S. Rajasekaran and S. Sahni, Computing on the Array with Reconfigurable
Optical Buses, Proc. World Multiconference on Systemics, Cybernetics,
andInformatics, Caracas, 1997, Volume 1, pp. 459466.
26) S. Rajasekaran, Basic Algorithms for Computing on Optical Models,
IMA Workshop on Parallel Processing for Discrete Problems, 1997.
25) S. Rajasekaran, Computing on Optical Models, DIMACS Workshop on
Randomization Methods in Algorithm Design, 1997.
24) 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 1216, 1997).
23) S. Rajasekaran and S. Sahni, Computing on the Array with
Reconfigurable Optical Buses, International Conference in Computer
Science, Caracuss, Venezuela, July 1997.
22) S. Rajasekaran and D.S.L. Wei, Designing Efficient Distributed
Algorithms Using Sampling Techniques, Proc. International Parallel
Processing Symposium, 1997.
21) 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. 105112.
20) 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. 6978.
19) S. Rajasekaran and S. Sahni, Sorting and Selection on
the Distributed Memory Bus Computer, Proc. International Conference on
Parallel Processing, 1995.
18) S. Rajasekaran, W. Chen, and S. Yooseph, Unifying Themes for Parallel
Selection, Proc. Fifth International Symposium on Algorithms and
Computation, August 1994. SpringerVerlag Lecture Notes in Computer
Science 834, pp. 92100.
17) S. Rajasekaran, Packet Routing on Meshes with Buses,
presented in the DIMACS Workshop on Organizing and Moving Data in
Parallel Computers, January 2628, 1994.
16) S. Rajasekaran, Sorting and Selection on Interconnection Networks,
DIMACS Workshop on Interconnection Networks and Mapping and Scheduling
Parallel Computation, Feb. 79, 1994.
15) S. Rajasekaran, Packet Routing on Meshes with Buses, DIMACS
Workshop on Organizing and Moving Data in Parallel Computers, January
2628, 1994.
14) J. C. Cogolludo and S. Rajasekaran,
Permutation
Routing on Reconfigurable Meshes, Proc. Fourth Annual International
Symposium on Algorithms and Computation, Hong Kong, December 1993.
SpringerVerlag Lecture Notes in Computer Science 762, 1993, pp. 157166.
13) S. Rajasekaran, Mesh Connected Computers with Fixed and Reconfigurable
Buses: Packet Routing, Sorting, and Selection, Proc. First Annual
European Symposium on Algorithms, Oct. 1993. SpringerVerlag Lecture
Notes in Computer Science 726, 1993, pp. 272283.
12) S. Rajasekaran, Mesh Connected Computers with Fixed and Reconfigurable
Buses, DIMACS workshop on Models, Architectures, and Technologies for
Parallel Computation, Sept 2022, 1993.
11) S. Rajasekaran and D.S.L. Wei, Selection, Routing, and
Sorting on the Star Graph, Proc. International Parallel Processing
Symposium, pp. 661665, April 1993.
10) 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.
3140, July 1992.
9) 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. 305311.
8) M.A. Palis, S. Rajasekaran, and D.S.L. Wei, Emulation of PRAMs on
Leveled Networks, Proc. International Conference on Parallel Processing,
1991.
7) S. Rajasekaran and R. Overholt, Constant Queue Routing on a Mesh,
Proc. Symposium on Theoretical Aspects of Computer Science, Feb. 1991,
Hamburg, Germany. SpringerVerlag Lecture Notes in Computer Science 480,
pp. 444455.
6) S. Rajasekaran, Randomized Parallel Selection, Proc. Tenth
conference on Foundations of Software Technology and Theoretical Computer
Science, Dec. 1990, Bangalore, India. SpringerVerlag Lecture Notes in
Computer Science 472, pp. 215224.
5) 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.
4) D. Krizanc, S. Rajasekaran and T. Tsantilas,
Optimal
Routing Algorithms for MeshConnected Processor Arrays, Proc. Third
International Aegean Workshop on Parallel Computation and VLSI theory,
SpringerVerlag Lecture Notes in Computer Science 319, pp. 411422, 1988.
3) S. Rajasekaran and T. Tsantilas, An Optimal Randomized Routing
Algorithm for the Mesh and A Class of Efficient MeshLike Routing
Networks, Proc. 7th Conference on Foundations of Software Technology
and Theoretical Computer Science, Pune, India, Dec. 1987. SpringerVerlag
Lecture Notes in Computer Science 287, pp. 226241.
2) S. Rajasekaran and J.H. Reif, Randomized Parallel
Computation, Fundamentals of Computation Theory Conference, Kazen,
USSR, August 1987. SpringerVerlag Lecture Notes in Computer Science 278,
pp. 364376.
1) 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.
COMPUTER SIMULATIONS
4) 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, March 2004, pp. 7578.
3) J. Luo, S. Rajasekaran, and C. Qiu, Parallelizing Wave Simulation Model
by Using PVM, Proc. 8th Annual European PVM/MPI Conference, 2001.
2) 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.
1) B. Thorndyke, P.A. Fishwick, and S. Rajasekaran, A
Randomized Approach to Hybrid MonteCarlo Simulation, Proc. SCS
Simulation Multiconference, 1996, pp. 1317.
TRANSPORTATION NETWORKS
5) N.E. Lownes, Q. Wang, S. Ibrahim, R. Ammar, S. Rajasekaran, and D.A. Sharma, Manytomany game theoretic approach to measuring transportation network vulnerability, Proc. 90th Annual Meeting of the Transportation Research Board, Washington, DC, 2011.
D. Sharma, S. Rajasekaran, R.A. Ammar, and N. Lownes, Multilevel sensor deployment algorithm for wireless sensor networks, Proc. 1st International Conference on Advanced Computing and Communication, September 1517, Orlando, Florida, 2010.
4) N. Lownes and R. Ammar, and S. Rajasekaran, Transportation network risk modeling, Proc. First FrancoAmerican Symposium on Linear Infrastructures Security, Troyes, France, November 4, 2010.
3) N. Lownes, R. Ammar, S. Rajasekaran, L. Fiondella, and Q. Wang, Securing America’s future transportation infrastructure: Network vulnerability and highspeed rail, Proc. The DHS Science Conference  Fifth Annual University Network Summit, Washington, DC, Mar 2011, Panel 15.
2) L. Fiondella, S. Tolba, A. Byrd, Q. Wang, R. Ammar, S. Rajasekaran, and N. Lownes, Optimal deployment and protection of highspeed rail, Proc. Fifth Annual Department of Homeland Security Student Day, Washington, DC, pp. 5556, Mar 2011. Panel 3.
1) Q. Wang, L. Fiondella, A. Byrd, S. Tolba, R. Ammar, S. Rajasekaran, and N. Lownes, A many to many game theory Approach to measuring transportation network vulnerability, Proc. Fifth Annual Department of Homeland Security Student Day, Washington, DC, pp. 8788, Mar 2011. Panel 3.
WEBCACHING ALGORITHMS
4) 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.
3) 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 Distributed Processing, and
Applications, October 2002, Tsukuba, Japan.
2) J. Lim and S. Rajasekaran, Parallel Cache Management Protocol for
Static and Dynamic Web Contents, Proc. IADIS International WWW/Internet
Conference, November 2002, Lisbon, Portugal, pp. 2028.
1) 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.
SEMANTIC NETWORKS
2) C.W. Lee, C.H. Huang, and S. Rajasekaran, TROJAN:
A Scalable Parallel Semantic Network System, Proc. 15th IEEE
International Conference on Tools with Artificial Intelligence (ICTAI),
November 2003, pp. 219223.
1) C.W. Lee, C.H. Huang, S. Rajasekaran, L.
Yang, and D. F. Hsu, Distributed PathBased Inference in Semantic
Networks, Proc. 7th IEEE International Symposium on Parallel
Architectures, Algorithms and Networks (ISPAN), May 2004, pp. 232237.
COMPUTATIONAL GEOMETRY AND MOTION
PLANNING
3) 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. 5766.
2) 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.
1) 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.
MOBILE COMPUTING
3) S. Rajasekaran, D. Sharma, R.A. Ammar, and N. Lownes, An efficient randomized routing protocol for singlehop radio networks, Proc. International Conference on Parallel Processing (ICPP), San Diego, September 2010.
2) S. Rajasekaran, K. Naik, D. Wei, Frequency Assignment Algorithms for
Cellular Networks, Proc. DIMACS Workshop on Mobile Networks and
Computing, 1999.
1) 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.
PARSING ALGORITHMS
1) S. Rajasekaran and S. Yooseph, TAL Parsing in O(M(n^{2})) Time,
Proc. Meeting of the Association for Computational Linguistics,
1995.
MODEL CHECKING AND REALTIME SYSTEMS
2) 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. SpringerVerlag Lecture Notes in Computer Science 818, 1994, pp.
404414.
1) I. Lee and S. Rajasekaran, Fast Parallel Algorithms for
Model Checking using BDDs, Proc. International Parallel Processing
Symposium, pp. 444448, April 1993.
OPTIMIZATION
4) A. Amin, R.A. Ammar, and S. Rajasekaran, Maximizing Reliability While
Scheduling RealTime TaskGraphs on a Cluster of Computers, Proc. 10th
IEEE International Symposium on Computers and Communications (ISCC),
2005, pp. 10011006.
3) A. Amin, R. Ammar, and S. Rajasekaran, A Randomized
Algorithm to Schedule RealTime Task Graphs to Satisfy a MultiCriteria
Objective Function, Proc. IEEE International Symposium on Signal
Processing and Information Technology (ISSPIT), Rome, Italy, December
2004.
2) 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.
1) 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. SpringerVerlag
Lecture Notes in Computer Science 317, pp.455472.
LEARNING THEORY
1) R. Paturi, S. Rajasekaran, and J.H. Reif, The Light Bulb Problem, Proc.
Second Workshop on Computational Learning Theory, Santa Cruz, pp. 261268,
July 1989.

