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!
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiyer, A.S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.-P., Porth, C.: Bar fault tolerance for cooperative services. In: SOSP, pp. 45–58 (2005)
Arora, S., Barak, B., Brunnermeier, M., Ge, R.: Computational complexity and informational asymmetry in financial products (Unpublished manuscript) (2010)
Awerbuch, B., Sipser, M.: Dynamic networks are as fast as static networks (preliminary version). In: FOCS, pp. 206–220. IEEE, Los Alamitos (1988)
Chazelle, B.: Natural algorithms. In: Proc. of the 20th ACM-SIAM Symposium on Discrete Algorithms, SODA (2009)
Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a nash equilibrium. In: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing (STOC), pp. 71–78. ACM, New York (2006)
Dijkstra, E.W.: Self-stabilization in spite of distributed control. EWD391 (October 1973) (manuscript)
Eidenbenz, R., Wattenhofer, R.: Good Programming in Transactional Memory: Game Theory Meets Multicore Architecture. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878. Springer, Heidelberg (2009)
Michael, J., Fischer, N.A.: Lynch, and Mike Paterson. Impossibility of distributed consensus with one faulty process. In: PODS, pp. 1–7 (1983)
Goldstein, S.C., Campbell, J.D., Mowry, T.C.: Programmable matter. Computer 38(6), 99–101 (2005)
Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: ISCA, pp. 289–300 (1993)
Kleinberg, J.M.: The small-world phenomenon: an algorithm perspective. In: STOC, pp. 163–170 (2000)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: What Cannot be Computed Locally!. In: Proc. of the 23rd ACM Symposium on the Principles of Distributed Computing (PODC), pp. 300–309 (2004)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: The Price of Being Near-Sighted. In: Proc. of the 17th ACM-SIAM Symposium on Discrete Algorithms, SODA (2006)
Kostka, J., Oswald, Y.A., Wattenhofer, R.: Word of Mouth: Rumor Dissemination in Social Networks. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 185–196. Springer, Heidelberg (2008)
Kuhn, F., Panagiotou, K., Spencer, J., Steger, A.: Synchrony and asynchrony in neural networks. In: Proc. of the 21st ACM-SIAM Symposium on Discrete Algorithms, SODA (2010)
Linial, N.: Locality in Distributed Graph Algorithms. SIAM Journal on Computing 21(1), 193–201 (1992)
Lenzen, C., Locher, T., Wattenhofer, R.: Tight Bounds for Clock Synchronization. J. ACMÂ 57(2) (2010)
Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
Lenzen, C., Suomela, J., Wattenhofer, R.: Local Algorithms: Self-Stabilization on Speed. In: 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Lyon, France (November 2009)
Locher, T., Wattenhofer, R.: Oblivious Gradient Clock Synchronization. In: 20th International Symposium on Distributed Computing (DISC), Stockholm, Sweden (September 2006)
Moscibroda, T., Schmid, S., Wattenhofer, R.: When Selfish Meets Evil: Byzantine Players in a Virus Inoculation Game. In: 25th Annual Symposium on Principles of Distributed Computing (PODC), Denver, Colorado, USA (July 2006)
Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), Barcelona, Spain (April 2006)
Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)
Shostak, R., Pease, M., Lamport, L.: Reaching Agreement in the Presence of Faults. J. of the ACM 27(2), 228–234 (1980)
Sterling, A.: Memory consistency conditions for self-assembly programming. CoRR, abs/0909.2704 (2009)
Suomela, J.: Survey of local algorithms (2009) (manuscript)
Schneider, J., Wattenhofer, R.: Bounds On Contention Management Algorithms. In: 20th International Symposium on Algorithms and Computation (ISAAC), Honolulu, USA (December 2009)
von Neumann, J.: First Draft of a Report on the EDVAC. IEEE Ann. Hist. Comput. 15(4), 27–75 (1993)
von Neumann, J., Morgenstern, O.: Theory of games and economic behavior. Princeton University Press, Princeton (1947)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wattenhofer, R. (2010). Physical Algorithms. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-14162-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14161-4
Online ISBN: 978-3-642-14162-1
eBook Packages: Computer ScienceComputer Science (R0)