| 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 |
| 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 |
| Relaxing the irrevocability requirement for online graph algorithms | 2022-06-28 | 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 |
| Tight Bounds for Restricted Grid Scheduling | 2019-06-21 | 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 |
| Small low-depth circuits for cryptographic applications | 2019-01-08 | Paper |
| Online-bounded analysis | 2018-11-07 | Paper |
| The relative worst order ratio applied to seat reservation | 2018-11-05 | Paper |
| Weighted online problems with advice | 2018-08-03 | Paper |
| Adding isolated vertices makes some greedy online algorithms optimal | 2018-06-27 | Paper |
| Multiplicative complexity of vector valued Boolean functions | 2018-03-12 | Paper |
| The advice complexity of a class of hard online problems | 2018-02-01 | Paper |
| Online Dominating Set | 2017-10-17 | Paper |
| Relaxing the irrevocability requirement for online graph algorithms | 2017-09-22 | 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 |
| https://portal.mardi4nfdi.de/entity/Q2954988 | 2017-01-24 | Paper |
| Weighted Online Problems with Advice | 2016-09-29 | Paper |
| Online Bounded Analysis | 2016-07-25 | Paper |
| On various nonlinearity measures for Boolean functions | 2016-05-04 | Paper |
| Adding isolated vertices makes some greedy online algorithms optimal | 2016-04-04 | Paper |
| Online bin packing with advice | 2016-03-23 | Paper |
| The Frequent Items Problem in Online Streaming Under Various Performance Measures | 2015-09-29 | Paper |
| Constructive Relationships Between Algebraic Thickness and Normality | 2015-09-29 | Paper |
| A comparison of performance measures for online algorithms | 2015-09-02 | Paper |
| The relative worst order ratio for online algorithms | 2015-09-02 | Paper |
| Cancellation-free circuits in unbounded and bounded depth | 2015-06-10 | Paper |
| Relative interval analysis of paging algorithms on access graphs | 2015-01-28 | Paper |
| The Relationship between Multiplicative Complexity and Nonlinearity | 2014-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921733 | 2014-10-13 | Paper |
| Short Discreet Proofs | 2014-08-20 | Paper |
| A comparison of performance measures via online search | 2014-04-15 | Paper |
| On the list update problem with advice | 2014-03-31 | Paper |
| A new variable-sized bin packing problem | 2014-02-05 | Paper |
| Bounds for Scheduling Jobs on Grid Processors | 2013-09-13 | Paper |
| The Frequent Items Problem in Online Streaming under Various Performance Measures | 2013-08-16 | Paper |
| Cancellation-Free Circuits in Unbounded and Bounded Depth | 2013-08-16 | Paper |
| Relative Interval Analysis of Paging Algorithms on Access Graphs | 2013-08-12 | Paper |
| Logic minimization techniques with applications to cryptology | 2013-06-27 | Paper |
| Four Measures of Nonlinearity | 2013-06-07 | Paper |
| Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis | 2012-08-14 | Paper |
| On the absolute approximation ratio for first fit and related results | 2012-08-10 | Paper |
| A Comparison of Performance Measures via Online Search | 2012-07-16 | Paper |
| A theoretical comparison of LRU and LRU-K | 2010-12-13 | Paper |
| Tight results for next fit and worst fit with resource augmentation | 2010-06-07 | Paper |
| Scheduling jobs on grid processors | 2010-05-28 | Paper |
| Priority algorithms for graph optimization problems | 2009-12-01 | Paper |
| A comparison of performance measures for online algorithms | 2009-10-20 | Paper |
| On the Shortest Linear Straight-Line Program for Computing Linear Forms | 2009-02-03 | Paper |
| Tight bounds for the multiplicative complexity of symmetric functions | 2008-05-28 | 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 |
| Scheduling Jobs on Grid Processors | 2007-09-07 | Paper |
| Concrete Multiplicative Complexity of Symmetric Functions | 2007-09-05 | 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 |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024764 | 2005-07-04 | Paper |
| Extending the accommodating function | 2004-09-22 | Paper |
| Seat reservation allowing seat changes | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808625 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437497 | 2003-12-02 | 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 |
| https://portal.mardi4nfdi.de/entity/Q2721979 | 2001-07-11 | Paper |
| Short non-interactive cryptographic proofs | 2000-12-21 | Paper |
| Efficient rebalancing of chromatic search trees | 2000-06-21 | Paper |
| On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). | 2000-06-04 | Paper |
| The seat reservation problem | 2000-01-17 | Paper |
| Amortization results for chromatic search trees, with an application to priority queues | 1998-08-04 | Paper |
| Subquadratic zero-knowledge | 1998-01-28 | Paper |
| Bounds on certain multiplications of affine combinations | 1995-01-09 | Paper |
| Convertible Undeniable Signatures | 1994-03-07 | Paper |
| On the communication complexity of zero-knowledge proofs | 1993-08-29 | Paper |
| An arithmetic model of computation equivalent to threshold circuits | 1992-06-28 | Paper |
| Practic zero-knowledge proofs: Giving hints and using deficiencies | 1992-06-27 | Paper |
| A discrete logarithm implementation of perfect zero-knowledge blobs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210182 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3358224 | 1990-01-01 | Paper |
| Inferring sequences produced by a linear congruential generator missing low-order bits | 1989-01-01 | Paper |
| Inferring sequences produced by pseudo-random number generators | 1989-01-01 | Paper |
| Coloring planar graphs in parallel | 1987-01-01 | Paper |
