| Publication | Date of Publication | Type |
|---|
A fast and space-economical algorithm for length-limited coding
| 2023-03-21 | Paper |
In-place calculation of minimum-redundancy codes
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Sorting multisets stably in minimum space
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Worst-case efficient external-memory priority queues
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
In-place linear probing sort
STACS 92 | 2022-08-18 | Paper |
Regular numeral systems for data structures
Acta Informatica | 2022-05-17 | Paper |
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Convex-hull algorithms: implementation, testing, and experimentation
Algorithms | 2019-01-21 | Paper |
Multipartite priority queues
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Bipartite binomial heaps
RAIRO - Theoretical Informatics and Applications | 2018-05-03 | Paper |
A compact data structure for representing a dynamic multiset
Information Processing Letters | 2017-11-03 | Paper |
Optimizing binary heaps
Theory of Computing Systems | 2017-10-20 | Paper |
An in-place priority queue with \(O(1)\) time for push and \(\lg n + O(1)\) comparisons for pop
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Selection from read-only memory with limited workspace
Theoretical Computer Science | 2014-10-06 | Paper |
A catalogue of algorithms for building weak heaps
Lecture Notes in Computer Science | 2014-08-19 | Paper |
Weak heaps engineered
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Weak heaps and friends: recent developments
Lecture Notes in Computer Science | 2014-01-17 | Paper |
In-place binary counters
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Fat heaps without regular counters
Discrete Mathematics, Algorithms and Applications | 2013-09-05 | Paper |
Selection from read-only memory with limited workspace
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Priority queues and sorting for read-only data
Lecture Notes in Computer Science | 2013-05-28 | Paper |
The weak-heap data structure: variants and applications
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Two skew-binary numeral systems and one application
Theory of Computing Systems | 2012-12-06 | Paper |
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Worst-case optimal priority queues via extended regular counters
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Fat heaps without regular counters
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
The Open Graph Archive: a community-driven effort
Graph Drawing | 2012-03-09 | Paper |
Two constant-factor-optimal realizations of adaptive heapsort
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Strictly-regular number system and data structures
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Asymptotically efficient in-place merging
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Two new methods for constructing double-ended priority queues from priority queues
Computing | 2009-09-09 | Paper |
Compressing spatio-temporal trajectories
Computational Geometry | 2009-08-14 | Paper |
Two-tier relaxed heaps
Acta Informatica | 2008-06-17 | Paper |
Compressing Spatio-temporal Trajectories
Algorithms and Computation | 2008-05-27 | Paper |
Two-Tier Relaxed Heaps
Algorithms and Computation | 2008-04-24 | Paper |
Performance engineering case study
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
scientific article; zbMATH DE number 2111732 (Why is no real title available?)
| 2004-10-28 | Paper |
Performance Tuning an Algorithm for Compressing Relational Tables
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
scientific article; zbMATH DE number 2086251 (Why is no real title available?)
| 2004-08-11 | Paper |
Space-efficient planar convex hull algorithms
Theoretical Computer Science | 2004-08-10 | Paper |
scientific article; zbMATH DE number 1857505 (Why is no real title available?)
| 2003-01-29 | Paper |
In-place sorting with fewer moves
Information Processing Letters | 2002-07-25 | Paper |
Asymptotically efficient in-place merging
Theoretical Computer Science | 2000-06-04 | Paper |
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
Journal of Computer and System Sciences | 1999-02-21 | Paper |
scientific article; zbMATH DE number 1444318 (Why is no real title available?)
| 1998-01-01 | Paper |
A Reliable Randomized Algorithm for the Closest-Pair Problem
Journal of Algorithms | 1997-11-25 | Paper |
scientific article; zbMATH DE number 910923 (Why is no real title available?)
| 1996-08-22 | Paper |
Sorting multisets stably in minimum space
Acta Informatica | 1994-11-23 | Paper |
An analysis of the longest match and the greedy heuristics in text encoding
Journal of the ACM | 1994-11-13 | Paper |
scientific article; zbMATH DE number 559227 (Why is no real title available?)
| 1994-05-24 | Paper |
Space-efficient parallel merging
RAIRO - Theoretical Informatics and Applications | 1993-11-15 | Paper |
Stable minimum space partitioning in linear time
BIT | 1993-01-26 | Paper |
scientific article; zbMATH DE number 4775 (Why is no real title available?)
| 1992-06-25 | Paper |
A sublogarithmic convex hull algorithm
BIT | 1990-01-01 | Paper |
TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4155867 (Why is no real title available?)
| 1989-01-01 | Paper |
Fast Simulation of Turing Machines by Random Access Machines
SIAM Journal on Computing | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4062599 (Why is no real title available?)
| 1988-01-01 | Paper |
The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
Computing | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4062598 (Why is no real title available?)
| 1988-01-01 | Paper |
A linear expected-time algorithm for computing planar relative neighbourhood graphs
Information Processing Letters | 1987-01-01 | Paper |
An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
RAIRO - Theoretical Informatics and Applications | 1987-01-01 | Paper |
Computing relative neighbourhood graphs in the plane
Pattern Recognition | 1986-01-01 | Paper |
NP-completeness of the Hamming salesman problem
BIT | 1985-01-01 | Paper |
Notes on the complexity of sorting in abstract machines
BIT | 1985-01-01 | Paper |
An alternative for the implementation of Kruskal's minimal spanning tree algorithm
Science of Computer Programming | 1983-01-01 | Paper |
On the worst case of a minimal spanning tree algorithm for euclidean space
BIT | 1983-01-01 | Paper |
Finding minimal spanning trees in a Euclidean coordinate space
BIT | 1981-01-01 | Paper |
