Tomi Pasanen

According to our database1, Tomi Pasanen authored at least 9 papers between 1992 and 2002.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2002
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset.
(DOI)
Jyrki Katajainen
,
Tomi Pasanen
Proceedings of the Algorithm Theory, 2002

2000
Asymptotically efficient in-place merging.
(DOI)
Viliam Geffert
,
Jyrki Katajainen
,
Tomi Pasanen
Theor. Comput. Sci., 2000

Two exercises.
(DOI)
Jouni Järvinen
,
Tomi Pasanen
SIGACT News, 2000

1999
In-place algorithms for sorting problems.
(DOI)
Tomi Pasanen
SIGACT News, 1999

In-Place Sorting with Fewer Moves.
(DOI)
Jyrki Katajainen
,
Tomi Pasanen
Inf. Process. Lett., 1999

1996
Practical In-Place Mergesort.
Jyrki Katajainen
,
Tomi Pasanen
,
Jukka Teuhola
Nord. J. Comput., 1996

1995
Asymptotically Efficient In-Place Merging.
(DOI)
Jyrki Katajainen
,
Tomi Pasanen
,
George Titan
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1992
Stable Minimum Space Partitioning in Linear Time.
Jyrki Katajainen
,
Tomi Pasanen
BIT, 1992

Sorting Multisets Stably in Minimum Space.
(DOI)
Jyrki Katajainen
,
Tomi Pasanen
Proceedings of the Algorithm Theory, 1992


  Loading...