The following pages link to Stefan Schmid (Q324620):
Displaying 43 items.
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Congestion-Free Rerouting of Flows on DAGs (Q5002832) (← links)
- Integrality properties in the moduli space of elliptic curves: CM case (Q5009092) (← links)
- (Q5072475) (← links)
- (Q5072479) (← links)
- (Q5075823) (← links)
- Local Fast Segment Rerouting on Hypercubes (Q5091084) (← links)
- The Value of Information in Selfish Routing (Q5100972) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
- Does Preprocessing Help under Congestion? (Q5145217) (← links)
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs (Q5170310) (← links)
- When selfish meets evil (Q5177262) (← links)
- On the topologies formed by selfish peers (Q5177274) (← links)
- A Distributed and Oblivious Heap (Q5321687) (← links)
- A Local Constant Factor MDS Approximation for Bounded Genus Graphs (Q5361940) (← links)
- Manipulation in Games (Q5387771) (← links)
- SKIP <sup>+</sup> (Q5501939) (← links)
- Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning (Q5855272) (← links)
- Integrality Properties in the Moduli Space of Elliptic Curves: Isogeny Case (Q5866492) (← links)
- (Q5874254) (← links)
- Walking through waypoints (Q5918830) (← links)
- Walking through waypoints (Q5919407) (← links)
- Self-adjusting grid networks (Q6044463) (← links)
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks (Q6045214) (← links)
- Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model (Q6083443) (← links)
- (Q6161045) (← links)
- (Q6161046) (← links)
- (Q6161050) (← links)
- (Q6161055) (← links)
- Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation (Q6201318) (← links)
- Demand-aware network designs of bounded degree (Q6487477) (← links)
- Brief announcement: What can(not) be perfectly rerouted locally (Q6535045) (← links)
- Self-adjusting linear networks (Q6536343) (← links)
- Sinkless orientation made simple (Q6539123) (← links)
- The time complexity of consensus under oblivious message adversaries (Q6547208) (← links)
- R2: boosting liquidity in payment channel networks with online admission control (Q6573977) (← links)
- Know the person behind the papers. Today: Laura Kovács (Q6591396) (← links)
- Know the person behind the papers. Today: Moshe Vardi (Q6591397) (← links)
- Know the person behind the papers. Today: Sergio Rajsbaum (Q6591399) (← links)
- Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks (Q6610313) (← links)
- The time complexity of consensus under oblivious message adversaries (Q6610374) (← links)
- Dynamic maintenance of monotone dynamic programs and applications (Q6615144) (← links)
- Online algorithms with randomly infused advice (Q6656995) (← links)
