CONFERENCE AND WORKSHOP PAPERS

 

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 28-31, 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 14-17, 2010.

41) V. Kundeti, S. Rajasekaran, and H. Dinh, An efficient algorithm for chinese postman walk on bi-directed de Bruijn graphs, Proc. 4th International Conference on Combinatorial Optimization and Applications (COCOA), Kailua-Kona, HI, December 18-20, 2010, pp. 184-196.

40) 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.

39) 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, Rimini, Italy, September 14-18, 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 20-22, 2009, Springer LNCS 5633, pp. 388-400.

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. 90-101.

35) 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, 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. 135-147.

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. 148-158.

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

31) V. Kundeti and S. Rajasekaran, Generalized algorithms for generating balanced modulation codes in protein-based volumetric memories, Proc. 10th Annual IEEE Congress on Evolutionary Computation (IEEE CEC), May 18-21, 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 22-24, 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 30-April 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 30-April 2, 2009.

27) S. Rajasekaran, V. Kumar, S. Sahni, and R. Birge, Efficient algorithms for protein-based associative processors and volumetric memories, Proc. 8th IEEE International Conference Nanotechnology (IEEE NANO), August 18-21, Arlington, TX, 2008, pp. 397-400.

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 3-5, 2008, pp. 443-446.

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 Application-Specific Systems, Architectures, and Processors (IEEE ASAP), July 2008, pp. 156-161.

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 8-10, 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. 132-143.

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, Springer-Verlag LNCS, 2008, pp. 893-902.

20) S. Rajasekaran, Parallel algorithms for motif search, Proc. ISCA International Conference on Parallel and Distributed Computing Systems (PDCS), 2007, pp. 175-180.

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. 302-309.

18) M. Song and S. Rajasekaran, A greedy correlation-incorporated SVM-based algorithm for gene selection, Proc. AINA Workshops (1), 2007, pp. 657-661.

17) D. Trinca and S. Rajasekaran, Self-optimizing 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. 1294-1298.

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. 260-269.

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. 822-829.

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. 822-829.

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. Asia-Pacific Bioinformatics Conference (APBC), 2005, pp. 239-248.

10) S. Rajasekaran, S. Balla, and C.-H. Huang, Exact Algorithms for Planted Motif Challenge Problems, Proc. Asia-Pacific Bioinformatics Conference (APBC), 2005, pp. 249-258.

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, Springer-Verlag LNCS 3303, pp. 33-45.

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. 556-557.

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. 122-123.

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

3) R. Trumbower, P. Faghri, and S. Rajasekaran, Rigid Link-Segment Models as Predictors of Semi-Reclined 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. El-Maghraby, R.A. Ammar, I.A. El-Bagd, W. Sheta, S. Nassar, S. Rajasekaran, and A. El-Dessouki, Towards a fast surface energy balance algorithm for land, Proc.1st International Conference on Advanced Computing and Communication, September 15-17,  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 24-26, 2010, pp. 7-12.

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 4-6, 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. 10-13.

12) 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, Springer LNCS, 2007.

11) 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.

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, Springer-Verlag Lecture Notes in Computer Science 4208, pp. 129-137.

9) 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.

8) 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.

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

6) M. Song and S. Rajasekaran, Fast k-means Algorithms with Constant Approximation, Proc. International Symposium on Algorithms and Computation (ISAAC), 2005, Springer-Verlag Lecture Notes in Computer Science 3827, pp. 1029-1038.

5) 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, 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 Knowledge-Based Intelligent Information & Engineering Systems (KES), Springer-Verlag LNCS 3213, 2004, pp. 189-195.

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.

 

OUT-OF-CORE 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. 97-107.

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, Springer-Verlag Lecture Notes in Computer Science 3827, pp. 543-552.

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 High-Performance 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 single-hop 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 15-18, 2010, pp. 15-18.

37) M.F. Ahmed, R.A. Ammar, and S. Rajasekaran, FFTI: Fast in-place FFT on the cell broadband engine, Proc. 25th International Conference on Computers and Their Applications, Honolulu, Hawaii, March 24-26, 2010, pp. 167-173.

36) M.F. Ahmed, R.A. Ammar, and S. Rajasekaran, Novel micro-threading techniques on the cell broadband engine, Proc. 14th IEEE Symposium on Computers and Communication (ISCC), Sousse, Tunis, July 5-8, 2009, pp. 570-575.

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 5-9, 2008, pp. 736-741.

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 Next-Generation Multicore/Manycore Technologies (IFMT), Cairo, Egypt, November 24-25, 2008, pp. 1-10.

33) 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.

32) R.A. Ammar, S. Rajasekaran, A. Hussein, and 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.

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 OTIS-Mesh, 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. 459-466.

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 12-16, 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. 105-112.

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. 69-78.

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. Springer-Verlag Lecture Notes in Computer Science 834, pp. 92-100.

17) 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.

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

15) S. Rajasekaran, Packet Routing on Meshes with Buses, DIMACS Workshop on Organizing and Moving Data in Parallel Computers, January 26-28, 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. Springer-Verlag Lecture Notes in Computer Science 762, 1993, pp. 157-166.

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. Springer-Verlag Lecture Notes in Computer Science 726, 1993, pp. 272-283.

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

11) 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.

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. 31-40, 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. 305-311.

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. Springer-Verlag Lecture Notes in Computer Science 480, pp. 444-455.

6) 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.

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 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.

3) 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.

2) 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.

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. 75-78.

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 Monte-Carlo Simulation, Proc. SCS Simulation Multiconference, 1996, pp. 13-17.

 

TRANSPORTATION NETWORKS

5) N.E. Lownes, Q. Wang, S. Ibrahim, R. Ammar, S. Rajasekaran, and D.A. Sharma, Many-to-many 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, Multi-level sensor deployment algorithm for wireless sensor networks, Proc. 1st International Conference on Advanced Computing and Communication, September 15-17,  Orlando, Florida, 2010.

4) N. Lownes and R. Ammar, and S. Rajasekaran, Transportation network risk modeling, Proc. First Franco-American 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 high-speed 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 high-speed rail, Proc. Fifth Annual Department of Homeland Security Student Day, Washington, DC, pp. 55-56, 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. 87-88, Mar 2011. Panel 3.

WEB-CACHING 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. 20-28.

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. 219-223.

 1) C.-W. Lee, C.-H. Huang, S. Rajasekaran, L. Yang, and D. F. Hsu, Distributed Path-Based Inference in Semantic Networks, Proc. 7th IEEE International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), May 2004, pp. 232-237.

 

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. 57-66.

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 single-hop 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(n2)) Time, Proc. Meeting of the Association for Computational Linguistics, 1995.



MODEL CHECKING AND REAL-TIME 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. Springer-Verlag Lecture Notes in Computer Science 818, 1994, pp. 404-414.

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

OPTIMIZATION


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

3) A. Amin, R. Ammar, and S. 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.

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. Springer-Verlag Lecture Notes in Computer Science 317, pp.455-472.

 

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. 261-268, July 1989.