Tomi A. Pasanen

From MaRDI portal
(Redirected from Tomi A. Pasanen)



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!

PublicationDate of PublicationType
Sorting multisets stably in minimum space
Algorithm Theory — SWAT '92
2022-12-09Paper
Random binary search tree with equal elements
Theoretical Computer Science
2010-11-11Paper
Asymptotically efficient in-place merging
Lecture Notes in Computer Science
2010-06-17Paper
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
Algorithm Theory — SWAT 2002
2004-08-12Paper
In-place sorting with fewer moves
Information Processing Letters
2002-07-25Paper
Asymptotically efficient in-place merging
Theoretical Computer Science
2000-06-04Paper
Sorting multisets stably in minimum space
Acta Informatica
1994-11-23Paper
Stable minimum space partitioning in linear time
BIT
1993-01-26Paper


Research outcomes over time


This page was built for person: Tomi A. Pasanen