Jyrki Katajainen

According to our database1, Jyrki Katajainen
  • authored at least 91 papers between 1981 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
All-in-one implementation framework for binary heaps.
Softw., Pract. Exper., 2017

Optimizing Binary Heaps.
Theory Comput. Syst., 2017

Heap Construction - 50 Years Later.
Comput. J., 2017

2016
Editorial, SEA 2014 Special Issue.
ACM Journal of Experimental Algorithmics, 2016

Worst-Case-Efficient Dynamic Arrays in Practice.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

2015
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls.
CoRR, 2015

An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
Selection from read-only memory with limited workspace.
Theor. Comput. Sci., 2014

Selection from read-only memory with limited workspace.
CoRR, 2014

Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps.
CoRR, 2014

2013
Weak heaps engineered.
J. Discrete Algorithms, 2013

Fat Heaps without Regular Counters.
Discrete Math., Alg. and Appl., 2013

Branchless Search Programs.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Priority Queues and Sorting for Read-Only Data.
Proceedings of the Theory and Applications of Models of Computation, 2013

In-Place Binary Counters.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Weak Heaps and Friends: Recent Developments.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Selection from Read-Only Memory with Limited Workspace.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Two Skew-Binary Numeral Systems and One Application.
Theory Comput. Syst., 2012

The weak-heap data structure: Variants and applications.
J. Discrete Algorithms, 2012

Branch Mispredictions Don't Affect Mergesort.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Fat Heaps without Regular Counters.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Improved Address-Calculation Coding of Integer Arrays.
Proceedings of the String Processing and Information Retrieval, 2012

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

A Catalogue of Algorithms for Building Weak Heaps.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Lean Programs, Branch Mispredictions, and Sorting.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Worst-Case Optimal Priority Queues via Extended Regular Counters.
Proceedings of the Computer Science - Theory and Applications, 2012

The Weak-Heap Family of Priority Queues in Theory and Praxis.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011
Worst-Case Optimal Priority Queues via Extended Regular Counters
CoRR, 2011

The Open Graph Archive: A Community-Driven Effort
CoRR, 2011

Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

The Open Graph Archive: A Community-Driven Effort.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
A compact data structure for representing a dynamic multiset.
Inf. Process. Lett., 2010

Policy-Based Benchmarking of Weak Heaps and Their Relatives, .
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Strictly-Regular Number System and Data Structures.
Proceedings of the Algorithm Theory, 2010

The Magic of a Number System.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009
Compressing spatio-temporal trajectories.
Comput. Geom., 2009

Adaptable component frameworks: using vector from the C++ standard library as an example.
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming, 2009

2008
Multipartite priority queues.
ACM Trans. Algorithms, 2008

Two new methods for constructing double-ended priority queues from priority queues.
Computing, 2008

Two-tier relaxed heaps.
Acta Inf., 2008

2007
Compressing Spatio-temporal Trajectories.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

On the Power of Structural Violations in Priority Queues.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006
Two-Tier Relaxed Heaps.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2004
Space-efficient planar convex hull algorithms.
Theor. Comput. Sci., 2004

2003
Navigation Piles with Applications to Sorting, Priority Queues, and Priority Deques.
Nord. J. Comput., 2003

2002
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset.
Proceedings of the Algorithm Theory, 2002

Performance Tuning an Algorithm for Compressing Relational Tables.
Proceedings of the Algorithm Theory, 2002

In-Place Planar Convex Hull Algorithms.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Experiences with the Design and Implementation of Space-Efficient Deques.
Proceedings of the Algorithm Engineering, 2001

2000
Asymptotically efficient in-place merging.
Theor. Comput. Sci., 2000

Performance Engineering Case Study: Heap Construction.
ACM Journal of Experimental Algorithmics, 2000

Interchanging Two Segments of an Array in a Hierarchical Memory System.
Proceedings of the Algorithm Engineering, 2000

1999
Heaps and Heapsort on Secondary Storage.
Theor. Comput. Sci., 1999

In-Place Sorting with Fewer Moves.
Inf. Process. Lett., 1999

Performance Engineering Case Study: Heap Construction.
Proceedings of the Algorithm Engineering, 1999

1998
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth.
J. Comput. Syst. Sci., 1998

Worst-Case External-Memory Priority Queues.
Proceedings of the Algorithm Theory, 1998

The Ultimate Heapsort.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
A Reliable Randomized Algorithm for the Closest-Pair Problem.
J. Algorithms, 1997

A Meticulous Analysis of Mergesort Programs.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
Practical In-Place Mergesort.
Nord. J. Comput., 1996

1995
In-Place Calculation of Minimum-Redundancy Codes.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Asymptotically Efficient In-Place Merging.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

A Fast and Space - Economical Algorithm for Length - Limited Coding.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Space-Efficient Construction of Optimal Prefix Codes.
Proceedings of the IEEE Data Compression Conference, 1995

1994
Sorting Multisets Stably in Minimum Space.
Acta Inf., 1994

1993
Space-Efficient Parallel Merging.
ITA, 1993

1992
An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding.
J. ACM, 1992

Stable Minimum Space Partitioning in Linear Time.
BIT, 1992

Sorting Multisets Stably in Minimum Space.
Proceedings of the Algorithm Theory, 1992

In-place Linear Probing Sort.
Proceedings of the STACS 92, 1992

Space-Efficient Parallel Merging.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

1991
Comparison of algorithms for standard median filtering.
IEEE Trans. Signal Processing, 1991

1990
Tree Compression and Optimization with Applications.
Int. J. Found. Comput. Sci., 1990

A note on the complexity of trie compaction.
Bulletin of the EATCS, 1990

A Sublogarithmic Convex Hull Algorithm.
BIT, 1990

1989
An Approximation Algorithm for Space-Optimal Encoding of a Text.
Comput. J., 1989

Local Insertion Sort Revisited.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1988
Fast Simulation of Turing Machines by Random Access Machines.
SIAM J. Comput., 1988

The region approach for computing relative neighbourhood graphs in the Lp metric.
Computing, 1988

An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams.
Proceedings of the SWAT 88, 1988

1987
An Almost Naive Algorithm for Finding Relative Neighbourhood Graphs in Lp Metrics.
ITA, 1987

A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs.
Inf. Process. Lett., 1987

1986
Syntax-directed Compression of Program Files.
Softw., Pract. Exper., 1986

Computing relative neighbourhood graphs in the plane.
Pattern Recognition, 1986

1985
Notes on the Complexity of Sorting in Abstract Machines.
BIT, 1985

1983
An Alternative for the Implementation of Kruskal's Minimal Spanning Tree Algorithm.
Sci. Comput. Program., 1983

On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space.
BIT, 1983

1982
Experiments with a Closest Point Algorithm in Hamming Space.
Angewandte Informatik, 1982

1981
Finding Minimal Spanning Trees in a Euclidean Coordinate Space.
BIT, 1981


  Loading...