Name
Affiliation
Papers
ALEXANDER TISKIN
University of Warwick Department of Computer Science Coventry CV4 7AL UK
25
Collaborators
Citations 
PageRank 
20
220
15.50
Referers 
Referees 
References 
393
427
387
Search Limit
100427
Title
Citations
PageRank
Year
Communication vs Synchronisation in Parallel String Comparison00.342020
State-of-the-art in string similarity search and join170.652014
Four-point conditions for the TSP: The complete complexity classification.00.342014
Efficient high-similarity string comparison: the waterfall algorithm00.342013
Approximate string matching as an algebraic computation.00.342012
Towards approximate matching in compressed strings: local subsequence recognition60.442011
Boundary properties of graphs for algorithmic graph problems70.552011
Hamiltonian cycles in subcubic graphs: what makes the problem difficult10.372010
New algorithms for efficient parallel string comparison40.382010
Fast Distance Multiplication of Unit-Monge Matrices.110.602010
Parallel selection by regular sampling10.442010
Computing alignment plots efficiently00.342009
Parallel longest increasing subsequences in scalable time and memory30.392009
String comparison by transposition networks30.372009
Periodic String Comparison40.392009
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?30.412009
Semi-local longest common subsequences in subquadratic time190.822008
Packing tripods: Narrowing the density gap10.632007
Fast minimum-weight double-tree shortcutting for metric TSP40.452007
Communication-efficient parallel generic pairwise elimination120.742007
One-Sided monge TSP is NP-Hard10.352006
All semi-local longest common subsequences in subquadratic time60.522006
Longest common subsequences in permutations and maximum cliques in circle graphs70.482006
Efficient longest common subsequence computation using bulk-synchronous parallelism60.442006
Communication lower bounds for distributed-memory matrix multiplication1044.412004