| 2013 | ||
|---|---|---|
| j78 | Sanguthevar Rajasekaran, Michal Wozniak: Special section on invited papers from NetCoM-2009. Future Generation Comp. Syst. 29(1): 241 (2013) | |
| j77 | Lance Fiondella, Sanguthevar Rajasekaran, Swapna S. Gokhale: Efficient Software Reliability Analysis With Correlated Component Failures. IEEE Transactions on Reliability 62(1): 244-255 (2013) | |
| 2012 | ||
| j76 | Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh: An Efficient Algorithm for Chinese Postman Walk on Bi-Directed de Bruijn Graphs. Discrete Math., Alg. and Appl. 4(2) (2012) | |
| j75 | Sanguthevar Rajasekaran, Lance Fiondella, Dolly Sharma, Reda A. Ammar, Nicholas Lownes: Communication and energy efficient routing protocols for single-hop radio networks. J. Parallel Distrib. Comput. 72(6): 819-826 (2012) | |
| j74 | Tian Mi, Sanguthevar Rajasekaran, Robert Aseltine: Efficient algorithms for fast integration on large data sets from multiple sources. BMC Med. Inf. & Decision Making 12: 59 (2012) | |
| j73 | Tian Mi, Jerlin Camilus Merlin, Sandeep Deverasetty, Michael R. Gryk, Travis J. Bill, Andrew W. Brooks, Logan Y. Lee, Viraj Rathnayake, Christian A. Ross, David P. Sargeant, Christy L. Strong, Paula Watts, Sanguthevar Rajasekaran, Martin R. Schiller: Minimotif Miner 3.0: database expansion and significantly improved reduction of false-positive predictions from consensus sequences. Nucleic Acids Research 40(Database-Issue): 252-260 (2012) | |
| j72 | Vamsi Kundeti, Sanguthevar Rajasekaran: Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models. Natural Computing 11(2): 199-207 (2012) | |
| c105 | Samir A. Mohamed Elsayed, Sanguthevar Rajasekaran, Reda A. Ammar: AC-CS: An Immune-Inspired Associative Classification Algorithm. ICARIS 2012: 139-151 | |
| c104 | Shibdas Bandyopadhyay, Sartaj Sahni, Sanguthevar Rajasekaran: PMS6: A fast algorithm for motif discovery. ICCABS 2012: 1-6 | |
| c103 | Hieu Dinh, Sanguthevar Rajasekaran: Workshop: An efficient data structure for exact-match overlap graphs and next generation sequence assembly. ICCABS 2012: 1 | |
| c102 | Mai Hamdalla, David F. Grant, Ion I. Mandoiu, Dennis W. Hill, Sanguthevar Rajasekaran, Reda A. Ammar: The use of graph matching algorithms to identify biochemical substructures in synthetic chemical compounds: Application to metabolomics. ICCABS 2012: 1-6 | |
| c101 | Samir A. Mohamed Elsayed, Sanguthevar Rajasekaran, Reda A. Ammar: An Artificial Immune System Approach to Associative Classification. ICCSA (1) 2012: 161-171 | |
| c100 | Samir A. Mohamed Elsayed, Sanguthevar Rajasekaran, Reda A. Ammar: ML-DS: A Novel Deterministic Sampling Algorithm for Association Rules Mining. ICDM 2012: 224-235 | |
| c99 | Jun Liu, Xu Han, Manal Al-Bzoor, Michael Zuba, Jun-Hong Cui, Reda A. Ammar, Sanguthevar Rajasekaran: PADP: Prediction assisted dynamic surface gateway placement for mobile underwater networks. ISCC 2012: 139-144 | |
| c98 | Rania Kilany, Reda A. Ammar, Sanguthevar Rajasekaran: A novel algorithm for technical articles classification based on gene selection. ISCC 2012: 234-238 | |
| c97 | Mahmoud Maghrbay, Reda A. Ammar, Sanguthevar Rajasekaran: Fast GPU algorithms for endmember extraction from hyperspectral images. ISCC 2012: 631-636 | |
| c96 | Samir A. Mohamed Elsayed, Reda A. Ammar, Sanguthevar Rajasekaran: Artificial Immune Systems: Models, Applications, and challenges. SAC 2012: 256-258 | |
| c95 | Manal Al-Bzoor, Yibo Zhu, Jun Liu, Reda A. Ammar, Jun-Hong Cui, Sanguthevar Rajasekaran: Adaptive Power Controlled Routing for Underwater Sensor Networks. WASA 2012: 549-560 | |
| e6 | Sorin Istrail, Ion I. Mandoiu, Mihai Pop, Sanguthevar Rajasekaran, John L. Spouge (Eds.): IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2012, Las Vegas, NV, USA, February 23-25, 2012. IEEE 2012, isbn 978-1-4673-1320-9 | |
| 2011 | ||
| j71 | Hieu Dinh, Sanguthevar Rajasekaran: A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly. Bioinformatics 27(14): 1901-1907 (2011) | |
| j70 | Hieu Dinh, Sanguthevar Rajasekaran, Vamsi Kundeti: PMS5: an efficient exact algorithm for the (l, d)-motif finding problem. BMC Bioinformatics 12: 410 (2011) | |
| j69 | Vamsi Kundeti, Sanguthevar Rajasekaran: Efficient out-of-core sorting algorithms for the Parallel Disks Model. J. Parallel Distrib. Comput. 71(11): 1427-1433 (2011) | |
| j68 | Vamsi Kundeti, Sanguthevar Rajasekaran: Efficient algorithms for self assembling non-rectangular nano structures. Natural Computing 10(1): 583-594 (2011) | |
| j67 | Mark Borodovsky, Teresa M. Przytycka, Sanguthevar Rajasekaran, Alexander Zelikovsky: Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications. IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 865-866 (2011) | |
| c94 | Lance Fiondella, Sanguthevar Rajasekaran, Swapna S. Gokhale: Efficient System Reliability with Correlated Component Failures. HASE 2011: 269-276 | |
| c93 | ||
| c92 | Sanguthevar Rajasekaran, Hieu Dinh, Vamsi Kundeti: Workshop: Efficient sequential and parallel algorithms for sequence assembly. ICCABS 2011: 274 | |
| c91 | Saleh Ibrahim, Reda A. Ammar, Sanguthevar Rajasekaran, Nicholas Lownes, Qixing Wang, Dolly Sharma: An efficient heuristic for estimating transportation network vulnerability. ISCC 2011: 1092-1098 | |
| c90 | Mahmoud Maghrbay, Reda A. Ammar, Sanguthevar Rajasekaran: Improving N-Finder technique for extracting endmembers. ISSPIT 2011: 42-49 | |
| c89 | Rania Kilany, Reda A. Ammar, Sanguthevar Rajasekaran: A correlation-based algorithm for classifying technical articles. ISSPIT 2011: 50-53 | |
| e5 | Ion I. Mandoiu, Satoru Miyano, Teresa M. Przytycka, Sanguthevar Rajasekaran (Eds.): IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2011, Orlando, FL, USA, February 3-5, 2011. IEEE Computer Society 2011, isbn 978-1-61284-851-8 | |
| i6 | Dolly Sharma, Sanguthevar Rajasekaran, Hieu Dinh: An Experimental Comparison of PMSPrune and Other Algorithms for Motif Search. CoRR abs/1108.5217 (2011) | |
| i5 | Dragos Trinca, Sanguthevar Rajasekaran: Parallel Algorithms for DNA Probe Placement on Small Oligonucleotide Arrays. CoRR abs/1110.3959 (2011) | |
| 2010 | ||
| j66 | Jay Vyas, Ronald J. Nowling, Thomas Meusburger, David P. Sargeant, Krishna Kadaveru, Michael R. Gryk, Vamsi Kundeti, Sanguthevar Rajasekaran, Martin R. Schiller: MimoSA: a system for minimotif annotation. BMC Bioinformatics 11: 328 (2010) | |
| j65 | Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh, Matthew Vaughn, Vishal Thapar: Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs. BMC Bioinformatics 11: 560 (2010) | |
| j64 | Mingjun Song, Sanguthevar Rajasekaran: A greedy algorithm for gene selection based on SVM and correlation. IJBRA 6(3): 296-307 (2010) | |
| j63 | Vamsi Kundeti, Sanguthevar Rajasekaran: On the Hardness of the Border Length Minimization Problem on a Rectangular Array. Int. J. Found. Comput. Sci. 21(6): 1089-1100 (2010) | |
| j62 | Vamsi Kundeti, Sanguthevar Rajasekaran: Fast algorithms for placing large entries along the diagonal of a sparse matrix. J. Computational Applied Mathematics 235(3): 756-764 (2010) | |
| j61 | Mingjun Song, Sanguthevar Rajasekaran: Fast Algorithms for Constant Approximation k-Means Clustering. Trans. MLDM 3(2): 67-79 (2010) | |
| j60 | Sanguthevar Rajasekaran, Sahar Al Seesi, Reda A. Ammar: Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 619-627 (2010) | |
| c88 | Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh: On the border length minimization problem (BLMP) on a square array. BCB 2010: 112-119 | |
| c87 | Mahmoud Maghrbay, Reda A. Ammar, Sanguthevar Rajasekaran: Network A Randomized Automatic Pixel Purity Index Technique. CATA 2010: 7-12 | |
| c86 | Mohamed F. Ahmed, Sanguthevar Rajasekaran, Reda A. Ammar: FFTI: Fast In-Place FFT on the Cell Broadband Engine. CATA 2010: 167-173 | |
| c85 | Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh: An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs. COCOA (1) 2010: 184-196 | |
| c84 | Vamsi Kundeti, Sanguthevar Rajasekaran: Randomized Self Assembly of Rectangular Nano Structures. DNA 2010: 100-111 | |
| c83 | Sanguthevar Rajasekaran, Dolly Sharma, Reda A. Ammar, Nicholas Lownes: An Efficient Randomized Routing Protocol for Single-Hop Radio Networks. ICPP 2010: 160-167 | |
| c82 | Ahmed Ebaid, Reda A. Ammar, Sanguthevar Rajasekaran, Tahany A. Fergany: Task clustering & scheduling with duplication using recursive critical path approach (RCPA). ISSPIT 2010: 34-41 | |
| e4 | Mark Borodovsky, Johann Peter Gogarten, Teresa M. Przytycka, Sanguthevar Rajasekaran (Eds.): Bioinformatics Research and Applications, 6th International Symposium, ISBRA 2010, Storrs, CT, USA, May 23-26, 2010. Proceedings. Lecture Notes in Computer Science 6053, Springer 2010, isbn 978-3-642-13077-9 | |
| i4 | Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh: Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs. CoRR abs/1003.1940 (2010) | |
| i3 | Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh: On the Border Length Minimization Problem (BLMP) on a Square Array. CoRR abs/1003.2839 (2010) | |
| i2 | Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh: An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs. CoRR abs/1006.4828 (2010) | |
| i1 | Hieu Dinh, Sanguthevar Rajasekaran: A memory-efficient data structure representing exact-match overlap graphs with application for next generation DNA assembly. CoRR abs/1009.3984 (2010) | |
| 2009 | ||
| j59 | Sanguthevar Rajasekaran, Vamsi Kundeti: Spectrum Based Techniques for Graph Isomorphism. Int. J. Found. Comput. Sci. 20(3): 479-499 (2009) | |
| j58 | Sanguthevar Rajasekaran, Sudha Balla, Patrick Gradie, Michael R. Gryk, Krishna Kadaveru, Vamsi Kundeti, Mark W. Maciejewski, Tian Mi, Nicholas Rubino, Jay Vyas, Martin R. Schiller: Minimotif miner 2nd release: a database and web system for motif search. Nucleic Acids Research 37(Database-Issue): 185-190 (2009) | |
| c81 | Mohamed F. Ahmed, Reda A. Ammar, Sanguthevar Rajasekaran: Optimal Micro-Threading Scheduling for Multi-Core Processors to Hide Memory Latency. ISCA PDCCS 2009: 221-227 | |
| c80 | Vamsi Kundeti, Sanguthevar Rajasekaran: On the Hardness of the Border Length Minimization Problem. BIBE 2009: 248-253 | |
| c79 | Sahar Al Seesi, Sanguthevar Rajasekaran, Reda A. Ammar: RNA Pseudoknot Folding through Inference and Identification Using TAGRNA. BICoB 2009: 90-101 | |
| c78 | Vamsi Kundeti, Sanguthevar Rajasekaran, R. Birge: Generalized algorithms for generating balanced modulation codes in protein-based volumetric memories. IEEE Congress on Evolutionary Computation 2009: 1585-1590 | |
| c77 | Dolly Sharma, Sanguthevar Rajasekaran: A Simple Algorithm for (l, d) Motif Search1. CIBCB 2009: 148-154 | |
| c76 | Dolly Sharma, Sudha Balla, Sanguthevar Rajasekaran, Nikoletta DiGirolamo: Degenerate primer selection algorithms. CIBCB 2009: 155-162 | |
| c75 | Sanguthevar Rajasekaran, Ofer Harel, Michael Zuba, Greg Matthews, Robert Aseltine: Responsible Data Releases. ICDM 2009: 388-400 | |
| c74 | Sanguthevar Rajasekaran, Sahar Al Seesi, Reda A. Ammar: Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots. ISBRA 2009: 135-147 | |
| c73 | Vamsi Kundeti, Sanguthevar Rajasekaran: Efficient Algorithms for Self Assembling Triangular and Other Nano Structures. ISBRA 2009: 148-158 | |
| c72 | Mohamed F. Ahmed, Reda A. Ammar, Sanguthevar Rajasekaran: Novel micro-threading techniques on the Cell Broadband Engine. ISCC 2009: 570-575 | |
| e3 | Sanguthevar Rajasekaran (Ed.): Bioinformatics and Computational Biology, First International Conference, BICoB 2009, New Orleans, LA, USA, April 8-10, 2009. Proceedings. Lecture Notes in Computer Science 5462, Springer 2009, isbn 978-3-642-00726-2 | |
| 2008 | ||
| j57 | Sanguthevar Rajasekaran: Special issue on parallel techniques for information extraction. J. Parallel Distrib. Comput. 68(1): 1-2 (2008) | |
| j56 | Sanguthevar Rajasekaran, Mingjun Song: A relaxation scheme for increasing the parallelism in Jacobi-SVD. J. Parallel Distrib. Comput. 68(6): 769-777 (2008) | |
| j55 | Sanguthevar Rajasekaran, Sandeep Sen: Optimal and Practical Algorithms for Sorting on the PDM. IEEE Trans. Computers 57(4): 547-561 (2008) | |
| c71 | Vamsi Kundeti, Yunsi Fei, Sanguthevar Rajasekaran: An efficient digital circuit for implementing Sequence Alignment algorithm in an extended processor. ASAP 2008: 156-161 | |
| c70 | Sudha Balla, Sanguthevar Rajasekaran, Ion I. Mandoiu: Faster greedy algorithms for Multiple Degenerate Primer Selection. BIBE 2008: 1-4 | |
| c69 | Vamsi Kundeti, Sanguthevar Rajasekaran: A local structural alignment algorithm with Variable Length Alignment Fragment Pairs. BIBE 2008: 1-7 | |
| c68 | Vishal Thapar, Sanguthevar Rajasekaran: Sampling Based Meta-algorithms for Accurate Multiple Sequence Alignment. BIBM 2008: 429-432 | |
| c67 | Tian Mi, Robert Aseltine, Sanguthevar Rajasekaran: Data Integration on Multiple Data Sets. BIBM 2008: 443-446 | |
| c66 | Mingjun Song, Sanguthevar Rajasekaran: A Novel Scheme for the Detection of an Unknown Class in Classification. DMIN 2008: 10-13 | |
| c65 | ||
| c64 | Vamsi Kundeti, Sanguthevar Rajasekaran: Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space. ICCS (1) 2008: 893-902 | |
| c63 | Mohamed F. Ahmed, Reda A. Ammar, Sanguthevar Rajasekaran: SPENK: adding another level of parallelism on the cell broadband engine. IFMT 2008: 2 | |
| c62 | Dolly Sharma, Vishal Thapar, Reda A. Ammar, Sanguthevar Rajasekaran, M. Ahmed: Efficient sorting algorithms for the cell broadband engine. ISCC 2008: 736-741 | |
| c61 | Sahar Al Seesi, Sanguthevar Rajasekaran, Reda A. Ammar: Pseudoknot Identification through Learning TAGRNA. PRIB 2008: 132-143 | |
| 2007 | ||
| j54 | Sudha Balla, Sanguthevar Rajasekaran, Ion I. Mandoiu: Efficient Algorithms for degenerate Primer Search. Int. J. Found. Comput. Sci. 18(4): 899-910 (2007) | |
| j53 | Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran: Fast and Practical Algorithms for Planted (l, d) Motif Search. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 544-552 (2007) | |
| c60 | ||
| c59 | Mingjun Song, Sanguthevar Rajasekaran: A Greedy Correlation-Incorporated SVM-Based Algorithm for Gene Selection. AINA Workshops (1) 2007: 657-661 | |
| c58 | Dragos Trinca, Sanguthevar Rajasekaran: Self-Optimizing Parallel Algorithms for Haplotype Reconstruction and Their Evaluation on the JPT and CHB Genotype Data. BIBE 2007: 1294-1298 | |
| c57 | Dragos Trinca, Sanguthevar Rajasekaran: Fast Cryptographic Multi-party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association Rule Mining in Vertically Partitioned Data. DaWaK 2007: 418-427 | |
| c56 | Mostafa I. Soliman, Sanguthevar Rajasekaran, Reda A. Ammar: A Block JRS Algorithm for Highly Parallel Computation of SVDs. HPCC 2007: 346-357 | |
| c55 | Dragos Trinca, Sanguthevar Rajasekaran: Fast Cryptographic Multi-Party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association: Rule Mining in Vertically Partitioned Data. Industrial Conference on Data Mining - Posters and Workshops 2007: 86 | |
| c54 | Dragos Trinca, Sanguthevar Rajasekaran: Towards a Collusion-Resistant Algebraic Multi-Party Protocol for Privacy-Preserving Association Rule Mining in Vertically Partitioned Data. IPCCC 2007: 402-409 | |
| c53 | Sudha Balla, Sanguthevar Rajasekaran: Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data. ISBRA 2007: 260-269 | |
| c52 | Reda A. Ammar, Sanguthevar Rajasekaran, Ahmed Hussein, Abeer Hamdy: Efficient Scheduling of Real-time Tandem Task Graphs on Heterogeneous Clusters with Network Limitations. ISCC 2007: 227-232 | |
| c51 | Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran: Fast Algorithms for Selecting Specific siRNA in Complete mRNA Data. WABI 2007: 302-309 | |
| 2006 | ||
| j52 | Chun-Hsi Huang, Sanguthevar Rajasekaran, Laurence Tianruo Yang, Xin He: Finding Hamiltonian paths in tournaments on clusters. Cluster Computing 9(3): 345-353 (2006) | |
| j51 | Sanguthevar Rajasekaran, Reda A. Ammar, D. G. Shin, G. Zhang: Efficient parallel algorithms for processing biological sequences. IJCAT 26(3): 119-125 (2006) | |
| j50 | Jun Luo, Sanguthevar Rajasekaran: A Framework for Mining Association Rules. I. J. Comput. Appl. 13(1): 39-49 (2006) | |
| j49 | Mingjun Song, Sanguthevar Rajasekaran: A Transaction Mapping Algorithm for Frequent Itemsets Mining. IEEE Trans. Knowl. Data Eng. 18(4): 472-481 (2006) | |
| p1 | Reda A. Ammar, Steven A. Demurjian, Ian R. Greenshields, Krishna R. Pattipati, Sanguthevar Rajasekaran: Analysis of Heterogeneous Data in Ultrahigh Dimensions. Emergent Information Technologies and Enabling Policies for Counter-Terrorism 2006 | |
| c50 | Jaime Davila, Sanguthevar Rajasekaran: Extending Pattern Branching to Handle Challenging Instances. BIBE 2006: 65-69 | |
| c49 | Sanguthevar Rajasekaran, Mingjun Song: A Novel Scheme for the Parallel Computation of SVDs. HPCC 2006: 129-137 | |
| c48 | Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran: Space and Time Efficient Algorithms for Planted Motif Search. International Conference on Computational Science (2) 2006: 822-829 | |
| c47 | Kishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Shvartsman: Robust Network Supercomputing with Malicious Processes. DISC 2006: 474-488 | |
| e2 | Sanguthevar Rajasekaran (Ed.): Proceedings of the Third IASTED International Conference on Communication, Network, and Information Security, October 9-11, 2006, Cambridge, MA, USA. IASTED/ACTA Press 2006, isbn 0-88986-636-8 | |
| 2005 | ||
| j48 | Jaime Davila, Sanguthevar Rajasekaran: Randomized Sorting On The Pops Network. Int. J. Found. Comput. Sci. 16(1): 105-116 (2005) | |
| j47 | Sanguthevar Rajasekaran, Sandeep Sen: A generalization of the 0-1 principle for sorting. Inf. Process. Lett. 94(1): 43-47 (2005) | |
| j46 | Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang: Exact Algorithms for Planted Motif Problems. Journal of Computational Biology 12(8): 1117-1128 (2005) | |
| j45 | Sanguthevar Rajasekaran, Jaime Davila: Packet routing and selection on the POPS network. J. Parallel Distrib. Comput. 65(8): 927-933 (2005) | |
| j44 | Sanguthevar Rajasekaran: Efficient Parallel Hierarchical Clustering Algorithms. IEEE Trans. Parallel Distrib. Syst. 16(6): 497-502 (2005) | |
| c46 | Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang, Vishal Thapar, Michael R. Gryk, Mark W. Maciejewski, Martin R. Schiller: Exact algorithms for motif search. APBC 2005: 239-248 | |
| c45 | Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang: Exact algorithms for planted motif challenge problems. APBC 2005: 249-259 | |
| c44 | Chun-Hsi Huang, Sanguthevar Rajasekaran: BioGrid- bridging life science and information technology. CCGRID 2005: 450-454 | |
| c43 | Sanguthevar Rajasekaran, Sandeep Sen: PDM Sorting Algorithms That Take A Small Number of Passes. IPDPS 2005 | |
| c42 | Sanguthevar Rajasekaran, Sandeep Sen: A Simple Optimal Randomized Algorithm for Sorting on the PDM. ISAAC 2005: 543-552 | |
| c41 | Mingjun Song, Sanguthevar Rajasekaran: Fast k-Means Algorithms with Constant Approximation. ISAAC 2005: 1029-1038 | |
| c40 | Alaa Amin, Reda A. Ammar, Sanguthevar Rajasekaran: Maximizing Reliability While Scheduling Real-Time Task-Graphs on a Cluster of Computers. ISCC 2005: 1001-1006 | |
| c39 | ||
| c38 | Mingjun Song, Sanguthevar Rajasekaran: Finding frequent itemsets by transaction mapping. SAC 2005: 488-492 | |
| e1 | Michael J. Oudshoorn, Sanguthevar Rajasekaran (Eds.): Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, September 12-14, 2005 Imperial Palace Hotel, Las Vegas, Nevada, USA. ISCA 2005, isbn 1-880843-56-0 | |
| 2004 | ||
| j43 | Jun Luo, Sanguthevar Rajasekaran: Parallizing 1-Dimensional Estuarine Model. Int. J. Found. Comput. Sci. 15(6): 809-821 (2004) | |
| j42 | Sanguthevar Rajasekaran: Out-of-core computing on mesh connected computers. J. Parallel Distrib. Comput. 64(11): 1311-1317 (2004) | |
| j41 | Chun-Hsi Huang, Sanguthevar Rajasekaran: High-performance parallel bio-computing. Parallel Computing 30(9-10): 999-1000 (2004) | |
| j40 | Chain-Wu Lee, Chun-Hsi Huang, Laurence Tianruo Yang, Sanguthevar Rajasekaran: Distributed Path-Based Inference in Semantic Networks. The Journal of Supercomputing 29(2): 211-227 (2004) | |
| j39 | Lixin Fu, Sanguthevar Rajasekaran: Evaluating holistic aggregators efficiently for very large datasets. VLDB J. 13(2): 148-161 (2004) | |
| c37 | Sanguthevar Rajasekaran: Efficient Parallel Hierarchical Clustering Algorithms. ISCA PDCS 2004: 27-32 | |
| c36 | Jaime Davila, Sanguthevar Rajasekaran: Randomized Sorting on the POPS Network. ISCA PDCS 2004: 45-50 | |
| c35 | Sanguthevar Rajasekaran, Reda A. Ammar, K. Reifsnider, Luke E. K. Achenie, Ahmed M. Mohamed, G. Zhang, M. Ahmed: Efficient Parallel Simulation of Direct Methanol Fuel Cell Models. Computers and Their Applications 2004: 75-78 | |
| c34 | Sanguthevar Rajasekaran, Jaime Davila: A Fundamental Problem in Computer and Communication. ICPADS 2004: 81- | |
| c33 | Chain-Wu Lee, Laurence Tianruo Yang, Chun-Hsi Huang, Sanguthevar Rajasekaran, D. Frank Hsu: Distributed Path-Based Inference in Semantic Networks. ISPAN 2004: 232-238 | |
| c32 | Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dave, Chun-Hsi Huang: A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment. KELSI 2004: 33-45 | |
| c31 | ||
| 2003 | ||
| j38 | David S. L. Wei, Sanguthevar Rajasekaran, Kshirasagar Naik, Sy-Yen Kuo: Efficient Algorithms For Selection And Sorting Of Large Distributed Files On De Bruijn And Hypercube Structures. Int. J. Found. Comput. Sci. 14(6): 1129-1146 (2003) | |
| c30 | Jaeyong Lim, Sanguthevar Rajasekaran: Parallel cache management protocol and algorithm for cooperative Web servers. ICC 2003: 918-922 | |
| c29 | Chain-Wu Lee, Chun-Hsi Huang, Sanguthevar Rajasekaran: TROJAN: A Scalable Distributed Semantic Network System. ICTAI 2003: 219- | |
| 2002 | ||
| j37 | Sanguthevar Rajasekaran, Suneeta Ramaswami: Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane. Algorithmica 33(4): 436-460 (2002) | |
| j36 | Sanguthevar Rajasekaran, X. Jin, John L. Spouge: The Efficient Computation of Position-Specific Match Scores with the Fast Fourier Transform. Journal of Computational Biology 9(1): 23-33 (2002) | |
| j35 | David S. L. Wei, Sanguthevar Rajasekaran, Zixue Cheng, Kshirasagar Naik, Sy-Yen Kuo: Efficient Selection and Sorting Schemes Using Coteries for Processing Large Distributed Files. J. Parallel Distrib. Comput. 62(8): 1295-1313 (2002) | |
| j34 | Sanguthevar Rajasekaran: Efficient Parallel Algorithms for Template Matching. Parallel Processing Letters 12(3-4): 359-364 (2002) | |
| c28 | Jaeyong Lim, Sanguthevar Rajasekaran: Parallel Cache Management Protocol for Static and Dynamic Web Contents. ICWI 2002: 20-28 | |
| c27 | Jaeyong Lim, Sanguthevar Rajasekaran: Distributed Cache Content Management Protocol for Cooperative Web Server. IASTED PDCS 2002: 662-667 | |
| 2001 | ||
| j33 | J. C. Cogolludo, Sanguthevar Rajasekaran: Permutation Routing on Reconfigurable Meshes. Algorithmica 31(1): 44-57 (2001) | |
| j32 | Sanguthevar Rajasekaran, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw: Efficient Algorithms for Local Alignment Search. J. Comb. Optim. 5(1): 117-124 (2001) | |
| j31 | Sanguthevar Rajasekaran, Y. Hu, Jun Luo, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw: Efficient Algorithms for Similarity Search. J. Comb. Optim. 5(1): 125-132 (2001) | |
| j30 | Sanguthevar Rajasekaran: Selection Algorithms for Parallel Disk Systems. J. Parallel Distrib. Comput. 61(4): 536-544 (2001) | |
| j29 | Sanguthevar Rajasekaran: A Framework for Simple Sorting Algorithms on Parallel Disk Systems. Theory Comput. Syst. 34(2): 101-114 (2001) | |
| c26 | Lixin Fu, Sanguthevar Rajasekaran: Novel Algorithms for Computing Medians and Other Quantiles of Disk-Resident Data. IDEAS 2001: 145-154 | |
| c25 | Jun Luo, Sanguthevar Rajasekaran, Chenxia Qiu: Parallelizing 1-Dimensional Estuarine Model. PVM/MPI 2001: 257-264 | |
| 2000 | ||
| j28 | Sanguthevar Rajasekaran, Sartaj Sahni: Special Issue on Randomized Computing. Int. J. Found. Comput. Sci. 11(2): 205 (2000) | |
| c24 | Sanguthevar Rajasekaran, Xiao-ming Jin: A Practical Realization of Parallel Disks. ICPP Workshops 2000: 337- | |
| c23 | Sartaj Sahni, Timothy A. Davis, Sanguthevar Rajasekaran, Sanjay Ranka: Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel. IPDPS Workshops 2000: 423-426 | |
| 1999 | ||
| j27 | Hossam A. ElGindy, Sanguthevar Rajasekaran: Sorting and Selection on a Linear Array with Optical Bus System. Parallel Processing Letters 9(3): 373-383 (1999) | |
| 1998 | ||
| j26 | Sanguthevar Rajasekaran, T. McKendall: Permutation Routing and Sorting on the Reconfigurable Mesh. Int. J. Found. Comput. Sci. 9(2): 199-212 (1998) | |
| j25 | Sanguthevar Rajasekaran: An Optimal Parallel Algorithm for Sorting Multisets. Inf. Process. Lett. 67(3): 141-143 (1998) | |
| j24 | Sanguthevar Rajasekaran: Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses. J. Algorithms 29(1): 68-81 (1998) | |
| j23 | Sanguthevar Rajasekaran, Shibu Yooseph: TAL Recognition in O(M(n»)) Time. J. Comput. Syst. Sci. 56(1): 83-89 (1998) | |
| j22 | Sanguthevar Rajasekaran, Insup Lee: Parallel Algorithms for Relational Coarsest Partition Problems. IEEE Trans. Parallel Distrib. Syst. 9(7): 687-699 (1998) | |
| j21 | Sanguthevar Rajasekaran, Sartaj Sahni: Randomized Routing, Selection, and Sorting on the OTIS-Mesh. IEEE Trans. Parallel Distrib. Syst. 9(9): 833-840 (1998) | |
| c22 | Sanguthevar Rajasekaran: A Framework for Simple Sorting Algorithms on Parallel Disk Systems (Extended Abstract). SPAA 1998: 88-97 | |
| 1997 | ||
| j20 | Sanguthevar Rajasekaran, David S. L. Wei: Selection, Routing, and Sorting on the Star Graph. J. Parallel Distrib. Comput. 41(2): 225-233 (1997) | |
| j19 | Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph: Unifying Themes for Selection on Any Network. J. Parallel Distrib. Comput. 46(1): 105-111 (1997) | |
| j18 | Sanguthevar Rajasekaran, Sartaj Sahni: Determinisitic Routing on the Array with Reconfigurable Optical Buses. Parallel Processing Letters 7(3): 219-224 (1997) | |
| j17 | Sanguthevar Rajasekaran, Sartaj Sahni: Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses. IEEE Trans. Parallel Distrib. Syst. 8(11): 1123-1132 (1997) | |
| c21 | Sanguthevar Rajasekaran, David S. L. Wei: Designing Efficient Distributed Algorithms Using Sampling Techniques. IPPS 1997: 397-401 | |
| 1996 | ||
| j16 | Sanguthevar Rajasekaran: Randomized Selection on the Hypercube. J. Parallel Distrib. Comput. 37(2): 187-193 (1996) | |
| j15 | Sanguthevar Rajasekaran: Tree-Adjoining Language Parsing in o(n^6) Time. SIAM J. Comput. 25(4): 862-873 (1996) | |
| j14 | Sanguthevar Rajasekaran: Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting. IEEE Trans. Computers 45(5): 529-539 (1996) | |
| c20 | David S. L. Wei, Sanguthevar Rajasekaran, Sy-Yen Kuo: Efficient Selection and Sorting Schemes for Processing Large Distributed Files in Finite Projectives Plane. PDPTA 1996: 69-78 | |
| 1995 | ||
| j13 | Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif: The Light Bulb Problem. Inf. Comput. 117(2): 187-192 (1995) | |
| j12 | Sanguthevar Rajasekaran: k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh. J. Algorithms 19(3): 361-382 (1995) | |
| j11 | Sanguthevar Rajasekaran, Suneeta Ramaswami: Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane. J. Parallel Distrib. Comput. 26(1): 99-115 (1995) | |
| j10 | Sanguthevar Rajasekaran, Mukund Raghavachari: A Randomized Algorithm for Multipacket Routing on the Mesh. J. Parallel Distrib. Comput. 26(2): 257-260 (1995) | |
| j9 | Michael A. Palis, Jing-Chiou Liou, Sanguthevar Rajasekaran, Sunil M. Shende, David S. L. Wei: Online Scheduling of Dynamic Trees. Parallel Processing Letters 5: 635-646 (1995) | |
| c19 | ||
| c18 | Sanguthevar Rajasekaran, Sartaj Sahni: Sorting and Selection on Distributed Memory Bus Computers. ICPP (3) 1995: 151-154 | |
| 1994 | ||
| j8 | Michael A. Palis, Sanguthevar Rajasekaran, David S. L. Wei: Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks. J. Parallel Distrib. Comput. 20(2): 145-157 (1994) | |
| c17 | ||
| c16 | Sanguthevar Rajasekaran, Suneeta Ramaswami: Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems. Symposium on Computational Geometry 1994: 57-66 | |
| c15 | Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph: Unifying Themes for Network Selection. ISAAC 1994: 92-100 | |
| 1993 | ||
| j7 | Danny Krizanc, Sanguthevar Rajasekaran, Sunil M. Shende: A Comparison of Meshes with Static Buses and Half-Duplex Wrap-Arounds. Parallel Processing Letters 3: 109-114 (1993) | |
| j6 | Sanguthevar Rajasekaran, Keith W. Ross: Fast Algorithms for Generating Discrete Random Variates with Changing Distributions. ACM Trans. Model. Comput. Simul. 3(1): 1-19 (1993) | |
| c14 | Sanguthevar Rajasekaran: Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection. ESA 1993: 309-320 | |
| c13 | ||
| c12 | Sanguthevar Rajasekaran, David S. L. Wei: Selection, Routing, and Sorting on the Star Graph. IPPS 1993: 661-665 | |
| c11 | J. C. Cogolludo, Sanguthevar Rajasekaran: Permutation Routing on Reconfigurable Meshes. ISAAC 1993: 157-166 | |
| 1992 | ||
| j5 | ||
| j4 | Sanguthevar Rajasekaran, Thanasis Tsantilas: Optimal Routing Algorithms for Mesh-Connected Processor Arrays. Algorithmica 8(1): 21-38 (1992) | |
| j3 | Sanguthevar Rajasekaran, Richard Overholt: Constant Queue Routing on a Mesh. J. Parallel Distrib. Comput. 15(2): 160-166 (1992) | |
| j2 | Sanguthevar Rajasekaran, John H. Reif: Nested Annealing: A Provable Improvement to Simulated Annealing. Theor. Comput. Sci. 99(1): 157-176 (1992) | |
| c10 | Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn: Matching the Bisection Bound for Routing and Sorting on the Mesh. SPAA 1992: 31-40 | |
| 1991 | ||
| c9 | Michael A. Palis, Sanguthevar Rajasekaran, David S. L. Wei: Emulation of a PRAM on Leveled Networks. ICPP (1) 1991: 418-421 | |
| c8 | Sanguthevar Rajasekaran, Mukund Raghavachari: Optimal randomized algorithms for multipacket and cut through routing on the mesh. SPDP 1991: 305-311 | |
| c7 | ||
| 1990 | ||
| c6 | ||
| 1989 | ||
| j1 | Sanguthevar Rajasekaran, John H. Reif: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. SIAM J. Comput. 18(3): 594-607 (1989) | |
| c5 | ||
| 1988 | ||
| c4 | Danny Krizanc, Sanguthevar Rajasekaran, Thanasis Tsantilas: Optimal Routing Algorithms for Mesh-Connected Processor Arrays. AWOC 1988: 411-422 | |
| c3 | Sanguthevar Rajasekaran, John H. Reif: Nested Annealing: A Provable Improvement to Simulated Annealing. ICALP 1988: 455-472 | |
| 1987 | ||
| c2 | ||
| c1 | Sanguthevar Rajasekaran, Thanasis Tsantilas: An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks. FSTTCS 1987: 226-241 | |
Colors in the list of coauthors
Last update Sat May 18 23:46:47 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page