Alexander Tiskin
Alexander Tiskin
Подтвержден адрес электронной почты в домене
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
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
Semi-local string comparison: Algorithmic techniques and applications
A Tiskin
Mathematics in Computer Science 1 (4), 571-603, 2008
Fast distance multiplication of unit-Monge matrices
A Tiskin
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
Boundary properties of graphs for algorithmic graph problems
N Korpelainen, VV Lozin, DS Malyshev, A Tiskin
Theoretical Computer Science, 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
Semi-local longest common subsequences in subquadratic time
A Tiskin
Journal of Discrete Algorithms 6 (4), 570-581, 2008
Communication-efficient parallel generic pairwise elimination
A Tiskin
Future Generation Computer Systems 23 (2), 179-188, 2007
Bulk-synchronous parallel Gaussian elimination
A Tiskin
Journal of Mathematical Sciences 108 (6), 977-991, 2002
Faster subsequence recognition in compressed strings
A Tiskin
Journal of Mathematical Sciences 158 (5), 759-769, 2009
Efficient longest common subsequence computation using bulk-synchronous parallelism
P Krusche, A Tiskin
Computational Science and Its Applications-ICCSA 2006, 165-174, 2006
Dynamic BSP: towards a flexible approach to parallel computing over the grid
JMR Martin, AV Tiskin
Communicating Process Architectures 2004, 219-226, 2004
New algorithms for efficient parallel string comparison
P Krusche, A Tiskin
Proceedings of the 22nd ACM symposium on Parallelism in algorithms and …, 2010
Towards approximate matching in compressed strings: Local subsequence recognition
A Tiskin
Computer Science–Theory and Applications, 401-414, 2011
Semi-local longest common subsequences and maximum cliques in circle graphs
A Tiskin
Proceedings of CPM2006, Lecture Notes in Computer Science 4009, 271-282, 2006
Longest common subsequences in permutations and maximum cliques in circle graphs
A Tiskin
Combinatorial Pattern Matching, 270-281, 2006
All semi-local longest common subsequences in subquadratic time
A Tiskin
Computer Science–Theory and Applications, 352-363, 2006
BSP modelling a two-tiered parallel architectures
JMR Martin, A Tiskin
WoTUG 99, 47-55, 1999
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
V Deineko, A Tiskin
Journal of Experimental Algorithmics (JEA) 14, 6, 2009
Computing alignment plots efficiently
P Krusche, A Tiskin
Parallel Computing: From Multicores and GPU's to Petascale 19, 158, 2010
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20