Physical algorithms

1Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This is the accompanying paper to an ICALP 2010 invited talk, intending to encourage research in physical algorithms. The area of physical algorithms deals with networked systems of active agents. These agents have access to limited information for varying reasons; examples are communication constraints, evolving topologies, various types of faults and dynamics. The networked systems we envision include traditional computer networks, but also more generally networked systems, such as social networks, highly dynamic and mobile networks, or even networks of entities such as cars or ants. In other words, the world is becoming algorithmic, and we need the means to analyze this world! © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wattenhofer, R. (2010). Physical algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6199 LNCS, pp. 38–51). https://doi.org/10.1007/978-3-642-14162-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free