#### Filter Results:

- Full text PDF available (57)

#### Publication Year

1970

2017

- This year (14)
- Last 5 years (57)
- Last 10 years (78)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Johannes Schneider, Roger Wattenhofer
- PODC
- 2008

We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growth-bounded graphs (GBG) our deterministic algorithm finishes in O(log* n) time, n being the number of nodes. In light of Linial's Ω(log* n) lower bound our algorithm is asymptotically optimal. Our algorithm answers prominent open problems in the ad hoc/sensor… (More)

- Johannes Schneider, Roger Wattenhofer
- PODC
- 2010

We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three randomized algorithms for distributed (vertex or edge) coloring improving on previous algorithms and showing a time/color trade-off. To get a Δ+1 coloring takes time O(log Δ+… (More)

- Johannes Schneider, Roger Wattenhofer
- ISAAC
- 2009

We present two new algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the randomized algorithm RandomizedRounds. Our randomized algorithm is efficient: in some notorious problem instances (e.g., dining philosophers) it is exponentially faster than prior work from a worst case perspective. Both… (More)

- Johannes Schneider, Roger Wattenhofer
- DISC
- 2010

We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks, i.e. the maximal independent set (MIS), broadcasting and coloring problem. We present lower and upper bounds for all three problems for the Growth-Bounded Graph such as the Unit… (More)

- Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider
- 2012 IEEE 53rd Annual Symposium on Foundations of…
- 2012

Symmetry-breaking problems are among the most well studied in the field of distributed computing and yet the most fundamental questions about their complexity remain open. In this article we work in the LOCAL model (where the input graph and underlying distributed network are identical) and study the <i>randomized</i> complexity of four fundamental… (More)

- Johannes Schneider, Roger Wattenhofer
- Distributed Computing
- 2010

We present a novel distributed algorithm for the maximal independent set problem (This is an extended journal version of Schneider and Wattenhofer in Twenty-seventh annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, 2008). On bounded-independence graphs our deterministic algorithm finishes in O(log* n) time, n being the number of… (More)

- H.-Christian Estler, Martín Nordio, Carlo A. Furia, Bertrand Meyer, Johannes Schneider
- Empirical Software Engineering
- 2012

In globally distributed software development, does it matter being agile rather than structured? To answer this question, this paper presents an extensive case study that compares agile (Scrum, XP, etc.) vs. structured (RUP, waterfall) processes to determine if the choice of process impacts aspects such as the overall success and economic savings of… (More)

- David Hasenfratz, Johannes Schneider, Roger Wattenhofer
- 2010 International Conference on High Performance…
- 2010

We analyze and present different strategies to adapt the load in transactional memory systems based on contention. Our experimental results show a substantial overall improvement for our best performing strategies QuickAdapter and AbortBackoff on the throughput when compared to the best existing contention management policies (without load adaption).… (More)

- Johannes Schneider, Roger Wattenhofer
- PODC
- 2009

We present a randomized coloring algorithm for the <i>unstructured radio network model</i>, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unknown but geometric network topology. The current state-of-the-art coloring algorithm needs with high probability <i>O</i>(Δ ∙ log <i>n</i>) time and uses… (More)

- Thomas Ziesemer, Steven Brakman, +7 authors Gerd Weinrich
- 2005

In this paper the monopolistic competition model of Dixit and Stiglitz for the goods market and the search unemployment model of Pissarides are combined. The Pissarides part loses its Walrasian goods market and the Dixit–Stiglitz part loses its Walrasian labour market. Pissarides’ results now depend on the degree of competition. In the Dixit–Stiglitz part… (More)