| Publication | Date of Publication | Type |
|---|
| Online minimum spanning trees with weight predictions | 2024-01-16 | Paper |
| Online interval scheduling with predictions | 2024-01-16 | Paper |
| Advice complexity of adaptive priority algorithms | 2024-01-02 | Paper |
| DNA-templated synthesis optimization | 2023-11-30 | Paper |
| Relative Worst-Order Analysis: A Survey | 2023-06-30 | Paper |
| Amortization results for chromatic search trees, with an application to priority queues | 2022-12-16 | Paper |
| Efficient rebalancing of chromatic search trees | 2022-12-09 | Paper |
| Relaxed balance through standard rotations | 2022-08-19 | Paper |
| Relaxing the irrevocability requirement for online graph algorithms | 2022-06-28 | Paper |
| Relaxed balance for search trees with local rebalancing | 2021-12-20 | Paper |
| Online bin covering with advice | 2021-04-08 | Paper |
| Randomized distributed online algorithms against adaptive offline adversaries | 2020-08-04 | Paper |
| Advice complexity of priority algorithms | 2020-06-02 | Paper |
| Online bin covering with advice | 2020-01-16 | Paper |
| Online dominating set | 2019-05-07 | Paper |
| Advice complexity of priority algorithms | 2019-01-15 | Paper |
| Batch coloring of graphs | 2019-01-11 | Paper |
| Heuristic variants of \(\mathrm{A}^*\) search for 3D flight planning | 2018-11-21 | Paper |
| Online-bounded analysis | 2018-11-07 | Paper |
| DNA-templated synthesis optimization | 2018-02-02 | Paper |
| Formally proving size optimality of sorting networks | 2018-02-02 | Paper |
| How to get more out of your oracles | 2018-01-04 | Paper |
| Online Dominating Set | 2017-10-17 | Paper |
| Relaxing the irrevocability requirement for online graph algorithms | 2017-09-22 | Paper |
| The Paths to Choreography Extraction | 2017-05-19 | Paper |
| Batch Coloring of Graphs | 2017-04-04 | Paper |
| On the list update problem with advice | 2017-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965482 | 2017-03-03 | Paper |
| Online Bounded Analysis | 2016-07-25 | Paper |
| Online bin covering: expectations vs. guarantees | 2016-06-27 | Paper |
| Regular expressions with nested levels of back referencing form a hierarchy | 2016-06-09 | Paper |
| Online bin packing with advice | 2016-03-23 | Paper |
| Online Multi-Coloring with Advice | 2015-11-20 | Paper |
| The Frequent Items Problem in Online Streaming Under Various Performance Measures | 2015-09-29 | Paper |
| Soccer is Harder Than Football | 2015-09-29 | Paper |
| A comparison of performance measures for online algorithms | 2015-09-02 | Paper |
| Online multi-coloring with advice | 2015-07-24 | Paper |
| VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE | 2015-04-30 | Paper |
| SORT ORDER PROBLEMS IN RELATIONAL DATABASES | 2015-04-29 | Paper |
| ON GROUPING IN RELATIONAL ALGEBRA | 2015-04-29 | Paper |
| Relative interval analysis of paging algorithms on access graphs | 2015-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921733 | 2014-10-13 | Paper |
| A comparison of performance measures via online search | 2014-04-15 | Paper |
| On the list update problem with advice | 2014-03-31 | Paper |
| Better bounds on online unit clustering | 2013-12-19 | Paper |
| Online Bin Covering: Expectations vs. Guarantees | 2013-12-10 | Paper |
| Online multi-coloring on the path revisited | 2013-11-11 | Paper |
| The Frequent Items Problem in Online Streaming under Various Performance Measures | 2013-08-16 | Paper |
| Relative Interval Analysis of Paging Algorithms on Access Graphs | 2013-08-12 | Paper |
| A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS | 2013-07-30 | Paper |
| List factoring and relative worst order analysis | 2013-05-13 | Paper |
| Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis | 2012-08-14 | Paper |
| A Comparison of Performance Measures via Online Search | 2012-07-16 | Paper |
| List Factoring and Relative Worst Order Analysis | 2011-02-15 | Paper |
| A theoretical comparison of LRU and LRU-K | 2010-12-13 | Paper |
| Competitive analysis of the online inventory problem | 2010-09-09 | Paper |
| Better Bounds on Online Unit Clustering | 2010-06-22 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Priority algorithms for graph optimization problems | 2009-12-01 | Paper |
| A comparison of performance measures for online algorithms | 2009-10-20 | Paper |
| Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem | 2008-02-21 | Paper |
| Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem | 2007-12-20 | Paper |
| The relative worst-order ratio applied to paging | 2007-05-30 | Paper |
| The maximum resource bin packing problem | 2006-10-20 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Exponentially decreasing number of operations in balanced trees | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS | 2005-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024764 | 2005-07-04 | Paper |
| Extending the accommodating function | 2004-09-22 | Paper |
| Packet Bundling | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808625 | 2004-08-12 | Paper |
| Dynamic TCP acknowledgment in the LogP model | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448370 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448372 | 2004-02-18 | Paper |
| Relaxed red-black trees with group updates | 2003-09-01 | Paper |
| Relaxed multi-way trees with group updates. | 2003-08-19 | Paper |
| On the existence and construction of non-extreme \((a,b)\)-trees. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778576 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547549 | 2002-10-21 | Paper |
| Fair versus unrestricted bin packing | 2002-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766831 | 2002-07-01 | Paper |
| The Accommodating Function: A Generalization of the Competitive Ratio | 2002-04-23 | Paper |
| Relaxed balance using standard rotations | 2002-01-24 | Paper |
| relaxed balance for search trees with local rebalancing | 2001-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721979 | 2001-07-11 | Paper |
| AVL trees with relaxed balance | 2001-04-17 | Paper |
| Efficient rebalancing of chromatic search trees | 2000-06-21 | Paper |
| The seat reservation problem | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836530 | 1999-12-09 | Paper |
| Amortized constant relaxed rebalancing using standard rotations | 1999-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4209362 | 1998-09-27 | Paper |
| Amortization results for chromatic search trees, with an application to priority queues | 1998-08-04 | Paper |
| EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE | 1996-11-26 | Paper |
| Injectivity of composite functions | 1995-01-26 | Paper |
| Bounds on certain multiplications of affine combinations | 1995-01-09 | Paper |
| A new formalism for relational algebra | 1992-06-28 | Paper |
