Alexander Tiskin

Alexandre Tiskin

	2009
34		Alexander Tiskin: Periodic String Comparison. CPM 2009: 193-206
33		Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin: Introduction. Euro-Par 2009: 989
32		Peter Krusche, Alexander Tiskin: String comparison by transposition networks CoRR abs/0903.3579: (2009)
31		Peter Krusche, Alexander Tiskin: Computing alignment plots efficiently CoRR abs/0909.2000: (2009)
30		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)
	2008
29		Alexander Tiskin: Semi-local longest common subsequences in subquadratic time. J. Discrete Algorithms 6(4): 570-581 (2008)
28		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		Vladimir G. Deineko, Alexandre Tiskin: Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. WEA 2007: 136-149
25		Alexandre Tiskin: Faster subsequence recognition in compressed strings CoRR abs/0707.3407: (2007)
24		Alexandre Tiskin: Faster exon assembly by sparse spliced alignment CoRR abs/0707.3409: (2007)
23		Alexandre Tiskin: Semi-local string comparison: algorithmic techniques and applications CoRR abs/0707.3619: (2007)
22		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		Vladimir G. Deineko, Alexandre Tiskin: Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio CoRR abs/0711.2399: (2007)
20		Alexandre Tiskin: Packing tripods: Narrowing the density gap. Discrete Mathematics 307(16): 1973-1981 (2007)
19		Alexandre Tiskin: Communication-efficient parallel generic pairwise elimination. Future Generation Comp. Syst. 23(2): 179-188 (2007)
	2006
18		Alexandre Tiskin: Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. CPM 2006: 270-281
17		Alexandre Tiskin: All Semi-local Longest Common Subsequences in Subquadratic Time. CSR 2006: 352-363
16		Vladimir G. Deineko, Alexandre Tiskin: One-Sided Monge TSP Is NP-Hard. ICCSA (3) 2006: 793-801
15		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		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		Alexandre Tiskin: Communication-Efficient Parallel Gaussian Elimination. PaCT 2003: 369-383
	2002
11		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		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		Alexandre Tiskin: Tripods Do Not Pack Densely. COCOON 2000: 272-280
	1999
6		Alexandre Tiskin: Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices. ICALP 1999: 717-718
5		William F. McColl, Alexandre Tiskin: Memory-Efficient Matrix Multiplication in the BSP Model. Algorithmica 24(3-4): 287-297 (1999)
	1998
4		Alexandre Tiskin: Bulk-Synchronous Parallel Multiplication of Boolean Matrices. ICALP 1998: 494-506
3		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

Coauthor Index

1	Rob H. Bisseling	[33]
2	Vladimir G. Deineko	[16] [21] [22] [26] [30]
3	Alexandros V. Gerbessiotis	[2] [10]
4	Dror Irony	[13]
5	Peter Krusche	[15] [27] [31] [32]
6	Emmanuelle Lebhar	[33]
7	William F. McColl	[5]
8	Andrea Pietracaprina	[33]
9	Constantinos J. Siniolakis	[2] [10]
10	Sivan Toledo	[13]

Colors in the list of coauthors