| 2009 |
|---|
| 30 | EE | Peter Krusche,
Alexander Tiskin:
String comparison by transposition networks
CoRR abs/0903.3579: (2009) |
| 2008 |
|---|
| 29 | EE | Alexander Tiskin:
Semi-local longest common subsequences in subquadratic time.
J. Discrete Algorithms 6(4): 570-581 (2008) |
| 28 | EE | Alexandre Tiskin:
Semi-local String Comparison: Algorithmic Techniques and Applications.
Mathematics in Computer Science 1(4): 571-603 (2008) |
| 2007 |
|---|
| 27 | | Peter Krusche,
Alexandre Tiskin:
Efficient Parallel String Comparison.
PARCO 2007: 193-200 |
| 26 | EE | Vladimir G. Deineko,
Alexandre Tiskin:
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP.
WEA 2007: 136-149 |
| 25 | EE | Alexandre Tiskin:
Faster subsequence recognition in compressed strings
CoRR abs/0707.3407: (2007) |
| 24 | EE | Alexandre Tiskin:
Faster exon assembly by sparse spliced alignment
CoRR abs/0707.3409: (2007) |
| 23 | EE | Alexandre Tiskin:
Semi-local string comparison: algorithmic techniques and applications
CoRR abs/0707.3619: (2007) |
| 22 | EE | Vladimir G. Deineko,
Alexandre Tiskin:
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
CoRR abs/0710.0318: (2007) |
| 21 | EE | Vladimir G. Deineko,
Alexandre Tiskin:
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
CoRR abs/0711.2399: (2007) |
| 20 | EE | Alexandre Tiskin:
Packing tripods: Narrowing the density gap.
Discrete Mathematics 307(16): 1973-1981 (2007) |
| 19 | EE | Alexandre Tiskin:
Communication-efficient parallel generic pairwise elimination.
Future Generation Comp. Syst. 23(2): 179-188 (2007) |
| 2006 |
|---|
| 18 | EE | Alexandre Tiskin:
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs.
CPM 2006: 270-281 |
| 17 | EE | Alexandre Tiskin:
All Semi-local Longest Common Subsequences in Subquadratic Time.
CSR 2006: 352-363 |
| 16 | EE | Vladimir G. Deineko,
Alexandre Tiskin:
One-Sided Monge TSP Is NP-Hard.
ICCSA (3) 2006: 793-801 |
| 15 | EE | Peter Krusche,
Alexandre Tiskin:
Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism.
ICCSA (5) 2006: 165-174 |
| 2005 |
|---|
| 14 | | Alexandre Tiskin:
Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences.
PARCO 2005: 827-834 |
| 2004 |
|---|
| 13 | EE | Dror Irony,
Sivan Toledo,
Alexandre Tiskin:
Communication lower bounds for distributed-memory matrix multiplication.
J. Parallel Distrib. Comput. 64(9): 1017-1026 (2004) |
| 2003 |
|---|
| 12 | EE | Alexandre Tiskin:
Communication-Efficient Parallel Gaussian Elimination.
PaCT 2003: 369-383 |
| 2002 |
|---|
| 11 | EE | Alexandre Tiskin:
Parallel Convex Hull Computation by Generalised Regular Sampling.
Euro-Par 2002: 392-399 |
| 10 | | Alexandros V. Gerbessiotis,
Constantinos J. Siniolakis,
Alexandre Tiskin:
Parallel Priority Queue and List Contraction: The BSP Approach.
Computers and Artificial Intelligence 21(1): (2002) |
| 2001 |
|---|
| 9 | EE | Alexandre Tiskin:
All-Pairs Shortest Paths Computation in the BSP Model.
ICALP 2001: 178-189 |
| 8 | | Alexandre Tiskin:
A New Way to Divide and Conquer.
Parallel Processing Letters 11(4): 409-422 (2001) |
| 2000 |
|---|
| 7 | EE | Alexandre Tiskin:
Tripods Do Not Pack Densely.
COCOON 2000: 272-280 |
| 1999 |
|---|
| 6 | EE | Alexandre Tiskin:
Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices.
ICALP 1999: 717-718 |
| 5 | EE | William F. McColl,
Alexandre Tiskin:
Memory-Efficient Matrix Multiplication in the BSP Model.
Algorithmica 24(3-4): 287-297 (1999) |
| 1998 |
|---|
| 4 | EE | Alexandre Tiskin:
Bulk-Synchronous Parallel Multiplication of Boolean Matrices.
ICALP 1998: 494-506 |
| 3 | EE | Alexandre Tiskin:
The Bulk-Synchronous Parallel Random Access Machine.
Theor. Comput. Sci. 196(1-2): 109-130 (1998) |
| 1997 |
|---|
| 2 | | Alexandros V. Gerbessiotis,
Constantinos J. Siniolakis,
Alexandre Tiskin:
Parallel Priority Queue and List Contraction: The BSP Approach.
Euro-Par 1997: 409-416 |
| 1996 |
|---|
| 1 | | Alexandre Tiskin:
The Bulk-Synchronous Parallel Random Access Machine.
Euro-Par, Vol. II 1996: 327-338 |
