|
|
Published papers
|
Tetsuo Asano, Amr Elmasry, and Jyrki Katajainen:
Priority queues and sorting for read-only data,
Proceedings of the 10th Annual Conference on Theory and Applications of Models of Computation, Lecture Notes in Computer Science 7876, Springer-Verlag (2013), 32-41. © Springer-Verlag GmbH Berlin Heidelberg
[.pdf]
|
|
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, and Srinivasa Rao Satti:
Selection from read-only memory with limited workspace,
Proceedings of the 19th Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science , Springer-Verlag (2013). © Springer-Verlag GmbH Berlin Heidelberg
[.pdf]
|
|
Amr Elmasry and Jyrki Katajainen:
Branchless search programs,
Proceedings of the 12th International Symposium on Experimental Algorithms, Lecture Notes in Computer Science , Springer-Verlag (2013). © Springer-Verlag GmbH Berlin Heidelberg
[.pdf]
|
|
Jingsen Chen, Stefan Edelkamp, Amr Elmasry, and Jyrki Katajainen:
In-place heap construction with optimized comparisons, moves, and cache misses,
Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 7464, Springer-Verlag (2012), 259-270. © Springer-Verlag
[.pdf]
|
|
Stefan Edelkamp, Amr Elmasry, and Jyrki Katajainen:
A catalogue of algorithms for building weak heaps,
Proceedings of the 23nd International Workshop on Combinatorial Algorithms, Lecture Notes in Computer Science 7643, Springer-Verlag (2012), 249-262. © Springer-Verlag
[.pdf]
|
|
Stefan Edelkamp, Amr Elmasry, and Jyrki Katajainen:
The weak-heap family of priority queues in theory and praxis,
Proceedings of the 18th Computing: The Australasian Theory Symposium, Conferences in Research and Practice in Information Technology 128, Australian Computer Society, Inc. (2012), 103-112. © Australian Computer Society, Inc.
[.pdf]
|
|
Stefan Edelkamp, Amr Elmasry, and Jyrki Katajainen:
The weak-heap data structure: Variants and applications,
Journal of Discrete Algorithms 16 (2012), 187-205 © Elsevier B.V.
[.pdf]
|
|
Amr Elmasry, Jyrki Katajainen, and Max Stenmark:
Branch mispredictions don't affect mergesort,
Proceedings of the 11th International Symposium on Experimental Algorithms, Lecture Notes in Computer Science 7276, Springer-Verlag (2012), 160-171. © Springer-Verlag
[.pdf]
|
|
Amr Elmasry, Jyrki Katajainen, and Jukka Teuhola:
Improved address-calculation coding of integer arrays,
Proceedings of the 19th International Symposium on String Processing and Information Retrieval, Lecture Notes in Computer Science 7608, Springer-Verlag (2012), 205-216. © Springer-Verlag
[.pdf]
|
|
Amr Elmasry and Jyrki Katajainen:
Worst-case optimal priority queues via extended regular counters,
Proceedings of the 7th International Computer Science Symposium in Russia, Lecture Notes in Computer Science 7353, Springer-Verlag (2012), 130-142. © Springer-Verlag
[.pdf]
|
|
Amr Elmasry and Jyrki Katajainen:
Lean programs, branch mispredictions, and sorting,
Proceedings of the 6th International Conference on Fun with Algorithms, Lecture Notes in Computer Science 7288, Springer-Verlag (2012), 119-130. © Springer-Verlag
[.pdf]
|
|
Amr Elmasry and Jyrki Katajainen:
Fat heaps without regular counters,
Proceedings of the 6th Workshop on Algorithms and Computation, Lecture Notes in Computer Science 7157, Springer-Verlag (2012), 173-185. © Springer-Verlag
[.pdf]
|
|
Stefan Edelkamp, Amr Elmasry, and Jyrki Katajainen:
Two constant-factor-optimal realizations of adaptive heapsort,
Proceedings of the 22nd International Workshop on Combinatorial Algorithms, Lecture Notes in Computer Science 7056, Springer-Verlag (2011), 195-208. © Springer-Verlag
[.pdf]
|
|
Amr Elmasry, Claus Jensen, and Jyrki Katajainen:
Two skew-binary numeral systems and one application,
Theory of Computing Systems 50(1) (2011), 185-211. © Springer Science+Business Media, LLC
[.pdf]
|
|
Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, and Jens Rasmussen:
Policy-based benchmarking of weak heaps and their relatives,
Proceedings of the 9th International Symposium on Experimental Algorithms, Lecture Notes in Computer Science 6049, Springer-Verlag (2010), 424-435. © Springer-Verlag
[.pdf]
|
|
Amr Elmasry, Claus Jensen, and Jyrki Katajainen:
Strictly-regular number system and data structures,
Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory, Lecture Notes in Computer Science 6139, Springer-Verlag (2010), 26-37. © Springer-Verlag
[.pdf]
|
|
Amr Elmasry, Claus Jensen, and Jyrki Katajainen:
The magic of a number system,
Proceedings of the 5th International Conference on Fun with Algorithms, Lecture Notes in Computer Science 6099, Springer-Verlag (2010), 156-165. © Springer-Verlag
[.pdf]
|
|
Radu Drăguşin and Paula Petcu:
PyAlg: An algorithm learning platform,
Proceedings of the 5th International Conference on Virtual Learning, Bucharest University Press (2010)
[.pdf] [.doc]
|
|
Jyrki Katajainen and S. Srinivasa Rao:
A compact data structure for representing a dynamic multiset,
Information Processing Letters 110(23) (2010), 1061-1066. © Elsevier B.V.
[.pdf]
|
|
Jyrki Katajainen and Bo Simonsen:
Adaptable component frameworks: Using vector from the C++ standard library as an example,
Proceedings of the 2009 ACM SIGPLAN Workshop on Generic Programming, ACM (2009), 13-24. © ACM
[.pdf] [.ps]
|
|
Amr Elmasry, Claus Jensen, and Jyrki Katajainen:
Two new methods for constructing double-ended priority queues from priority queues,
Computing 83(4) (2008), 193-204 © The Authors
[.pdf] [.ps]
|
|
Amr Elmasry, Claus Jensen, and Jyrki Katajainen:
Multipartite priority queues,
ACM Transactions on Algorithms 5(1) (2008), Article 14. © ACM
[.pdf] [.ps]
|
|
Amr Elmasry, Claus Jensen, and Jyrki Katajainen:
Two-tier relaxed heaps,
Acta Informatica 45(3) (2008), 193-210. © Springer-Verlag
[.pdf] [.ps]
|
|
Amr Elmasry, Claus Jensen, and Jyrki Katajainen:
On the power of structural violations in priority queues,
Proceedings of the 13th Computing: The Australasian Theory Symposium, Conferences in Research and Practice in Information Technology 65, Australian Computer Society, Inc. (2007), 45-53. © Australian Computer Society, Inc.
[.pdf] [.ps]
|
|
Amr Elmasry, Claus Jensen, and Jyrki Katajainen:
Two-tier relaxed heaps,
Proceedings of the 17th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science 4288, Springer-Verlag (2006), 308-317. © Springer-Verlag
[.pdf] [.ps]
|
|
Jyrki Katajainen and Fabio Vitale:
Navigation piles with applications to sorting, priority queues, and priority deques,
Nordic Journal of Computing 10(3) (2003), 238-262. © Publishing Association Nordic Journal of Computing
[.ps]
|
|
Jyrki Katajainen and Jeppe Nejsum Madsen:
Performance tuning an algorithm for compressing relational tables,
Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 2368, Springer-Verlag (2002). © Springer-Verlag
[.ps]
|
|
Jyrki Katajainen and Tomi A. Pasanen:
A randomized in-place algorithm for positioning the k th element in a multiset,
Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 2368, Springer-Verlag (2002). © Springer-Verlag
[.ps]
|
|
Jyrki Katajainen and Bjarke Buur Mortensen:
Experiences with the design and implementation of space-efficient deques,
Proceedings of the 5th Workshop on Algorithm Engineering, Lecture Notes in Computer Science 2141, Springer-Verlag (2001), 39-50. © Springer-Verlag
[.ps]
|
|
