Searching for authors named "Tomi Pasanen" – sorted by Relevance.
-
Elementary average case analysis of Floyd's algorithms to construct heaps
- Elementary average case analysis of Floyd's algorithms to construct heaps Tomi Pasanen Electronic
- Add To MetaCart
-
Stable Minimum Space Partitioning in Linear Time
- Stable minimum space partitioning in linear time Jyrki Katajainen 1 and Tomi Pasanen 2 Abstract
- Cited by 14 (4 self) – Add To MetaCart
-
Asymptotically Efficient in-Place Merging
- jyrki@(email omitted); Tomi Pasanen Turku Centre for Computer Science, Lemminkaisenkatu 14A, FIN-20520 Turku
- Cited by 13 (3 self) – Add To MetaCart
-
Practical In-Place Mergesort
- : jyrki@(email omitted); TOMI PASANEN y Turku Centre for Computer Science, Lemminkaisenkatu 14A, FIN-20520 Turku
- Cited by 7 (3 self) – Add To MetaCart
-
In-Place Sorting With Fewer Moves
- of Copenhagen Universitetsparken 1, DK-2100 Copenhagen East, Denmark TOMI A. PASANEN Turku Centre for Computer
- Cited by 8 (4 self) – Add To MetaCart
-
In-Place Sorting With Fewer Moves
- of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark Tomi A. Pasanen Turku Centre for Computer
- Add To MetaCart
-
Sorting Multisets Stably in Minimum Space
- Sorting Multisets Stably in Minimum Space ? Jyrki Katajainen 1 and Tomi Pasanen 2 1 Department
- Add To MetaCart

