| Practical in-place mergesort J Katajainen, T Pasanen, J Teuhola Nord. J. Comput. 3 (1), 27-40, 1996 | 98 | 1996 |
| Asymptotically efficient in-place merging V Geffert, J Katajainen, T Pasanen Theoretical Computer Science 237 (1-2), 159-181, 2000 | 73 | 2000 |
| Creativity and intrinsic motivation in computer science education: experimenting with robots M Apiola, M Lattu, TA Pasanen Proceedings of the fifteenth annual conference on Innovation and technology …, 2010 | 61 | 2010 |
| Stable minimum space partitioning in linear time J Katajainen, T Pasanen BIT Numerical Mathematics 32, 580-585, 1992 | 42 | 1992 |
| In-place sorting with fewer moves J Katajainen, TA Pasanen Information Processing Letters 70 (1), 31-37, 1999 | 36 | 1999 |
| Creativity-Supporting Learning Environment---CSLE M Apiola, M Lattu, TA Pasanen ACM Transactions on Computing Education (TOCE) 12 (3), 1-25, 2012 | 31 | 2012 |
| Sorting multisets stably in minimum space J Katajainen, T Pasanen Acta Informatica 31, 301-313, 1994 | 29 | 1994 |
| Why using robots to teach computer science can be successful theoretical reflection to andragogy and minimalism MI Koski, J Kurhila, TA Pasanen Proceedings of the 8th International Conference on Computing Education …, 2008 | 23 | 2008 |
| Sorting multisets stably in minimum space J Katajainen, T Pasanen Acta Informatica 31, 301-313, 1994 | 20 | 1994 |
| Framework for evaluating believability of non-player characters in games T Hinkkanen, J Kurhila, TA Pasanen AI and Machine Consciousness, 2008 | 9 | 2008 |
| In-place algorithms for sorting problems T Pasanen ACM SIGACT News 30 (2), 61-61, 1999 | 7 | 1999 |
| Students' working strategies and outcomes in a creativity-supporting learning environment M Apiola, M Lattu, TA Pasanen 2010 IEEE Frontiers in Education Conference (FIE), F4F-1-F4F-7, 2010 | 4 | 2010 |
| Top-down not-up heapsort J Katajainen, T Pasanen, J Tehuola Proc. of The Algorithm Day in Copenhagen, Dept. of Comp. Sci., University of …, 1997 | 4 | 1997 |
| Random binary search tree with equal elements TA Pasanen Theoretical computer science 411 (43), 3867-3872, 2010 | 3 | 2010 |
| Elementary average case analysis of Floyd''s algorithms to construct heaps T Pasanen Turku Centre for Computer Science, 1996 | 3 | 1996 |
| Towards a framework for designing and analyzing CS learning environments M Apiola, M Tedre, M Lattu, TA Pasanen 2012 Frontiers in Education Conference Proceedings, 1-6, 2012 | 1 | 2012 |
| Framework for evaluating believability of non-player T Hinkkanen, J Kurhila, TA Pasanen | 1 | 2008 |
| Game theoretic methods for action games I Puustinen, TA Pasanen Proceedings of the Ninth Scandinavian Conference on Artificial Intelligence …, 2006 | 1 | 2006 |
| Four Years of IT Program Development in Tanzania M Tedre, O Josephat, T Pasanen, F Ngumbuke, E Sutinen, D McIntyre IST-Africa 2012, 9-11 May, 2012, Dar es Salaam, Tanzania, 2012 | | 2012 |
| Applying creativity to Teaching in Computer Science: An exploratory learning course with LEGO Mindstorms robots M APIOLA, J Kurhila, M LATTU, TA PASANEN AIED 2009: 14 th International Conference on Artificial Intelligence in …, 2009 | | 2009 |
