Stefan Schmid

From MaRDI portal
Revision as of 09:24, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:324620

Available identifiers

zbMath Open schmid.stefanDBLP58/3289-1WikidataQ102526477 ScholiaQ102526477MaRDI QIDQ324620

List of research outcomes





PublicationDate of PublicationType
Online algorithms with randomly infused advice2025-01-06Paper
Dynamic maintenance of monotone dynamic programs and applications2024-10-08Paper
Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks2024-09-25Paper
The time complexity of consensus under oblivious message adversaries2024-09-25Paper
Know the person behind the papers. Today: Moshe Vardi2024-08-21Paper
Know the person behind the papers. Today: Sergio Rajsbaum2024-08-21Paper
Know the person behind the papers. Today: Laura Kovács2024-08-21Paper
R2: boosting liquidity in payment channel networks with online admission control2024-07-17Paper
The time complexity of consensus under oblivious message adversaries2024-05-30Paper
Sinkless orientation made simple2024-05-14Paper
Self-adjusting linear networks2024-04-19Paper
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear2024-03-26Paper
Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation2024-02-20Paper
https://portal.mardi4nfdi.de/entity/Q61908732024-02-06Paper
https://portal.mardi4nfdi.de/entity/Q61908802024-02-06Paper
https://portal.mardi4nfdi.de/entity/Q61474242024-01-15Paper
Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation2024-01-11Paper
Self-adjusting linear networks with ladder demand graph2024-01-11Paper
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model2023-12-08Paper
Brief announcement: What can(not) be perfectly rerouted locally2023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q61610452023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610462023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610472023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610482023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610492023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610502023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610512023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610522023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610532023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610552023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q61610612023-06-26Paper
\textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks2023-05-26Paper
Self-adjusting grid networks2023-05-19Paper
https://portal.mardi4nfdi.de/entity/Q58742542023-02-07Paper
Demand-aware network designs of bounded degree2023-02-03Paper
Dynamically optimal self-adjusting single-source tree networks2022-10-13Paper
Integrality Properties in the Moduli Space of Elliptic Curves: Isogeny Case2022-09-22Paper
The Value of Information in Selfish Routing2022-09-01Paper
Local Fast Segment Rerouting on Hypercubes2022-07-21Paper
Faster pushdown reachability analysis with applications in network verification2022-06-22Paper
https://portal.mardi4nfdi.de/entity/Q50758232022-05-11Paper
https://portal.mardi4nfdi.de/entity/Q50724752022-04-28Paper
https://portal.mardi4nfdi.de/entity/Q50724792022-04-28Paper
\textit{Renaissance}: a self-stabilizing distributed SDN control plane using in-band communications2022-04-04Paper
Integrality properties in the moduli space of elliptic curves: CM case2021-08-19Paper
Resilient capacity-aware routing2021-08-04Paper
Congestion-Free Rerouting of Flows on DAGs2021-07-28Paper
Conic formation in presence of faulty robots2021-07-08Paper
Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning2021-03-15Paper
Does Preprocessing Help under Congestion?2021-01-20Paper
Competitive clustering of stochastic communication patterns on a ring2021-01-15Paper
Dynamic Balanced Graph Partitioning2020-10-28Paper
The many faces of graph dynamics2020-08-11Paper
Demand-aware network designs of bounded degree2020-06-15Paper
Walking through waypoints2020-05-21Paper
Self-adjusting linear networks2020-03-03Paper
Walking through waypoints2020-02-12Paper
Distributed Dominating Set Approximations beyond Planar Graphs2019-11-25Paper
Principles of Robust Medium Access and an Application to Leader Election2018-10-30Paper
Online balanced repartitioning2018-08-16Paper
https://portal.mardi4nfdi.de/entity/Q31749432018-07-18Paper
Sade: competitive MAC under adversarial SINR2018-06-01Paper
Topological Self-Stabilization with Name-Passing Process Calculi2018-03-21Paper
rDAN: toward robust demand-aware network designs2018-03-16Paper
Large cuts with local algorithms on triangle-free graphs2017-10-24Paper
A Local Constant Factor MDS Approximation for Bounded Genus Graphs2017-09-29Paper
Data locality and replica aware virtual cluster embeddings2017-09-28Paper
An Approximation Algorithm for Path Computation and Function Placement in SDNs2016-12-01Paper
Transiently Consistent SDN Updates: Being Greedy is Hard2016-12-01Paper
Upper and lower bounds for deterministic broadcast in powerline communication networks2016-10-17Paper
Scheduling Loop-free Network Updates2016-03-23Paper
Online Admission Control and Embedding of Service Chains2016-01-08Paper
SKIP +2015-08-14Paper
Adversarial topology discovery in network virtualization environments: a threat for ISPs?2015-07-08Paper
When selfish meets evil2015-03-10Paper
On the topologies formed by selfish peers2015-03-10Paper
A note on the parallel runtime of self-stabilizing graph linearization2015-02-05Paper
Small strain elasto-plastic multiphase-field model2015-01-23Paper
Distributed computation of the mode2014-12-12Paper
Tight bounds for delay-sensitive aggregation2014-12-12Paper
Competitive and fair throughput for co-existing networks under adversarial interference2014-12-05Paper
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs2014-07-23Paper
Misleading stars: what cannot be measured in the internet?2014-03-25Paper
Competitive and deterministic embeddings of virtual networks2014-01-10Paper
Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie2013-12-17Paper
Competitive throughput in multi-hop wireless networks despite adaptive jamming2013-08-26Paper
Towards worst-case churn resistant peer-to-peer systems2013-06-28Paper
Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs2012-10-11Paper
COST AND COMPLEXITY OF HARNESSING GAMES WITH PAYMENTS2012-09-04Paper
Misleading stars: what cannot be measured in the internet?2011-10-28Paper
Topological implications of selfish neighbor selection in unstructured peer-to-peer networks2011-09-20Paper
The Price of Malice: A Game-Theoretic Framework for Malicious Behavior in Distributed Systems2011-01-31Paper
A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks2010-09-10Paper
https://portal.mardi4nfdi.de/entity/Q35754682010-07-27Paper
Online Function Tracking with Generalized Penalties2010-06-22Paper
Towards Network Games with Social Preferences2010-06-17Paper
Event Extent Estimation2010-06-17Paper
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization2010-04-27Paper
A Self-stabilizing and Local Delaunay Graph Construction2009-12-17Paper
A Distributed and Oblivious Heap2009-07-14Paper
Mechanism Design by Creditability2009-03-03Paper
Push-to-Pull Peer-to-Peer Live Streaming2008-09-02Paper
Distributed Disaster Disclosure2008-07-15Paper
Manipulation in Games2008-05-27Paper
A highly flexible service composition framework for real-life networks2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q44204172003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q48010222003-04-06Paper

Research outcomes over time

This page was built for person: Stefan Schmid