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 general approach to connected-component labeling for arbitrary image representations Journal of the ACM | 1994-11-27 | Paper |
| A general approach to connected-component labeling for arbitrary image representations Journal of the ACM | 1994-09-29 | Paper |
| Two levels are as good as any Journal of Algorithms | 1985-01-01 | Paper |
| On search by address computation BIT | 1985-01-01 | Paper |
| Analysis of N-trees Information Processing Letters | 1983-01-01 | Paper |
| The extendible cell method for closest point problems BIT | 1982-01-01 | Paper |
| Extendible hashing with overflow Information Processing Letters | 1982-01-01 | Paper |
| Order preserving extendible hashing and bucket tries BIT | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3757684 (Why is no real title available?) | 1981-01-01 | Paper |
Research outcomes over time
This page was built for person: Markku Tamminen
