| Publication | Date of Publication | Type |
|---|
| Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes | 2024-02-28 | Paper |
| The parallel complexity of approximating the High Degree Subgraph problem | 2023-03-21 | Paper |
| Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations | 2022-11-09 | Paper |
| Efficient constructions of Hitting Sets for systems of linear functions | 2022-11-09 | Paper |
| E-complete sets do not have optimal polynomial time approximations | 2022-08-18 | Paper |
| Every Schnyder drawing is a greedy embedding | 2020-01-22 | Paper |
| Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs | 2018-07-04 | Paper |
| Optimal lower bounds on the multiparty communication complexity | 2017-12-04 | Paper |
| Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness | 2017-11-16 | Paper |
| On the efficiency of routing in sensor networks | 2012-10-23 | Paper |
| Virtual raw anchor coordinates: a new localization paradigm | 2012-10-11 | Paper |
| Energy-Balanced Data Propagation inWireless Sensor Networks | 2011-04-05 | Paper |
| Stochastic models and adaptive algorithms for energy balance in sensor networks | 2010-10-06 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| High level communication functionalities for wireless sensor networks | 2008-11-12 | Paper |
| A framework for probabilistic numerical evaluation of sensor networks | 2008-06-20 | Paper |
| Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks | 2007-09-14 | Paper |
| Energy optimal data propagation in wireless sensor networks | 2007-03-02 | Paper |
| Towards a dynamical model for wireless sensor networks | 2005-12-05 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Algorithmic Aspects of Wireless Sensor Networks | 2005-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818849 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536214 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779814 | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247467 | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938624 | 2000-07-10 | Paper |
| Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs | 2000-01-12 | Paper |
| Weak Random Sources, Hitting Sets, and BPP Simulations | 1999-10-28 | Paper |
| A case study of de-randomization methods for combinatorial approximation algorithms | 1999-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251082 | 1999-06-17 | Paper |
| A new general derandomization method | 1999-01-05 | Paper |
| Lower bounds on the multiparty communication complexity | 1998-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395335 | 1998-08-04 | Paper |
| Bisecting de Bruijn and Kautz graphs | 1998-07-28 | Paper |
| Optimal bounds for the approximation of Boolean functions and some applications | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390865 | 1998-05-26 | Paper |
| Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4895237 | 1997-01-22 | Paper |
| CONJUNCTIVE AND DISJUNCTIVE REDUCIBILITIES TO SPARSE AND TALLY SETS REVISITED | 1995-10-29 | Paper |
| A note on the density of oracle decreasing time-space complexity | 1994-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016511 | 1993-01-16 | Paper |
| On the polynomial IO-complexity | 1989-01-01 | Paper |
| A note on the best-case complexity | 1989-01-01 | Paper |
| On the IO-complexity and approximation languages | 1988-01-01 | Paper |
