Abstract State Machines 1988-1998: Commented ASM Bibliography

An annotated bibliography of papers which deal with or use Abstract State Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm

A guided tour of asynchronous cellular automata

Research on asynchronous cellular automata has received a great amount of attention these last years and has turned to a thriving field. We survey the recent research that has been carried out on this topic and present a wide state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat

A Survey on Continuous Time Computations

We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature

Computers and Liquid State Statistical Mechanics

The advent of electronic computers has revolutionised the application of statistical mechanics to the liquid state. Computers have permitted, for example, the calculation of the phase diagram of water and ice and the folding of proteins. The behaviour of alkanes adsorbed in zeolites, the formation of liquid crystal phases and the process of nucleation. Computer simulations provide, on one hand, new insights into the physical processes in action, and on the other, quantitative results of greater and greater precision. Insights into physical processes facilitate the reductionist agenda of physics, whilst large scale simulations bring out emergent features that are inherent (although far from obvious) in complex systems consisting of many bodies. It is safe to say that computer simulations are now an indispensable tool for both the theorist and the experimentalist, and in the future their usefulness will only increase. This chapter presents a selective review of some of the incredible advances in condensed matter physics that could only have been achieved with the use of computers.Comment: 22 pages, 2 figures. Chapter for a boo

Route Planning in Transportation Networks

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4, previously published by Microsoft Research. This work was mostly done while the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at Microsoft Research Silicon Valle