| Publication | Date of Publication | Type |
|---|
| Randomized parallel algorithms | 2024-06-21 | Paper |
Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes
Graph-Theoretic Concepts in Computer Science | 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
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Efficient constructions of hitting sets for systems of linear functions
Lecture Notes in Computer Science | 2022-11-09 | Paper |
E-complete sets do not have optimal polynomial time approximations
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Every Schnyder drawing is a greedy embedding
Theoretical Computer Science | 2020-01-22 | Paper |
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Automata, Languages and Programming | 2018-07-04 | Paper |
Optimal lower bounds on the multiparty communication complexity
STACS 95 | 2017-12-04 | Paper |
Optimal bounds on the approximation of Boolean functions with consequences on the concept of hardness
STACS 96 | 2017-11-16 | Paper |
On the efficiency of routing in sensor networks
Journal of Parallel and Distributed Computing | 2012-10-23 | Paper |
Virtual raw anchor coordinates: a new localization paradigm
Theoretical Computer Science | 2012-10-11 | Paper |
Energy-Balanced Data Propagation inWireless Sensor Networks
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Stochastic models and adaptive algorithms for energy balance in sensor networks
Theory of Computing Systems | 2010-10-06 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
High level communication functionalities for wireless sensor networks
Theoretical Computer Science | 2008-11-12 | Paper |
A framework for probabilistic numerical evaluation of sensor networks
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks
Experimental Algorithms | 2007-09-14 | Paper |
Energy optimal data propagation in wireless sensor networks
Journal of Parallel and Distributed Computing | 2007-03-02 | Paper |
Towards a dynamical model for wireless sensor networks
Theoretical Computer Science | 2005-12-05 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithmic Aspects of Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 2102761 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 1759287 (Why is no real title available?) | 2002-11-28 | Paper |
| scientific article; zbMATH DE number 1302200 (Why is no real title available?) | 2000-09-26 | Paper |
| scientific article; zbMATH DE number 1405644 (Why is no real title available?) | 2000-07-10 | Paper |
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Theoretical Computer Science | 2000-01-12 | Paper |
Weak Random Sources, Hitting Sets, and BPP Simulations
SIAM Journal on Computing | 1999-10-28 | Paper |
A case study of de-randomization methods for combinatorial approximation algorithms
Journal of Combinatorial Optimization | 1999-07-27 | Paper |
| scientific article; zbMATH DE number 1304350 (Why is no real title available?) | 1999-06-17 | Paper |
A new general derandomization method
Journal of the ACM | 1999-01-05 | Paper |
Lower bounds on the multiparty communication complexity
Journal of Computer and System Sciences | 1998-12-08 | Paper |
| scientific article; zbMATH DE number 1163722 (Why is no real title available?) | 1998-08-04 | Paper |
Bisecting de Bruijn and Kautz graphs
Discrete Applied Mathematics | 1998-07-28 | Paper |
Optimal bounds for the approximation of Boolean functions and some applications
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1156868 (Why is no real title available?) | 1998-05-26 | Paper |
Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 934538 (Why is no real title available?) | 1997-01-22 | Paper |
CONJUNCTIVE AND DISJUNCTIVE REDUCIBILITIES TO SPARSE AND TALLY SETS REVISITED
International Journal of Foundations of Computer Science | 1995-10-29 | Paper |
A note on the density of oracle decreasing time-space complexity
Theoretical Computer Science | 1994-09-25 | Paper |
| scientific article; zbMATH DE number 88935 (Why is no real title available?) | 1993-01-16 | Paper |
A note on the best-case complexity
Information Processing Letters | 1989-01-01 | Paper |
On the polynomial IO-complexity
Information Processing Letters | 1989-01-01 | Paper |
On the IO-complexity and approximation languages
Information Processing Letters | 1988-01-01 | Paper |
