Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Alexander
    Last name: Tiskin
    DBLP: t/AlexandreTiskin
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 52 of 52  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Alexander Tiskin.
    Fast Distance Multiplication of Unit-Monge Matrices.
    Algorithmica 2015, Volume 71 (0) 2015
    Journal article
    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 Record 2014, Volume 43 (0) 2014
    Conference paper
    Alexander Tiskin.
    Threshold Approximate Matching in Grammar-Compressed Strings.
    Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014 2014 (0) 2014
    Conference paper
    Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger.
    Four-point conditions for the TSP: The complete complexity classification.
    Discrete Optimization 2014, Volume 14 (0) 2014
    Journal article
    Matthew Felice Pace, Alexander Tiskin.
    Parallel Suffix Array Construction by Accelerated Sampling
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Alexander Tiskin.
    Efficient high-similarity string comparison: the waterfall algorithm.
    Joint 2013 EDBT/ICDT Conferences, EDBT/ICDT '13, Genoa, Italy, March 22, 2013, Workshop Proceedings 2013 (0) 2013
    Conference paper
    Matthew Felice Pace, Alexander Tiskin.
    Parallel Suffix Array Construction by Accelerated Sampling.
    Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, September 2-4, 2013 2013 (0) 2013
    Journal article
    Alexander Tiskin.
    Approximate string matching as an algebraic computation.
    TinyToCS 2012, Volume 1 (0) 2012
    Conference paper
    Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin.
    Boundary properties of graphs for algorithmic graph problems.
    Theor. Comput. Sci. 2011, Volume 412 (0) 2011
    Conference paper
    Alexander Tiskin.
    Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition.
    Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings 2011 (0) 2011
    Book chapter
    Alexander Tiskin.
    BSP (Bulk Synchronous Parallelism).
    Encyclopedia of Parallel Computing 2011 (0) 2011
    Conference paper
    Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin.
    Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult.
    Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Peter Krusche, Alexander Tiskin.
    New algorithms for efficient parallel string comparison.
    SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010 2010 (0) 2010
    Conference paper
    Alexander Tiskin.
    Fast Distance Multiplication of Unit-Monge Matrices.
    Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010 (0) 2010
    Conference paper
    Alexander Tiskin.
    Parallel Selection by Regular Sampling.
    Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31 - September 3, 2010, Proceedings, Part II 2010 (0) 2010
    Conference paper
    Peter Krusche, Alexander Tiskin.
    Parallel Longest Increasing Subsequences in Scalable Time and Memory.
    Parallel Processing and Applied Mathematics, 8th International Conference, PPAM 2009, Wroclaw, Poland, September 13-16, 2009. Revised Selected Papers, Part I 2010 (0) 2009
    Conference paper
    Peter Krusche, Alexander Tiskin.
    Computing alignment plots efficiently.
    Parallel Computing: From Multicores and GPU's to Petascale, Proceedings of the conference ParCo 2009, 1-4 September 2009, Lyon, France 2010 (0) 2009
    Conference paper
    Alexander Tiskin.
    Periodic String Comparison.
    Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings 2009 (0) 2009
    Conference paper
    Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin.
    Introduction.
    Euro-Par 2009 Parallel Processing, 15th International Euro-Par Conference, Delft, The Netherlands, August 25-28, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Peter Krusche, Alexander Tiskin.
    String comparison by transposition networks
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Peter Krusche, Alexander Tiskin.
    Computing alignment plots efficiently
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Vladimir G. Deineko, Alexander Tiskin.
    Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio.
    Electronic Notes in Discrete Mathematics 2009, Volume 32 (0) 2009
    Journal article
    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 2009, Volume 14 (0) 2009
    Conference paper
    Alexander Tiskin.
    Semi-local longest common subsequences in subquadratic time.
    J. Discrete Algorithms 2008, Volume 6 (0) 2008
    Conference paper
    Alexander Tiskin.
    Semi-local String Comparison: Algorithmic Techniques and Applications.
    Mathematics in Computer Science 2008, Volume 1 (0) 2008
    Conference paper
    Peter Krusche, Alexander Tiskin.
    Efficient Parallel String Comparison.
    Parallel Computing: Architectures, Algorithms and Applications, ParCo 2007, Forschungszentrum Jülich and RWTH Aachen University, Germany, 4-7 September 2007 2008 (0) 2007
    Conference paper
    Vladimir G. Deineko, Alexander Tiskin.
    Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP.
    Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Alexander Tiskin.
    Faster subsequence recognition in compressed strings
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Alexander Tiskin.
    Faster exon assembly by sparse spliced alignment
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Alexander Tiskin.
    Semi-local string comparison: algorithmic techniques and applications
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Vladimir G. Deineko, Alexander Tiskin.
    Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Vladimir G. Deineko, Alexander Tiskin.
    Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Alexander Tiskin.
    Packing tripods: Narrowing the density gap.
    Discrete Mathematics 2007, Volume 307 (0) 2007
    Conference paper
    Alexander Tiskin.
    Communication-efficient parallel generic pairwise elimination.
    Future Generation Comp. Syst. 2007, Volume 23 (0) 2007
    Conference paper
    Alexander Tiskin.
    Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs.
    Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Alexander Tiskin.
    All Semi-local Longest Common Subsequences in Subquadratic Time.
    Computer Science - Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Vladimir G. Deineko, Alexander Tiskin.
    One-Sided Monge TSP Is NP-Hard.
    Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part III 2006 (0) 2006
    Conference paper
    Peter Krusche, Alexander Tiskin.
    Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism.
    Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part V 2006 (0) 2006
    Conference paper
    Alexander Tiskin.
    Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences.
    Parallel Computing: Current Future Issues of High-End Computing, Proceedings of the International Conference ParCo 2005, 13-16 September 2005, Department of Computer Architecture, University of Malaga, Spain 2005 (0) 2005
    Conference paper
    Dror Irony, Sivan Toledo, Alexander Tiskin.
    Communication lower bounds for distributed-memory matrix multiplication.
    J. Parallel Distrib. Comput. 2004, Volume 64 (0) 2004
    Conference paper
    Alexander Tiskin.
    Communication-Efficient Parallel Gaussian Elimination.
    Parallel Computing Technologies, 7th International Conference, PaCT 2003, Novosibirsk, Russia, September 15-19, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Alexander Tiskin.
    Parallel Convex Hull Computation by Generalised Regular Sampling.
    Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexander Tiskin.
    Parallel Priority Queue and List Contraction: The BSP Approach.
    Computers and Artificial Intelligence 2002, Volume 21 (0) 2002
    Conference paper
    Alexander Tiskin.
    All-Pairs Shortest Paths Computation in the BSP Model.
    Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Alexander Tiskin.
    A New Way to Divide and Conquer.
    Parallel Processing Letters 2001, Volume 11 (0) 2001
    Conference paper
    Alexander Tiskin.
    Tripods Do Not Pack Densely.
    Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings 2000 (0) 2000
    Conference paper
    Alexander Tiskin.
    Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices.
    Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings 1999 (0) 1999
    Conference paper
    William F. McColl, Alexander Tiskin.
    Memory-Efficient Matrix Multiplication in the BSP Model.
    Algorithmica 1999, Volume 24 (0) 1999
    Conference paper
    Alexander Tiskin.
    Bulk-Synchronous Parallel Multiplication of Boolean Matrices.
    Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings 1998 (0) 1998
    Conference paper
    Alexander Tiskin.
    The Bulk-Synchronous Parallel Random Access Machine.
    Theor. Comput. Sci. 1998, Volume 196 (0) 1998
    Conference paper
    Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexander Tiskin.
    Parallel Priority Queue and List Contraction: The BSP Approach.
    Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings 1997 (0) 1997
    Conference paper
    Alexander Tiskin.
    The Bulk-Synchronous Parallel Random Access Machine.
    Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume II 1996 (0) 1996
    Show item 1 to 52 of 52  

    Your query returned 52 matches in the database.