Alexander Tiskin

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