Alexander Tiskin

Publication Activity (10 Years)

Years Active: 2008-2022
Publications (10 Years): 5

Top Topics

Join Operations

Stochastic Processes

Approximate Matching

Similarity Search

Top Venues

Discret. Optim.

Publications

Alexander Tiskin
Fast RSK Correspondence by Doubling Search. ESA (2022)
Alexander Tiskin
The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes. CoRR (2022)
Nikita Mishin, Daniil Berezun, Alexander Tiskin
Efficient Parallel Algorithms for String Comparison. ICPP (2021)
Alexander Tiskin
Communication vs Synchronisation in Parallel String Comparison. SPAA (2020)
Alexander Tiskin
Bounded-Length Smith-Waterman Alignment. WABI (2019)
Alexander Tiskin
Fast Distance Multiplication of Unit-Monge Matrices. Algorithmica 71 (4) (2015)
Sebastian Wandelt, Dong Deng, Stefan Gerdjikov, Shashwat Mishra, Petar Mitankin, Manish Patil, Enrico Siragusa, Alexander Tiskin, Wei Wang, Jiaying Wang, Ulf Leser
State-of-the-art in string similarity search and join. SIGMOD Rec. 43 (1) (2014)
Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger
Four-point conditions for the TSP: The complete complexity classification. Discret. Optim. 14 (2014)
Alexander Tiskin
Threshold Approximate Matching in Grammar-Compressed Strings. Stringology (2014)
Matthew Felice Pace, Alexander Tiskin
Parallel Suffix Array Construction by Accelerated Sampling CoRR (2013)
Alexander Tiskin
Efficient high-similarity string comparison: the waterfall algorithm. EDBT/ICDT Workshops (2013)
Matthew Felice Pace, Alexander Tiskin
Parallel Suffix Array Construction by Accelerated Sampling. Stringology (2013)
Alexander Tiskin
Approximate string matching as an algebraic computation. Tiny Trans. Comput. Sci. 1 (2012)
Alexander Tiskin
Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition. CSR (2011)
Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin
Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412 (29) (2011)
Alexander Tiskin
Fast Distance Multiplication of Unit-Monge Matrices. SODA (2010)
Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. TAMC (2010)
Peter Krusche, Alexander Tiskin
New algorithms for efficient parallel string comparison. SPAA (2010)
Alexander Tiskin
Parallel Selection by Regular Sampling. Euro-Par (2) (2010)
Alexander Tiskin
Periodic String Comparison. CPM (2009)
Vladimir G. Deineko, Alexander Tiskin
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? ACM J. Exp. Algorithmics 14 (2009)
Peter Krusche, Alexander Tiskin
Computing alignment plots efficiently. PARCO (2009)
Peter Krusche, Alexander Tiskin
Computing alignment plots efficiently CoRR (2009)
Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin
Introduction. Euro-Par (2009)
Peter Krusche, Alexander Tiskin
Parallel Longest Increasing Subsequences in Scalable Time and Memory. PPAM (1) (2009)
Peter Krusche, Alexander Tiskin
String comparison by transposition networks CoRR (2009)
Vladimir G. Deineko, Alexander Tiskin
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. Electron. Notes Discret. Math. 32 (2009)
Alexander Tiskin
Semi-local longest common subsequences in subquadratic time. J. Discrete Algorithms 6 (4) (2008)