| Publication | Date of Publication | Type |
|---|
| On the online weighted non-crossing matching problem | 2025-12-02 | Paper |
| Complexity classes for online problems with and without predictions | 2025-11-20 | Paper |
| Online algorithms with predictions (invited talk) | 2024-12-03 | Paper |
| Quotable signatures for authenticating shared quotes | 2024-10-16 | Paper |
Online unit profit knapsack with predictions
Algorithmica | 2024-10-07 | 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 |
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 |
Relaxing the irrevocability requirement for online graph algorithms
Algorithmica | 2022-06-28 | 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 |
Tight bounds for restricted grid scheduling
International Journal of Foundations of Computer Science | 2019-06-21 | 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 |
Small low-depth circuits for cryptographic applications
Cryptography and Communications | 2019-01-08 | Paper |
Online-bounded analysis
Journal of Scheduling | 2018-11-07 | Paper |
The relative worst order ratio applied to seat reservation
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Weighted online problems with advice
Theory of Computing Systems | 2018-08-03 | Paper |
Adding isolated vertices makes some greedy online algorithms optimal
Discrete Applied Mathematics | 2018-06-27 | Paper |
Multiplicative complexity of vector valued Boolean functions
Theoretical Computer Science | 2018-03-12 | Paper |
The advice complexity of a class of hard online problems
Theory of Computing Systems | 2018-02-01 | 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 |
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 |
Advice complexity for a class of online problems
(available as arXiv preprint) | 2017-01-24 | Paper |
Weighted Online Problems with Advice
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Online bounded analysis
Computer Science – Theory and Applications | 2016-07-25 | Paper |
On various nonlinearity measures for Boolean functions
Cryptography and Communications | 2016-05-04 | Paper |
Adding isolated vertices makes some online algorithms optimal
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Online bin packing with advice
Algorithmica | 2016-03-23 | Paper |
Online bin packing with advice
Algorithmica | 2016-03-23 | Paper |
Constructive relationships between algebraic thickness and normality
Fundamentals of Computation Theory | 2015-09-29 | Paper |
The Frequent Items Problem in Online Streaming Under Various Performance Measures
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
The relative worst order ratio for online algorithms
ACM Transactions on Algorithms | 2015-09-02 | Paper |
A comparison of performance measures for online algorithms
Algorithmica | 2015-09-02 | Paper |
Cancellation-free circuits in unbounded and bounded depth
Theoretical Computer Science | 2015-06-10 | Paper |
Relative interval analysis of paging algorithms on access graphs
Theoretical Computer Science | 2015-01-28 | Paper |
The relationship between multiplicative complexity and nonlinearity
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
| The relative worst order ratio applied to paging | 2014-10-13 | Paper |
Short discreet proofs
Advances in Cryptology — EUROCRYPT ’96 | 2014-08-20 | 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 |
A new variable-sized bin packing problem
Journal of Scheduling | 2014-02-05 | Paper |
Bounds for scheduling jobs on grid processors
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Cancellation-free circuits in unbounded and bounded depth
Fundamentals of Computation Theory | 2013-08-16 | 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 |
Logic minimization techniques with applications to cryptology
Journal of Cryptology | 2013-06-27 | Paper |
Four measures of nonlinearity
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
On the absolute approximation ratio for first fit and related results
Discrete Applied Mathematics | 2012-08-10 | Paper |
A comparison of performance measures via online search
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
A theoretical comparison of LRU and LRU-K
Acta Informatica | 2010-12-13 | Paper |
Tight results for next fit and worst fit with resource augmentation
Theoretical Computer Science | 2010-06-07 | Paper |
Scheduling jobs on grid processors
Algorithmica | 2010-05-28 | 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 |
On the Shortest Linear Straight-Line Program for Computing Linear Forms
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Tight bounds for the multiplicative complexity of symmetric functions
Theoretical Computer Science | 2008-05-28 | 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 |
Scheduling Jobs on Grid Processors
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Concrete Multiplicative Complexity of Symmetric Functions
Lecture Notes in Computer Science | 2007-09-05 | 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 |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | 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 |
Seat reservation allowing seat changes
Journal of Algorithms | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2089963 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2011845 (Why is no real title available?) | 2003-12-02 | 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 |
| scientific article; zbMATH DE number 1617259 (Why is no real title available?) | 2001-07-11 | Paper |
Short non-interactive cryptographic proofs
Journal of Cryptology | 2000-12-21 | Paper |
Efficient rebalancing of chromatic search trees
Journal of Computer and System Sciences | 2000-06-21 | Paper |
On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
Theoretical Computer Science | 2000-06-04 | Paper |
The seat reservation problem
Algorithmica | 2000-01-17 | Paper |
Amortization results for chromatic search trees, with an application to priority queues
Journal of Computer and System Sciences | 1998-08-04 | Paper |
Subquadratic zero-knowledge
Journal of the ACM | 1998-01-28 | Paper |
Bounds on certain multiplications of affine combinations
Discrete Applied Mathematics | 1995-01-09 | Paper |
Convertible Undeniable Signatures
Advances in Cryptology - CRYPTO '90. A conference on the theory and application of Cryptography, Univ. of California, Santa Barbara, USA, August 11--15, 1990. Proceedings | 1994-03-07 | Paper |
On the communication complexity of zero-knowledge proofs
Journal of Cryptology | 1993-08-29 | Paper |
An arithmetic model of computation equivalent to threshold circuits
Theoretical Computer Science | 1992-06-28 | Paper |
Practic zero-knowledge proofs: Giving hints and using deficiencies
Journal of Cryptology | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4191124 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4211485 (Why is no real title available?) | 1990-01-01 | Paper |
A discrete logarithm implementation of perfect zero-knowledge blobs
Journal of Cryptology | 1990-01-01 | Paper |
Inferring sequences produced by pseudo-random number generators
Journal of the ACM | 1989-01-01 | Paper |
Inferring sequences produced by a linear congruential generator missing low-order bits
Journal of Cryptology | 1989-01-01 | Paper |
Coloring planar graphs in parallel
Journal of Algorithms | 1987-01-01 | Paper |
