National Library of Finland
Open Data and Linked Data Service
Search works, persons, organizations and subjects:
Katajainen, Jyrki
URI:
http://urn.fi/URN:NBN:fi:au:pn:000047062
name
Katajainen, Jyrki
Authored works
A note on the complexity of trie compaction
An implementation of Cheriton-Tarjan's minimal spanning tree algorithm using ordered subsets
Bucketing and filtering in computational geometry
On the relationship between minimum matchings and Delaunay graphs in the L[sub p]-metric
On the worst case of a minimal spanning tree algorithm for Euclidean space
Simulation of turing machines by random access machines in O(T[square root]log S) time
Works contributed to
A minimal spanning tree algorithm for a point set in Euclidean space
Notes on the complexity of sorting in abstract machines
Proceedings of the second Finnish Summer School on Theoretical Computer Science : Parainen, Finland, August 26-29, 1985
Systemoinnin seminaariesitelmät 1984 : [2]
Works about Katajainen, Jyrki
Download this resource as RDF:
Turtle
RDF/XML
N-Triples
JSON-LD
