| Publication | Date of Publication | Type |
|---|
| Tree reconstruction from partial orders | 2023-01-18 | Paper |
| Pipeline Interventions | 2023-01-09 | Paper |
| Quantifying the Burden of Exploration and the Unfairness of Free Riding | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121896 | 2020-09-22 | Paper |
| Locating Errors in Faulty Formulas | 2019-11-25 | Paper |
| Graph Reconstruction and Verification | 2019-03-28 | Paper |
| Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy) | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5278416 | 2017-07-19 | Paper |
| Minimizing space usage in evaluation of expression trees | 2017-01-19 | Paper |
| Optimal Provision-After-Wait in Healthcare | 2016-04-15 | Paper |
| Near-Linear Query Complexity for Graph Inference | 2015-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501353 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501370 | 2015-08-03 | Paper |
| A robust model for finding optimal evolutionary trees | 2015-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921736 | 2014-10-13 | Paper |
| Algorithms for the Generalized Sorting Problem | 2014-07-30 | Paper |
| On the Complexity of Shortest Path Problems on Discounted Cost Graphs | 2013-03-18 | Paper |
| Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply | 2012-11-02 | Paper |
| STCON in Directed Unique-Path Graphs | 2012-10-19 | Paper |
| On Sampling from Multivariate Distributions | 2011-08-17 | Paper |
| Weighted isotonic regression under the L1 norm | 2010-08-16 | Paper |
| Reconstructing Numbers from Pairwise Function Values | 2009-12-17 | Paper |
| Graph Distances in the Data-Stream Model | 2009-11-06 | Paper |
| Checking and Spot-Checking the Correctness of Priority Queues | 2007-11-28 | Paper |
| Efficient Enumeration of Phylogenetically Informative Substrings | 2007-08-30 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-05-02 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Randomized Pursuit-Evasion with Local Visibility | 2006-06-01 | Paper |
| Better alternatives to OSPF routing | 2006-03-21 | Paper |
| On graph problems in a semi-streaming model | 2006-01-09 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| Computing diameter in the streaming and sliding-window models | 2005-02-21 | Paper |
| A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols | 2005-02-21 | Paper |
| Efficient algorithms for inverting evolution | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818872 | 2004-09-24 | Paper |
| Java-MaC: A run-time assurance approach for Java programs | 2004-09-09 | Paper |
| Polyhedral flows in hybrid automata | 2004-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471268 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542544 | 2004-01-14 | Paper |
| An Approximate L1 -Difference Algorithm for Massive Data Streams | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754189 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267798 | 1999-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249560 | 1999-08-16 | Paper |
| On the complexity and approximation of syntenic distance | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228475 | 1999-05-04 | Paper |
| Register Allocation in Structured Programs | 1999-01-17 | Paper |
| A formal framework for evaluating heuristic programs | 1998-10-13 | Paper |
| Computing the Local Consensus of Trees | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4389880 | 1998-08-10 | Paper |
| A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies | 1998-02-10 | Paper |
| Designing programs that check their work | 1998-02-02 | Paper |
| A quasi-polynomial-time algorithm for sampling words from a context-free language | 1997-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128932 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886090 | 1997-01-14 | Paper |
| Oracles and queries that are sufficient for exact learning | 1996-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886067 | 1996-11-11 | Paper |
| Determining the Evolutionary Tree Using Experiments | 1996-10-16 | Paper |
| An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score | 1996-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886095 | 1996-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886035 | 1996-07-28 | Paper |
| Tree Reconstruction from Partial Orders | 1996-01-28 | Paper |
| Inferring Evolutionary History From DNA Sequences | 1996-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138927 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138970 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036561 | 1993-05-18 | Paper |
| Two Probabilistic Results on Merging | 1993-05-17 | Paper |
| Implicat Representation of Graphs | 1993-04-01 | Paper |
| Triangulating 3-Colored Graphs | 1992-09-27 | Paper |
| Tiling polygons with parallelograms | 1992-06-28 | Paper |
| The generation of random permutations on the fly | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734302 | 1986-01-01 | Paper |
