Bulk-Synchronous Parallel Multiplication of Boolean Matrices. - Alexandre Tiskin (ICALP, 1998)

The Bulk-Synchronous Parallel Random Access Machine. - Alexandre Tiskin (Theor. Comput. Sci., 1998)

The design and analysis of bulk-synchronous parallel algorithms. - Alexandre Tiskin (1998)

Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices. - Alexandre Tiskin (ICALP, 1999)

Memory-Efficient Matrix Multiplication in the BSP Model. - William F. McColl; Alexandre Tiskin (Algorithmica, 1999)

Tripods Do Not Pack Densely. - Alexandre Tiskin (COCOON, 2000)

All-Pairs Shortest Paths Computation in the BSP Model. - Alexandre Tiskin (ICALP, 2001)

A New Way to Divide and Conquer. - Alexandre Tiskin (Parallel Process. Lett., 2001)

Parallel Convex Hull Computation by Generalised Regular Sampling. - Alexandre Tiskin (Euro-Par, 2002)

Parallel Priority Queue and List Contraction: The BSP Approach. - Alexandros V. Gerbessiotis; Constantinos J. Siniolakis; Alexandre Tiskin (Comput. Artif. Intell., 2002)

Communication-Efficient Parallel Gaussian Elimination. - Alexandre Tiskin (PaCT, 2003)

Communication lower bounds for distributed-memory matrix multiplication. - Dror Irony; Sivan Toledo; Alexandre Tiskin (J. Parallel Distributed Comput., 2004)

Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences. - Alexandre Tiskin (PARCO, 2005)

Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. - Alexandre Tiskin (CPM, 2006)

All Semi-local Longest Common Subsequences in Subquadratic Time. - Alexandre Tiskin (CSR, 2006)

One-Sided Monge TSP Is NP-Hard. - Vladimir G. Deineko; Alexandre Tiskin (ICCSA (3), 2006)

Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism. - Peter Krusche; Alexandre Tiskin (ICCSA (5), 2006)

Efficient Parallel String Comparison. - Peter Krusche; Alexandre Tiskin (PARCO, 2007)

Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. - Vladimir G. Deineko; Alexandre Tiskin (WEA, 2007)

Faster subsequence recognition in compressed strings - Alexandre Tiskin (CoRR, 2007)

Faster exon assembly by sparse spliced alignment - Alexandre Tiskin (CoRR, 2007)

Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio - Vladimir G. Deineko; Alexandre Tiskin (CoRR, 2007)

Packing tripods: Narrowing the density gap. - Alexandre Tiskin (Discret. Math., 2007)

Communication-efficient parallel generic pairwise elimination. - Alexandre Tiskin (Future Gener. Comput. Syst., 2007)

Semi-local longest common subsequences in subquadratic time. - Alexander Tiskin (J. Discrete Algorithms, 2008)

Semi-local String Comparison: Algorithmic Techniques and Applications. - Alexandre Tiskin (Math. Comput. Sci., 2008)

Periodic String Comparison. - Alexander Tiskin (CPM, 2009)

Introduction. - Andrea Pietracaprina; Rob H. Bisseling; Emmanuelle Lebhar; Alexander Tiskin (Euro-Par, 2009)

Computing alignment plots efficiently. - Peter Krusche; Alexander Tiskin (PARCO, 2009)

Parallel Longest Increasing Subsequences in Scalable Time and Memory. - Peter Krusche; Alexander Tiskin (PPAM (1), 2009)

String comparison by transposition networks - Peter Krusche; Alexander Tiskin (CoRR, 2009)

Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. - Vladimir G. Deineko; Alexander Tiskin (Electron. Notes Discret. Math., 2009)

Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? - Vladimir G. Deineko; Alexander Tiskin (ACM J. Exp. Algorithmics, 2009)

Parallel Selection by Regular Sampling. - Alexander Tiskin (Euro-Par (2), 2010)

New algorithms for efficient parallel string comparison. - Peter Krusche; Alexander Tiskin (SPAA, 2010)

Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. - Nicholas Korpelainen; Vadim V. Lozin; Alexander Tiskin (TAMC, 2010)

Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition. - Alexander Tiskin (CSR, 2011)

Boundary properties of graphs for algorithmic graph problems. - Nicholas Korpelainen; Vadim V. Lozin; Dmitriy S. Malyshev; Alexander Tiskin (Theor. Comput. Sci., 2011)

BSP (Bulk Synchronous Parallelism). - Alexander Tiskin (Encyclopedia of Parallel Computing, 2011)

Approximate string matching as an algebraic computation. - Alexander Tiskin (Adv. Math. Commun., 2012)

Efficient high-similarity string comparison: the waterfall algorithm. - Alexander Tiskin (EDBT/ICDT Workshops, 2013)

Parallel Suffix Array Construction by Accelerated Sampling. - Matthew Felice Pace; Alexander Tiskin (Stringology, 2013)

Threshold Approximate Matching in Grammar-Compressed Strings. - Alexander Tiskin (Stringology, 2014)

Four-point conditions for the TSP: The complete complexity classification. - Vladimir G. Deineko; Bettina Klinz; Alexander Tiskin; Gerhard J. Woeginger (Discret. Optim., 2014)

State-of-the-art in string similarity search and join. - Sebastian Wandelt; Dong Deng 001; Stefan Gerdjikov; Shashwat Mishra; Petar Mitankin; Manish Patil; Enrico Siragusa; Alexander Tiskin; Wei Wang 011; Jiaying Wang; Ulf Leser (SIGMOD Rec., 2014)

Fast Distance Multiplication of Unit-Monge Matrices. - Alexander Tiskin (Algorithmica, 2015)

Bounded-Length Smith-Waterman Alignment. - Alexander Tiskin (WABI, 2019)

Communication vs Synchronisation in Parallel String Comparison. - Alexander Tiskin (SPAA, 2020)

Efficient Parallel Algorithms for String Comparison. - Nikita Mishin; Daniil Berezun; Alexander Tiskin (ICPP, 2021)

Fast RSK Correspondence by Doubling Search. - Alexander Tiskin (ESA, 2022)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes. - Alexander Tiskin (CoRR, 2022)

Doubly-Periodic String Comparison. - Nikita Gaevoy; Boris Zolotov; Alexander Tiskin (CPM, 2025)