default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkku Tamminen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1992
[j21]Michael B. Dillencourt, Hanan Samet, Markku Tamminen:
A General Approach to Connected-Component Labelling for Arbitrary Image Representations. J. ACM 39(2): 253-280 (1992)- [j20]Michael B. Dillencourt, Hanan Samet, Markku Tamminen:
Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'. J. ACM 39(4): 985-986 (1992) - 1990
- [j19]Hanan Samet, Markku Tamminen:
Approximating CSG trees of moving objects. Vis. Comput. 6(4): 182-209 (1990)
1980 – 1989
- 1989
- [j18]Vesa Hirvisalo, Jari Arkko, Juha Kuusela, Esko Nuutila, Markku Tamminen:
XE design rationale: Clu revisited. ACM SIGPLAN Notices 24(9): 72-79 (1989) - [c9]M. Bouteldja, Markku Tamminen:
Buidling an Embedded Knowledge-Based Application Using Abstractions. SCAI 1989: 643-656 - 1988
- [j17]Hanan Samet, Markku Tamminen:
Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees. IEEE Trans. Pattern Anal. Mach. Intell. 10(4): 579-586 (1988) - 1987
- [j16]Esko Nuutila, Juha Kuusela, Markku Tamminen, Jukka Veilahti, Jari Arkko, Nassim Bouteldja:
XC - A Language for Embedded Rule Based Systems. ACM SIGPLAN Notices 22(9): 23-32 (1987) - [j15]Wing K. Luk, Paolo Sipala, Markku Tamminen, Donald T. Tang, Lin S. Woo, Chak-Kuen Wong:
A Hierarchical Global Wiring Algorithm for Custom Chip Design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6(4): 518-533 (1987) - 1986
- [j14]Markku Tamminen, Wing K. Luk, Paolo Sipala, Lin S. Woo, C. K. Wong:
Constructing Maximal Slicings from Geometry. Acta Informatica 23(3): 267-288 (1986) - 1985
- [j13]Markku Tamminen:
On Search by Address Computation. BIT 25(1): 135-147 (1985) - [j12]Markku Tamminen, Frederik W. Jansen:
An integrity filter for recursive subdivision meshes. Comput. Graph. 9(4): 351-363 (1985) - [j11]Markku Tamminen:
Two Levels are as Good as Any. J. Algorithms 6(1): 138-144 (1985) - [j10]Hanan Samet, Markku Tamminen:
Computing Geometric Properties of Images Represented by Linear Quadtrees. IEEE Trans. Pattern Anal. Mach. Intell. 7(2): 229-240 (1985) - [j9]Klaus Kronlöf, Markku Tamminen:
A viewing pipeline for discrete solid modeling. Vis. Comput. 1(1): 24-36 (1985) - [c8]Petri Koistinen, Markku Tamminen, Hanan Samet:
Viewing Solid Models by Bintree Conversion. Eurographics 1985 - [c7]Hanan Samet, Markku Tamminen:
Bintrees, CSG trees, and time. SIGGRAPH 1985: 121-130 - 1984
- [j8]Markku Tamminen:
Comment on Quad- and Octtrees. Commun. ACM 27(3): 248-249 (1984) - [j7]Markku Tamminen:
Encoding pixel trees. Comput. Vis. Graph. Image Process. 28(1): 44-57 (1984) - [c6]Hanan Samet, Markku Tamminen:
Experiences with New Image Component Algorithms. Eurographics 1984 - [c5]Markku Tamminen, Hanan Samet:
Efficient octree conversion by connectivity labeling. SIGGRAPH 1984: 43-51 - 1983
- [j6]Markku Tamminen:
Performance analysis of cell based geometric file organizations. Comput. Vis. Graph. Image Process. 24(2): 160-181 (1983) - [j5]Markku Tamminen:
Analysis of N-Trees. Inf. Process. Lett. 16(3): 131-137 (1983) - [c4]Matti Tikkanen, Martti Mäntylä, Markku Tamminen:
A Geometric Data Manager. Eurographics 1983 - [c3]Martti Mäntylä, Markku Tamminen:
Localized set operations for solid modeling. SIGGRAPH 1983: 279-288 - 1982
- [j4]Markku Tamminen:
The Extendible Cell Method for Closest Point Problems. BIT 22(1): 27-41 (1982) - [j3]Markku Tamminen:
Hidden Lines using the EXCELL Method. Comput. Graph. Forum 1(3): 96-105 (1982) - [j2]Markku Tamminen:
Extendible Hashing with Overflow. Inf. Process. Lett. 15(5): 227-232 (1982) - [c2]Markku Tamminen, Reijo Sulonen:
The excell method for efficient geometric access to data. DAC 1982: 345-351 - [c1]Markku Tamminen:
Efficient Spatial Access to a Data Base. SIGMOD Conference 1982: 200-206 - 1981
- [j1]Markku Tamminen:
Order Preserving Extendible Hashing and Bucket Tries. BIT 21(4): 419-435 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
