Alexander Tiskin

CoRR, 2022

Fast RSK Correspondence by Doubling Search.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Efficient Parallel Algorithms for String Comparison.

[BibT_eX]

[DOI]

Nikita Mishin

Daniil Berezun

Proceedings of the ICPP 2021: 50th International Conference on Parallel Processing, Lemont, IL, USA, August 9, 2021

2020

Communication vs Synchronisation in Parallel String Comparison.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Bounded-Length Smith-Waterman Alignment.

[BibT_eX]

[DOI]

Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

2015

Fast Distance Multiplication of Unit-Monge Matrices.

[BibT_eX]

[DOI]

Algorithmica, 2015

2014

State-of-the-art in string similarity search and join.

[BibT_eX]

[DOI]

SIGMOD Rec., 2014

Four-point conditions for the TSP: The complete complexity classification.

[BibT_eX]

[DOI]

Discret. Optim., 2014

Threshold Approximate Matching in Grammar-Compressed Strings.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

2013

Parallel Suffix Array Construction by Accelerated Sampling.

[BibT_eX]

[DOI]

Matthew Felice Pace

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Efficient high-similarity string comparison: the waterfall algorithm.

[BibT_eX]

[DOI]

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Approximate string matching as an algebraic computation.

[BibT_eX]

[DOI]

Tiny Trans. Comput. Sci., 2012

2011

BSP (Bulk Synchronous Parallelism).

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Parallel Computing, 2011

Boundary properties of graphs for algorithmic graph problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2011

2010

Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult.

[BibT_eX]

[DOI]

Nicholas Korpelainen

Vadim V. Lozin

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

New algorithms for efficient parallel string comparison.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Parallel Selection by Regular Sampling.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009

Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

String comparison by transposition networks

[BibT_eX]

[DOI]

CoRR, 2009

Parallel Longest Increasing Subsequences in Scalable Time and Memory.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2009

Computing alignment plots efficiently.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computing: From Multicores and GPU's to Petascale, 2009

Introduction.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2009 Parallel Processing, 2009

Periodic String Comparison.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

Semi-local String Comparison: Algorithmic Techniques and Applications.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2008

Semi-local longest common subsequences in subquadratic time.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

2007

Communication-efficient parallel generic pairwise elimination.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2007

Packing tripods: Narrowing the density gap.

[BibT_eX]

[DOI]

Discret. Math., 2007

Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio

[BibT_eX]

[DOI]

CoRR, 2007

Faster exon assembly by sparse spliced alignment

[BibT_eX]

[DOI]

CoRR, 2007

Faster subsequence recognition in compressed strings

[BibT_eX]

[DOI]

CoRR, 2007

Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Efficient Parallel String Comparison.

[BibT_eX]

Proceedings of the Parallel Computing: Architectures, 2007

2006

Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

One-Sided Monge TSP Is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

All Semi-local Longest Common Subsequences in Subquadratic Time.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2006

Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences.

[BibT_eX]

Proceedings of the Parallel Computing: Current & Future Issues of High-End Computing, 2005

2004

Communication lower bounds for distributed-memory matrix multiplication.

[BibT_eX]

[DOI]

Dror Irony

Sivan Toledo

J. Parallel Distributed Comput., 2004

2003

Communication-Efficient Parallel Gaussian Elimination.

[BibT_eX]

[DOI]

Alexandros V. Gerbessiotis

Proceedings of the Parallel Computing Technologies, 2003

2002

Parallel Priority Queue and List Contraction: The BSP Approach.

[BibT_eX]

[DOI]

Constantinos J. Siniolakis

Comput. Artif. Intell., 2002

Parallel Convex Hull Computation by Generalised Regular Sampling.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2002, 2002

2001

A New Way to Divide and Conquer.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2001

All-Pairs Shortest Paths Computation in the BSP Model.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Tripods Do Not Pack Densely.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Memory-Efficient Matrix Multiplication in the BSP Model.

[BibT_eX]

[DOI]

William F. McColl

Algorithmica, 1999

Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

The design and analysis of bulk-synchronous parallel algorithms.

[BibT_eX]

[DOI]

PhD thesis, 1998

The Bulk-Synchronous Parallel Random Access Machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Bulk-Synchronous Parallel Multiplication of Boolean Matrices.

[BibT_eX]

[DOI]