Markku Tamminen
From MaRDI portal
Person:802311
Available identifiers
zbMath Open tamminen.markkuMaRDI QIDQ802311
List of research outcomes
| Publication | Date of Publication | Type |
|---|---|---|
| A general approach to connected-component labeling for arbitrary image representations | 1994-11-27 | Paper |
| A general approach to connected-component labeling for arbitrary image representations | 1994-09-29 | Paper |
| On search by address computation | 1985-01-01 | Paper |
| Two levels are as good as any | 1985-01-01 | Paper |
| Analysis of N-trees | 1983-01-01 | Paper |
| The extendible cell method for closest point problems | 1982-01-01 | Paper |
| Extendible hashing with overflow | 1982-01-01 | Paper |
| Order preserving extendible hashing and bucket tries | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3940826 | 1981-01-01 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
| Property | Value |
|---|---|
| MaRDI profile type | MaRDI person profile |
| instance of | human |
This page was built for person: Markku Tamminen
