The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Sanguthevar Rajasekaran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jaime Davila, Sanguthevar Rajasekaran
    Randomized Sorting on the POPS Network. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2004, pp:45-50 [Conf]
  2. Sanguthevar Rajasekaran
    Efficient Parallel Hierarchical Clustering Algorithms. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2004, pp:27-32 [Conf]
  3. Sanguthevar Rajasekaran
    TAL Recognition in O(M(n2)) Time. [Citation Graph (0, 0)][DBLP]
    ACL, 1995, pp:166-173 [Conf]
  4. Mingjun Song, Sanguthevar Rajasekaran
    A Greedy Correlation-Incorporated SVM-Based Algorithm for Gene Selection. [Citation Graph (0, 0)][DBLP]
    AINA Workshops (1), 2007, pp:657-661 [Conf]
  5. Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang
    Exact algorithms for planted motif challenge problems. [Citation Graph (0, 0)][DBLP]
    APBC, 2005, pp:249-259 [Conf]
  6. Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang, Vishal Thapar, M. Gryk, M. Maciejewski, M. Schiller
    Exact algorithms for motif search. [Citation Graph (0, 0)][DBLP]
    APBC, 2005, pp:239-248 [Conf]
  7. Danny Krizanc, Sanguthevar Rajasekaran, Thanasis Tsantilas
    Optimal Routing Algorithms for Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:411-422 [Conf]
  8. Jaime Davila, Sanguthevar Rajasekaran
    Extending Pattern Branching to Handle Challenging Instances. [Citation Graph (0, 0)][DBLP]
    BIBE, 2006, pp:65-69 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Computers and Their Applications, 2004, pp:75-78 [Conf]
  10. Insup Lee, Sanguthevar Rajasekaran
    A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation. [Citation Graph (0, 0)][DBLP]
    CAV, 1994, pp:404-414 [Conf]
  11. Chun-Hsi Huang, Sanguthevar Rajasekaran
    BioGrid- bridging life science and information technology. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2005, pp:450-454 [Conf]
  12. Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
    The Light Bulb Problem. [Citation Graph (0, 0)][DBLP]
    COLT, 1989, pp:261-268 [Conf]
  13. Sanguthevar Rajasekaran, Suneeta Ramaswami
    Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:57-66 [Conf]
  14. Sanguthevar Rajasekaran
    Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:309-320 [Conf]
  15. Sanguthevar Rajasekaran, John H. Reif
    Ranomized Parallel Computation. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:364-376 [Conf]
  16. Sanguthevar Rajasekaran
    Randomized Parallel Selection. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:215-224 [Conf]
  17. Sanguthevar Rajasekaran, Thanasis Tsantilas
    An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:226-241 [Conf]
  18. Sanguthevar Rajasekaran, Mingjun Song
    A Novel Scheme for the Parallel Computation of SVDs. [Citation Graph (0, 0)][DBLP]
    HPCC, 2006, pp:129-137 [Conf]
  19. Jaeyong Lim, Sanguthevar Rajasekaran
    Parallel Cache Management Protocol for Static and Dynamic Web Contents. [Citation Graph (0, 0)][DBLP]
    ICWI, 2002, pp:20-28 [Conf]
  20. Sanguthevar Rajasekaran, John H. Reif
    Nested Annealing: A Provable Improvement to Simulated Annealing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:455-472 [Conf]
  21. Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran
    Space and Time Efficient Algorithms for Planted Motif Search. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:822-829 [Conf]
  22. Sanguthevar Rajasekaran, Jaime Davila
    A Fundamental Problem in Computer and Communication. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2004, pp:81-0 [Conf]
  23. Michael A. Palis, Sanguthevar Rajasekaran, David S. L. Wei
    Emulation of a PRAM on Leveled Networks. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1991, pp:418-421 [Conf]
  24. Sanguthevar Rajasekaran, Sartaj Sahni
    Sorting and Selection on Distributed Memory Bus Computers. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1995, pp:151-154 [Conf]
  25. Sanguthevar Rajasekaran, Xiao-ming Jin
    A Practical Realization of Parallel Disks. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2000, pp:337-0 [Conf]
  26. Chain-Wu Lee, Chun-Hsi Huang, Sanguthevar Rajasekaran
    TROJAN: A Scalable Distributed Semantic Network System. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2003, pp:219-0 [Conf]
  27. Lixin Fu, Sanguthevar Rajasekaran
    Novel Algorithms for Computing Medians and Other Quantiles of Disk-Resident Data. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2001, pp:145-154 [Conf]
  28. Insup Lee, Sanguthevar Rajasekaran
    Fast Parallel Algorithms for Model Checking Using BDDs. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:444-448 [Conf]
  29. Sanguthevar Rajasekaran, Sandeep Sen
    PDM Sorting Algorithms That Take A Small Number of Passes. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  30. Sanguthevar Rajasekaran, David S. L. Wei
    Selection, Routing, and Sorting on the Star Graph. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:661-665 [Conf]
  31. Sanguthevar Rajasekaran, David S. L. Wei
    Designing Efficient Distributed Algorithms Using Sampling Techniques. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:397-401 [Conf]
  32. Sartaj Sahni, Timothy A. Davis, Sanguthevar Rajasekaran, Sanjay Ranka
    Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:423-426 [Conf]
  33. J. C. Cogolludo, Sanguthevar Rajasekaran
    Permutation Routing on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:157-166 [Conf]
  34. Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
    Unifying Themes for Network Selection. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:92-100 [Conf]
  35. Sanguthevar Rajasekaran, Sandeep Sen
    A Simple Optimal Randomized Algorithm for Sorting on the PDM. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:543-552 [Conf]
  36. Mingjun Song, Sanguthevar Rajasekaran
    Fast k-Means Algorithms with Constant Approximation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:1029-1038 [Conf]
  37. Alaa Amin, Reda A. Ammar, Sanguthevar Rajasekaran
    Maximizing Reliability While Scheduling Real-Time Task-Graphs on a Cluster of Computers. [Citation Graph (0, 0)][DBLP]
    ISCC, 2005, pp:1001-1006 [Conf]
  38. Chain-Wu Lee, Laurence Tianruo Yang, Chun-Hsi Huang, Sanguthevar Rajasekaran, D. Frank Hsu
    Distributed Path-Based Inference in Semantic Networks. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:232-238 [Conf]
  39. Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dave, Chun-Hsi Huang
    A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    KELSI, 2004, pp:33-45 [Conf]
  40. Jun Luo, Sanguthevar Rajasekaran
    FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases. [Citation Graph (0, 0)][DBLP]
    KES, 2004, pp:189-195 [Conf]
  41. Jun Luo, Sanguthevar Rajasekaran
    A Framework for Mining Association Rules. [Citation Graph (0, 0)][DBLP]
    KES (4), 2005, pp:509-517 [Conf]
  42. Jaeyong Lim, Sanguthevar Rajasekaran
    Distributed Cache Content Management Protocol for Cooperative Web Server. [Citation Graph (0, 0)][DBLP]
    IASTED PDCS, 2002, pp:662-667 [Conf]
  43. David S. L. Wei, Sanguthevar Rajasekaran, Sy-Yen Kuo
    Efficient Selection and Sorting Schemes for Processing Large Distributed Files in Finite Projectives Plane. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1996, pp:69-78 [Conf]
  44. Jun Luo, Sanguthevar Rajasekaran, Chenxia Qiu
    Parallelizing 1-Dimensional Estuarine Model. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2001, pp:257-264 [Conf]
  45. Mingjun Song, Sanguthevar Rajasekaran
    Finding frequent itemsets by transaction mapping. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:488-492 [Conf]
  46. Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn
    Matching the Bisection Bound for Routing and Sorting on the Mesh. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:31-40 [Conf]
  47. Sanguthevar Rajasekaran
    A Framework for Simple Sorting Algorithms on Parallel Disk Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:88-97 [Conf]
  48. Sanguthevar Rajasekaran, Richard Overholt
    Constant Queue Routing on a Mesh. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:444-455 [Conf]
  49. Kishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Shvartsman
    Robust Network Supercomputing with Malicious Processes. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:474-488 [Conf]
  50. Sanguthevar Rajasekaran, Sandeep Sen
    On Parallel Integer Sorting. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1992, v:29, n:1, pp:1-15 [Journal]
  51. J. C. Cogolludo, Sanguthevar Rajasekaran
    Permutation Routing on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:1, pp:44-57 [Journal]
  52. Sanguthevar Rajasekaran, Suneeta Ramaswami
    Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:436-460 [Journal]
  53. Sanguthevar Rajasekaran, Thanasis Tsantilas
    Optimal Routing Algorithms for Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:1, pp:21-38 [Journal]
  54. Chun-Hsi Huang, Sanguthevar Rajasekaran, Laurence Tianruo Yang, Xin He
    Finding Hamiltonian paths in tournaments on clusters. [Citation Graph (0, 0)][DBLP]
    Cluster Computing, 2006, v:9, n:3, pp:345-353 [Journal]
  55. Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
    The Light Bulb Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:117, n:2, pp:187-192 [Journal]
  56. Jaime Davila, Sanguthevar Rajasekaran
    Randomized Sorting On The Pops Network. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:1, pp:105-116 [Journal]
  57. Jun Luo, Sanguthevar Rajasekaran
    Parallizing 1-Dimensional Estuarine Model. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:6, pp:809-821 [Journal]
  58. Sanguthevar Rajasekaran, T. McKendall
    Permutation Routing and Sorting on the Reconfigurable Mesh. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1998, v:9, n:2, pp:199-212 [Journal]
  59. Sanguthevar Rajasekaran, Sartaj Sahni
    Special Issue on Randomized Computing. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:205- [Journal]
  60. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1129-1146 [Journal]
  61. Sanguthevar Rajasekaran
    An Optimal Parallel Algorithm for Sorting Multisets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:3, pp:141-143 [Journal]
  62. Sanguthevar Rajasekaran, Sandeep Sen
    A generalization of the 0-1 principle for sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:1, pp:43-47 [Journal]
  63. Sanguthevar Rajasekaran
    k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:3, pp:361-382 [Journal]
  64. Sanguthevar Rajasekaran
    Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:1, pp:68-81 [Journal]
  65. Sanguthevar Rajasekaran, Y. Hu, Jun Luo, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw
    Efficient Algorithms for Similarity Search. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:1, pp:125-132 [Journal]
  66. Sanguthevar Rajasekaran, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw
    Efficient Algorithms for Local Alignment Search. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:1, pp:117-124 [Journal]
  67. Sanguthevar Rajasekaran, Shibu Yooseph
    TAL Recognition in O(M(n»)) Time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:56, n:1, pp:83-89 [Journal]
  68. Michael A. Palis, Sanguthevar Rajasekaran, David S. L. Wei
    Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:20, n:2, pp:145-157 [Journal]
  69. Sanguthevar Rajasekaran
    Selection Algorithms for Parallel Disk Systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:4, pp:536-544 [Journal]
  70. Sanguthevar Rajasekaran
    Out-of-core computing on mesh connected computers. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:11, pp:1311-1317 [Journal]
  71. Sanguthevar Rajasekaran
    Randomized Selection on the Hypercube. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:37, n:2, pp:187-193 [Journal]
  72. Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
    Unifying Themes for Selection on Any Network. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:46, n:1, pp:105-111 [Journal]
  73. Sanguthevar Rajasekaran, Jaime Davila
    Packet routing and selection on the POPS network. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:8, pp:927-933 [Journal]
  74. Sanguthevar Rajasekaran, Richard Overholt
    Constant Queue Routing on a Mesh. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1992, v:15, n:2, pp:160-166 [Journal]
  75. Sanguthevar Rajasekaran, Suneeta Ramaswami
    Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:1, pp:99-115 [Journal]
  76. Sanguthevar Rajasekaran, Mukund Raghavachari
    A Randomized Algorithm for Multipacket Routing on the Mesh. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:2, pp:257-260 [Journal]
  77. Sanguthevar Rajasekaran, David S. L. Wei
    Selection, Routing, and Sorting on the Star Graph. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:41, n:2, pp:225-233 [Journal]
  78. 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. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:8, pp:1295-1313 [Journal]
  79. Sanguthevar Rajasekaran
    A Framework for Simple Sorting Algorithms on Parallel Disk Systems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:2, pp:101-114 [Journal]
  80. Chun-Hsi Huang, Sanguthevar Rajasekaran
    High-performance parallel bio-computing. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2004, v:30, n:9-10, pp:999-1000 [Journal]
  81. Hossam A. ElGindy, Sanguthevar Rajasekaran
    Sorting and Selection on a Linear Array with Optical Bus System. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:3, pp:373-383 [Journal]
  82. Danny Krizanc, Sanguthevar Rajasekaran, Sunil M. Shende
    A Comparison of Meshes with Static Buses and Half-Duplex Wrap-Arounds. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:109-114 [Journal]
  83. Michael A. Palis, Jing-Chiou Liou, Sanguthevar Rajasekaran, Sunil M. Shende, David S. L. Wei
    Online Scheduling of Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:635-646 [Journal]
  84. Sanguthevar Rajasekaran
    Efficient Parallel Algorithms for Template Matching. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2002, v:12, n:3-4, pp:359-364 [Journal]
  85. Sanguthevar Rajasekaran, Sartaj Sahni
    Determinisitic Routing on the Array with Reconfigurable Optical Buses. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:3, pp:219-224 [Journal]
  86. Sanguthevar Rajasekaran
    Tree-Adjoining Language Parsing in o(n^6) Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:4, pp:862-873 [Journal]
  87. Sanguthevar Rajasekaran, John H. Reif
    Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:594-607 [Journal]
  88. Sanguthevar Rajasekaran
    Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:5, pp:529-539 [Journal]
  89. Sanguthevar Rajasekaran, John H. Reif
    Nested Annealing: A Provable Improvement to Simulated Annealing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:99, n:1, pp:157-176 [Journal]
  90. Chain-Wu Lee, Chun-Hsi Huang, Laurence Tianruo Yang, Sanguthevar Rajasekaran
    Distributed Path-Based Inference in Semantic Networks. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2004, v:29, n:2, pp:211-227 [Journal]
  91. Mingjun Song, Sanguthevar Rajasekaran
    A Transaction Mapping Algorithm for Frequent Itemsets Mining. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2006, v:18, n:4, pp:472-481 [Journal]
  92. Sanguthevar Rajasekaran, Keith W. Ross
    Fast Algorithms for Generating Discrete Random Variates with Changing Distributions. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Model. Comput. Simul., 1993, v:3, n:1, pp:1-19 [Journal]
  93. Sanguthevar Rajasekaran
    Efficient Parallel Hierarchical Clustering Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2005, v:16, n:6, pp:497-502 [Journal]
  94. Sanguthevar Rajasekaran, Insup Lee
    Parallel Algorithms for Relational Coarsest Partition Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:7, pp:687-699 [Journal]
  95. Sanguthevar Rajasekaran, Sartaj Sahni
    Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:11, pp:1123-1132 [Journal]
  96. Sanguthevar Rajasekaran, Sartaj Sahni
    Randomized Routing, Selection, and Sorting on the OTIS-Mesh. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:9, pp:833-840 [Journal]
  97. Lixin Fu, Sanguthevar Rajasekaran
    Evaluating holistic aggregators efficiently for very large datasets. [Citation Graph (0, 0)][DBLP]
    VLDB J., 2004, v:13, n:2, pp:148-161 [Journal]
  98. Sanguthevar Rajasekaran
    Parallel algorithms for motif search. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2007, pp:175-180 [Conf]
  99. 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. [Citation Graph (0, 0)][DBLP]
    DaWaK, 2007, pp:418-427 [Conf]
  100. Mostafa I. Soliman, Sanguthevar Rajasekaran, Reda A. Ammar
    A Block JRS Algorithm for Highly Parallel Computation of SVDs. [Citation Graph (0, 0)][DBLP]
    HPCC, 2007, pp:346-357 [Conf]
  101. 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. [Citation Graph (0, 0)][DBLP]
    Industrial Conference on Data Mining - Posters and Workshops, 2007, pp:86- [Conf]
  102. Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran
    Fast Algorithms for Selecting Specific siRNA in Complete mRNA Data. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:302-309 [Conf]
  103. Sudha Balla, Sanguthevar Rajasekaran
    Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data. [Citation Graph (0, 0)][DBLP]
    ISBRA, 2007, pp:260-269 [Conf]

  104. Optimal Micro-Threading Scheduling for Multi-Core Processors to Hide Memory Latency. [Citation Graph (, )][DBLP]


  105. An efficient digital circuit for implementing Sequence Alignment algorithm in an extended processor. [Citation Graph (, )][DBLP]


  106. Self-Optimizing Parallel Algorithms for Haplotype Reconstruction and Their Evaluation on the JPT and CHB Genotype Data. [Citation Graph (, )][DBLP]


  107. A local structural alignment algorithm with Variable Length Alignment Fragment Pairs. [Citation Graph (, )][DBLP]


  108. Faster greedy algorithms for Multiple Degenerate Primer Selection. [Citation Graph (, )][DBLP]


  109. On the Hardness of the Border Length Minimization Problem. [Citation Graph (, )][DBLP]


  110. FFTI: Fast In-Place FFT on the Cell Broadband Engine. [Citation Graph (, )][DBLP]


  111. Network A Randomized Automatic Pixel Purity Index Technique. [Citation Graph (, )][DBLP]


  112. A Simple Algorithm for (l, d) Motif Search1. [Citation Graph (, )][DBLP]


  113. Degenerate primer selection algorithms. [Citation Graph (, )][DBLP]


  114. A Novel Scheme for the Detection of an Unknown Class in Classification. [Citation Graph (, )][DBLP]


  115. Efficient PDM Sorting Algorithms. [Citation Graph (, )][DBLP]


  116. Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space. [Citation Graph (, )][DBLP]


  117. Responsible Data Releases. [Citation Graph (, )][DBLP]


  118. Efficient Scheduling of Real-time Tandem Task Graphs on Heterogeneous Clusters with Network Limitations. [Citation Graph (, )][DBLP]


  119. Efficient sorting algorithms for the cell broadband engine. [Citation Graph (, )][DBLP]


  120. Novel micro-threading techniques on the Cell Broadband Engine. [Citation Graph (, )][DBLP]


  121. Optimal randomized algorithms for multipacket and cut through routing on the mesh. [Citation Graph (, )][DBLP]


  122. Pseudoknot Identification through Learning TAGRNA. [Citation Graph (, )][DBLP]


  123. Towards a Collusion-Resistant Algebraic Multi-Party Protocol for Privacy-Preserving Association Rule Mining in Vertically Partitioned Data. [Citation Graph (, )][DBLP]


  124. Generalized algorithms for generating balanced modulation codes in protein-based volumetric memories. [Citation Graph (, )][DBLP]


  125. Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots. [Citation Graph (, )][DBLP]


  126. Efficient Algorithms for Self Assembling Triangular and Other Nano Structures. [Citation Graph (, )][DBLP]


  127. Sampling Based Meta-algorithms for Accurate Multiple Sequence Alignment. [Citation Graph (, )][DBLP]


  128. Data Integration on Multiple Data Sets. [Citation Graph (, )][DBLP]


  129. SPENK: adding another level of parallelism on the cell broadband engine. [Citation Graph (, )][DBLP]


  130. RNA Pseudoknot Folding through Inference and Identification Using TAGRNA. [Citation Graph (, )][DBLP]


  131. MimoSA: a system for minimotif annotation. [Citation Graph (, )][DBLP]


  132. Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs [Citation Graph (, )][DBLP]


  133. On the Border Length Minimization Problem (BLMP) on a Square Array [Citation Graph (, )][DBLP]


  134. An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.612secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002