Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Alexander Tiskin - MaRDI portal

Alexander Tiskin

From MaRDI portal
(Redirected from Person:238795)
Person:551177

Available identifiers

zbMath Open tiskin.alexandreMaRDI QIDQ551177

List of research outcomes

PublicationDate of PublicationType
The Chv\'atal-Sankoff problem: Understanding random string comparison through stochastic processes2022-12-03Paper
https://portal.mardi4nfdi.de/entity/Q50917412022-07-27Paper
Fast distance multiplication of unit-Monge matrices2015-06-25Paper
Four-point conditions for the TSP: the complete complexity classification2015-04-09Paper
https://portal.mardi4nfdi.de/entity/Q54177072014-05-22Paper
Fast minimum-weight double-tree shortcutting for metric TSP2014-04-01Paper
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio2013-07-04Paper
Boundary properties of graphs for algorithmic graph problems2011-07-14Paper
Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition2011-06-17Paper
https://portal.mardi4nfdi.de/entity/Q30848022011-03-25Paper
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult2010-06-17Paper
Faster subsequence recognition in compressed strings2010-01-15Paper
Periodic String Comparison2009-07-07Paper
Semi-local longest common subsequences in subquadratic time2009-02-23Paper
Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism2009-02-12Paper
One-Sided Monge TSP Is NP-Hard2009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q36010622009-02-09Paper
Semi-local string comparison: algorithmic techniques and applications2008-09-08Paper
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP2008-01-02Paper
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs2007-09-14Paper
Packing tripods: narrowing the density gap2007-06-26Paper
All Semi-local Longest Common Subsequences in Subquadratic Time2007-05-02Paper
Communication lower bounds for distributed-memory matrix multiplication2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q48157392004-09-07Paper
https://portal.mardi4nfdi.de/entity/Q48130632004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q45369662002-11-06Paper
https://portal.mardi4nfdi.de/entity/Q27668362002-07-22Paper
https://portal.mardi4nfdi.de/entity/Q45350182002-06-12Paper
Bulk-synchronous parallel Gaussian elimination2002-04-14Paper
Memory-efficient matrix multiplication in the BSP model2000-09-13Paper
https://portal.mardi4nfdi.de/entity/Q49386552000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42190431998-11-15Paper
The bulk-synchronous parallel random access machine1998-08-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Alexander Tiskin