| Publication | Date of Publication | Type |
|---|
| The topology of randomized symmetry-breaking distributed computing | 2024-11-29 | Paper |
| The Topology of Randomized Symmetry-Breaking Distributed Computing | 2024-03-26 | Paper |
| Weighted microscopic image reconstruction | 2024-01-09 | Paper |
| The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication | 2023-10-23 | Paper |
| Lower and upper bounds for deterministic convergecast with labeling schemes | 2023-03-24 | Paper |
| The Generalized Microscopic Image Reconstruction Problem | 2023-02-03 | Paper |
| Randomized strategies for non-additive 3-slope ski rental | 2022-11-11 | Paper |
| The generalized microscopic image reconstruction problem | 2022-09-15 | Paper |
| Hotelling games in fault-prone settings | 2022-06-13 | Paper |
| Mixed preferential attachment model: homophily and minorities in social networks | 2022-05-19 | Paper |
| Weighted microscopic image reconstruction | 2022-03-24 | Paper |
| Nonuniform SINR+Voronoi diagrams are effectively uniform | 2021-07-22 | Paper |
| High entropy random selection protocols | 2021-03-26 | Paper |
| Analyzing Narratives in Social Networks | 2021-02-18 | Paper |
| Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743416 | 2019-05-10 | Paper |
| Cover time and mixing time of random walks on dynamic graphs | 2018-09-05 | Paper |
| Nonuniform SINR+Voroni diagrams are effectively uniform | 2018-08-24 | Paper |
| Improved Distributed Approximate Matching | 2018-08-02 | Paper |
| The Topology of Wireless Communication | 2018-08-02 | Paper |
| Distance in the Forest Fire Model How far are you from Eve? | 2018-07-16 | Paper |
| Big data interpolation using functional representation | 2018-04-17 | Paper |
| The topology of wireless communication on a line | 2018-02-16 | Paper |
| Assortative Mixing Equilibria in Social Network Games | 2017-11-01 | Paper |
| Homophily and the Glass Ceiling Effect in Social Networks | 2017-05-19 | Paper |
| Distributed Verification Using Mobile Agents | 2016-12-19 | Paper |
| Sparsifying Congested Cliques and Core-Periphery Networks | 2016-12-01 | Paper |
| Distributed MST for constant diameter graphs | 2016-03-04 | Paper |
| Core Size and Densification in Preferential Attachment Networks | 2015-11-04 | Paper |
| Order optimal information spreading using algebraic gossip | 2015-09-11 | Paper |
| Geometrically aware communication in random wireless networks | 2015-08-03 | Paper |
| Probabilistic connectivity threshold for directional antenna widths | 2015-05-22 | Paper |
| Self-adjusting grid networks to minimize expected path length | 2015-05-22 | Paper |
| Average-case analysis of greedy packet scheduling (extended astract) | 2015-03-03 | Paper |
| Buffer overflow management in QoS switches | 2015-02-27 | Paper |
| Collaborative search on the plane without communication | 2014-12-05 | Paper |
| Bounds for algebraic gossip on graphs | 2014-10-16 | Paper |
| Testing the irreducibility of nonsquare Perron-Frobenius systems | 2014-08-28 | Paper |
| Nearly optimal FIFO buffer management for DiffServ | 2014-07-25 | Paper |
| SINR diagrams | 2014-07-23 | Paper |
| Distributed Computing on Core-Periphery Networks: Axiom-Based Design | 2014-07-01 | Paper |
| The topology of wireless communication | 2014-06-05 | Paper |
| Distributed approximate matching | 2014-03-13 | Paper |
| SINR Diagrams | 2014-02-17 | Paper |
| Probabilistic Connectivity Threshold for Directional Antenna Widths | 2013-12-17 | Paper |
| Self-adjusting Grid Networks to Minimize Expected Path Length | 2013-12-17 | Paper |
| From balls and bins to points and vertices | 2013-12-11 | Paper |
| Order optimal information spreading using algebraic gossip | 2013-08-26 | Paper |
| Distributed MST for constant diameter graphs | 2013-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910746 | 2013-03-19 | Paper |
| A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model | 2012-10-11 | Paper |
| Rent, lease, or buy: randomized algorithms for multislope ski rental | 2012-09-12 | Paper |
| On the connectivity threshold for general uniform metric spaces | 2012-01-18 | Paper |
| Connectivity guarantees for wireless networks with directional antennas | 2011-12-28 | Paper |
| Many Random Walks Are Faster Than One | 2011-08-16 | Paper |
| A Lower Bound for Network Navigability | 2011-03-15 | Paper |
| Distributed Weighted Stable Marriage Problem | 2010-06-17 | Paper |
| Ski rental with two general options | 2010-06-09 | Paper |
| Distributed Approximate Matching | 2010-04-29 | Paper |
| The distant-2 chromatic number of random proximity and random geometric graphs | 2010-04-19 | Paper |
| Recovering the long-range links in augmented graphs | 2010-04-06 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices | 2010-01-29 | Paper |
| On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources | 2009-10-29 | Paper |
| Universal augmentation schemes for network navigability | 2009-05-28 | Paper |
| Efficient Distributed Weighted Matchings on Trees | 2009-03-12 | Paper |
| High Entropy Random Selection Protocols | 2009-02-17 | Paper |
| How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) | 2008-08-28 | Paper |
| Recovering the Long-Range Links in Augmented Graphs | 2008-07-10 | Paper |
| Note on deleting a vertex and weak interlacing of the Laplacian spectrum | 2008-05-28 | Paper |
| A game of timing and visibility | 2008-05-08 | Paper |
| A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability | 2008-03-11 | Paper |
| Collaborate with strangers to find own preferences | 2008-02-18 | Paper |
| Sequences Characterizing k-Trees | 2007-09-10 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| The minimal spanning tree and the upper box dimension | 2006-02-17 | Paper |
| Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds | 2005-10-28 | Paper |
| On Cayley's formula for counting trees in nested interval graphs | 2005-03-11 | Paper |
| Buffer Overflow Management in QoS Switches | 2005-02-21 | Paper |
| New Stability Results for Adversarial Queuing | 2005-02-21 | Paper |
| Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model | 2005-02-21 | Paper |
| Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks | 2004-01-08 | Paper |
| Nearly optimal FIFO buffer management for two packet classes. | 2003-08-07 | Paper |
| Average-case analysis of greedy packet scheduling | 2003-05-04 | Paper |
| A note on randomized mutual search. | 2002-07-25 | Paper |
