![](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 18 matches
- 2009
- Jing Cao, Albert Nymeyer:
Formal Model of a Protocol Converter. CATS 2009: 107-117 - Ching-Lueh Chang, Yuh-Dauh Lyuu:
Spreading of Messages in Random Graphs. CATS 2009: 3-7 - Adam R. Day:
On Process Complexity. CATS 2009: 29-34 - Vladimir Estivill-Castro, Mahdi Parsa:
Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity. CATS 2009: 81-87 - Andras Farago:
Structural Properties of Random Graph Models. CATS 2009: 129-136 - Hideaki Fukuhara, Eiji Takimoto:
Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes. CATS 2009: 89-98 - Sumit Ganguly:
Distributing Frequency-Dependent Data Stream Computations. CATS 2009: 161-167 - Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting:
Boolean Affine Approximation with Binary Decision Diagrams. CATS 2009: 119-127 - Toshimasa Ishii, Kazuhisa Makino:
Augmenting Edge-Connectivity between Vertex Subsets. CATS 2009: 43-49 - Mehdi Karimi, Arvind Gupta:
Minimum Cost Homomorphism to Oriented Cycles with Some Loops. CATS 2009: 7-17 - Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest Paths in Planar DAGs in Unambiguous Logspace. CATS 2009: 99-105 - Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. CATS 2009: 19-28 - Koji Nakazawa, Makoto Tatsuta:
Type Checking and Inference for Polymorphic and Existential Types. CATS 2009: 61-69 - Ukachukwu Ndukwu, Jeff W. Sanders:
Reasoning about a Distributed Probabilistic System. CATS 2009: 35-42 - David J. Pearce, Gary Haggard, Gordon F. Royle:
Edge-Selection Heuristics for Computing Tutte Polynomials. CATS 2009: 151-159 - Mark Utting, Petra Malik, Ian Toyn:
Transformation Rules for Z. CATS 2009: 71-80 - Kira Vyatkina:
Linear Axis for Planar Straight Line Graphs. CATS 2009: 137-150 - Rod Downey, Prabhu Manyem:
Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009. CRPIT 94, Australian Computer Society 2009, ISBN 978-1-920682-75-0 [contents]
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-07-08 16:36 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