Alexandre Tiskin

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