The following pages link to Roger Wattenhofer (Q249057):
Displaying 50 items.
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Good programming in transactional memory: game theory meets multicore architecture (Q553350) (← links)
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
- Monitoring churn in wireless networks (Q714767) (← links)
- Dynamic analysis of the arrow distributed protocol (Q863197) (← links)
- How many ants does it take to find the food? (Q896147) (← links)
- An inherent bottleneck in distributed counting (Q1130325) (← links)
- Randomness vs. time in anonymous networks (Q1664141) (← links)
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs (Q1686112) (← links)
- The counting pyramid: an adaptive distributed counting scheme (Q1881286) (← links)
- Wireless network algorithmics (Q2075769) (← links)
- Space complexity of streaming algorithms on universal quantum computers (Q2110722) (← links)
- Two-agent tree evacuation (Q2117727) (← links)
- Timelocked bribing (Q2145364) (← links)
- \textsc{Brick}: asynchronous incentive-compatible payment channels (Q2147243) (← links)
- Default ambiguity: finding the best solution to the clearing problem (Q2152134) (← links)
- Byzantine preferential voting (Q2190409) (← links)
- A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q2220396) (← links)
- Ride the lightning: the game theory of payment channels (Q2226588) (← links)
- \textsc{Cerberus} channels: incentivizing watchtowers for Bitcoin (Q2226597) (← links)
- Fast size approximation of a radio network in beeping model (Q2292914) (← links)
- Towards worst-case churn resistant peer-to-peer systems (Q2377141) (← links)
- Coloring unstructured radio networks (Q2377260) (← links)
- Deterministic multi-channel information exchange (Q2396723) (← links)
- Theoretical aspects of connectivity-based multi-hop positioning (Q2575092) (← links)
- Competitive concurrent distributed queuing (Q2787673) (← links)
- Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks (Q2787691) (← links)
- Clairvoyant Mechanisms for Online Auctions (Q2817844) (← links)
- Approximating the Size of a Radio Network in Beeping Model (Q2835036) (← links)
- On Competitive Recommendations (Q2859208) (← links)
- (Q2889027) (← links)
- COST AND COMPLEXITY OF HARNESSING GAMES WITH PAYMENTS (Q2907961) (← links)
- Convergence in (Social) Influence Networks (Q2920968) (← links)
- Optimal distributed all pairs shortest paths and applications (Q2933812) (← links)
- Tight bounds for delay-sensitive aggregation (Q2934345) (← links)
- MIS on trees (Q2943380) (← links)
- Anonymous networks (Q2943614) (← links)
- Geometric ad-hoc routing (Q2943747) (← links)
- Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model (Q3069061) (← links)
- The Price of Malice: A Game-Theoretic Framework for Malicious Behavior in Distributed Systems (Q3071039) (← links)
- Distributed stable matching with similar preference lists (Q3174935) (← links)
- Local Computation (Q3177774) (← links)
- Hard-Potato routing (Q3191994) (← links)
- piChain: When a Blockchain meets Paxos (Q3300800) (← links)
- (Q3396596) (← links)
- Fast and Simple Algorithms for Weighted Perfect Matching (Q3439168) (← links)
