Tomi Pasanen

According to our database, Tomi Pasanen authored at least 10 papers between 1992 and 2002.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2002

A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset.

Jyrki Katajainen, Tomi Pasanen

Proceedings of the Algorithm Theory, 2002

2000

Asymptotically efficient in-place merging.

Viliam Geffert, Jyrki Katajainen, Tomi Pasanen

Theor. Comput. Sci., 2000

Two exercises.

Jouni Järvinen, Tomi Pasanen

SIGACT News, 2000

1999

In-place algorithms for sorting problems.

Tomi Pasanen

SIGACT News, 1999

In-Place Sorting with Fewer Moves.

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.

Jyrki Katajainen, Tomi Pasanen, George Titan

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

Sorting Multisets Stably in Minimum Space.

Jyrki Katajainen, Tomi Pasanen

Acta Inf., 1994

1992

Stable Minimum Space Partitioning in Linear Time.

Jyrki Katajainen, Tomi Pasanen

BIT, 1992

Sorting Multisets Stably in Minimum Space.

Jyrki Katajainen, Tomi Pasanen

Proceedings of the Algorithm Theory, 1992