| Publication | Date of Publication | Type |
|---|
| Envy-Free Division of Land | 2021-01-08 | Paper |
| On the cost of recomputing: tight bounds on pebbling with faults | 2019-04-29 | Paper |
| Demand-flow of agents with gross-substitute valuations | 2019-01-15 | Paper |
| Waste Makes Haste | 2018-11-05 | Paper |
| Efficient asynchronous consensus with the weak adversary scheduler | 2017-09-29 | Paper |
| Fair and square: cake-cutting in two dimensions | 2017-06-15 | Paper |
| SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism | 2016-09-29 | Paper |
| Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting | 2016-07-06 | Paper |
| Exploration costs as a means for improving performance in multiagent systems | 2015-02-05 | Paper |
| Dotted interval graphs and high throughput genotyping | 2014-10-13 | Paper |
| Dotted interval graphs | 2014-09-09 | Paper |
| Finding witnesses by peeling | 2014-09-09 | Paper |
| Physical search problems with probabilistic knowledge | 2013-08-23 | Paper |
| Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler | 2013-06-07 | Paper |
| On the evaluation of election outcomes under uncertainty | 2012-11-15 | Paper |
| Quasi-distinct parsing and optimal compression methods | 2012-05-14 | Paper |
| Throw One’s Cake — and Eat It Too | 2011-10-28 | Paper |
| Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games | 2010-10-19 | Paper |
| Pattern matching with address errors | 2010-08-16 | Paper |
| Security against covert adversaries: Efficient protocols for realistic adversaries | 2010-03-01 | Paper |
| Approximate string matching with address bit errors | 2009-11-18 | Paper |
| Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances | 2009-10-09 | Paper |
| Pattern matching with address errors: rearrangement distances | 2009-07-24 | Paper |
| Quasi-distinct Parsing and Optimal Compression Methods | 2009-07-07 | Paper |
| Approximate String Matching with Address Bit Errors | 2008-06-17 | Paper |
| Finding Witnesses by Peeling | 2008-06-17 | Paper |
| Fixed Structure Complexity | 2008-06-05 | Paper |
| Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries | 2007-08-30 | Paper |
| Function Matching | 2006-06-01 | Paper |
| Research in Computational Molecular Biology | 2005-11-23 | Paper |
| Everlasting security in the bounded storage model | 2005-05-11 | Paper |
| Designing optimally multiplexed SNP genotyping assays | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818871 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472142 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449230 | 2004-02-08 | Paper |
| Linear-consistency testing. | 2002-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230336 | 2002-01-17 | Paper |
| Pattern Matching with Swaps | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941830 | 2000-12-18 | Paper |
| On the cost of recomputing: Tight bounds on pebbling with faults | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941847 | 2000-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249338 | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252273 | 1999-06-17 | Paper |
| Efficient execution of nondeterministic parallel programs on asynchronous systems | 1998-07-27 | Paper |
| An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341735 | 1997-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886092 | 1996-10-21 | Paper |
| Clock construction in fully asynchronous parallel systems and PRAM simulation | 1995-04-04 | Paper |
| Improved memory utilization in deterministic PRAM simulation | 1992-06-25 | Paper |
| Evaluation of the time course of neurotransmitter release from the measured PSC and MPSC | 1991-01-01 | Paper |
