Locality in distributed graph algorithms
SIAM Journal on Computing
Transactional memory: architectural support for lock-free data structures
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility of distributed consensus with one faulty process
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
First Draft of a Report on the EDVAC
IEEE Annals of the History of Computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Computer
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Dynamic networks are as fast as static networks
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Word of Mouth: Rumor Dissemination in Social Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Tight bounds for clock synchronization
Journal of the ACM (JACM)
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Bounds on Contention Management Algorithms
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Good Programming in Transactional Memory
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Synchrony and asynchrony in neural networks
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Oblivious gradient clock synchronization
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |
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!