Journal Article

Tiskin, Alexander (2015) Fast distance multiplication of unit-Monge matrices. Algorithmica, 71 (4). pp. 859-888. doi:10.1007/s00453-013-9830-z

Deineko, Vladimir G., Klinz, Bettina, Tiskin, Alexander and Woeginger, Gerhard J. (2014) Four-point conditions for the TSP : the complete complexity classification. Discrete Optimization, Volume 14 . pp. 147-159. doi:10.1016/j.disopt.2014.09.003

Wandelt, Sebastian, Wang, Jiaying, Leser, Ulf, Deng, Dong, Gerdjikov, Stefan, Mishra, Shashwat, Mitankin, Petar, Patil, Manish, Siragusa, Enrico, Tiskin, Alexander and Wang, Wei (2014) State-of-the-art in string similarity search and join. SIGMOD Record, Volume 43 (Number 1). pp. 64-76. doi:10.1145/2627692.2627706

Baxter, Laura, Jironkin, Aleksey, Hickman, R. D. G., Moore, Jonathan D., Barrington, Christopher, Krusche, Peter, Dyer, Nigel, Buchanan-Wollaston, Vicky, Tiskin, Alexander, Beynon, Jim, Denby, Katherine J. and Ott, Sascha (2012) Conserved noncoding sequences highlight shared components of regulatory networks in dicotyledonous plants. The Plant Cell, Vol.24 (No.10). pp. 3949-3965. doi:10.1105/tpc.112.103010

Korpelainen, Nicholas, Lozin, Vadim V., Malyshev, Dmitriy S. and Tiskin, Alexander (2011) Boundary properties of graphs for algorithmic graph problems. Theoretical Computer Science, Vol.412 (No.29). pp. 3545-3554. doi:10.1016/j.tcs.2011.03.001

Picot, Emma, Krusche, Peter, Tiskin, Alexander, Carré, Isabelle A. and Ott, Sascha (2010) Evolutionary analysis of regulatory sequences (EARS) in plants. Plant Journal, Vol.64 (No.1). pp. 165-176. doi:10.1111/j.1365-313X.2010.04314.x

Deineko, Vladimir G. and Tiskin, Alexander (2009) Fast minimum-weight double-tree shortcutting for metric TSP. Journal of Experimental Algorithmics, Vol.14 . 4.6. doi:10.1145/1498698.1594232

Deineko, Vladimir G. and Tiskin, Alexander (2009) Min-weight double-tree shortcutting for metric TSP : bounding the approximation ratio. Electronic Notes in Discrete Mathematics, Volume 32 . pp. 19-26. doi:10.1016/j.endm.2009.02.004

Tiskin, Alexander (2009) Faster Subsequence Recognition in Compressed Strings. Journal of Mathematical Sciences, 158 (5). pp. 759-769. doi:10.1007/s10958-009-9396-0

Tiskin, Alexander (2008) Semi-local longest common subsequences in subquadratic time. Journal of Discrete Algorithms, Volume 6 (Number 4). pp. 570-581. doi:10.1016/j.jda.2008.07.001

Tiskin, Alexander (2008) Semi-local string comparison : algorithmic techniques and applications. Mathematics in Computer Science, Volume 1 (Number 4). pp. 571-603. doi:10.1007/s11786-007-0033-3

Tiskin, Alexander (2007) Packing tripods : narrowing the density gap. Discrete Mathematics, Volume 307 (Number 16). pp. 1973-1981. doi:10.1016/j.disc.2004.12.028

Tiskin, Alexander (2007) Communication-efficient parallel generic pairwise elimination. Future Generation Computer Systems, Volume 23 (Number 2). pp. 179-188. doi:10.1016/j.future.2006.04.017

Ironya, Dror, Sivan, Toledo and Tiskin, Alexander (2004) Communication lower bounds for distributed-memory matrix multiplication. Journal of Parallel and Distributed Computing, Volume 64 (Number 9). pp. 1017-1026. doi:10.1016/j.jpdc.2004.03.021

Martin, J. M. R and Tiskin, Alexander (2004) Dynamic BSP : towards a flexible approach to parallel computing over the grid. Communicating Process Architectures . pp. 219-226.

Tiskin, Alexander (2002) Bulk-synchronous parallel Gaussian elimination. Journal of Mathematical Sciences, Volume 108 (Number 6). pp. 977-991. doi:10.1023/A:1013588221172

Book Item

Tiskin, Alexander (2010) Parallel selection by regular sampling. In: Guarracino, M. R. and Vivien, F. and Traff, J. L. and Cannataro, M. and Danelutto, M. and Hast, A. and Perla, F. and Knüpfer, A. and Di Martino, B. and Alexander, M., (eds.) Euro-Par 2010 - Parallel Processing. Lecture Notes in Computer Science (6272). Germany: Springer Verlag, pp. 393-399. ISBN 9783642152900

Krusche, Peter and Tiskin, Alexander (2010) Computing alignment plots efficiently. In: Chapman, Barbara and Desprez, Frédéric and Joubert, Gerhard R. and Lichnewsky, Alain and Peters, Frans and Priol, Thierry, (eds.) Parallel Computing: From Multicores and GPU's to Petascale. Advances in Parallel Computing, Volume 19 . IOS Press, pp. 158-165. ISBN 9781607505297

Korpelainen, Nicholas, Lozin, Vadim V. and Tiskin, Alexander (2010) Hamiltonian cycles in subcubic graphs : what makes the problem difficult. In: Kratochvil, J and Li, A and Fiala, J and Kolman, P, (eds.) Theory and Applications of Models of Computation. Lecture Notes in Computer Science, Vol.6108 . Springer, pp. 320-327. ISBN 9783642135613

Tiskin, Alexander and Krusche, Peter (2010) Parallel longest increasing subsequences in scalable time and memory. In: Wyrzykowski, Roman and Dongarra, Jack and Karczewski, Konrad and Wasniewski, Jerzy, (eds.) Parallel processing and applied mathematics. Lecture Notes in Computer Science (6067). Germany: Springer Verlag, pp. 176-185. ISBN 9783642143892

Krusche, Peter and Tiskin, Alexander (2009) String comparison by transposition networks. In: London Algorithmics 2008: Theory and Practice. London: College Publications, pp. 184-204. ISBN 9781904987970

Tiskin, Alexander (2009) Periodic string comparison. In: Combinatorial Pattern Matching. Lecture Notes in Computer Science (5577). Springer Verlag, pp. 193-206. ISBN 9783642024405

Krusche, Peter and Tiskin, Alexander (2007) Efficient parallel string comparison. In: Bischof, C. and Bücker, M. and Gibbon, P. and Joubert, G. R. and Lippert, T. and Mohr, B. and Peters, F., (eds.) Parallel Computing: Architectures, Algorithms and Applications. NIC Series, Volume 38 . Julich: John von Neumann-Institut für Computing. ISBN 9783981084344

Deineko, Vladimir G. and Tiskin, Alexander (2007) Fast minimum-weight double-tree shortcutting for metric TSP. In: Demetrescu, C., (ed.) Experimental Algorithms. Lecture Notes in Computer Science, Volume 4525 . Springer Berlin Heidelberg, pp. 136-149. ISBN 9783540728443

Tiskin, Alexander (2006) Efficient representation and parallel computation of string-substring longest common subsequences. In: Joubert, G. R. and Nagel, W. E. and Peters, F. J. and Plata, O. and Tirado, P. and Zapata, E., (eds.) Parallel Computing: Current & Future Issues of High-End Computing,. NIC Series, Volume 33 . John von Neumann Institute for Computing, pp. 827-834. ISBN 3000173528

Tiskin, Alexander (2006) Bulk-synchronous parallelism : an emerging paradigm of high-performance computing. In: Yang, Laurence T. and Guo, Minyi, (eds.) High-Performance Computing: Paradigm and Infrastructure. John Wiley & Sons, Inc., pp. 69-80. ISBN 9780471654711

Tiskin, Alexander (2006) All semi-local longest common subsequences in subquadratic time. In: Grigoriev, D. and Harrison, J. and Hirsch, E. A., (eds.) Computer Science – Theory and Applications. Lecture Notes in Computer Science, Volume 3967 . Springer Berlin Heidelberg, pp. 352-363. ISBN 9783540341666

Krusche, Peter and Tiskin, Alexander (2006) Efficient longest common subsequence computation using bulk-synchronous parallelism. In: Gavrilova, M. and Gervasi, O. and Kumar, V. and Tan, C. J. K. and Taniar, D. and Lagana, A. and Mun, Y. and Choo, H., (eds.) Computational Science and Its Applications - ICCSA 2006. Lecture Notes in Computer Science, Volume 3984 . Springer Berlin Heidelberg, pp. 165-174. ISBN 9783540340799

Tiskin, Alexander (2006) Longest common subsequences in permutations and maximum cliques in circle graphs. In: Lewenstein, M. and Valiente, G., (eds.) Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. Lecture Notes in Computer Science, Volume 4009 . Springer Berlin Heidelberg, pp. 270-281. ISBN 9783540354550

Deineko, Vladimir and Tiskin, Alexander (2006) One-sided monge TSP is NP-Hard. In: Gavrilova, M. and Gervasi, O. and Kumar, V. and Tan, C. J. K. and Taniar, D. and Lagana, A. and Mun, Y. and Choo, H., (eds.) Computational Science and Its Applications - ICCSA 2006. Lecture Notes in Computer Science, Volume 3982 . Springer, pp. 793-801. ISBN 9783540340751

Tiskin, Alexander (2003) Communication-efficient parallel Gaussian elimination. In: Malyshkin, V., (ed.) Parallel Computing Technologies. Lecture Notes in Computer Science, Volume 2763 . Springer Berlin Heidelberg, pp. 369-383. ISBN 3540406735

Tiskin, Alexander (2002) Parallel convex hull computation by generalised regular sampling. In: Monien, B. and Feldmann, R., (eds.) Euro-Par 2002 Parallel Processing. Lecture Notes in Computer Science, Volume 2400 . Springer Berlin Heidelberg, pp. 392-399. ISBN 9783540440499

Conference Item

Tiskin, Alexander (2019) Bounded-length Smith-Waterman alignment. In: 19th International Workshop on Algorithms in Bioinformatics (WABI 2019), Niagara Falls, NY, USA, 8-10 Sep 2019, 143 16:1-16:12. ISBN 9783959771238. ISSN 1868-8969. doi:10.4230/LIPIcs.WABI.2019.16

Tiskin, Alexander (2013) Efficient high-similarity string comparison. In: EDBT '13 Proceedings of the Joint EDBT/ICDT, Genoa, Italy, 18-22 Mar 2013 pp. 358-365. ISBN 9781450315999 . doi:10.1145/2457317.2457384

Krusche, Peter and Tiskin, Alexander (2010) New algorithms for efficient parallel string comparison. In: 22nd ACM Symposium on Parallelism in Algorithms and Architectures, Santorini, Greece, 13-15 Jun 2010. Published in: SPAA '10: Proceedings of the Twenty-Second Annual Symposium on Parallelism in Algorithms and Architectures pp. 209-216. ISBN 9781450300797. doi:10.1145/1810479.1810521

Tiskin, Alexander (2010) Fast distance multiplication of unit-Monge matrices. In: 21st Annual ACM/SIAM Symposium on Discrete Algorithms, Austin, TX, 17-19 Jan 2010. Published in: Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms, Vol.135 pp. 1287-1296. ISBN 9780898716986.

Tiskin, Alexander (2010) Parallel selection by regular sampling. In: 16th International Euro-Par Conference on Parallel Processing, Ischia, Italy, August 31 - September 03 2010 doi:10.1007/978-3-642-15291-7_36

Tiskin, Alexander (2009) Periodic string comparison. In: 20th Annual Symposium on Combinatorial Pattern Matching, Lille, France, June 22-24, 2009. Published in: Lecture Notes in Computer Science, Vol.5577 pp. 193-206. ISBN 978-3-642-02440-5. ISSN 0302-9743. doi:10.1007/978-3-642-02441-2_18

Krusche, Peter and Tiskin, Alexander (2008) Efficient parallel string comparison. In: International Parallel Computing Conference 2007, RWTH Aachen Univ, Aachen, France, 4-7 Sep 2007, Volume 15 pp. 193-200. ISBN 9781586037963. ISSN 0927-5452.