2009 | ||
---|---|---|
129 | EE | Sanguthevar Rajasekaran: Bioinformatics and Computational Biology, First International Conference, BICoB 2009, New Orleans, LA, USA, April 8-10, 2009. Proceedings Springer 2009 |
128 | EE | Sahar Al Seesi, Sanguthevar Rajasekaran, Reda A. Ammar: RNA Pseudoknot Folding through Inference and Identification Using TAGRNA. BICoB 2009: 90-101 |
127 | EE | Sanguthevar Rajasekaran, Sahar Al Seesi, Reda A. Ammar: Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots. ISBRA 2009: 135-147 |
126 | EE | Vamsi Kundeti, Sanguthevar Rajasekaran: Efficient Algorithms for Self Assembling Triangular and Other Nano Structures. ISBRA 2009: 148-158 |
2008 | ||
125 | EE | Vamsi Kundeti, Yunsi Fei, Sanguthevar Rajasekaran: An efficient digital circuit for implementing Sequence Alignment algorithm in an extended processor. ASAP 2008: 156-161 |
124 | EE | Sudha Balla, Sanguthevar Rajasekaran, Ion I. Mandoiu: Faster greedy algorithms for Multiple Degenerate Primer Selection. BIBE 2008: 1-4 |
123 | EE | Vamsi Kundeti, Sanguthevar Rajasekaran: A local structural alignment algorithm with Variable Length Alignment Fragment Pairs. BIBE 2008: 1-7 |
122 | Mingjun Song, Sanguthevar Rajasekaran: A Novel Scheme for the Detection of an Unknown Class in Classification. DMIN 2008: 10-13 | |
121 | EE | Vamsi Kundeti, Sanguthevar Rajasekaran: Efficient PDM Sorting Algorithms. HiPC 2008: 97-107 |
120 | EE | Vamsi Kundeti, Sanguthevar Rajasekaran: Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space. ICCS (1) 2008: 893-902 |
119 | EE | Mohamed F. Ahmed, Reda A. Ammar, Sanguthevar Rajasekaran: SPENK: adding another level of parallelism on the cell broadband engine. IFMT 2008: 2 |
118 | EE | D. Sharma, Vishal Thapar, Reda A. Ammar, Sanguthevar Rajasekaran, M. Ahmed: Efficient sorting algorithms for the cell broadband engine. ISCC 2008: 736-741 |
117 | EE | Sahar Al Seesi, Sanguthevar Rajasekaran, Reda A. Ammar: Pseudoknot Identification through Learning TAGRNA. PRIB 2008: 132-143 |
116 | EE | Sanguthevar Rajasekaran, Sandeep Sen: Optimal and Practical Algorithms for Sorting on the PDM. IEEE Trans. Computers 57(4): 547-561 (2008) |
115 | EE | Sanguthevar Rajasekaran: Special issue on parallel techniques for information extraction. J. Parallel Distrib. Comput. 68(1): 1-2 (2008) |
114 | EE | Sanguthevar Rajasekaran, Mingjun Song: A relaxation scheme for increasing the parallelism in Jacobi-SVD. J. Parallel Distrib. Comput. 68(6): 769-777 (2008) |
2007 | ||
113 | EE | Mingjun Song, Sanguthevar Rajasekaran: A Greedy Correlation-Incorporated SVM-Based Algorithm for Gene Selection. AINA Workshops (1) 2007: 657-661 |
112 | EE | 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 |
111 | EE | 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 |
110 | EE | Mostafa I. Soliman, Sanguthevar Rajasekaran, Reda A. Ammar: A Block JRS Algorithm for Highly Parallel Computation of SVDs. HPCC 2007: 346-357 |
109 | EE | 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 |
108 | EE | Sudha Balla, Sanguthevar Rajasekaran: Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data. ISBRA 2007: 260-269 |
107 | Sanguthevar Rajasekaran: Parallel algorithms for motif search. ISCA PDCS 2007: 175-180 | |
106 | EE | 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 |
105 | 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 | |
104 | EE | Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran: Fast Algorithms for Selecting Specific siRNA in Complete mRNA Data. WABI 2007: 302-309 |
103 | EE | 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) |
102 | EE | Sudha Balla, Sanguthevar Rajasekaran, Ion I. Mandoiu: Efficient Algorithms for degenerate Primer Search. Int. J. Found. Comput. Sci. 18(4): 899-910 (2007) |
2006 | ||
101 | Sanguthevar Rajasekaran: Proceedings of the Third IASTED International Conference on Communication, Network, and Information Security, October 9-11, 2006, Cambridge, MA, USA IASTED/ACTA Press 2006 | |
100 | Jaime Davila, Sanguthevar Rajasekaran: Extending Pattern Branching to Handle Challenging Instances. BIBE 2006: 65-69 | |
99 | EE | Kishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Shvartsman: Robust Network Supercomputing with Malicious Processes. DISC 2006: 474-488 |
98 | EE | Sanguthevar Rajasekaran, Mingjun Song: A Novel Scheme for the Parallel Computation of SVDs. HPCC 2006: 129-137 |
97 | EE | Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran: Space and Time Efficient Algorithms for Planted Motif Search. International Conference on Computational Science (2) 2006: 822-829 |
96 | EE | Chun-Hsi Huang, Sanguthevar Rajasekaran, Laurence Tianruo Yang, Xin He: Finding Hamiltonian paths in tournaments on clusters. Cluster Computing 9(3): 345-353 (2006) |
95 | Jun Luo, Sanguthevar Rajasekaran: A Framework for Mining Association Rules. I. J. Comput. Appl. 13(1): 39-49 (2006) | |
94 | EE | Mingjun Song, Sanguthevar Rajasekaran: A Transaction Mapping Algorithm for Frequent Itemsets Mining. IEEE Trans. Knowl. Data Eng. 18(4): 472-481 (2006) |
93 | EE | Sanguthevar Rajasekaran, Reda A. Ammar, D. G. Shin, G. Zhang: Efficient parallel algorithms for processing biological sequences. IJCAT 26(3): 119-125 (2006) |
2005 | ||
92 | Michael J. Oudshoorn, Sanguthevar Rajasekaran: 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 | |
91 | EE | Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang, Vishal Thapar, M. Gryk, M. Maciejewski, M. Schiller: Exact algorithms for motif search. APBC 2005: 239-248 |
90 | EE | Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang: Exact algorithms for planted motif challenge problems. APBC 2005: 249-259 |
89 | EE | Chun-Hsi Huang, Sanguthevar Rajasekaran: BioGrid- bridging life science and information technology. CCGRID 2005: 450-454 |
88 | EE | Sanguthevar Rajasekaran, Sandeep Sen: PDM Sorting Algorithms That Take A Small Number of Passes. IPDPS 2005 |
87 | EE | Mingjun Song, Sanguthevar Rajasekaran: Fast k-Means Algorithms with Constant Approximation. ISAAC 2005: 1029-1038 |
86 | EE | Sanguthevar Rajasekaran, Sandeep Sen: A Simple Optimal Randomized Algorithm for Sorting on the PDM. ISAAC 2005: 543-552 |
85 | EE | Alaa Amin, Reda A. Ammar, Sanguthevar Rajasekaran: Maximizing Reliability While Scheduling Real-Time Task-Graphs on a Cluster of Computers. ISCC 2005: 1001-1006 |
84 | EE | Jun Luo, Sanguthevar Rajasekaran: A Framework for Mining Association Rules. KES (4) 2005: 509-517 |
83 | EE | Mingjun Song, Sanguthevar Rajasekaran: Finding frequent itemsets by transaction mapping. SAC 2005: 488-492 |
82 | EE | Sanguthevar Rajasekaran: Efficient Parallel Hierarchical Clustering Algorithms. IEEE Trans. Parallel Distrib. Syst. 16(6): 497-502 (2005) |
81 | EE | Sanguthevar Rajasekaran, Sandeep Sen: A generalization of the 0-1 principle for sorting. Inf. Process. Lett. 94(1): 43-47 (2005) |
80 | EE | Jaime Davila, Sanguthevar Rajasekaran: Randomized Sorting On The Pops Network. Int. J. Found. Comput. Sci. 16(1): 105-116 (2005) |
79 | EE | Sanguthevar Rajasekaran, Jaime Davila: Packet routing and selection on the POPS network. J. Parallel Distrib. Comput. 65(8): 927-933 (2005) |
78 | EE | Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang: Exact Algorithms for Planted Motif Problems. Journal of Computational Biology 12(8): 1117-1128 (2005) |
2004 | ||
77 | 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 | |
76 | EE | Sanguthevar Rajasekaran, Jaime Davila: A Fundamental Problem in Computer and Communication. ICPADS 2004: 81- |
75 | Sanguthevar Rajasekaran: Efficient Parallel Hierarchical Clustering Algorithms. ISCA PDCS 2004: 27-32 | |
74 | Jaime Davila, Sanguthevar Rajasekaran: Randomized Sorting on the POPS Network. ISCA PDCS 2004: 45-50 | |
73 | EE | 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 |
72 | EE | Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dave, Chun-Hsi Huang: A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment. KELSI 2004: 33-45 |
71 | EE | Jun Luo, Sanguthevar Rajasekaran: FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases. KES 2004: 189-195 |
70 | EE | Jun Luo, Sanguthevar Rajasekaran: Parallizing 1-Dimensional Estuarine Model. Int. J. Found. Comput. Sci. 15(6): 809-821 (2004) |
69 | EE | Sanguthevar Rajasekaran: Out-of-core computing on mesh connected computers. J. Parallel Distrib. Comput. 64(11): 1311-1317 (2004) |
68 | EE | Chun-Hsi Huang, Sanguthevar Rajasekaran: High-performance parallel bio-computing. Parallel Computing 30(9-10): 999-1000 (2004) |
67 | EE | 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) |
66 | EE | Lixin Fu, Sanguthevar Rajasekaran: Evaluating holistic aggregators efficiently for very large datasets. VLDB J. 13(2): 148-161 (2004) |
2003 | ||
65 | EE | Chain-Wu Lee, Chun-Hsi Huang, Sanguthevar Rajasekaran: TROJAN: A Scalable Distributed Semantic Network System. ICTAI 2003: 219- |
64 | EE | 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) |
2002 | ||
63 | Jaeyong Lim, Sanguthevar Rajasekaran: Distributed Cache Content Management Protocol for Cooperative Web Server. IASTED PDCS 2002: 662-667 | |
62 | Jaeyong Lim, Sanguthevar Rajasekaran: Parallel Cache Management Protocol for Static and Dynamic Web Contents. ICWI 2002: 20-28 | |
61 | EE | Sanguthevar Rajasekaran, Suneeta Ramaswami: Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane. Algorithmica 33(4): 436-460 (2002) |
60 | EE | 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) |
59 | EE | Sanguthevar Rajasekaran: Efficient Parallel Algorithms for Template Matching. Parallel Processing Letters 12(3-4): 359-364 (2002) |
2001 | ||
58 | Lixin Fu, Sanguthevar Rajasekaran: Novel Algorithms for Computing Medians and Other Quantiles of Disk-Resident Data. IDEAS 2001: 145-154 | |
57 | EE | Jun Luo, Sanguthevar Rajasekaran, Chenxia Qiu: Parallelizing 1-Dimensional Estuarine Model. PVM/MPI 2001: 257-264 |
56 | EE | J. C. Cogolludo, Sanguthevar Rajasekaran: Permutation Routing on Reconfigurable Meshes. Algorithmica 31(1): 44-57 (2001) |
55 | 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) | |
54 | 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) | |
53 | EE | Sanguthevar Rajasekaran: Selection Algorithms for Parallel Disk Systems. J. Parallel Distrib. Comput. 61(4): 536-544 (2001) |
52 | EE | Sanguthevar Rajasekaran: A Framework for Simple Sorting Algorithms on Parallel Disk Systems. Theory Comput. Syst. 34(2): 101-114 (2001) |
2000 | ||
51 | EE | Sanguthevar Rajasekaran, Xiao-ming Jin: A Practical Realization of Parallel Disks. ICPP Workshops 2000: 337- |
50 | EE | Sartaj Sahni, Timothy A. Davis, Sanguthevar Rajasekaran, Sanjay Ranka: Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel. IPDPS Workshops 2000: 423-426 |
49 | Sanguthevar Rajasekaran, Sartaj Sahni: Special Issue on Randomized Computing. Int. J. Found. Comput. Sci. 11(2): 205 (2000) | |
1999 | ||
48 | EE | 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 | ||
47 | EE | Sanguthevar Rajasekaran: A Framework for Simple Sorting Algorithms on Parallel Disk Systems (Extended Abstract). SPAA 1998: 88-97 |
46 | EE | Sanguthevar Rajasekaran, Insup Lee: Parallel Algorithms for Relational Coarsest Partition Problems. IEEE Trans. Parallel Distrib. Syst. 9(7): 687-699 (1998) |
45 | EE | Sanguthevar Rajasekaran, Sartaj Sahni: Randomized Routing, Selection, and Sorting on the OTIS-Mesh. IEEE Trans. Parallel Distrib. Syst. 9(9): 833-840 (1998) |
44 | EE | Sanguthevar Rajasekaran: An Optimal Parallel Algorithm for Sorting Multisets. Inf. Process. Lett. 67(3): 141-143 (1998) |
43 | Sanguthevar Rajasekaran, T. McKendall: Permutation Routing and Sorting on the Reconfigurable Mesh. Int. J. Found. Comput. Sci. 9(2): 199-212 (1998) | |
42 | Sanguthevar Rajasekaran: Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses. J. Algorithms 29(1): 68-81 (1998) | |
41 | Sanguthevar Rajasekaran, Shibu Yooseph: TAL Recognition in O(M(n»)) Time. J. Comput. Syst. Sci. 56(1): 83-89 (1998) | |
1997 | ||
40 | EE | Sanguthevar Rajasekaran, David S. L. Wei: Designing Efficient Distributed Algorithms Using Sampling Techniques. IPPS 1997: 397-401 |
39 | EE | 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) |
38 | Sanguthevar Rajasekaran, David S. L. Wei: Selection, Routing, and Sorting on the Star Graph. J. Parallel Distrib. Comput. 41(2): 225-233 (1997) | |
37 | Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph: Unifying Themes for Selection on Any Network. J. Parallel Distrib. Comput. 46(1): 105-111 (1997) | |
36 | Sanguthevar Rajasekaran, Sartaj Sahni: Determinisitic Routing on the Array with Reconfigurable Optical Buses. Parallel Processing Letters 7(3): 219-224 (1997) | |
1996 | ||
35 | 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 | |
34 | Sanguthevar Rajasekaran: Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting. IEEE Trans. Computers 45(5): 529-539 (1996) | |
33 | Sanguthevar Rajasekaran: Randomized Selection on the Hypercube. J. Parallel Distrib. Comput. 37(2): 187-193 (1996) | |
32 | Sanguthevar Rajasekaran: Tree-Adjoining Language Parsing in o(n^6) Time. SIAM J. Comput. 25(4): 862-873 (1996) | |
1995 | ||
31 | Sanguthevar Rajasekaran: TAL Recognition in O(M(n2)) Time. ACL 1995: 166-173 | |
30 | Sanguthevar Rajasekaran, Sartaj Sahni: Sorting and Selection on Distributed Memory Bus Computers. ICPP (3) 1995: 151-154 | |
29 | Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif: The Light Bulb Problem Inf. Comput. 117(2): 187-192 (1995) | |
28 | Sanguthevar Rajasekaran: k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh. J. Algorithms 19(3): 361-382 (1995) | |
27 | 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) | |
26 | Sanguthevar Rajasekaran, Mukund Raghavachari: A Randomized Algorithm for Multipacket Routing on the Mesh. J. Parallel Distrib. Comput. 26(2): 257-260 (1995) | |
25 | 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) | |
1994 | ||
24 | Insup Lee, Sanguthevar Rajasekaran: A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation. CAV 1994: 404-414 | |
23 | Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph: Unifying Themes for Network Selection. ISAAC 1994: 92-100 | |
22 | EE | 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 |
21 | 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) | |
1993 | ||
20 | Sanguthevar Rajasekaran: Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection. ESA 1993: 309-320 | |
19 | Insup Lee, Sanguthevar Rajasekaran: Fast Parallel Algorithms for Model Checking Using BDDs. IPPS 1993: 444-448 | |
18 | Sanguthevar Rajasekaran, David S. L. Wei: Selection, Routing, and Sorting on the Star Graph. IPPS 1993: 661-665 | |
17 | J. C. Cogolludo, Sanguthevar Rajasekaran: Permutation Routing on Reconfigurable Meshes. ISAAC 1993: 157-166 | |
16 | EE | 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) |
15 | 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) | |
1992 | ||
14 | EE | Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn: Matching the Bisection Bound for Routing and Sorting on the Mesh. SPAA 1992: 31-40 |
13 | Sanguthevar Rajasekaran, Sandeep Sen: On Parallel Integer Sorting. Acta Inf. 29(1): 1-15 (1992) | |
12 | Sanguthevar Rajasekaran, Thanasis Tsantilas: Optimal Routing Algorithms for Mesh-Connected Processor Arrays. Algorithmica 8(1): 21-38 (1992) | |
11 | Sanguthevar Rajasekaran, Richard Overholt: Constant Queue Routing on a Mesh. J. Parallel Distrib. Comput. 15(2): 160-166 (1992) | |
10 | Sanguthevar Rajasekaran, John H. Reif: Nested Annealing: A Provable Improvement to Simulated Annealing. Theor. Comput. Sci. 99(1): 157-176 (1992) | |
1991 | ||
9 | Michael A. Palis, Sanguthevar Rajasekaran, David S. L. Wei: Emulation of a PRAM on Leveled Networks. ICPP (1) 1991: 418-421 | |
8 | Sanguthevar Rajasekaran, Richard Overholt: Constant Queue Routing on a Mesh. STACS 1991: 444-455 | |
1990 | ||
7 | Sanguthevar Rajasekaran: Randomized Parallel Selection. FSTTCS 1990: 215-224 | |
1989 | ||
6 | EE | Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif: The Light Bulb Problem. COLT 1989: 261-268 |
5 | Sanguthevar Rajasekaran, John H. Reif: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. SIAM J. Comput. 18(3): 594-607 (1989) | |
1988 | ||
4 | Danny Krizanc, Sanguthevar Rajasekaran, Thanasis Tsantilas: Optimal Routing Algorithms for Mesh-Connected Processor Arrays. AWOC 1988: 411-422 | |
3 | Sanguthevar Rajasekaran, John H. Reif: Nested Annealing: A Provable Improvement to Simulated Annealing. ICALP 1988: 455-472 | |
1987 | ||
2 | Sanguthevar Rajasekaran, John H. Reif: Ranomized Parallel Computation. FCT 1987: 364-376 | |
1 | 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 |