Trevor I. Dix
From MaRDI portal
Person:294679
Available identifiers
zbMath Open dix.trevor-iMaRDI QIDQ294679
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| A bit-string longest-common-subsequence algorithm | 2021-02-27 | Paper |
| A versatile divide and conquer technique for optimal string alignment | 2016-06-16 | Paper |
| Proximity-based non-uniform abstractions for approximate planning | 2012-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953361 | 2000-05-09 | Paper |
| Compression and approximate matching | 1999-09-22 | Paper |
| A platform for restriction mapping | 1998-01-21 | Paper |
| Shortest path and closure algorithms for banded matrices | 1992-06-28 | Paper |
| Exceptions and interrupts in CSP | 1983-01-01 | Paper |
Research outcomes over time
This page was built for person: Trevor I. Dix
