Alexander Tiskin

Available identifiers

zbMath Open tiskin.alexandreMaRDI QIDQ551177

List of research outcomes

Publication	Date of Publication	Type
The Chv\'atal-Sankoff problem: Understanding random string comparison through stochastic processes	2022-12-03	Paper
https://portal.mardi4nfdi.de/entity/Q5091741	2022-07-27	Paper
Fast distance multiplication of unit-Monge matrices	2015-06-25	Paper
Four-point conditions for the TSP: the complete complexity classification	2015-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q5417707	2014-05-22	Paper
Fast minimum-weight double-tree shortcutting for metric TSP	2014-04-01	Paper
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio	2013-07-04	Paper
Boundary properties of graphs for algorithmic graph problems	2011-07-14	Paper
Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition	2011-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q3084802	2011-03-25	Paper
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult	2010-06-17	Paper
Faster subsequence recognition in compressed strings	2010-01-15	Paper
Periodic String Comparison	2009-07-07	Paper
Semi-local longest common subsequences in subquadratic time	2009-02-23	Paper
Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism	2009-02-12	Paper
One-Sided Monge TSP Is NP-Hard	2009-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q3601062	2009-02-09	Paper
Semi-local string comparison: algorithmic techniques and applications	2008-09-08	Paper
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP	2008-01-02	Paper
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs	2007-09-14	Paper
Packing tripods: narrowing the density gap	2007-06-26	Paper
All Semi-local Longest Common Subsequences in Subquadratic Time	2007-05-02	Paper
Communication lower bounds for distributed-memory matrix multiplication	2004-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q4815739	2004-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4813063	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4536966	2002-11-06	Paper
https://portal.mardi4nfdi.de/entity/Q2766836	2002-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q4535018	2002-06-12	Paper
Bulk-synchronous parallel Gaussian elimination	2002-04-14	Paper
Memory-efficient matrix multiplication in the BSP model	2000-09-13	Paper
https://portal.mardi4nfdi.de/entity/Q4938655	2000-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q4219043	1998-11-15	Paper
The bulk-synchronous parallel random access machine	1998-08-13	Paper

Research outcomes over time

This page was built for person: Alexander Tiskin