Elmasry, A., C. Jensen and J. Katajainen: Strictly-regular number system and data structures. In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, (Eds.) Kaplan, Haim. Lecture Notes in Computer Science. Springer, Berlin (2010) 26-37.
doi: 10.1007/978-3-642-13731-0_4
url: http://dx.doi.org/10.1007/978-3-642-13731-0_4
localid: C1256428004B93B8-FB8E5DF4FC61464AC1257830004AA73E-Elmasry2010b
Elmasry, A., C. Jensen and J. Katajainen: The Magic of a Number System. In: Fun with Algorithms : 5th International Conference, FUN 2010, (Eds.) Boldi, Paolo; Gargano, Luisa. Lecture Notes in Computer Science. Springer, Berlin (2010) 156-165.
doi: 10.1007/978-3-642-13122-6_17
url: http://dx.doi.org/10.1007/978-3-642-13122-6_17
localid: C1256428004B93B8-AB447071D867DFA2C1257830004B1BC1-Elmasry2010c
Elmasry, A., C. Jensen and J. Katajainen: Multipartite Priority Queues. In: ACM Transactions on Algorithms 5, 1, 14.1-19 (2008).
doi: 10.1145/1435375.1435389
url: http://doi.acm.org/10.1145/1435375.1435389
localid: C125756E0038A185-D5DD03E5E5C9CA35C1257560006445AF-Elmasry2008
Brodal, G.S., R. Fagerberg, U. Meyer and N. Zeh: Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings Lecture Notes in Computer Science. Springer, Berlin, Germany (2004) 480-492.
localid: C1256428004B93B8-0A82DCE8EF8974DFC1256F870037AFA0-BFMZ04
Brodal, G.S., R. Fagerberg, U. Meyer and N. Zeh: Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings Lecture Notes in Computer Science. Springer, Berlin, Germany (2004) 480-492.
localid: C1256428004B93B8-0A82DCE8EF8974DFC1256F870037AFA0-BFMZ04
Brodal, G.S. and J. Katajainen: Worst-Case Efficient External-Memory Priority Queues. In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), (Eds.) Arnborg, Stefan; Ivansson, Lars. Lecture Notes in Computer Science. Springer, Berlin, Germany (1998) 107-118.
localid: C1256428004B93B8-AE17AD70BAC468B9C12567020067F566-Brodal1998b
Katajainen, J. and J.L. Träff: A meticulous analysis of mergesort programs. In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), (Eds.) Bongiovanni, Giancarlo; Bovet, Daniel Pierre; Di Battista, Guiseppe. Lecture Notes in Computer Science. Springer, Berlin (1997) 217-228.
localid: C1256428004B93B8-88A537F75569817DC12564C20042218B-Katajainen-Traeff97
Dietzfelbinger, M., T. Hagerup, J. Katajainen and M. Penttonen: A reliable randomized algorithm for the closest-pair problem. In: Journal of Algorithms 25, 1, 19-51 (1997).
localid: C1256428004B93B8-B94D7DB3C4A7825DC12564840050BDED-Hagerup-et-al97
Hagerup, T., J. Katajainen, N. Nishimura and P. Ragde: Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95) asm-Press, New York (1995) 641-649.
localid: C1256428004B93B8-0F6E68AE7F9F5DFAC125645A00476913-Hagerup-et-al-2-95
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.