Alexander Tiskin

According to our database1, Alexander Tiskin authored at least 53 papers between 1996 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2015
Fast Distance Multiplication of Unit-Monge Matrices.
Algorithmica, 2015

2014
State-of-the-art in string similarity search and join.
SIGMOD Record, 2014

Four-point conditions for the TSP: The complete complexity classification.
Discrete Optimization, 2014

Threshold Approximate Matching in Grammar-Compressed Strings.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

2013
Parallel Suffix Array Construction by Accelerated Sampling
CoRR, 2013

Parallel Suffix Array Construction by Accelerated Sampling.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Efficient high-similarity string comparison: the waterfall algorithm.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012
Approximate string matching as an algebraic computation.
TinyToCS, 2012

2011
BSP (Bulk Synchronous Parallelism).
Proceedings of the Encyclopedia of Parallel Computing, 2011

Boundary properties of graphs for algorithmic graph problems.
Theor. Comput. Sci., 2011

Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition.
Proceedings of the Computer Science - Theory and Applications, 2011

2010
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

New algorithms for efficient parallel string comparison.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Fast Distance Multiplication of Unit-Monge Matrices.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Parallel Selection by Regular Sampling.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?
ACM Journal of Experimental Algorithmics, 2009

Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio.
Electronic Notes in Discrete Mathematics, 2009

Computing alignment plots efficiently
CoRR, 2009

String comparison by transposition networks
CoRR, 2009

Parallel Longest Increasing Subsequences in Scalable Time and Memory.
Proceedings of the Parallel Processing and Applied Mathematics, 2009

Computing alignment plots efficiently.
Proceedings of the Parallel Computing: From Multicores and GPU's to Petascale, 2009

Introduction.
Proceedings of the Euro-Par 2009 Parallel Processing, 2009

Periodic String Comparison.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Semi-local String Comparison: Algorithmic Techniques and Applications.
Mathematics in Computer Science, 2008

Semi-local longest common subsequences in subquadratic time.
J. Discrete Algorithms, 2008

2007
Communication-efficient parallel generic pairwise elimination.
Future Generation Comp. Syst., 2007

Packing tripods: Narrowing the density gap.
Discrete Mathematics, 2007

Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
CoRR, 2007

Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
CoRR, 2007

Semi-local string comparison: algorithmic techniques and applications
CoRR, 2007

Faster exon assembly by sparse spliced alignment
CoRR, 2007

Faster subsequence recognition in compressed strings
CoRR, 2007

Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Efficient Parallel String Comparison.
Proceedings of the Parallel Computing: Architectures, 2007

2006
Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism.
Proceedings of the Computational Science and Its Applications, 2006

One-Sided Monge TSP Is NP-Hard.
Proceedings of the Computational Science and Its Applications, 2006

All Semi-local Longest Common Subsequences in Subquadratic Time.
Proceedings of the Computer Science, 2006

Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences.
Proceedings of the Parallel Computing: Current & Future Issues of High-End Computing, 2005

2004
Communication lower bounds for distributed-memory matrix multiplication.
J. Parallel Distrib. Comput., 2004

2003
Communication-Efficient Parallel Gaussian Elimination.
Proceedings of the Parallel Computing Technologies, 2003

2002
Parallel Priority Queue and List Contraction: The BSP Approach.
Computers and Artificial Intelligence, 2002

Parallel Convex Hull Computation by Generalised Regular Sampling.
Proceedings of the Euro-Par 2002, 2002

2001
A New Way to Divide and Conquer.
Parallel Processing Letters, 2001

All-Pairs Shortest Paths Computation in the BSP Model.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Tripods Do Not Pack Densely.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Memory-Efficient Matrix Multiplication in the BSP Model.
Algorithmica, 1999

Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices.
Proceedings of the Automata, 1999

1998
The design and analysis of bulk-synchronous parallel algorithms.
PhD thesis, 1998

The Bulk-Synchronous Parallel Random Access Machine.
Theor. Comput. Sci., 1998

Bulk-Synchronous Parallel Multiplication of Boolean Matrices.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Parallel Priority Queue and List Contraction: The BSP Approach.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
The Bulk-Synchronous Parallel Random Access Machine.
Proceedings of the Euro-Par '96 Parallel Processing, 1996


  Loading...