Communication lower bounds for distributed-memory matrix multiplication D Irony, S Toledo, A Tiskin Journal of Parallel and Distributed Computing 64 (9), 1017-1026, 2004 | 305 | 2004 |
Semi-local string comparison: Algorithmic techniques and applications A Tiskin Mathematics in Computer Science 1 (4), 571-603, 2008 | 93 | 2008 |
Conserved noncoding sequences highlight shared components of regulatory networks in dicotyledonous plants L Baxter, A Jironkin, R Hickman, J Moore, C Barrington, P Krusche, ... The Plant Cell Online 24 (10), 3949-3965, 2012 | 84 | 2012 |
Fast Distance Multiplication of Unit-Monge Matrices A Tiskin Algorithmica 71, 859-888, 2015 | 76 | 2015 |
The bulk-synchronous parallel random access machine A Tiskin Theoretical Computer Science 196 (1-2), 109-130, 1998 | 64 | 1998 |
State-of-the-art in string similarity search and join S Wandelt, D Deng, S Gerdjikov, S Mishra, P Mitankin, M Patil, E Siragusa, ... ACM Sigmod Record 43 (1), 64-76, 2014 | 52 | 2014 |
All-Pairs Shortest Paths Computation in the BSP Model A Tiskin International Colloquium on Automata, Languages, and Programming 2076, 178-189, 2001 | 40 | 2001 |
Boundary properties of graphs for algorithmic graph problems N Korpelainen, VV Lozin, DS Malyshev, A Tiskin Theoretical Computer Science, 2011 | 38 | 2011 |
Evolutionary analysis of regulatory sequences (EARS) in plants E Picot, P Krusche, A Tiskin, I Carré, S Ott The Plant Journal 64 (1), 165-176, 2010 | 37 | 2010 |
Semi-local longest common subsequences in subquadratic time A Tiskin Journal of Discrete Algorithms 6 (4), 570-581, 2008 | 37 | 2008 |
Communication-efficient parallel generic pairwise elimination A Tiskin Future Generation Computer Systems 23 (2), 179-188, 2007 | 29 | 2007 |
Efficient longest common subsequence computation using bulk-synchronous parallelism P Krusche, A Tiskin Computational Science and Its Applications-ICCSA 2006, 165-174, 2006 | 29 | 2006 |
New algorithms for efficient parallel string comparison P Krusche, A Tiskin Proceedings of the 22nd ACM symposium on Parallelism in algorithms and …, 2010 | 28 | 2010 |
Bulk-synchronous parallel Gaussian elimination A Tiskin Journal of Mathematical Sciences 108 (6), 977-991, 2002 | 28 | 2002 |
Faster subsequence recognition in compressed strings A Tiskin Journal of Mathematical Sciences 158 (5), 759-769, 2009 | 23 | 2009 |
Four-point conditions for the TSP: The complete complexity classification VG Deineko, B Klinz, A Tiskin, GJ Woeginger Discrete optimization 14, 147-159, 2014 | 22 | 2014 |
Dynamic BSP: towards a flexible approach to parallel computing over the grid JMR Martin, AV Tiskin Communicating Process Architectures 2004, 219-226, 2004 | 21 | 2004 |
Towards approximate matching in compressed strings: Local subsequence recognition A Tiskin Computer Science–Theory and Applications, 401-414, 2011 | 18 | 2011 |
Longest common subsequences in permutations and maximum cliques in circle graphs A Tiskin Combinatorial Pattern Matching, 270-281, 2006 | 18 | 2006 |
BSP (Bulk Synchronous Parallelism). A Tiskin Encyclopedia of Parallel Computing, 192-199, 2011 | 17 | 2011 |