Author image not provided
 Christian Scheideler

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article10.02
Citation Count1,072
Publication count107
Publication years1995-2017
Available for download54
Average downloads per article366.39
Downloads (cumulative)19,785
Downloads (12 Months)934
Downloads (6 Weeks)153
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Advisor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


112 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 112
Result page: 1 2 3 4 5 6

Sort by:

1 published by ACM
July 2018 TOPIC '18: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 20,   Downloads (12 Months): 27,   Downloads (Overall): 27

Full text available: PDFPDF
In my presentation I will propose a new link-layer model for distributed computing based on so-called relays that promises to be useful for the design of robust and secure distributed systems based on overlay networks and, in particular, for fog computing.
Keywords: admission control, models for distributed computing, overlay networks

2 published by ACM
July 2018 SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 15,   Downloads (Overall): 15

Full text available: PDFPDF
Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor ...
Keywords: $c$-competitiveness, ad hoc networks, convex hulls, greedy routing

3 published by ACM
July 2018 SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 10,   Downloads (12 Months): 17,   Downloads (Overall): 17

Full text available: PDFPDF
We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or ...
Keywords: adaptive adversary, almost-everywhere consensus, probabilistic analysis, randomized algorithm

4
June 2018 Distributed Computing: Volume 31 Issue 3, June 2018
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the ...

5
March 2018 Natural Computing: an international journal: Volume 17 Issue 1, March 2018
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

Imagine coating buildings and bridges with smart particles (also coined smart paint) that monitor structural integrity and sense and report on traffic and wind loads, leading to technology that could do such inspection jobs faster and cheaper and increase safety at the same time. In this paper, we study the ...
Keywords: Coating, Programmable matter, Self-organizing systems, Distributed algorithms, Self-organization

6 published by ACM
June 2017 ACM SIGACT News: Volume 48 Issue 2, June 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 0

Full text available: PDFPDF
In July 2016, the Dagstuhl Seminar 16271 considered "Algorithmic Foundations of Programmable Matter", a new and emerging field that combines theoretical work on algorithms with a wide spectrum of practical applications that reach all the way from small-scale embedded systems to cyber-physical structures at nano-scale. The aim of the Dagstuhl ...

7 published by ACM
July 2016 SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 8,   Downloads (12 Months): 109,   Downloads (Overall): 232

Full text available: PDFPDF
We envision programmable matter consisting of systems of computationally limited devices (which we call particles ) that are able to self-organize in order to achieve a desired collective goal without the need for central control or external intervention. Central problems for these particle systems are shape formation and coating problems. ...
Keywords: programmable matter, distributed algorithms, self-organizing systems

8 published by ACM
July 2016 SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 18,   Downloads (Overall): 87

Full text available: PDFPDF
We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a ...
Keywords: expander, hypercube, random walks, DOS-attack, churn, overlay network

9
June 2016 IEEE/ACM Transactions on Networking (TON): Volume 24 Issue 3, June 2016
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 23,   Downloads (Overall): 23

Full text available: PDFPDF
This paper initiates the study of locally self-adjusting networks: networks whose topology adapts dynamically and in a decentralized manner, to the communication pattern σ. Our vision can be seen as a distributed generalization of the self-adjusting datastructures introduced by Sleator and Tarjan, 1985: In contrast to their splay trees which ...
Keywords: online algorithms and amortized analysis, distributed datastructures, network design, peer-to-peer computing, splay trees

10 published by ACM
November 2015 ACM Transactions on Parallel Computing (TOPC) - Special Issue for SPAA 2013: Volume 2 Issue 3, October 2015
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 31,   Downloads (Overall): 147

Full text available: PDFPDF
In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to ...
Keywords: denial-of-service attacks, DHT, Distributed systems

11 published by ACM
September 2015 NANOCOM' 15: Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 15,   Downloads (Overall): 43

Full text available: PDFPDF
This material is based on work in progress. Imagine that we had a piece of matter that can change its physical properties like shape, density, conductivity, or color in a programmable fashion based on either user input or autonomous sensing. This is the vision behind what is commonly known as ...

12
August 2015 Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems - Volume 9212
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no ...

13
August 2015 DNA 21: Proceedings of the 21st International Conference on DNA Computing and Molecular Programming - Volume 9211
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

In this paper we consider programmable matter consisting of simple computational elements, called particles, that can establish and release bonds and can actively move in a self-organized way, and we investigate the feasibility of solving fundamental problems relevant for programmable matter. As a model for such self-organizing particle systems, we ...

14 published by ACM
July 2015 PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 13,   Downloads (Overall): 90

Full text available: PDFPDF
Imagine that we had a piece of matter that can change its physical properties like shape, density, conductivity, or color in a programmable fashion based on either user input or autonomous sensing. This is the vision behind what is commonly known as programmable matter. Many proposals have already been made ...
Keywords: leader election, programmable matter, self-organizing particle systems, shape formation

15 published by ACM
June 2015 SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 63

Full text available: PDFPDF
A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no ...
Keywords: distributed systems, overlay networks, process departures, self-stabilization

16
June 2015 Theoretical Computer Science: Volume 584 Issue C, June 2015
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 1

We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph ...
Keywords: Clique network, Self-stabilization, Distributed algorithms, Resource discovery

17 published by ACM
December 2014 Journal of the ACM (JACM): Volume 61 Issue 6, November 2014
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 10,   Downloads (12 Months): 71,   Downloads (Overall): 449

Full text available: PDFPDF
Peer-to-peer systems rely on a scalable overlay network that enables efficient routing between its members. Hypercubic topologies facilitate such operations while each node only needs to connect to a small number of other nodes. In contrast to static communication networks, peer-to-peer networks allow nodes to adapt their neighbor set over ...
Keywords: Distributed algorithms, peer-to-peer systems, distributed systems, overlay networks, performance, robustness, self-stabilization, churn, graph theory

18
October 2014 Theory of Computing Systems: Volume 55 Issue 3, October 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and ...
Keywords: Distributed algorithms, Self-stabilizing protocols, Chord, Peer-to-peer networks

19
July 2014 Theory of Computing Systems: Volume 55 Issue 1, July 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable ...
Keywords: Performance, Distributed systems, Overlay networks, Peer-to-peer systems, Self-stabilization, Distributed algorithms

20 published by ACM
June 2014 SPAA '14: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 2,   Downloads (12 Months): 29,   Downloads (Overall): 115

Full text available: PDFPDF
The term programmable matter refers to matter which has the ability to change its physical properties (shape, density, moduli, conductivity, optical properties, etc.) in a programmable fashion, based upon user input or autonomous sensing. This has many applications like smart materials, autonomous monitoring and repair, and minimal invasive surgery, so ...
Keywords: nano-computing, self-organisation, programmable matter, mobile robots



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us