| Publication | Date of Publication | Type |
|---|
Feasibility of flow decomposition with subpath constraints in linear time
| 2024-08-13 | Paper |
Fast Parallel Tensor Times Same Vector for Hypergraphs
| 2023-11-14 | Paper |
Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
Lecture Notes in Computer Science | 2023-03-09 | Paper |
The complexity of approximate pattern matching on de Bruijn graphs
| 2022-08-30 | Paper |
Evaluating High Performance Pattern Matching on the Automata Processor
IEEE Transactions on Computers | 2019-08-13 | Paper |
On the complexity of sequence to graph alignment
| 2019-05-21 | Paper |
scientific article; zbMATH DE number 6876076 (Why is no real title available?)
| 2018-05-29 | Paper |
scientific article; zbMATH DE number 6876086 (Why is no real title available?)
| 2018-05-29 | Paper |
A Scalable Parallel Wideband MLFMA for Efficient Electromagnetic Simulations on Large Scale Clusters
IEEE Transactions on Antennas and Propagation | 2017-09-01 | Paper |
Efficient Alignment Free Sequence Comparison with Bounded Mismatches
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Parallel globally optimal structure learning of Bayesian networks
Journal of Parallel and Distributed Computing | 2015-12-18 | Paper |
An algorithmic view on multi-related-segments: a unifying model for approximate common interval
Lecture Notes in Computer Science | 2012-07-16 | Paper |
A scalable parallelization of the gene duplication problem
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Space efficient linear time construction of suffix arrays
Combinatorial Pattern Matching | 2010-04-06 | Paper |
An optimal hierarchical clustering algorithm for gene expression data
Information Processing Letters | 2009-08-27 | Paper |
The Combinatorics of Sequencing the Corn Genome
Lecture Notes in Computer Science | 2009-03-06 | Paper |
ParBaum: Large-scale maximum likelihood-based phylogenetic analyses
| 2009-02-09 | Paper |
Obtaining Provably Good Performance from Suffix Trees in Secondary Storage
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Space efficient linear time construction of suffix arrays
Journal of Discrete Algorithms | 2005-10-27 | Paper |
Parallel algorithms for tree accumulations
Journal of Parallel and Distributed Computing | 2005-08-03 | Paper |
scientific article; zbMATH DE number 2080877 (Why is no real title available?)
| 2004-08-04 | Paper |
Parallel biological sequence comparison using prefix computations.
Journal of Parallel and Distributed Computing | 2003-08-19 | Paper |
scientific article; zbMATH DE number 1955849 (Why is no real title available?)
| 2003-07-29 | Paper |
scientific article; zbMATH DE number 1500640 (Why is no real title available?)
| 2000-09-04 | Paper |
Distribution-independent hierarchical algorithms for the \(N\)-body problem
The Journal of Supercomputing | 1999-01-17 | Paper |
Lagged Fibonacci random number generators for distributed memory parallel computers
Journal of Parallel and Distributed Computing | 1998-08-03 | Paper |
Greengard’s N-Body Algorithm is not Order N
SIAM Journal on Scientific Computing | 1996-07-02 | Paper |
A random number generator for parallel computers
Parallel Computing | 1993-01-17 | Paper |
