| Publication | Date of Publication | Type |
|---|
| Quotable signatures for authenticating shared quotes | 2024-10-16 | Paper |
Online unit profit knapsack with predictions
Algorithmica | 2024-10-07 | Paper |
| Flight planning in free route airspaces | 2024-07-11 | Paper |
| Online unit profit knapsack with untrusted predictions | 2024-05-27 | Paper |
Online minimum spanning trees with weight predictions
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Online interval scheduling with predictions
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Advice complexity of adaptive priority algorithms
Theoretical Computer Science | 2024-01-02 | Paper |
DNA-templated synthesis optimization
Natural Computing | 2023-11-30 | Paper |
Relative Worst-Order Analysis: A Survey
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Amortization results for chromatic search trees, with an application to priority queues
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Efficient rebalancing of chromatic search trees
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Relaxed balance through standard rotations
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Relaxing the irrevocability requirement for online graph algorithms
Algorithmica | 2022-06-28 | Paper |
| Relaxed balance for search trees with local rebalancing | 2021-12-20 | Paper |
Online bin covering with advice
Algorithmica | 2021-04-08 | Paper |
Randomized distributed online algorithms against adaptive offline adversaries
Information Processing Letters | 2020-08-04 | Paper |
Advice complexity of priority algorithms
Theory of Computing Systems | 2020-06-02 | Paper |
Online bin covering with advice
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Online dominating set
Algorithmica | 2019-05-07 | Paper |
Advice complexity of priority algorithms
Lecture Notes in Computer Science | 2019-01-15 | Paper |
Batch coloring of graphs
Algorithmica | 2019-01-11 | Paper |
| Heuristic variants of \(\mathrm{A}^*\) search for 3D flight planning | 2018-11-21 | Paper |
Online-bounded analysis
Journal of Scheduling | 2018-11-07 | Paper |
Formally proving size optimality of sorting networks
Journal of Automated Reasoning | 2018-02-02 | Paper |
| DNA-templated synthesis optimization | 2018-02-02 | Paper |
| How to get more out of your oracles | 2018-01-04 | Paper |
Online Dominating Set
(available as arXiv preprint) | 2017-10-17 | Paper |
Relaxing the irrevocability requirement for online graph algorithms
Lecture Notes in Computer Science | 2017-09-22 | Paper |
The Paths to Choreography Extraction
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Batch Coloring of Graphs
Approximation and Online Algorithms | 2017-04-04 | Paper |
Batch Coloring of Graphs
Approximation and Online Algorithms | 2017-04-04 | Paper |
On the list update problem with advice
Information and Computation | 2017-03-16 | Paper |
| Online bin packing with advice | 2017-03-03 | Paper |
Online bounded analysis
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Online bin covering: expectations vs. guarantees
Theoretical Computer Science | 2016-06-27 | Paper |
Regular expressions with nested levels of back referencing form a hierarchy
Information Processing Letters | 2016-06-09 | Paper |
Online bin packing with advice
Algorithmica | 2016-03-23 | Paper |
Online bin packing with advice
Algorithmica | 2016-03-23 | Paper |
Online Multi-Coloring with Advice
Approximation and Online Algorithms | 2015-11-20 | Paper |
The Frequent Items Problem in Online Streaming Under Various Performance Measures
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
Soccer is Harder Than Football
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
A comparison of performance measures for online algorithms
Algorithmica | 2015-09-02 | Paper |
Online multi-coloring with advice
Theoretical Computer Science | 2015-07-24 | Paper |
Variants of \((a,b)\)-trees with relaxed balance
International Journal of Foundations of Computer Science | 2015-04-30 | Paper |
ON GROUPING IN RELATIONAL ALGEBRA
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Sort order problems in relational databases
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Relative interval analysis of paging algorithms on access graphs
Theoretical Computer Science | 2015-01-28 | Paper |
| The relative worst order ratio applied to paging | 2014-10-13 | Paper |
A comparison of performance measures via online search
Theoretical Computer Science | 2014-04-15 | Paper |
On the list update problem with advice
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Better bounds on online unit clustering
Theoretical Computer Science | 2013-12-19 | Paper |
Online Bin Covering: Expectations vs. Guarantees
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Online multi-coloring on the path revisited
Acta Informatica | 2013-11-11 | Paper |
The frequent items problem in online streaming under various performance measures
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Relative interval analysis of paging algorithms on access graphs
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A technique for exact computation of precoloring extension on interval graphs
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
List factoring and relative worst order analysis
Algorithmica | 2013-05-13 | Paper |
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
A comparison of performance measures via online search
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
List Factoring and Relative Worst Order Analysis
Approximation and Online Algorithms | 2011-02-15 | Paper |
A theoretical comparison of LRU and LRU-K
Acta Informatica | 2010-12-13 | Paper |
Competitive analysis of the online inventory problem
European Journal of Operational Research | 2010-09-09 | Paper |
Better bounds on online unit clustering
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Online seat reservations via offline seating arrangements.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Priority algorithms for graph optimization problems
Theoretical Computer Science | 2009-12-01 | Paper |
A comparison of performance measures for online algorithms
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
Approximation and Online Algorithms | 2008-02-21 | Paper |
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling | 2007-12-20 | Paper |
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences | 2007-05-30 | Paper |
The maximum resource bin packing problem
Theoretical Computer Science | 2006-10-20 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Exponentially decreasing number of operations in balanced trees
Acta Informatica | 2005-12-14 | Paper |
ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS
International Journal of Foundations of Computer Science | 2005-09-12 | Paper |
| scientific article; zbMATH DE number 2185603 (Why is no real title available?) | 2005-07-04 | Paper |
Extending the accommodating function
Acta Informatica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2089963 (Why is no real title available?) | 2004-08-12 | Paper |
Packet Bundling
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
Dynamic TCP acknowledgment in the LogP model
Journal of Algorithms | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2044508 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 2044506 (Why is no real title available?) | 2004-02-18 | Paper |
Relaxed red-black trees with group updates
Acta Informatica | 2003-09-01 | Paper |
Relaxed multi-way trees with group updates.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
On the existence and construction of non-extreme \((a,b)\)-trees.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1830753 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1786227 (Why is no real title available?) | 2002-10-21 | Paper |
Fair versus unrestricted bin packing
Algorithmica | 2002-09-25 | Paper |
| scientific article; zbMATH DE number 1696638 (Why is no real title available?) | 2002-07-01 | Paper |
The accommodating function: A generalization of the competitive ratio
SIAM Journal on Computing | 2002-04-23 | Paper |
Relaxed balance using standard rotations
Algorithmica | 2002-01-24 | Paper |
relaxed balance for search trees with local rebalancing
Acta Informatica | 2001-08-26 | Paper |
| scientific article; zbMATH DE number 1617259 (Why is no real title available?) | 2001-07-11 | Paper |
AVL trees with relaxed balance
Journal of Computer and System Sciences | 2001-04-17 | Paper |
Efficient rebalancing of chromatic search trees
Journal of Computer and System Sciences | 2000-06-21 | Paper |
The seat reservation problem
Algorithmica | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1375590 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1375590 (Why is no real title available?) | 1999-12-09 | Paper |
Amortized constant relaxed rebalancing using standard rotations
Acta Informatica | 1999-03-29 | Paper |
| scientific article; zbMATH DE number 1202980 (Why is no real title available?) | 1998-09-27 | Paper |
Amortization results for chromatic search trees, with an application to priority queues
Journal of Computer and System Sciences | 1998-08-04 | Paper |
EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
International Journal of Foundations of Computer Science | 1996-11-26 | Paper |
Injectivity of composite functions
Journal of Symbolic Computation | 1995-01-26 | Paper |
Bounds on certain multiplications of affine combinations
Discrete Applied Mathematics | 1995-01-09 | Paper |
A new formalism for relational algebra
Information Processing Letters | 1992-06-28 | Paper |
