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 ACM Transactions on Algorithms | 2014-09-09 | Paper |
| Meldable heaps and boolean union-find Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
| The greedy algorithm for edit distance with moves Information Processing Letters | 2009-12-18 | Paper |
| The greedy algorithm for shortest superstrings Information Processing Letters | 2009-08-27 | Paper |
| Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs Journal of the ACM | 2008-12-21 | Paper |
| Path Minima in Incremental Unrooted Trees Algorithms - ESA 2008 | 2008-11-25 | Paper |
| Finding the Position of the k-Mismatch and Approximate Tandem Repeats Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
| scientific article; zbMATH DE number 2119640 (Why is no real title available?) | 2004-11-29 | Paper |
Research outcomes over time
This page was built for person: Nira Shafrir
