![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 53 matches
- 2012
- Lisbeth Fajstrup, Eric Goubault, Martin Raussen:
Proceedings of the workshop on Geometric and Topological Methods in Computer Science, GETCO 2010, Aalborg, Denmark, January 11-15, 2010. Electronic Notes in Theoretical Computer Science 283, Elsevier 2012 [contents] - 2010
- Peter Bubenik
:
Simplicial Models for Concurrency. GETCO 2010: 3-12 - Armando Castañeda, Sergio Rajsbaum:
An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing. GETCO 2010: 13-27 - Rodolfo Conde
, Sergio Rajsbaum:
An Introduction to the Topological Theory of Distributed Computing with Safe-consensus. GETCO 2010: 29-51 - A. E. Costa, Michael Farber, Thomas Kappeler:
Topics of Stochastic Algebraic Topology. GETCO 2010: 53-70 - Barbara Di Fabio, Claudia Landi
:
Stability of Reeb Graphs of Closed Curves. GETCO 2010: 71-76 - Lisbeth Fajstrup
, Eric Goubault, Martin Raussen
:
Preface. GETCO 2010: 1-2 - Eric Goubault, Samuel Mimram
:
Formal Relationships Between Geometrical and Classical Models for Concurrency. GETCO 2010: 77-109 - Emmanuel Haucourt:
Streams, d-Spaces and Their Fundamental Categories. GETCO 2010: 111-151 - Dmitry N. Kozlov
:
Some Conjectures Concerning Complexity of PL subdivisions. GETCO 2010: 153-157 - Michael Robinson
:
Asynchronous Logic Circuits and Sheaf Obstructions. GETCO 2010: 159-177 - 2009
- Éric Goubault:
Proceedings of the Workshops on Geometric and Topological Methods in Concurrency Theory, GETCO@DISC 2004, Amsterdam, The Netherlands, 2004 + GETCO@CONCUR October 2005, San Francisco, CA, USA, August 2005 + GETCO 2006, Bonn, Germany, 2006. Electronic Notes in Theoretical Computer Science 230, Elsevier 2009 [contents] - 2006
- Eric Goubault:
Preface. GETCO 2006: 1-2 - Thomas Kahl
:
A Fibration Category of Local Pospaces. GETCO 2006: 129-140 - Sanjeevi Krishnan:
Criteria for Homotopic Maps to be So Along Monotone Homotopies. GETCO 2006: 141-148 - Luigi Santocanale
:
Topological Properties of Event Structures. GETCO 2006: 149-160 - Viorica Sofronie-Stokkermans:
Sheaves and Geometric Logic and Applications to Modular Verification of Complex Systems. GETCO 2006: 161-187 - 2005
- Philippe Gaucher
:
T-homotopy and Refinement of Observation (I): Introduction. GETCO@CONCUR 2005: 103-110 - Emmanuel Haucourt:
Comparing Topological Models for Concurrency. GETCO@CONCUR 2005: 111-127 - 2004
- Peter Bubenik
:
Context for Models of Concurrency. GETCO@DISC 2004: 3-21 - Lior Davidovitch, Shlomi Dolev
, Sergio Rajsbaum
:
Stability of Multi-Valued Continuous Consensus. GETCO@DISC 2004: 23-38 - Rachid Guerraoui
, Bastian Pochon:
The Complexity of Early Deciding Set Agreement: How can Topology help? GETCO@DISC 2004: 71-78 - Emmanuel Haucourt:
A Framework for Component Categories. GETCO@DISC 2004: 39-69 - Maurice Herlihy, Sergio Rajsbaum
, Mark R. Tuttle:
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems. GETCO@DISC 2004: 79-102 - Thomas T. Hildebrandt, Alexander Kurz, Eric Goubault, Ulrich Fahrenberg:
Combined Proceedings of the Second Workshop on Categorical Methods for Concurrency, Interaction, and Mobility, CMCIM 2003, and the Fifth Workshop on Geometric and Topological Methods in Concurrency, GETCO 2003, Satellite Events of CONCUR 2003, Marseille, France, September 6, 2003. Electronic Notes in Theoretical Computer Science 100, Elsevier 2004 [contents] - 2003
- Ling Cheung, Jesse Hughes:
Concise Graphs and Functional Bisimulations. CMCIM/GETCO@CONCUR 2003: 5-29 - Pieter J. L. Cuijpers
, Michel A. Reniers:
Topological (Bi-)Simulation. CMCIM/GETCO@CONCUR 2003: 49-64 - Ulrich Fahrenberg:
Directed Homology. CMCIM/GETCO@CONCUR 2003: 111-125 - Philippe Gaucher
:
The Homotopy Branching Space of a Flow. CMCIM/GETCO@CONCUR 2003: 95-109 - Eric Goubault, Ulrich Fahrenberg:
Preface. CMCIM/GETCO@CONCUR 2003: 47-48
skipping 23 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-30 20:06 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint