| Publication | Date of Publication | Type |
|---|
| An \(\alpha \)-regret analysis of adversarial bilateral trade | 2025-01-17 | Paper |
| Combinatorial auctions with interdependent valuations: SOS to the rescue | 2024-06-27 | Paper |
| An economics-based analysis of RANKING for online bipartite matching | 2024-05-14 | Paper |
| Dynamic pricing of servers on trees | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009585 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743453 | 2019-05-10 | Paper |
| Beyond myopic best response (in Cournot competition) | 2019-03-29 | Paper |
| Highway Dimension and Provably Efficient Shortest Path Algorithms | 2018-08-02 | Paper |
| (1 + ∊)-Approximate f-Sensitive Distance Oracles | 2018-07-16 | Paper |
| Packing Small Vectors | 2018-07-16 | Paper |
| Carpooling in Social Networks | 2017-12-19 | Paper |
| On-line competitive algorithms for call admission in optical networks | 2017-12-05 | Paper |
| Pricing Online Decisions: Beyond Auctions | 2017-10-05 | Paper |
| Approaching utopia | 2017-05-16 | Paper |
| History-Independent Distributed Multi-agent Learning | 2016-09-29 | Paper |
| The Temp Secretary Problem | 2015-11-19 | Paper |
| Provable unlinkability against traffic analysis with low message overhead | 2015-08-03 | Paper |
| On-line load balancing with applications to machine scheduling and virtual circuit routing | 2015-05-07 | Paper |
| Competitive distributed file allocation | 2015-05-07 | Paper |
| Spectral analysis of data | 2015-02-27 | Paper |
| Private coresets | 2015-02-04 | Paper |
| Minimal indices for predecessor search | 2015-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934596 | 2014-12-18 | Paper |
| Online conflict-free coloring for intervals | 2014-10-13 | Paper |
| Better algorithms for unfair metrical task systems and applications | 2014-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417667 | 2014-05-22 | Paper |
| Minimal Indices for Successor Search | 2013-09-20 | Paper |
| Envy-free makespan approximation | 2012-05-30 | Paper |
| VC-Dimension and Shortest Path Algorithms | 2011-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002776 | 2011-05-24 | Paper |
| Derandomization of auctions | 2011-05-16 | Paper |
| When the Players Are Not Expectation Maximizers | 2010-10-19 | Paper |
| Optimal oblivious routing in polynomial time | 2010-08-16 | Paper |
| Derandomization of auctions | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579445 | 2010-08-06 | Paper |
| Competitive generalized auctions | 2010-08-05 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations | 2009-03-12 | Paper |
| Bi-criteria linear-time approximations for generalized k-mean/median/center | 2009-02-12 | Paper |
| Caching Content under Digital Rights Management | 2009-02-12 | Paper |
| New algorithms for an ancient scheduling problem. | 2008-12-21 | Paper |
| Competitive algorithms for distributed data management. | 2008-12-21 | Paper |
| Subjective vs. Objective Reality — The Risk of Running Late | 2008-05-02 | Paper |
| Strong Price of Anarchy for Machine Load Balancing | 2007-11-28 | Paper |
| Online Conflict‐Free Coloring for Intervals | 2007-10-22 | Paper |
| Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing | 2007-05-03 | Paper |
| Associative search in peer to peer networks: Harnessing latent semantics | 2007-04-26 | Paper |
| An improved algorithm for online coloring of intervals with bandwidth | 2007-01-09 | Paper |
| Correlation clustering in general weighted graphs | 2006-09-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| Financial Cryptography | 2005-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828919 | 2004-11-29 | Paper |
| Optimal oblivious routing in polynomial time | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818855 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471366 | 2004-07-28 | Paper |
| Competitive distributed file allocation. | 2004-03-14 | Paper |
| Making data structures confluently persistent | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449161 | 2004-02-08 | Paper |
| Better Algorithms for Unfair Metrical Task Systems and Applications | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411386 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4709172 | 2003-06-20 | Paper |
| Tracing traitors | 2002-08-15 | Paper |
| Optimal search and one-way trading online algorithms | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234112 | 2002-02-03 | Paper |
| Making data structures confluently persistent. (Extended abstract) | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230356 | 2002-01-16 | Paper |
| On-line competitive algorithms for call admission in optical networks | 2001-10-14 | Paper |
| Dynamic traitor tracing | 2001-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941865 | 2000-08-27 | Paper |
| Competitive algorithms for the weighted server problem | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252724 | 2000-04-26 | Paper |
| Rigorous Time/Space Trade-offs for Inverting Functions | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940701 | 2000-03-01 | Paper |
| On capital investment. | 2000-01-04 | Paper |
| On-line scheduling on a single machine: Minimizing the total completion time | 1999-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228507 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228508 | 1999-03-01 | Paper |
| Competitive Algorithms for Layered Graph Traversal | 1998-09-21 | Paper |
| On-line routing of virtual circuits with applications to load balancing and machine scheduling | 1998-02-17 | Paper |
| Distributed Paging for General Networks | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341773 | 1997-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128890 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128932 | 1997-04-23 | Paper |
| Batch RSA | 1997-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875171 | 1996-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876409 | 1996-10-07 | Paper |
| Online Navigation in a Room | 1995-11-22 | Paper |
| Nonoblivious hashing | 1994-08-21 | Paper |
| A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle | 1994-07-21 | Paper |
| Competitive \(k\)-server algorithms | 1994-06-29 | Paper |
| Implicit $O(1)$ Probe Search | 1993-05-16 | Paper |
| An implicit data structure for searching a multikey table in logarithmic time | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360795 | 1990-01-01 | Paper |
| How to find a battleship | 1989-01-01 | Paper |
| Zero-knowledge proofs of identity | 1988-01-01 | Paper |
| How To Prove Yourself: Practical Solutions to Identification and Signature Problems | 1987-01-01 | Paper |
| Polymorphic arrays: A novel VLSI layout for systolic computers | 1986-01-01 | Paper |
| Generalized 'write-once' memories | 1984-01-01 | Paper |
