default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Tiskin
Person information
- affiliation: University of Warwick, Coventry, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c31]Alexander Tiskin:
Fast RSK Correspondence by Doubling Search. ESA 2022: 86:1-86:10- [i10]Alexander Tiskin:
The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes. CoRR abs/2212.01582 (2022) - 2021
- [c30]Nikita Mishin, Daniil Berezun, Alexander Tiskin:
Efficient Parallel Algorithms for String Comparison. ICPP 2021: 50:1-50:10 - 2020
- [c29]Alexander Tiskin
:
Communication vs Synchronisation in Parallel String Comparison. SPAA 2020: 479-489
2010 – 2019
- 2019
- [c28]Alexander Tiskin:
Bounded-Length Smith-Waterman Alignment. WABI 2019: 16:1-16:12 - 2015
- [j15]Alexander Tiskin:
Fast Distance Multiplication of Unit-Monge Matrices. Algorithmica 71(4): 859-888 (2015) - 2014
- [j14]Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger:
Four-point conditions for the TSP: The complete complexity classification. Discret. Optim. 14: 147-159 (2014) - [j13]Sebastian Wandelt, Dong Deng, Stefan Gerdjikov, Shashwat Mishra, Petar Mitankin, Manish Patil, Enrico Siragusa, Alexander Tiskin, Wei Wang, Jiaying Wang, Ulf Leser:
State-of-the-art in string similarity search and join. SIGMOD Rec. 43(1): 64-76 (2014) - [c27]Alexander Tiskin:
Threshold Approximate Matching in Grammar-Compressed Strings. Stringology 2014: 124-138 - 2013
- [c26]Alexander Tiskin:
Efficient high-similarity string comparison: the waterfall algorithm. EDBT/ICDT Workshops 2013: 358-365 - [c25]Matthew Felice Pace, Alexander Tiskin:
Parallel Suffix Array Construction by Accelerated Sampling. Stringology 2013: 142-156 - [i9]Matthew Felice Pace, Alexander Tiskin:
Parallel Suffix Array Construction by Accelerated Sampling. CoRR abs/1302.5851 (2013) - 2012
- [i8]Alexander Tiskin:
Approximate string matching as an algebraic computation. Tiny Trans. Comput. Sci. 1 (2012) - 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]Alexander Tiskin:
Parallel Selection by Regular Sampling. Euro-Par (2) 2010: 393-399 - [c22]Alexander Tiskin:
Fast Distance Multiplication of Unit-Monge Matrices. SODA 2010: 1287-1296 - [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. Electron. Notes Discret. Math. 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 J. Exp. Algorithmics 14 (2009) - [c19]Alexander Tiskin:
Periodic String Comparison. CPM 2009: 193-206 - [c18]Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin:
Introduction. Euro-Par 2009: 989 - [c17]Peter Krusche, Alexander Tiskin:
Computing alignment plots efficiently. PARCO 2009: 158-165 - [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]Peter Krusche, Alexander Tiskin:
Computing alignment plots efficiently. CoRR abs/0909.2000 (2009) - 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. Math. Comput. Sci. 1(4): 571-603 (2008) - 2007
- [j7]Alexandre Tiskin:
Packing tripods: Narrowing the density gap. Discret. Math. 307(16): 1973-1981 (2007) - [j6]Alexandre Tiskin:
Communication-efficient parallel generic pairwise elimination. Future Gener. Comput. Syst. 23(2): 179-188 (2007) - [c15]Peter Krusche, Alexandre Tiskin:
Efficient Parallel String Comparison. PARCO 2007: 193-200 - [c14]Vladimir G. Deineko, Alexandre Tiskin:
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. WEA 2007: 136-149 - [i5]Alexandre Tiskin:
Faster subsequence recognition in compressed strings. CoRR abs/0707.3407 (2007) - [i4]Alexandre Tiskin:
Faster exon assembly by sparse spliced alignment. CoRR abs/0707.3409 (2007) - [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]Vladimir G. Deineko, Alexandre Tiskin:
One-Sided Monge TSP Is NP-Hard. ICCSA (3) 2006: 793-801 - 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 Distributed Comput. 64(9): 1017-1026 (2004) - 2003
- [c8]Alexandre Tiskin:
Communication-Efficient Parallel Gaussian Elimination. PaCT 2003: 369-383 - 2002
- [j4]Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexandre Tiskin:
Parallel Priority Queue and List Contraction: The BSP Approach. Comput. Artif. Intell. 21(1): 59-90 (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 Process. Lett. 11(4): 409-422 (2001) - [c6]Alexandre Tiskin:
All-Pairs Shortest Paths Computation in the BSP Model. ICALP 2001: 178-189 - 2000
- [c5]Alexandre Tiskin:
Tripods Do Not Pack Densely. COCOON 2000: 272-280
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
- [b1]Alexandre Tiskin:
The design and analysis of bulk-synchronous parallel algorithms. University of Oxford, UK, 1998 - [j1]Alexandre Tiskin:
The Bulk-Synchronous Parallel Random Access Machine. Theor. Comput. Sci. 196(1-2): 109-130 (1998) - [c3]Alexandre Tiskin:
Bulk-Synchronous Parallel Multiplication of Boolean Matrices. ICALP 1998: 494-506 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
