The following pages link to Stefan Schmid (Q324620):
Displaying 50 items.
- Upper and lower bounds for deterministic broadcast in powerline communication networks (Q324622) (← links)
- Competitive throughput in multi-hop wireless networks despite adaptive jamming (Q360275) (← links)
- Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
- Small strain elasto-plastic multiphase-field model (Q487903) (← links)
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
- Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs (Q714851) (← links)
- Sade: competitive MAC under adversarial SINR (Q1635833) (← links)
- Online balanced repartitioning (Q1660940) (← links)
- rDAN: toward robust demand-aware network designs (Q1705692) (← links)
- Conic formation in presence of faulty robots (Q2037836) (← links)
- Resilient capacity-aware routing (Q2044217) (← links)
- Dynamically optimal self-adjusting single-source tree networks (Q2081610) (← links)
- \textit{Renaissance}: a self-stabilizing distributed SDN control plane using in-band communications (Q2121474) (← links)
- Faster pushdown reachability analysis with applications in network verification (Q2147193) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
- A note on the parallel runtime of self-stabilizing graph linearization (Q2254491) (← links)
- Self-adjusting linear networks (Q2303298) (← links)
- Adversarial topology discovery in network virtualization environments: a threat for ISPs? (Q2353249) (← links)
- Towards worst-case churn resistant peer-to-peer systems (Q2377141) (← links)
- Data locality and replica aware virtual cluster embeddings (Q2405895) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Misleading stars: what cannot be measured in the internet? (Q2441536) (← links)
- A highly flexible service composition framework for real-life networks (Q2506766) (← links)
- Scheduling loop-free network updates: it's good to relax! (Q2796237) (← links)
- An Approximation Algorithm for Path Computation and Function Placement in SDNs (Q2835038) (← links)
- Transiently Consistent SDN Updates: Being Greedy is Hard (Q2835039) (← links)
- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie (Q2868634) (← links)
- Cost and complexity of harnessing games with payments (Q2907961) (← links)
- Competitive and fair throughput for co-existing networks under adversarial interference (Q2933804) (← links)
- Distributed computation of the mode (Q2934328) (← links)
- Tight bounds for delay-sensitive aggregation (Q2934345) (← links)
- The Price of Malice: A Game-Theoretic Framework for Malicious Behavior in Distributed Systems (Q3071039) (← links)
- (Q3174943) (← links)
- The many faces of graph dynamics (Q3303089) (← links)
- Online Admission Control and Embedding of Service Chains (Q3460710) (← links)
- Distributed Disaster Disclosure (Q3512463) (← links)
- Push-to-Pull Peer-to-Peer Live Streaming (Q3523223) (← links)
- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization (Q3557028) (← links)
- Towards Network Games with Social Preferences (Q3569112) (← links)
- Event Extent Estimation (Q3569116) (← links)
- Online Function Tracking with Generalized Penalties (Q3569905) (← links)
- (Q3575468) (← links)
- A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks (Q3588303) (← links)
- Mechanism Design by Creditability (Q3611973) (← links)
- A Self-stabilizing and Local Delaunay Graph Construction (Q3652263) (← links)
- (Q4420417) (← links)
- Topological Self-Stabilization with Name-Passing Process Calculi (Q4608671) (← links)
- (Q4801022) (← links)
- Principles of Robust Medium Access and an Application to Leader Election (Q4962158) (← links)
