| Publication | Date of Publication | Type |
|---|
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 |
Optimal prefix codes with fewer distinct codeword lengths are faster to construct
Information and Computation | 2019-09-17 | Paper |
The subset partial order: computing and combinatorics
2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
A new algorithm for the shortest-path problem
Networks | 2019-08-01 | Paper |
Red-black trees with constant update time
Acta Informatica | 2019-06-20 | Paper |
| Pairing heaps with \(O(\log \log n)\) decrease cost | 2019-05-06 | Paper |
Toward optimal self-adjusting heaps
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Multipartite priority queues
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On the approximability of the maximum interval constrained coloring problem
Discrete Optimization | 2018-08-17 | Paper |
Bipartite binomial heaps
RAIRO - Theoretical Informatics and Applications | 2018-05-03 | Paper |
Space-efficient plane-sweep algorithms
(available as arXiv preprint) | 2018-04-19 | Paper |
Optimizing binary heaps
Theory of Computing Systems | 2017-10-20 | Paper |
| Space-efficient basic graph algorithms | 2017-01-24 | Paper |
Dynamic range majority data structures
Theoretical Computer Science | 2016-09-01 | 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 |
Counting inversions adaptively
Information Processing Letters | 2015-06-15 | Paper |
On finding sparse three-edge-connected and three-vertex-connected spanning subgraphs
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Optimal time-space tradeoff for the 2D convex-hull problem
Algorithms - ESA 2014 | 2014-10-08 | 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 |
Inversion-sensitive sorting algorithms in practice
ACM Journal of Experimental Algorithmics | 2014-04-01 | 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 |
On the hierarchy of distribution-sensitive properties for data structures
Acta Informatica | 2013-08-05 | Paper |
Enumerating trichromatic triangles containing the origin in linear time
Journal of Discrete Algorithms | 2013-06-24 | 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 |
Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
Journal of Graph Theory | 2013-03-07 | Paper |
The weak-heap data structure: variants and applications
Journal of Discrete Algorithms | 2013-01-18 | Paper |
A priority queue with the time-finger property
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 |
On the size of the subset partial order
Information Processing Letters | 2012-07-25 | Paper |
Fat heaps without regular counters
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs
Algorithmica | 2012-04-26 | Paper |
Finding simplices containing the origin in two and three dimensions
International Journal of Computational Geometry & Applications | 2012-04-19 | Paper |
The longest almost-increasing subsequence
Information Processing Letters | 2012-03-19 | Paper |
A unifying property for distribution-sensitive priority queues
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Two constant-factor-optimal realizations of adaptive heapsort
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Dynamic range majority data structures
Algorithms and Computation | 2011-12-16 | Paper |
Analysis of swaps in radix selection
Advances in Applied Probability | 2011-07-22 | Paper |
The violation heap: a relaxed Fibonacci-like heap
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
Pairing heaps, scrambled pairing and square-root trees
International Journal of Computer Mathematics | 2011-01-20 | Paper |
On the approximability of the maximum interval constrained coloring problem
Algorithms and Computation | 2010-12-09 | Paper |
Why depth-first search efficiently identifies two and three-connected graphs
Algorithms and Computation | 2010-12-09 | Paper |
Pairing heaps with costless meld
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Computing the subset partial order for dense families of sets
Information Processing Letters | 2010-08-20 | Paper |
The Longest Almost-Increasing Subsequence
Lecture Notes in Computer Science | 2010-07-20 | Paper |
The violation heap: a relaxed Fibonacci-like heap
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Strictly-regular number system and data structures
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Distribution-sensitive binomial queues.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Two new methods for constructing double-ended priority queues from priority queues
Computing | 2009-09-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Verification of minimum-redundancy prefix codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Two-tier relaxed heaps
Acta Informatica | 2008-06-17 | Paper |
Two-Tier Relaxed Heaps
Algorithms and Computation | 2008-04-24 | Paper |
Adaptive sorting: an information theoretic perspective
Acta Informatica | 2008-04-03 | Paper |
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
STACS 2006 | 2008-03-19 | Paper |
Competitive advantage and the cost of equity in international shipping
The Journal of the Operational Research Society | 2007-12-04 | Paper |
A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
| scientific article; zbMATH DE number 5050579 (Why is no real title available?) | 2006-08-29 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 2226804 (Why is no real title available?) | 2005-11-08 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
| scientific article; zbMATH DE number 2163028 (Why is no real title available?) | 2005-04-29 | Paper |
Parameterized self-adjusting heaps
Journal of Algorithms | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2086621 (Why is no real title available?) | 2004-08-11 | Paper |
On the sequential access theorem and deque conjecture for splay trees
Theoretical Computer Science | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2050887 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2050892 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 1962852 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1953147 (Why is no real title available?) | 2003-07-25 | Paper |
Reaching the bound in the \((2,n)\) merging problem
Information Sciences | 2000-01-04 | Paper |
