| Publication | Date of Publication | Type |
|---|
| Random sources in private computation | 2023-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090444 | 2022-07-18 | Paper |
| Sublinear Random Access Generators for Preferential Attachment Graphs | 2022-02-22 | Paper |
| Online budgeted maximum coverage | 2021-09-02 | Paper |
| Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND | 2021-03-30 | Paper |
| Sublinear Random Access Generators for Preferential Attachment Graphs. | 2020-05-27 | Paper |
| Paid exchanges are worth the price | 2020-05-23 | Paper |
| Lower and upper bounds on the randomness complexity of private computations of AND | 2020-04-30 | Paper |
| Multi-Party Protocols, Information Complexity and Privacy | 2019-12-16 | Paper |
| Online bin packing with advice of small size | 2019-09-05 | Paper |
| Approximating Semi-matchings in Streaming and in Two-Party Communication | 2018-11-05 | Paper |
| Space-Constrained Interval Selection | 2018-11-05 | Paper |
| Semi-Streaming Set Cover | 2018-11-05 | Paper |
| Reordering buffer management with advice | 2018-04-04 | Paper |
| Multi-Party Protocols, Information Complexity and Privacy | 2018-03-21 | Paper |
| A Constant Approximation Algorithm for Scheduling Packets on Line Networks | 2018-03-02 | Paper |
| Online Budgeted Maximum Coverage | 2018-03-02 | Paper |
| Clique Here: On the Distributed Complexity in Fully-Connected Networks | 2017-12-15 | Paper |
| On-line competitive algorithms for call admission in optical networks | 2017-12-05 | Paper |
| On the additive constant of the \(k\)-server work function algorithm | 2017-11-03 | Paper |
| Randomness vs. fault-tolerance | 2017-09-29 | Paper |
| The slide mechanism with applications in dynamic networks | 2017-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955029 | 2017-01-24 | Paper |
| A theorem on sensitivity and applications in private computation | 2016-09-29 | Paper |
| Unconditionally Secure Computation with Reduced Interaction | 2016-07-15 | Paper |
| Shrinking maxima, decreasing costs: new online packing and covering problems | 2016-05-31 | Paper |
| Amortizing randomness in private multiparty computations | 2016-03-02 | Paper |
| Online Bin Packing with Advice of Small Size | 2015-10-30 | Paper |
| Online algorithms with advice for bin packing and scheduling problems | 2015-09-16 | Paper |
| On online algorithms with advice for the \(k\)-server problem | 2015-05-12 | Paper |
| Competitive weighted throughput analysis of greedy protocols on DAGs | 2015-03-10 | Paper |
| Competitive weighted throughput analysis of greedy protocols on DAGs | 2014-11-18 | Paper |
| Competitive weighted throughput analysis of greedy protocols on dags | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921742 | 2014-10-13 | Paper |
| Rate vs. buffer size--greedy information gathering on the line | 2014-09-09 | Paper |
| Reordering Buffer Management with Advice | 2014-09-02 | Paper |
| Semi-Streaming Set Cover | 2014-07-01 | Paper |
| Distributed approximate matching | 2014-03-13 | Paper |
| Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems | 2013-10-04 | Paper |
| Space-Constrained Interval Selection | 2013-08-12 | Paper |
| Approximating Semi-matchings in Streaming and in Two-Party Communication | 2013-08-06 | Paper |
| Approximation algorithms for time-constrained scheduling on line networks | 2012-12-10 | Paper |
| On Online Algorithms with Advice for the k-Server Problem | 2012-07-16 | Paper |
| Connectivity guarantees for wireless networks with directional antennas | 2011-12-28 | Paper |
| Online computation with advice | 2011-06-07 | Paper |
| Online time-constrained scheduling in linear and ring networks | 2011-01-20 | Paper |
| Lower bounds on the amount of randomness in private computation | 2010-08-16 | Paper |
| On the Additive Constant of the k-Server Work Function Algorithm | 2010-05-11 | Paper |
| Distributed Approximate Matching | 2010-04-29 | Paper |
| Online Computation with Advice | 2009-07-14 | Paper |
| On delivery times in packet networks under adversarial traffic | 2007-01-25 | Paper |
| Scheduling policies for CIOQ switches | 2006-08-14 | Paper |
| $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation | 2005-09-16 | Paper |
| Tight bounds for the performance of Longest In System on DAGs | 2005-06-30 | Paper |
| Competitive queue policies for differentiated services | 2005-06-30 | Paper |
| New Stability Results for Adversarial Queuing | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818855 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736830 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471371 | 2004-07-28 | Paper |
| Amortizing Randomness in Private Multiparty Computations | 2004-01-08 | Paper |
| Time-constrained scheduling of weighted packets on trees and meshes | 2003-08-17 | Paper |
| A note on models for non-probabilistic analysis of packet switching networks. | 2003-01-21 | Paper |
| A Theorem on Sensitivity and Applications in Private Computation | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542554 | 2002-09-17 | Paper |
| On-line Randomized Call Control Revisited | 2001-06-21 | Paper |
| Adaptive packet routing for bursty adversarial traffic | 2000-08-27 | Paper |
| Randomness versus fault-tolerance | 2000-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252724 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940712 | 2000-03-01 | Paper |
| On capital investment. | 2000-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228509 | 1999-10-04 | Paper |
| Characterizing linear size circuits in terms of privacy | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250198 | 1999-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234105 | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230358 | 1999-04-22 | Paper |
| Log-Space Polynomial End-to-End Communication | 1998-09-21 | Paper |
| A Randomness-Rounds Tradeoff in Private Computation | 1998-05-11 | Paper |
| The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms | 1997-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128890 | 1997-04-23 | Paper |
| Slide—The Key to Polynomial End-to-End Communication | 1997-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875171 | 1996-10-21 | Paper |
