Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alexander Tiskin
Alexandre Tiskin
2010 – today
- 2013
[c25]Alexander Tiskin: Efficient high-similarity string comparison: the waterfall algorithm. EDBT/ICDT Workshops 2013: 358-365- [i9]Matthew Felice Pace, Alexander Tiskin: Parallel Suffix Array Construction by Accelerated Sampling. CoRR abs/1302.5851 (2013)
- 2012
- [i8]
- 2011
- [j12]Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin: Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412(29): 3545-3554 (2011)
- [c24]Alexander Tiskin: Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition. CSR 2011: 401-414
- [r1]Alexander Tiskin: BSP (Bulk Synchronous Parallelism). Encyclopedia of Parallel Computing 2011: 192-199
- 2010
- [c23]
- [c22]
- [c21]Peter Krusche, Alexander Tiskin: New algorithms for efficient parallel string comparison. SPAA 2010: 209-216
- [c20]Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin: Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. TAMC 2010: 320-327
2000 – 2009
- 2009
- [j11]Vladimir G. Deineko, Alexander Tiskin: Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. Electronic Notes in Discrete Mathematics 32: 19-26 (2009)
- [j10]Vladimir G. Deineko, Alexander Tiskin: Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? ACM Journal of Experimental Algorithmics 14 (2009)
- [c19]
- [c18]Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin: Introduction. Euro-Par 2009: 989
- [c17]
- [c16]Peter Krusche, Alexander Tiskin: Parallel Longest Increasing Subsequences in Scalable Time and Memory. PPAM (1) 2009: 176-185
- [i7]Peter Krusche, Alexander Tiskin: String comparison by transposition networks. CoRR abs/0903.3579 (2009)
- [i6]
- 2008
- [j9]Alexander Tiskin: Semi-local longest common subsequences in subquadratic time. J. Discrete Algorithms 6(4): 570-581 (2008)
- [j8]Alexandre Tiskin: Semi-local String Comparison: Algorithmic Techniques and Applications. Mathematics in Computer Science 1(4): 571-603 (2008)
- 2007
- [j7]Alexandre Tiskin: Packing tripods: Narrowing the density gap. Discrete Mathematics 307(16): 1973-1981 (2007)
- [j6]Alexandre Tiskin: Communication-efficient parallel generic pairwise elimination. Future Generation Comp. Syst. 23(2): 179-188 (2007)
- [c15]
- [c14]Vladimir G. Deineko, Alexandre Tiskin: Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. WEA 2007: 136-149
- [i5]
- [i4]
- [i3]Alexandre Tiskin: Semi-local string comparison: algorithmic techniques and applications. CoRR abs/0707.3619 (2007)
- [i2]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)
- [i1]Vladimir G. Deineko, Alexandre Tiskin: Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. CoRR abs/0711.2399 (2007)
- 2006
- [c13]Alexandre Tiskin: Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. CPM 2006: 270-281
- [c12]Alexandre Tiskin: All Semi-local Longest Common Subsequences in Subquadratic Time. CSR 2006: 352-363
- [c11]Peter Krusche, Alexandre Tiskin: Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism. ICCSA (5) 2006: 165-174
- [c10]
- 2005
- [c9]Alexandre Tiskin: Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences. PARCO 2005: 827-834
- 2004
- [j5]Dror Irony, Sivan Toledo, Alexandre Tiskin: Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distrib. Comput. 64(9): 1017-1026 (2004)
- 2003
- [c8]
- 2002
- [j4]Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexandre Tiskin: Parallel Priority Queue and List Contraction: The BSP Approach. Computers and Artificial Intelligence 21(1) (2002)
- [c7]Alexandre Tiskin: Parallel Convex Hull Computation by Generalised Regular Sampling. Euro-Par 2002: 392-399
- 2001
- [j3]Alexandre Tiskin: A New Way to Divide and Conquer. Parallel Processing Letters 11(4): 409-422 (2001)
- [c6]
- 2000
- [c5]
1990 – 1999
- 1999
- [j2]William F. McColl, Alexandre Tiskin: Memory-Efficient Matrix Multiplication in the BSP Model. Algorithmica 24(3-4): 287-297 (1999)
- [c4]Alexandre Tiskin: Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices. ICALP 1999: 717-718
- 1998
- [j1]Alexandre Tiskin: The Bulk-Synchronous Parallel Random Access Machine. Theor. Comput. Sci. 196(1-2): 109-130 (1998)
- [c3]
- 1997
- [c2]Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexandre Tiskin: Parallel Priority Queue and List Contraction: The BSP Approach. Euro-Par 1997: 409-416
- 1996
- [c1]Alexandre Tiskin: The Bulk-Synchronous Parallel Random Access Machine. Euro-Par, Vol. II 1996: 327-338
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-27 22:21 CEST by the dblp team