Electronic Notes in Theoretical Computer Science, Volume 283
Volume 283, June 2012
- Peter Bubenik: Simplicial Models for Concurrency. 3-12
- Armando Castañeda, Sergio Rajsbaum: An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing. 13-27
- Rodolfo Conde, Sergio Rajsbaum: An Introduction to the Topological Theory of Distributed Computing with Safe-consensus. 29-51
- Eric Goubault, Samuel Mimram: Formal Relationships Between Geometrical and Classical Models for Concurrency. 77-109
- Emmanuel Haucourt: Streams, d-Spaces and Their Fundamental Categories. 111-151
- Dmitry N. Kozlov: Some Conjectures Concerning Complexity of PL subdivisions. 153-157
- Michael Robinson: Asynchronous Logic Circuits and Sheaf Obstructions. 159-177
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team