| On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph | 0 | 0.34 | 2022 |
| Distributed Graph Realizations | 0 | 0.34 | 2022 |
| Graph Realization of Distance Sets | 0 | 0.34 | 2022 |
| On Vertex-Weighted Graph Realizations. | 0 | 0.34 | 2021 |
| On Vertex-Weighted Graph Realizations. | 0 | 0.34 | 2021 |
| Efficiently Realizing Interval Sequences* | 0 | 0.34 | 2020 |
| Message lower bounds via efficient network synchronization. | 3 | 0.40 | 2020 |
| Graph Realizations - Maximum Degree in Vertex Neighborhoods. | 0 | 0.34 | 2020 |
| Majority vote and monopolies in social networks. | 0 | 0.34 | 2019 |
| Mixed fault tolerance in server assignment: Combining reinforcement and backup | 0 | 0.34 | 2018 |
| The topology of wireless communication on a line. | 0 | 0.34 | 2018 |
| Maintaining Communication in Multi-Robot Tree Coverage. | 1 | 0.36 | 2017 |
| Assortative Mixing Equilibria In Social Network Games | 1 | 0.36 | 2017 |
| Discovery Through Gossip. | 0 | 0.34 | 2016 |
| Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach. | 0 | 0.34 | 2016 |
| Homophily and the Glass Ceiling Effect in Social Networks | 4 | 0.47 | 2015 |
| Random Preferential Attachment Hypergraphs. | 0 | 0.34 | 2015 |
| Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. | 0 | 0.34 | 2015 |
| The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication | 4 | 0.42 | 2015 |
| Core Size and Densification in Preferential Attachment Networks | 5 | 0.51 | 2015 |
| Truth tellers and liars with fewer questions | 0 | 0.34 | 2015 |
| Testing the irreducibility of nonsquare Perron-Frobenius systems | 0 | 0.34 | 2014 |
| Efficient distributed source detection with limited bandwidth | 34 | 1.00 | 2013 |
| Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. | 8 | 0.46 | 2013 |
| Prize for innovation in distributed computing: awarded to Roger Wattenhofer | 0 | 0.34 | 2013 |
| Randomized distributed decision (invited lecture abstract) | 0 | 0.34 | 2013 |
| Randomized distributed decision | 5 | 0.46 | 2012 |
| On the approximability of some degree-constrained subgraph problems | 8 | 0.48 | 2012 |
| SINR diagram with interference cancellation | 9 | 0.62 | 2012 |
| Gathering Despite Mischief | 11 | 0.49 | 2012 |
| f-Sensitivity Distance Oracles and Routing Schemes | 24 | 0.84 | 2012 |
| The fault-tolerant capacitated K-center problem. | 1 | 0.35 | 2012 |
| Sublinear bounds for randomized leader election. | 7 | 0.47 | 2012 |
| Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings | 45 | 3.09 | 2011 |
| On approximating the d-girth of a graph | 1 | 0.36 | 2011 |
| Local Distributed Decision | 25 | 0.95 | 2011 |
| SINR maps: properties and applications | 1 | 0.35 | 2011 |
| Localized spanner construction for ad hoc networks with variable transmission range | 6 | 0.44 | 2010 |
| A near-linear-time algorithm for computing replacement paths in planar directed graphs | 4 | 0.41 | 2010 |
| Broadcasting in udg radio networks with unknown topology | 13 | 0.54 | 2009 |
| A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs | 6 | 0.81 | 2009 |
| Local spreading algorithms for autonomous robot systems | 39 | 1.51 | 2008 |
| Label-guided graph exploration by a finite automaton | 39 | 1.40 | 2008 |
| Asynchronous Resource Discovery in Peer to Peer Networks | 13 | 0.85 | 2007 |
| Feasibility and complexity of broadcasting with random transmission failures | 45 | 1.55 | 2007 |
| Energy and time efficient broadcasting in known topology radio networks | 3 | 0.37 | 2007 |
| Average stretch analysis of compact routing schemes | 1 | 0.36 | 2007 |
| Fault-tolerant gathering algorithms for autonomous mobile robots | 83 | 5.34 | 2006 |
| Adaptive Collaboration in Peer-to-Peer Systems | 5 | 0.50 | 2005 |
| Collaboration of untrusting peers with changing interests | 16 | 1.00 | 2004 |
