Nira Shafrir
From MaRDI portal
Person:834976
Available identifiers
zbMath Open shafrir.niraMaRDI QIDQ834976
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 |
|---|---|---|
| Data structures for mergeable trees | 2014-09-09 | Paper |
| Meldable heaps and boolean union-find | 2010-08-05 | Paper |
| The greedy algorithm for edit distance with moves | 2009-12-18 | Paper |
| The greedy algorithm for shortest superstrings | 2009-08-27 | Paper |
| Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs | 2008-12-21 | Paper |
| Path Minima in Incremental Unrooted Trees | 2008-11-25 | Paper |
| Finding the Position of the k-Mismatch and Approximate Tandem Repeats | 2007-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828911 | 2004-11-29 | Paper |
Research outcomes over time
This page was built for person: Nira Shafrir
