Michael Feldmann
YOU?
Author Swipe
View article: Parasitism and branchitis in various fish species from 4 Cook County, Illinois inland freshwater lakes, 5-year survey, 2017–2021
Parasitism and branchitis in various fish species from 4 Cook County, Illinois inland freshwater lakes, 5-year survey, 2017–2021 Open
We investigated disease trends of concern for fish or public health in a 5-y (2017–2021) prospective survey of fish in Cook County, IL, inland lakes. Lesions were assessed in relation to fish species, lake type and location, season and col…
View article: Near-Shortest Path Routing in Hybrid Communication Networks
Near-Shortest Path Routing in Hybrid Communication Networks Open
Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20] introduced the $\mathsf{HYBRID}$ model, which is based on…
View article: Accelerating Amoebots via Reconfigurable Circuits
Accelerating Amoebots via Reconfigurable Circuits Open
We consider an extension to the geometric amoebot model that allows amoebots to form so-called \emph{circuits}. Given a connected amoebot structure, a circuit is a subgraph formed by the amoebots that permits the instant transmission of si…
View article: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs Open
We consider the problem of computing shortest paths in hybrid networks, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular …
View article: Time- and Space-Optimal Clock Synchronization in the Beeping Model
Time- and Space-Optimal Clock Synchronization in the Beeping Model Open
We consider the clock synchronization problem in the (discrete) beeping model: Given a network of $n$ nodes with each node having a clock value $δ(v) \in \{0,\ldots T-1\}$, the goal is to synchronize the clock values of all nodes such that…
View article: Self-stabilizing Overlays for high-dimensional Monotonic Searchability
Self-stabilizing Overlays for high-dimensional Monotonic Searchability Open
We extend the concept of monotonic searchability for self-stabilizing systems from one to multiple dimensions. A system is self-stabilizing if it can recover to a legitimate state from any initial illegal state. These kind of systems are m…
View article: Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities
Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities Open
We propose two protocols for distributed priority queues (for simplicity denoted 'heap') called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols buil…
View article: Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities
Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities Open
We propose two protocols for distributed priority queues (for simplicity denoted 'heap') called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols buil…
View article: Self-Stabilizing Supervised Publish-Subscribe Systems
Self-Stabilizing Supervised Publish-Subscribe Systems Open
In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing sup…
View article: Skueue: A Scalable and Sequentially Consistent Distributed Queue
Skueue: A Scalable and Sequentially Consistent Distributed Queue Open
We propose a distributed protocol for a queue, called \textsc{Skueue}, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios. \textsc{Skueue} can be used in highly dynamic environments, th…
View article: A Self-Stabilizing General De Bruijn Graph
A Self-Stabilizing General De Bruijn Graph Open
Searching for other participants is one of the most important operations in a distributed system. We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination. Give…