Sanguthevar Rajasekaran

From MaRDI portal
(Redirected from Person:293337)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Online Evidential Nearest Neighbour Classification for Internet of Things Time Series
International Statistical Review
2024-04-05Paper
Efficient algorithms for finding edit-distance based motifs2019-07-25Paper
On string matching with mismatches
Algorithms
2019-03-26Paper
Optimal and Practical Algorithms for Sorting on the PDM
IEEE Transactions on Computers
2017-11-10Paper
On pattern matching with \(k\) mismatches and few don't cares
Information Processing Letters
2016-11-23Paper
Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
Natural Computing
2016-07-08Paper
An optimal parallel algorithm for sorting multisets
Information Processing Letters
2016-06-09Paper
An error correcting parser for context free grammars that takes less than cubic time
Language and Automata Theory and Applications
2016-04-13Paper
Novel randomized feature selection algorithms
International Journal of Foundations of Computer Science
2015-09-29Paper
PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
International Journal of Foundations of Computer Science
2015-04-29Paper
An elegant algorithm for the construction of suffix arrays
Journal of Discrete Algorithms
2014-07-07Paper
EMS1: an elegant algorithm for edit distance based motif search
International Journal of Foundations of Computer Science
2013-10-23Paper
An efficient algorithm for chinese postman walk on bi-directed de Bruijn graphs
Discrete Mathematics, Algorithms and Applications
2012-10-15Paper
A relaxation scheme for increasing the parallelism in Jacobi-SVD
Journal of Parallel and Distributed Computing
2012-07-26Paper
Communication and energy efficient routing protocols for single-hop radio networks
Journal of Parallel and Distributed Computing
2012-07-13Paper
Efficient out-of-core sorting algorithms for the parallel disks model
Journal of Parallel and Distributed Computing
2011-11-10Paper
Efficient algorithms for self assembling non-rectangular nano structures
Natural Computing
2011-05-23Paper
Randomized Self Assembly of Rectangular Nano Structures
Lecture Notes in Computer Science
2011-01-28Paper
On the hardness of the border length minimization problem on a rectangular array
International Journal of Foundations of Computer Science
2011-01-19Paper
An efficient algorithm for Chinese postman walk on bi-directed de Bruijn graphs
Combinatorial Optimization and Applications
2011-01-08Paper
Fast algorithms for placing large entries along the diagonal of a sparse matrix
Journal of Computational and Applied Mathematics
2010-10-11Paper
A generalization of the 0-1 principle for sorting
Information Processing Letters
2009-12-04Paper
SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM
International Journal of Foundations of Computer Science
2009-06-30Paper
Space and Time Efficient Algorithms for Planted Motif Search
Computational Science – ICCS 2006
2008-12-09Paper
Robust Network Supercomputing with Malicious Processes
Lecture Notes in Computer Science
2008-09-09Paper
EFFICIENT ALGORITHMS FOR DEGENERATE PRIMER SEARCH
International Journal of Foundations of Computer Science
2008-05-20Paper
Algorithms and Computation
Lecture Notes in Computer Science
2006-11-14Paper
Algorithms and Computation
Lecture Notes in Computer Science
2006-11-14Paper
EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES
International Journal of Foundations of Computer Science
2005-10-19Paper
Packet routing and selection on the POPS network
Journal of Parallel and Distributed Computing
2005-08-01Paper
RANDOMIZED SORTING ON THE POPS NETWORK
International Journal of Foundations of Computer Science
2005-05-06Paper
PARALLIZING 1-DIMENSIONAL ESTUARINE MODEL
International Journal of Foundations of Computer Science
2005-02-28Paper
Out-of-core computing on mesh connected computers
Journal of Parallel and Distributed Computing
2005-01-31Paper
SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS
Parallel Algorithms and Applications
2004-10-06Paper
Efficient algorithms for local alignment search
Journal of Combinatorial Optimization
2004-01-07Paper
Efficient algorithms for similarity search
Journal of Combinatorial Optimization
2004-01-07Paper
Mesh connected computers with fixed and reconfigurable buses: packet routing and sorting
IEEE Transactions on Computers
2003-06-25Paper
Selection algorithms for parallel disk systems
Journal of Parallel and Distributed Computing
2003-03-19Paper
scientific article; zbMATH DE number 1844548 (Why is no real title available?)2002-12-12Paper
Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane
Algorithmica
2002-12-01Paper
scientific article; zbMATH DE number 1792119 (Why is no real title available?)2002-08-28Paper
Permutation routing on reconfigurable meshes
Algorithmica
2002-03-04Paper
A framework for simple sorting algorithms on parallel disk systems
Theory of Computing Systems
2002-02-07Paper
scientific article; zbMATH DE number 1857637 (Why is no real title available?)2001-01-01Paper
scientific article; zbMATH DE number 1302200 (Why is no real title available?)2000-09-26Paper
On simulated annealing and nested annealing.
Journal of Global Optimization
2000-09-14Paper
TAL recognition in \(O(M(n^2))\) time
Journal of Computer and System Sciences
1999-06-21Paper
scientific article; zbMATH DE number 1304349 (Why is no real title available?)1999-06-17Paper
scientific article; zbMATH DE number 1241394 (Why is no real title available?)1999-05-18Paper
Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses
Journal of Algorithms
1998-11-11Paper
Unifying themes for selection on any network
Journal of Parallel and Distributed Computing
1998-10-01Paper
Tree-Adjoining Language Parsing in $O(n^6 )$ Time
SIAM Journal on Computing
1996-12-09Paper
Fast algorithms for generating discrete random variates with changing distributions
ACM Transactions on Modeling and Computer Simulation
1996-06-13Paper
Fast algorithms for generating discrete random variates with changing distributions
ACM Transactions on Modeling and Computer Simulation
1996-06-13Paper
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
Journal of Algorithms
1996-01-16Paper
A randomized algorithm for multipacket routing on the mesh
Journal of Parallel and Distributed Computing
1995-07-20Paper
Optimal mesh algorithms for the Voronoi diagram of line segments and motion planning in the plane
Journal of Parallel and Distributed Computing
1995-07-06Paper
The light bulb problem
Information and Computation
1995-07-06Paper
Packet routing and PRAM emulation on star graphs and leveled networks
Journal of Parallel and Distributed Computing
1994-06-22Paper
scientific article; zbMATH DE number 176525 (Why is no real title available?)1993-05-18Paper
Constant queue routing on a mesh
Journal of Parallel and Distributed Computing
1993-01-17Paper
Nested annealing: A provable improvement to simulated annealing
Theoretical Computer Science
1992-09-27Paper
scientific article; zbMATH DE number 67624 (Why is no real title available?)1992-09-27Paper
Optimal routing algorithms for mesh-connected processor arrays
Algorithmica
1992-08-13Paper
On parallel integer sorting
Acta Informatica
1992-01-01Paper
scientific article; zbMATH DE number 4213428 (Why is no real title available?)1990-01-01Paper
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
SIAM Journal on Computing
1989-01-01Paper
scientific article; zbMATH DE number 4070640 (Why is no real title available?)1988-01-01Paper
scientific article; zbMATH DE number 4047072 (Why is no real title available?)1987-01-01Paper
scientific article; zbMATH DE number 4049037 (Why is no real title available?)1987-01-01Paper


Research outcomes over time


This page was built for person: Sanguthevar Rajasekaran