DagRep.2.3.50.pdf
- Filesize: 0.96 MB
- 17 pages
Document
Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 2, Issue 3
Volume: Dagstuhl Reports, Volume 2
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2012-07-26
Cite AsGet BibTex
Lisbeth Fajstrup, Dmitry Feichtner-Kozlov, and Maurice Herlihy. Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121). In Dagstuhl Reports, Volume 2, Issue 3, pp. 50-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/DagRep.2.3.50
https://doi.org/10.4230/DagRep.2.3.50
Abstract
This report documents the program of Dagstuhl Seminar 12121 "Applications of Combinatorial Topology to Computer Science". The seminar brought together researchers working on applications of combinatorial topology to various fields of computer science. The goal was to foster communication across these fields by providing researchers in each field the opportunity to explain their research programs to the others. The fields covered included distributed computing, persistent homology, semantics of concurrency, and sensor networks.
Keywords
- Combinatorial topology
- Distributed computing
- Persistent homology
- Program semantics
- Sensor networks
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads