- Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses1
- In Encyclopedia of Computer Science and Technology, Marcel Dekker Inc. Randomized Parallel Computing
- Curriculum Vitae of Sanguthevar Rajasekaran
- Journal of Clinical Monitoring and Computing (2005) 19: 319328 DOI: 10.1007/s10877-005-0677-y C Springer 2005
- Exact Algorithms for Planted Motif Problems CONTACT AUTHOR
- Randomized Sorting on the POPS Network Jaime Davila and Sanguthevar Rajasekaran
- Efficient Selection and Sorting Schemes for Processing Large Distributed Files in de Bruijn Networks and
- Permutation Routing on Reconfigurable Meshes 1 J.C. Cogolludo S. Rajasekaran
- Permutation Routing and Sorting on the Reconfigurable Mesh
- Parallel Processing Letters c World Scientific Publishing Company
- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 8, NO. 11, NOVEMBER 1997 1 F:\LIBRARY\TRANS\PRODUCTION\ regularpap KSM 27,136 09/02/97 2:03 PM 1 /
- Mesh Connected Computers with Fixed and Reconfigurable Buses
- A Randomized Algorithm for Multipacket Routing on the Mesh1 Sanguthevar Rajasekaran2
- Constant Queue Routing on a Mesh1 Sanguthevar Rajasekaran
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms1
- PROOF COPY 001502FCT Science and
- TAL Recognition in O(M(n2 Sanguthevar Rajasekaran
- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 9, NO. 7, JULY 1998 1 )?/,%5$5
- PDM Sorting Algorithms That Take A Small Number Of Passes Sanguthevar Rajasekaran
- A Practical Realization of Parallel Disks Sanguthevar Rajasekaran
- Selection Algorithms for Parallel Disk Systems Sanguthevar Rajasekaran
- Randomized Routing, Selection, and Sorting on the OTIS-Mesh
- Computing on the Array with Reconfigurable Optical Buses S. Rajasekaran and S. Sahni
- Unifying Themes for Network Selection1 Sanguthevar Rajasekaran2
- Matching the Bisection Bound for Routing and Sorting on the Mesh
- Optimal Randomized Algorithms for Multipacket and Cut Through Routing on the Mesh
- Randomized Parallel Selection Sanguthevar Rajasekaran
- Proceedings of the IASTED International Conference Parallel and Distributed Computing and Systems
- Separability of a Random Graph and Applications Sanguthevar Rajasekaran
- Randomization in Discrete Optimization: Annealing Algorithms
- SORTING AND SELECTION ON PARALLEL DISK MODELS
- RANDOM SAMPLING: SORTING AND SELECTION Danny Krizanc
- Encylopedia of Electrical and Electronic Engineering, John Wiley and Sons. Data Structures and Algorithms
- Derivation of Randomized Sorting and Selection Algorithms
- Randomized Algorithms for Packet Routing on the Mesh
- FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
- A generalization of the 0-1 principle for sorting Sanguthevar Rajasekaran
- CSE3500 Algorithms and Complexity. Fall 2010 Home work 1 Solutions
- CSE 3500 Algorithms and Complexity Fall 2010; Exam I; Solutions
- CSE 3500 Algorithms and Complexity Exam I, October 20, 2009
- CSE 3500 Algorithms and Complexity Exam II, December 2, 2010
- CSE 3500: Algorithms and Complexity Fall 2010, Exam II; Help Sheet
- CSE 3500 Algorithms and Complexity. Fall 2010 Exam II Solutions
- CSE 3500 Algorithms and Complexity Exam III, December 15, 2009
- CSE 3500 Algorithms and Complexity. Fall 2009 Exam III Solutions
- CSE 5500 Advanced Sequential and Parallel Algorithms. Spring 2011 Home work 1. Due on March 7, 2011.
- CSE 5500 Advanced Sequential and Parallel Algorithms. Spring 2011 Home work 2. Due on April 11 (3:30 PM).
- CSE 5500 Advanced Sequential and Parallel Algorithms. Spring 2011 Homework #2 Solutions
- CSE5500 Advanced Sequential and Parallel Algorithms Spring 2011; Homework 3, Due on April 29, 2011
- CSE 5500 Advanced Sequential and Parallel Algorithms Spring 2011; Homework 3 Solutions
- CSE 5500 Advanced Sequential and Parallel Algorithms Spring 2011; Exam I Helpsheet
- CSE 5500: Advanced Sequential and Parallel Algorithms Exam II; Help Sheet
- CSE 5500 Advanced Sequential and Parallel Algorithms. Spring 2011 Solutions to Exam 2.
- CSE 5500 Advanced Sequential and Parallel Algorithms Exam II; April 19, 2010
- CSE 5500 Advanced Sequential and Parallel Algorithms Exam III; Help Sheet
- CSE 5500 Advanced Sequential and Parallel Algorithms Exam III; May 4, 2010
- On Parallel Integer Sorting Sanguthevar Rajasekaran1
- (Presented in the International Conference on Parallel Processing 1995) Sorting and Selection on
- TM Algorithm for Frequent Itemset Mining1 Mingjun Song Sanguthevar Rajasekaran
- Novel Algorithms for Computing Medians and Other Quantiles of Disk-Resident Data
- An Optimal Parallel Algorithm for Sorting Multisets1
- CSE3500 Algorithms and Complexity. Fall 2010 Home work 3. Due on November 18 (11AM).
- Illustration of Reif Macros1 Mukund N. Thapa
- On Frequency Assignment in Cellular Networks
- CSE 5500 Advanced Sequential and Parallel Algorithms Spring 2010 Exam III Solutions
- A volume in the Chapman & Hall/CRC Computer and Information Science Series Series edited by Sartaj Sahni, University of Florida, Gainesville, USA Edited by Sanguthevar Rajasekaran University of Connecticut, Storrs, USA
- Nested Annealing: A Provable Improvement to Simulated Annealing
- CSE 3500 Algorithms and Complexity Fall 2010; Homework 4: Solutions
- Presented in the 33rd Annual Meeting of the Association for Computational Linguistics
- CSE 3500 Algorithms and Complexity Fall 2010; Exam I; Help Sheet
- Director of Dissertation Committees (Ph.D.) 1. Sahar Al Seesi, University of Connecticut (June 2010)
- Unifying Themes For Selection On Any Network1 Sanguthevar Rajasekaran
- Selection, Routing, and Sorting on the Star Graph Sanguthevar Rajasekaran
- THE LIGHT BULB PROBLEM 1 Ramamohan Paturi2 Sanguthevar Rajasekaran3 John Reif3
- CSE 5500 Advanced Sequential and Parallel Algorithms Exam I; March 16, 2011
- Constant Queue Routing on a Mesh Sanguthevar Rajasekaran
- On Simulated Annealing and Nested Annealing Sanguthevar Rajasekaran
- A Framework For Simple Sorting Algorithms On Parallel Disk Systems
- BASIC ALGORITHMS ON PARALLEL OPTICAL MODELS OF COMPUTING
- CSE 5500 Advanced Sequential and Parallel Algorithms. Spring 2010 Exam I Solutions
- Parallel Processing Letters c World Scientific Publishing Company
- SORTING AND SELECTION ON INTERCONNECTION NETWORKS
- www.sciencemag.org SCIENCE VOL 311 17 FEBRUARY 2006 925 Send site suggestions to >> netwatch@aaas.org. Archive: www.sciencemag.org/netwatch
- CSE 3500 Algorithms and Complexity Fall 2010; Exam III; Help Sheet
- CSE 5500 Advanced Sequential and Parallel Algorithms Exam II; April 19, 2011
- Randomized Selection on the Hypercube1 Sanguthevar Rajasekaran
- On the Euclidean Minimum Spanning Tree Problem
- Designing Efficient Distributed Algorithms Using Sampling Techniques S. Rajasekaran and D.S.L. Wei
- CSE 3500 Algorithms and Complexity Exam II, December 3, 2009
- Fast k-Means Algorithms with Constant Approximation
- k -k Routing, k -k Sorting, and Cut Through Routing on the Mesh1
- Journal of Clinical Monitoring and Computing (2005) 19: 351359 DOI: 10.1007/s10877-005-0680-3 C Springer 2005
- CSE 5500 Advanced Sequential and Parallel Algorithms Exam I; March 17, 2010
- CSE 5500 Advanced Sequential and Parallel Algorithms. Spring 2010 Solutions to Exam 2.
- Journal of Clinical Monitoring and Computing (2006) 20: 209220 DOI: 10.1007/s10877-006-9023-2 C Springer 2006
- Research Patents 1. S. Rajasekaran and R. Varadarajan, Techniques for searching encrypted
- A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation
- Transactions on Machine Learning and Data Mining
- CSE 3500 Algorithms and Complexity Fall 2009; Exam I; Solutions
- Novel FFT Techniques for Sequence Analysis Sanguthevar Rajasekaran Xioming Jin John L. Spouge
- Sorting and Selection on a Linear Array with Optical Bus System
- CSE 3500 Algorithms and Complexity Exam I, October 26, 2010
- Novel Algorithms for Computing Medians and Other Quantiles of Disk-Resident Data
- Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems
- An Optimal Randomized Routing Algorithm for the Mesh A Class of Efficient Mesh-like Routing Networks
- CSE 3500 Algorithms and Complexity. Fall 2009 Exam II Solutions
- Basic Algorithms on Optical Models of Computing1 S. Rajasekaran
- FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases Jun Luo Sanguthevar Rajasekaran
- A Simple Optimal Randomized Algorithm for Sorting on the PDM
- Sorting and Routing on the Array with Reconfigurable Optical Buses
- PARALLEL CACHE MANAGEMENT PROTOCOL FOR STATIC AND DYNAMIC WEB CONTENTS
- PROJECT SUMMARY The Project Summary should include a statement of objectives, methods to be employed and the significance of
- IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 A Transaction Mapping Algorithm for Frequent
- CSE 3500 Algorithms and Complexity. Fall 2010 Home work 3 Solutions
- CSE 3500 Algorithms and Complexity. Fall 2010 Home work 2. Solutions
- Space And Time Efficient Algorithms For Planted Motif Search
- CSE 5500 Advanced Sequential and Parallel Algorithms. Spring 2011 Home work 1 Solutions
- Algorithms for Motif Search Sanguthevar Rajasekaran
- Mesh Connected Computers with Fixed and Reconfigurable Buses
- Randomized Routing, Selection, and Sorting on the OTIS-Mesh
- CSE 5500 Advanced Sequential and Parallel Algorithms. Spring 2011 Exam I Solutions
- Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks1 2
- RANDOMIZED PARALLEL COMPUTATION Sanguthevar Rajasekaran
- THE LIGHT BULB PROBLEM 1 Ramamohan Paturi2 Sanguthevar Rajasekaran3 John Reif3
- Randomization in computing Notes of lecture 2 on Sep 01 2011
- CSE 6512 Lecture 1 Notes Taken by Marius Nicolae
- CSE 6512 Randomization in Computing Exam I; November 29, 2011
- CSE6512 Lecture 10 Notes Manal Alharbi
- CSE 6512 Lecture 22; November 10, 2011 Notes by Tamas Lengyel
- Notes by Jerlin C Merlin MARKOV CHAINS
- Randomization in Computing Notes -10/27/11 Written up by: Michael Fagan
- CSE 6512 Lecture on Optimal Randomized Sorting James Lindsay
- CSE6512 Lecture 9 Notes September 27, 2011
- Randomization in Computing Lecture 4 -Notes
- Notes Page 1 of 5 Randomized algorithms
- RANDOMIZATION IN COMPUTING LECTURE 16, 20th
- CSE 6512 Lecture 11 Notes Jingxin Sun
- CSE 6512 Lecture 12 Notes Taken by Levon Nazaryan
- CSE 6512 Lecture 7 Notes Sudipta Pathak
- CSE 6512 --Lecture 15 Notes by Son Le
- CSE 6512 -Homework 1 Solutions Marius Nicolae
- CSE 6512, Lecture 17, October 25, 2011 Notes by Mahmoud Maghraby
- CSE 6512 Randomization in Computing. Fall 2011 Exam #1 Solutions
- CSE 6512 Randomization in Computing Exam I; Help Sheet
- Class Lecture Eight (8) Randomized Hashing
- CSE 6512 Lecture 6 Notes Morad Behandish
- Transcript of Lecture 3 of CSE 6512. Saad Quader
- CSE6512 Lecture 24 Notes Manal Alharbi
- CSE6512: Randomization in Computing Lecture 19, Nov 1st
- CSE 6512 Lecture 14 Notes Asa Thibodeau
- CSE 6512 Randomization in Computing Lecture Notes 23
- Page 1 of 6 CSE6512: Randomization in Computing
- CSE 3500 Algorithms and Complexity. Spring 2012 Home work 2. Solutions
- CSE6512 Class Lecture 26 Prepared By: Subrata Saha
- CSE 3500 Algorithms and Complexity Spring 2012; Exam I; Help Sheet
- CSE3500 Algorithms and Complexity. Spring 2012 Home work 1 Solutions
- CSE6512 Lecture 25 Notes Sudipta Pathak