The following pages link to Sanguthevar Rajasekaran (Q293337):
Displayed 50 items.
- Item:Q293337 (redirect page) (← links)
- An optimal parallel algorithm for sorting multisets (Q293338) (← links)
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- Communication and energy efficient routing protocols for single-hop radio networks (Q433469) (← links)
- A relaxation scheme for increasing the parallelism in Jacobi-SVD (Q436787) (← links)
- Efficient algorithms for self assembling non-rectangular nano structures (Q537839) (← links)
- Efficient out-of-core sorting algorithms for the parallel disks model (Q645818) (← links)
- Out-of-core computing on mesh connected computers (Q705578) (← links)
- Fast algorithms for placing large entries along the diagonal of a sparse matrix (Q708297) (← links)
- On parallel integer sorting (Q805234) (← links)
- A generalization of the 0-1 principle for sorting (Q1041721) (← links)
- Optimal routing algorithms for mesh-connected processor arrays (Q1188114) (← links)
- Nested annealing: A provable improvement to simulated annealing (Q1193895) (← links)
- Constant queue routing on a mesh (Q1200148) (← links)
- TAL recognition in \(O(M(n^2))\) time (Q1267714) (← links)
- Packet routing and PRAM emulation on star graphs and leveled networks (Q1325971) (← links)
- Unifying themes for selection on any network (Q1384524) (← links)
- On simulated annealing and nested annealing. (Q1579946) (← links)
- On string matching with mismatches (Q1736652) (← links)
- Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane (Q1849744) (← links)
- Selection algorithms for parallel disk systems (Q1862466) (← links)
- Optimal mesh algorithms for the Voronoi diagram of line segments and motion planning in the plane (Q1892867) (← links)
- The light bulb problem (Q1892873) (← links)
- A randomized algorithm for multipacket routing on the mesh (Q1893676) (← links)
- An elegant algorithm for the construction of suffix arrays (Q2250537) (← links)
- Efficient algorithms for finding edit-distance based motifs (Q2315525) (← links)
- Packet routing and selection on the POPS network (Q2484299) (← links)
- Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models (Q2629930) (← links)
- An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time (Q2798747) (← links)
- EMS1: AN ELEGANT ALGORITHM FOR EDIT DISTANCE BASED MOTIF SEARCH (Q2856019) (← links)
- Novel Randomized Feature Selection Algorithms (Q2947957) (← links)
- An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs (Q3066156) (← links)
- ON THE HARDNESS OF THE BORDER LENGTH MINIMIZATION PROBLEM ON A RECTANGULAR ARRAY (Q3069747) (← links)
- Randomized Self Assembly of Rectangular Nano Structures (Q3070965) (← links)
- AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS (Q3166730) (← links)
- (Q3359742) (← links)
- EFFICIENT ALGORITHMS FOR DEGENERATE PRIMER SEARCH (Q3503104) (← links)
- Robust Network Supercomputing with Malicious Processes (Q3524326) (← links)
- Space and Time Efficient Algorithms for Planted Motif Search (Q3545137) (← links)
- SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM (Q3636158) (← links)
- (Q3783528) (← links)
- (Q3785933) (← links)
- (Q3802892) (← links)
- (Q4013544) (← links)
- (Q4035691) (← links)
- Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses (Q4217301) (← links)
- (Q4224934) (← links)
- (Q4247467) (← links)
- (Q4251081) (← links)
- Mesh connected computers with fixed and reconfigurable buses: packet routing and sorting (Q4406354) (← links)