| Publication | Date of Publication | Type |
|---|
| Search via Parallel Lévy Walks on Z2 | 2024-03-26 | Paper |
| Improved non-approximability results for vertex cover with density constraints | 2024-01-29 | Paper |
| Expansion and flooding in dynamic random networks with node churn | 2023-10-12 | Paper |
| Percolation and epidemic processes in one-dimensional small-world networks (extended abstract) | 2023-07-26 | Paper |
| The parallel complexity of approximating the High Degree Subgraph problem | 2023-03-21 | Paper |
| Consensus vs Broadcast, with and without Noise | 2023-02-03 | Paper |
| Efficient constructions of Hitting Sets for systems of linear functions | 2022-11-09 | Paper |
| Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions | 2022-09-01 | Paper |
| Bond Percolation in Small-World Graphs with Power-Law Distribution | 2022-05-18 | Paper |
| Parallel load balancing on constrained client-server topologies | 2021-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005128 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009564 | 2021-08-04 | Paper |
| Finding a Bounded-Degree Expander Inside a Dense One | 2021-02-02 | Paper |
| Find Your Place: Simple Distributed Algorithms for Community Detection | 2020-08-18 | Paper |
| Self-stabilizing repeated balls-into-bins | 2019-03-21 | Paper |
| Stabilizing Consensus with Many Opinions | 2018-07-16 | Paper |
| Find Your Place: Simple Distributed Algorithms for Community Detection | 2018-07-16 | Paper |
| Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs | 2018-07-04 | Paper |
| Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness | 2017-11-16 | Paper |
| Ignore or Comply? | 2017-10-11 | Paper |
| Plurality Consensus in the Gossip Model | 2017-10-05 | Paper |
| Simple dynamics for plurality consensus | 2017-09-04 | Paper |
| Rumor spreading in random evolving graphs | 2016-03-22 | Paper |
| Distributed multi-broadcast in unknown radio networks | 2016-03-04 | Paper |
| Distributed community detection in dynamic graphs | 2015-05-22 | Paper |
| Information spreading in dynamic graphs | 2015-03-25 | Paper |
| Fast flooding over Manhattan | 2015-03-02 | Paper |
| Flooding time in edge-Markovian dynamic graphs | 2014-12-12 | Paper |
| Information spreading in dynamic graphs | 2014-12-05 | Paper |
| Parsimonious flooding in geometric random-walks | 2014-09-22 | Paper |
| Communication in dynamic radio networks | 2014-03-13 | Paper |
| Distributed Community Detection in Dynamic Graphs | 2013-12-17 | Paper |
| Rumor Spreading in Random Evolving Graphs | 2013-09-17 | Paper |
| Fast flooding over Manhattan | 2013-06-25 | Paper |
| Optimal gossiping in geometric radio networks in the presence of dynamical faults | 2012-06-29 | Paper |
| Parsimonious Flooding in Geometric Random-Walks | 2011-10-28 | Paper |
| Flooding Time of Edge-Markovian Evolving Graphs | 2011-07-18 | Paper |
| Information Spreading in Dynamic Networks: An Analytical Approach | 2011-04-05 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| MANETS: High Mobility Can Make Up for Low Transmission Power | 2009-07-14 | Paper |
| Broadcasting in dynamic radio networks | 2009-04-30 | Paper |
| Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks | 2009-03-12 | Paper |
| Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults | 2008-09-17 | Paper |
| Minimum-energy broadcast and disk cover in grid wireless networks | 2008-06-24 | Paper |
| On the bounded-hop MST problem on random Euclidean instances | 2007-10-02 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| On the approximability of the range assignment problem on radio networks in presence of selfish agents | 2005-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818849 | 2004-09-24 | Paper |
| Round robin is optimal for fault-tolerant broadcasting on wireless networks | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427854 | 2003-09-14 | Paper |
| Distributed broadcast in radio networks of unknown topology. | 2003-08-17 | Paper |
| The minimum range assignment problem on linear radio networks | 2003-06-02 | Paper |
| The minimum broadcast range assignment problem on linear multi-hop wireless networks. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796195 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785466 | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768369 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762500 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753931 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501569 | 2001-12-05 | 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 |
| Improved non-approximability results for minimum vertex cover with density constraints | 2000-01-12 | Paper |
| Weak Random Sources, Hitting Sets, and BPP Simulations | 1999-10-28 | Paper |
| The parallel complexity of approximating the high degree subgraph problem | 1999-01-12 | Paper |
| A new general derandomization method | 1999-01-05 | 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 |
| The reachability problem for finite cellular automata | 1997-02-28 | 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 |
| OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS | 1996-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848814 | 1995-09-20 | Paper |
