Остановите войну!
for scientists:
default search action
Search dblp for Publications
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.
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 10 matches
- 2019
- Gregor B. Banusic, Rupak Majumdar, Marcus Pirron, Anne-Kathrin Schmuck, Damien Zufferey:
PGCD: robot programming and verification with geometry, concurrency, and dynamics. ICCPS 2019: 57-66 - 2003
- Anjolina Grisi de Oliveira, Ruy J. G. B. de Queiroz:
Geometry of Deduction Via Graphs of Proofs. Logic for Concurrency and Synchronisation 2003: 3-88 - Patrick Cousot, Lisbeth Fajstrup, Eric Goubault, Maurice Herlihy, Martin Raussen, Vladimiro Sassone:
4th Workshop on GEometry and Topology in COncurrency and distributed systems theory, GETCO 2002, Satellite workshop of DISC 2002, Toulouse, France, October 2002. Electronic Notes in Theoretical Computer Science 81, Elsevier 2003 [contents] - 2002
- Peter Veelaert:
Concurrency of Line Segments in Uncertain Geometry. DGCI 2002: 289-300 - Patrick Cousot, Lisbeth Fajstrup, Eric Goubault, Jeremy Gunawardena, Maurice Herlihy, Martin Raussen, Vladimiro Sassone:
3rd Workshop on GEometry and Topology in COncurrency theory, GETCO 2001, Satellite Event of CONCUR 2001, Aalborg, Denmark, August 25, 2001. Electronic Notes in Theoretical Computer Science 52(2), Elsevier 2002 [contents] - 2000
- Eric Goubault:
Geometry and concurrency: a user's guide. Math. Struct. Comput. Sci. 10(4): 411-425 (2000) - Patrick Cousot, Eric Goubault, Jeremy Gunawardena, Maurice Herlihy, Martin Raussen, Vladimiro Sassone:
2nd Workshop on Geometry and Topology in Concurrency theory, GETCO 2000, Satellite Workshop of CONCUR 2000, State College, PA, USA, August 21, 2000. Electronic Notes in Theoretical Computer Science 39(2), Elsevier 2000 [contents] - 1992
- Vaughan R. Pratt:
Arithmetic + Logic + Geometry = Concurrency. LATIN 1992: 430-447 - 1991
- Vaughan R. Pratt:
Modeling Concurrency with Geometry. POPL 1991: 311-322 - 1989
- Bernadette Charron-Bost:
Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory. WDAG 1989: 45-56
loading more results
failed to load more results, please try again later
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-05-23 21:32 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