Alexandre Tiskin

ORCID

Publication Activity (10 Years)

Years Active: 1996-2008
Publications (10 Years): 0

University of Oxford, UK (PHD)

Education History

University of Oxford, UK

PHD

Publications

Alexandre Tiskin
Semi-local String Comparison: Algorithmic Techniques and Applications. Math. Comput. Sci. 1 (4) (2008)
Alexandre Tiskin
Semi-local string comparison: algorithmic techniques and applications CoRR (2007)
Vladimir G. Deineko, Alexandre Tiskin
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio CoRR (2007)
Peter Krusche, Alexandre Tiskin
Efficient Parallel String Comparison. PARCO (2007)
Alexandre Tiskin
Packing tripods: Narrowing the density gap. Discret. Math. 307 (16) (2007)
Vladimir G. Deineko, Alexandre Tiskin
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. WEA (2007)
Alexandre Tiskin
Communication-efficient parallel generic pairwise elimination. Future Gener. Comput. Syst. 23 (2) (2007)
Vladimir G. Deineko, Alexandre Tiskin
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? CoRR (2007)
Alexandre Tiskin
Faster exon assembly by sparse spliced alignment CoRR (2007)
Alexandre Tiskin
Faster subsequence recognition in compressed strings CoRR (2007)
Peter Krusche, Alexandre Tiskin
Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism. ICCSA (5) (2006)
Alexandre Tiskin
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. CPM (2006)
Vladimir G. Deineko, Alexandre Tiskin
One-Sided Monge TSP Is NP-Hard. ICCSA (3) (2006)
Alexandre Tiskin
All Semi-local Longest Common Subsequences in Subquadratic Time. CSR (2006)
Alexandre Tiskin
Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences. PARCO (2005)
Dror Irony, Sivan Toledo, Alexandre Tiskin
Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distributed Comput. 64 (9) (2004)
Alexandre Tiskin
Communication-Efficient Parallel Gaussian Elimination. PaCT (2003)
Alexandre Tiskin
Parallel Convex Hull Computation by Generalised Regular Sampling. Euro-Par (2002)
Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexandre Tiskin
Parallel Priority Queue and List Contraction: The BSP Approach. Comput. Artif. Intell. 21 (1) (2002)
Alexandre Tiskin
A New Way to Divide and Conquer. Parallel Process. Lett. 11 (4) (2001)
Alexandre Tiskin
All-Pairs Shortest Paths Computation in the BSP Model. ICALP (2001)
Alexandre Tiskin
Tripods Do Not Pack Densely. COCOON (2000)
Alexandre Tiskin
Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices. ICALP (1999)
William F. McColl, Alexandre Tiskin
Memory-Efficient Matrix Multiplication in the BSP Model. Algorithmica 24 (3-4) (1999)
Alexandre Tiskin
The Bulk-Synchronous Parallel Random Access Machine. Theor. Comput. Sci. 196 (1-2) (1998)
Alexandre Tiskin
Bulk-Synchronous Parallel Multiplication of Boolean Matrices. ICALP (1998)
Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexandre Tiskin
Parallel Priority Queue and List Contraction: The BSP Approach. Euro-Par (1997)
Alexandre Tiskin
The Bulk-Synchronous Parallel Random Access Machine. Euro-Par, Vol. II (1996)

Alexandre Tiskin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Alexandre Tiskin