Sanguthevar Rajasekaran

According to our database1, Sanguthevar Rajasekaran
  • authored at least 267 papers between 1987 and 2017.
  • has a "Dijkstra number"2 of four.

Awards

IEEE Fellow

IEEE Fellow 2008, "For contributions to sequential, parallel, and randomized algorithms and to bioinformatics".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
On pattern matching with k mismatches and few don't cares.
Inf. Process. Lett., 2017

2016
On pattern matching with k mismatches and few don't cares.
CoRR, 2016

Hybrid-DCA: A Double Asynchronous Approach for Stochastic Dual Coordinate Ascent.
CoRR, 2016

NRGC: a novel referential genome compression algorithm.
Bioinformatics, 2016

Authors' response to 'Comment on: ERGC: An efficient Referential Genome Compression Algorithm'.
Bioinformatics, 2016

KCMBT: a k-mer Counter based on Multiple Burst Trees.
Bioinformatics, 2016

An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time.
Proceedings of the Language and Automata Theory and Applications, 2016

Data mining using Probabilistic Grammars.
Proceedings of the 2016 IEEE International Symposium on Signal Processing and Information Technology, 2016

Taking swarms to the field: Constrained Spiral Flocking for underwater search.
Proceedings of the IEEE Symposium on Computers and Communication, 2016

An efficient Minimum Spanning Tree algorithm.
Proceedings of the IEEE Symposium on Computers and Communication, 2016

Efficient Algorithms for the Three Locus Problem in Genome-Wide Association Study.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

On Speeding-Up Parallel Jacobi Iterations for SVDs.
Proceedings of the 18th IEEE International Conference on High Performance Computing and Communications; 14th IEEE International Conference on Smart City; 2nd IEEE International Conference on Data Science and Systems, 2016

Efficient Algorithms for the Two Locus Problem in Genome-Wide Association Study: Algorithms for the Two Locus Problem.
Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, 2016

qPMS10: A randomized algorithm for efficiently solving quorum Planted Motif Search problem.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

POMP: a powerful splice mapper for RNA-seq reads.
Proceedings of the 7th ACM International Conference on Bioinformatics, 2016

2015
Robust network supercomputing with unreliable workers.
J. Parallel Distrib. Comput., 2015

Metabolic Pathway Predictions for Metabolomics: A Molecular Structure Matching Approach.
Journal of Chemical Information and Modeling, 2015

An adaptive power controlled routing protocol for underwater sensor network.
IJSNet, 2015

Novel Randomized Feature Selection Algorithms.
Int. J. Found. Comput. Sci., 2015

A molecular structure matching approach to efficient identification of endogenous mammalian biochemical structures.
BMC Bioinformatics, 2015

ERGC: an efficient referential genome compression algorithm.
Bioinformatics, 2015

LFQC: a lossless compression algorithm for FASTQ files.
Bioinformatics, 2015

On String Matching with Mismatches.
Algorithms, 2015

Aqua-Sim Next Generation: A NS-3 Based Simulator for Underwater Sensor Networks.
Proceedings of the 10th International Conference on Underwater Networks & Systems, 2015

Disjunctive combined causal rules mining.
Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2015

Conjunctive combined causal rules mining.
Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2015

Predicting E. Coli promoters using formal grammars.
Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2015

Taking swarms to the field: A framework for underwater mission planning.
Proceedings of the 2015 IEEE Symposium on Computers and Communication, 2015

NRRC: A Non-referential Reads Compression Algorithm.
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

HiCOMB Introduction and Committees.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

Efficient techniques for k-mer counting.
Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

Improved algorithms for finding edit distance based motifs.
Proceedings of the 2015 IEEE International Conference on Bioinformatics and Biomedicine, 2015

HECTOR: a novel paradigm for correcting short reads.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
An elegant algorithm for the construction of suffix arrays.
J. Discrete Algorithms, 2014

Border Length Minimization Problem on a Square Array.
Journal of Computational Biology, 2014

Efficient sequential and parallel algorithms for record linkage.
JAMIA, 2014

An experimental comparison of PMSprune and other algorithms for motif search.
IJBRA, 2014

PMS6: a fast algorithm for motif discovery.
IJBRA, 2014

Efficient Algorithms for the Closest Pair Problem and Applications.
CoRR, 2014

An error correcting parser for context free grammars that takes less than cubic time.
CoRR, 2014

Efficient Sequential and Parallel Algorithms for Planted Motif Search.
BMC Bioinformatics, 2014

Energy-aware heuristics for scheduling parallel applications on high performance computing platforms.
Proceedings of the 2014 IEEE International Symposium on Signal Processing and Information Technology, 2014

Frequent itemsets mining on weighted uncertain data.
Proceedings of the 2014 IEEE International Symposium on Signal Processing and Information Technology, 2014

Efficient pipeline architectures for Underwater Big data analytic.
Proceedings of the 2014 IEEE International Symposium on Signal Processing and Information Technology, 2014

Message from the technical program co-chairs.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

Disjunctive rules mining from uncertain databases.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

Coordinated multi-surface gateway redeployment for enhanced performance in underwater sensor networks.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

Efficient algorithms for error correction and compression of NGS data.
Proceedings of the IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences, 2014

Poster: Efficient record linkage techniques.
Proceedings of the IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences, 2014

Efficient algorithms for the compression of FASTQ files.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013
Efficient Software Reliability Analysis With Correlated Component Failures.
IEEE Trans. Reliability, 2013

Efficient techniques for genotype-phenotype correlational analysis.
BMC Med. Inf. & Decision Making, 2013

BioSM: Metabolomics Tool for Identifying Endogenous Mammalian Biochemical Structures in Chemical Structure Space.
Journal of Chemical Information and Modeling, 2013

Ems1: an Elegant Algorithm for Edit Distance Based Motif Search.
Int. J. Found. Comput. Sci., 2013

Special section on invited papers from NetCoM-2009.
Future Generation Comp. Syst., 2013

General optimization framework for surface gateway deployment problem in underwater sensor networks.
EURASIP J. Wireless Comm. and Networking, 2013

An Elegant Algorithm for the Construction of Suffix Arrays.
CoRR, 2013

On string matching with k mismatches.
CoRR, 2013

Efficient Sequential and Parallel Algorithms for Planted Motif Search.
CoRR, 2013

Efficient algorithms for biological stems search.
BMC Bioinformatics, 2013

PMS6MC: A Multicore Algorithm for Motif Discovery.
Algorithms, 2013

A Structure Based Algorithm for Improving Motifs Prediction.
Proceedings of the Pattern Recognition in Bioinformatics, 2013

A two-pass exact algorithm for selection on Parallel Disk Systems.
Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

Fast GPU algorithms for implementing the red-black Gauss-Seidel method for Solving Partial Differential Equations.
Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

An adaptive surface sink redeployment strategy for Underwater Sensor Networks.
Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

Efficient algorithms for sequence assembly.
Proceedings of the IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences, 2013

PMS6MC: A multicore algorithm for motif discovery.
Proceedings of the IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences, 2013

Integrating clonal selection and deterministic sampling for efficient associative classification.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

A Novel Deterministic Sampling Technique to Speedup Clustering Algorithms.
Proceedings of the Advanced Data Mining and Applications - 9th International Conference, 2013

2012
Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models.
Natural Computing, 2012

Minimotif Miner 3.0: database expansion and significantly improved reduction of false-positive predictions from consensus sequences.
Nucleic Acids Research, 2012

Efficient algorithms for fast integration on large data sets from multiple sources.
BMC Med. Inf. & Decision Making, 2012

Communication and energy efficient routing protocols for single-hop radio networks.
J. Parallel Distrib. Comput., 2012

An Efficient Algorithm for Chinese Postman Walk on Bi-Directed de Bruijn Graphs.
Discrete Math., Alg. and Appl., 2012

Adaptive Power Controlled Routing for Underwater Sensor Networks.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2012

Artificial Immune Systems: Models, Applications, and challenges.
Proceedings of the ACM Symposium on Applied Computing, 2012

An enhanced scheduling algorithm using a recursive critical path approach with task duplication.
Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2012

Fast GPU algorithms for endmember extraction from hyperspectral images.
Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012

PADP: Prediction assisted dynamic surface gateway placement for mobile underwater networks.
Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012

A novel algorithm for technical articles classification based on gene selection.
Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012

ML-DS: A Novel Deterministic Sampling Algorithm for Association Rules Mining.
Proceedings of the Advances in Data Mining. Applications and Theoretical Aspects, 2012

An Artificial Immune System Approach to Associative Classification.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

The use of graph matching algorithms to identify biochemical substructures in synthetic chemical compounds: Application to metabolomics.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

Workshop: An efficient data structure for exact-match overlap graphs and next generation sequence assembly.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

PMS6: A fast algorithm for motif discovery.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

AC-CS: An Immune-Inspired Associative Classification Algorithm.
Proceedings of the Artificial Immune Systems - 11th International Conference, 2012

2011
Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

Efficient algorithms for self assembling non-rectangular nano structures.
Natural Computing, 2011

Efficient out-of-core sorting algorithms for the Parallel Disks Model.
J. Parallel Distrib. Comput., 2011

Parallel Algorithms for DNA Probe Placement on Small Oligonucleotide Arrays
CoRR, 2011

An Experimental Comparison of PMSPrune and Other Algorithms for Motif Search
CoRR, 2011

PMS5: an efficient exact algorithm for the (l, d)-motif finding problem.
BMC Bioinformatics, 2011

A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
Bioinformatics, 2011

Improving N-Finder technique for extracting endmembers.
Proceedings of the 2011 IEEE International Symposium on Signal Processing and Information Technology, 2011

A correlation-based algorithm for classifying technical articles.
Proceedings of the 2011 IEEE International Symposium on Signal Processing and Information Technology, 2011

An efficient heuristic for estimating transportation network vulnerability.
Proceedings of the 16th IEEE Symposium on Computers and Communications, 2011

Workshop: Efficient sequential and parallel algorithms for sequence assembly.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

Computational Techniques for Motif Search.
Proceedings of the Contemporary Computing - 4th International Conference, 2011

Efficient System Reliability with Correlated Component Failures.
Proceedings of the 13th IEEE International Symposium on High-Assurance Systems Engineering, 2011

2010
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

Fast Algorithms for Constant Approximation k-Means Clustering.
Trans. MLDM, 2010

Fast algorithms for placing large entries along the diagonal of a sparse matrix.
J. Computational Applied Mathematics, 2010

On the Hardness of the Border Length Minimization Problem on a Rectangular Array.
Int. J. Found. Comput. Sci., 2010

A greedy algorithm for gene selection based on SVM and correlation.
IJBRA, 2010

A memory-efficient data structure representing exact-match overlap graphs with application for next generation DNA assembly
CoRR, 2010

An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs
CoRR, 2010

On the Border Length Minimization Problem (BLMP) on a Square Array
CoRR, 2010

Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs
CoRR, 2010

MimoSA: a system for minimotif annotation.
BMC Bioinformatics, 2010

Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
BMC Bioinformatics, 2010

Task clustering & scheduling with duplication using recursive critical path approach (RCPA).
Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2010

An Efficient Randomized Routing Protocol for Single-Hop Radio Networks.
Proceedings of the 39th International Conference on Parallel Processing, 2010

Randomized Self Assembly of Rectangular Nano Structures.
Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2010

Network A Randomized Automatic Pixel Purity Index Technique.
Proceedings of the ISCA 25th International Conference on Computers and Their Applications, 2010

FFTI: Fast In-Place FFT on the Cell Broadband Engine.
Proceedings of the ISCA 25th International Conference on Computers and Their Applications, 2010

On the border length minimization problem (BLMP) on a square array.
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

2009
Minimotif miner 2nd release: a database and web system for motif search.
Nucleic Acids Research, 2009

Spectrum Based Techniques for Graph Isomorphism.
Int. J. Found. Comput. Sci., 2009

Novel micro-threading techniques on the Cell Broadband Engine.
Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009

Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots.
Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

Efficient Algorithms for Self Assembling Triangular and Other Nano Structures.
Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

Responsible Data Releases.
Proceedings of the Advances in Data Mining. Applications and Theoretical Aspects, 2009

A Simple Algorithm for (l, d) Motif Search1.
Proceedings of the 2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2009

Degenerate primer selection algorithms.
Proceedings of the 2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2009

Generalized algorithms for generating balanced modulation codes in protein-based volumetric memories.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

RNA Pseudoknot Folding through Inference and Identification Using TAGRNA.
Proceedings of the Bioinformatics and Computational Biology, 2009

On the Hardness of the Border Length Minimization Problem.
Proceedings of the Ninth IEEE International Conference on Bioinformatics and Bioengineering, 2009

Optimal Micro-Threading Scheduling for Multi-Core Processors to Hide Memory Latency.
Proceedings of the 22nd International Conference on Parallel and Distributed Computing and Communication Systems, 2009

2008
Optimal and Practical Algorithms for Sorting on the PDM.
IEEE Trans. Computers, 2008

A relaxation scheme for increasing the parallelism in Jacobi-SVD.
J. Parallel Distrib. Comput., 2008

Special issue on parallel techniques for information extraction.
J. Parallel Distrib. Comput., 2008

Pseudoknot Identification through Learning TAGRNA.
Proceedings of the Pattern Recognition in Bioinformatics, 2008

Efficient sorting algorithms for the cell broadband engine.
Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC 2008), 2008

SPENK: adding another level of parallelism on the cell broadband engine.
Proceedings of the 1st international forum on Next-generation multicore/manycore technologies, 2008

Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space.
Proceedings of the Computational Science, 2008

Efficient PDM Sorting Algorithms.
Proceedings of the High Performance Computing, 2008

A Novel Scheme for the Detection of an Unknown Class in Classification.
Proceedings of The 2008 International Conference on Data Mining, 2008

Sampling Based Meta-algorithms for Accurate Multiple Sequence Alignment.
Proceedings of the 2008 IEEE International Conference on Bioinformatics and Biomedicine, 2008

Data Integration on Multiple Data Sets.
Proceedings of the 2008 IEEE International Conference on Bioinformatics and Biomedicine, 2008

A local structural alignment algorithm with Variable Length Alignment Fragment Pairs.
Proceedings of the 8th IEEE International Conference on Bioinformatics and Bioengineering, 2008

Faster greedy algorithms for Multiple Degenerate Primer Selection.
Proceedings of the 8th IEEE International Conference on Bioinformatics and Bioengineering, 2008

An efficient digital circuit for implementing Sequence Alignment algorithm in an extended processor.
Proceedings of the 19th IEEE International Conference on Application-Specific Systems, 2008

2007
Randomized Packet Routing, Selection, and Sorting on the POPS Network.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Deterministic and Randomized Sorting Algorithms for Parallel Disk Models.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Fast and Practical Algorithms for Planted (l, d) Motif Search.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

Efficient Algorithms for degenerate Primer Search.
Int. J. Found. Comput. Sci., 2007

Fast Algorithms for Selecting Specific siRNA in Complete mRNA Data.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Efficient Scheduling of Real-time Tandem Task Graphs on Heterogeneous Clusters with Network Limitations.
Proceedings of the 12th IEEE Symposium on Computers and Communications (ISCC 2007), 2007

Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

Towards a Collusion-Resistant Algebraic Multi-Party Protocol for Privacy-Preserving Association Rule Mining in Vertically Partitioned Data.
Proceedings of the 26th IEEE International Performance Computing and Communications Conference, 2007

Fast Cryptographic Multi-Party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association: Rule Mining in Vertically Partitioned Data.
Proceedings of the Advances in Data Mining. 7th Industrial Conference, 2007

A Block JRS Algorithm for Highly Parallel Computation of SVDs.
Proceedings of the High Performance Computing and Communications, 2007

Fast Cryptographic Multi-party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association Rule Mining in Vertically Partitioned Data.
Proceedings of the Data Warehousing and Knowledge Discovery, 9th International Conference, 2007

Self-Optimizing Parallel Algorithms for Haplotype Reconstruction and Their Evaluation on the JPT and CHB Genotype Data.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

A Greedy Correlation-Incorporated SVM-Based Algorithm for Gene Selection.
Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

Parallel algorithms for motif search.
Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems, 2007

2006
A Transaction Mapping Algorithm for Frequent Itemsets Mining.
IEEE Trans. Knowl. Data Eng., 2006

A Framework for Mining Association Rules.
I. J. Comput. Appl., 2006

Efficient parallel algorithms for processing biological sequences.
IJCAT, 2006

Finding Hamiltonian paths in tournaments on clusters.
Cluster Computing, 2006

Robust Network Supercomputing with Malicious Processes.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Space and Time Efficient Algorithms for Planted Motif Search.
Proceedings of the Computational Science, 2006

A Novel Scheme for the Parallel Computation of SVDs.
Proceedings of the High Performance Computing and Communications, 2006

Extending Pattern Branching to Handle Challenging Instances.
Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006

Analysis of Heterogeneous Data in Ultrahigh Dimensions.
Proceedings of the Emergent Information Technologies and Enabling Policies for Counter-Terrorism, 2006

2005
Efficient Parallel Hierarchical Clustering Algorithms.
IEEE Trans. Parallel Distrib. Syst., 2005

Packet routing and selection on the POPS network.
J. Parallel Distrib. Comput., 2005

Exact Algorithms for Planted Motif Problems.
Journal of Computational Biology, 2005

A generalization of the 0-1 principle for sorting.
Inf. Process. Lett., 2005

Randomized Sorting On The Pops Network.
Int. J. Found. Comput. Sci., 2005

Finding frequent itemsets by transaction mapping.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

A Framework for Mining Association Rules.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2005

Maximizing Reliability While Scheduling Real-Time Task-Graphs on a Cluster of Computers.
Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), 2005

Fast k-Means Algorithms with Constant Approximation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

A Simple Optimal Randomized Algorithm for Sorting on the PDM.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

PDM Sorting Algorithms That Take A Small Number of Passes.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

BioGrid- bridging life science and information technology.
Proceedings of the 5th International Symposium on Cluster Computing and the Grid (CCGrid 2005), 2005

Exact algorithms for motif search.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

Exact algorithms for planted motif challenge problems.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004
Evaluating holistic aggregators efficiently for very large datasets.
VLDB J., 2004

Distributed Path-Based Inference in Semantic Networks.
The Journal of Supercomputing, 2004

High-performance parallel bio-computing.
Parallel Computing, 2004

Out-of-core computing on mesh connected computers.
J. Parallel Distrib. Comput., 2004

Parallizing 1-Dimensional Estuarine Model.
Int. J. Found. Comput. Sci., 2004

FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2004

A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment.
Proceedings of the Knowledge Exploration in Life Science Informatics, 2004

Distributed Path-Based Inference in Semantic Networks.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

A Fundamental Problem in Computer and Communication.
Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

Efficient Parallel Simulation of Direct Methanol Fuel Cell Models.
Proceedings of the 19th International Conference on Computers and Their Applications, 2004

Efficient Parallel Hierarchical Clustering Algorithms.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

Randomized Sorting on the POPS Network.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003
Efficient Algorithms For Selection And Sorting Of Large Distributed Files On De Bruijn And Hypercube Structures.
Int. J. Found. Comput. Sci., 2003

TROJAN: A Scalable Distributed Semantic Network System.
Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 2003

Fast IP lookup algorithms.
Proceedings of the 11th IEEE International Conference on Networks, 2003

Parallel cache management protocol and algorithm for cooperative Web servers.
Proceedings of IEEE International Conference on Communications, 2003

2002
Efficient Parallel Algorithms for Template Matching.
Parallel Processing Letters, 2002

Efficient Selection and Sorting Schemes Using Coteries for Processing Large Distributed Files.
J. Parallel Distrib. Comput., 2002

The Efficient Computation of Position-Specific Match Scores with the Fast Fourier Transform.
Journal of Computational Biology, 2002

Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane.
Algorithmica, 2002

Distributed Cache Content Management Protocol for Cooperative Web Server.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Parallel Cache Management Protocol for Static and Dynamic Web Contents.
Proceedings of the IADIS International Conference WWW/Internet 2002, 2002

2001
A Framework for Simple Sorting Algorithms on Parallel Disk Systems.
Theory Comput. Syst., 2001

Selection Algorithms for Parallel Disk Systems.
J. Parallel Distrib. Comput., 2001

Efficient Algorithms for Local Alignment Search.
J. Comb. Optim., 2001

Efficient Algorithms for Similarity Search.
J. Comb. Optim., 2001

Permutation Routing on Reconfigurable Meshes.
Algorithmica, 2001

Parallelizing 1-Dimensional Estuarine Model.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2001

Novel Algorithms for Computing Medians and Other Quantiles of Disk-Resident Data.
Proceedings of the International Database Engineering & Applications Symposium, 2001

2000
On Simulated Annealing and Nested Annealing.
J. Global Optimization, 2000

Special Issue on Randomized Computing.
Int. J. Found. Comput. Sci., 2000

Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel.
Proceedings of the Parallel and Distributed Processing, 2000

A Practical Realization of Parallel Disks.
Proceedings of the 2000 International Workshop on Parallel Processing, 2000

1999
Sorting and Selection on a Linear Array with Optical Bus System.
Parallel Processing Letters, 1999

On frequency assignment in cellular networks.
Proceedings of the Mobile Networks and Computing, 1999

A GRASP for frequency assignment in mobile radio networks.
Proceedings of the Mobile Networks and Computing, 1999

1998
Randomized Routing, Selection, and Sorting on the OTIS-Mesh.
IEEE Trans. Parallel Distrib. Syst., 1998

Parallel Algorithms for Relational Coarsest Partition Problems.
IEEE Trans. Parallel Distrib. Syst., 1998

TAL Recognition in O(M(n»)) Time.
J. Comput. Syst. Sci., 1998

Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses.
J. Algorithms, 1998

An Optimal Parallel Algorithm for Sorting Multisets.
Inf. Process. Lett., 1998

Permutation Routing and Sorting on the Reconfigurable Mesh.
Int. J. Found. Comput. Sci., 1998

A Framework for Simple Sorting Algorithms on Parallel Disk Systems (Extended Abstract).
SPAA, 1998

1997
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses.
IEEE Trans. Parallel Distrib. Syst., 1997

Determinisitic Routing on the Array with Reconfigurable Optical Buses.
Parallel Processing Letters, 1997

Selection, Routing, and Sorting on the Star Graph.
J. Parallel Distrib. Comput., 1997

Unifying Themes for Selection on Any Network.
J. Parallel Distrib. Comput., 1997

Designing Efficient Distributed Algorithms Using Sampling Techniques.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Computing on optical models.
Proceedings of the Randomization Methods in Algorithm Design, 1997

1996
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting.
IEEE Trans. Computers, 1996

Tree-Adjoining Language Parsing in o(n^6) Time.
SIAM J. Comput., 1996

Randomized Selection on the Hypercube.
J. Parallel Distrib. Comput., 1996

Efficient Selection and Sorting Schemes for Processing Large Distributed Files in Finite Projectives Plane.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996

1995
The Light Bulb Problem
Inf. Comput., March, 1995

Online Scheduling of Dynamic Trees.
Parallel Processing Letters, 1995

A Randomized Algorithm for Multipacket Routing on the Mesh.
J. Parallel Distrib. Comput., 1995

Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane.
J. Parallel Distrib. Comput., 1995

k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh.
J. Algorithms, 1995

Sorting and Selection on Distributed Memory Bus Computers.
Proceedings of the 1995 International Conference on Parallel Processing, 1995

TAL Recognition in O(M(n2)) Time.
Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, 1995

1994
Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks.
J. Parallel Distrib. Comput., 1994

Unifying Themes for Network Selection.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Sorting and selection on interconnection networks.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation.
Proceedings of the Computer Aided Verification, 6th International Conference, 1994

1993
Fast Algorithms for Generating Discrete Random Variates with Changing Distributions.
ACM Trans. Model. Comput. Simul., 1993

A Comparison of Meshes with Static Buses and Half-Duplex Wrap-Arounds.
Parallel Processing Letters, 1993

Permutation Routing on Reconfigurable Meshes.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Selection, Routing, and Sorting on the Star Graph.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

Fast Parallel Algorithms for Model Checking Using BDDs.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Nested Annealing: A Provable Improvement to Simulated Annealing.
Theor. Comput. Sci., 1992

Constant Queue Routing on a Mesh.
J. Parallel Distrib. Comput., 1992

Optimal Routing Algorithms for Mesh-Connected Processor Arrays.
Algorithmica, 1992

On Parallel Integer Sorting.
Acta Inf., 1992

Matching the Bisection Bound for Routing and Sorting on the Mesh.
SPAA, 1992

1991
Constant Queue Routing on a Mesh.
Proceedings of the STACS 91, 1991

Optimal randomized algorithms for multipacket and cut through routing on the mesh.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Emulation of a PRAM on Leveled Networks.
Proceedings of the International Conference on Parallel Processing, 1991

1990
Randomized Parallel Selection.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1989
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms.
SIAM J. Comput., 1989

The Light Bulb Problem.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988
Nested Annealing: A Provable Improvement to Simulated Annealing.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Optimal Routing Algorithms for Mesh-Connected Processor Arrays.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

Ranomized Parallel Computation.
Proceedings of the Fundamentals of Computation Theory, 1987


  Loading...