![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/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 10 matches
- 2016
- Nabila Abdessaied, Matthew Amy, Rolf Drechsler
, Mathias Soeken:
Complexity of reversible circuits and their quantum implementations. Theor. Comput. Sci. 618: 85-106 (2016) - Simone Bova, Robert Ganian, Stefan Szeider
:
Quantified conjunctive queries on partially ordered sets. Theor. Comput. Sci. 618: 72-84 (2016) - Hélio B. Macêdo Filho
, Raphael C. S. Machado, Celina M. H. de Figueiredo
:
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. Theor. Comput. Sci. 618: 122-134 (2016) - Patrick Chisan Hew:
Working in binary protects the repetends of 1/3h: Comment on Colussi's 'The convergence classes of Collatz function'. Theor. Comput. Sci. 618: 135-141 (2016) - Limei Lin, Li Xu, Shuming Zhou:
Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model. Theor. Comput. Sci. 618: 21-29 (2016) - Lhouari Nourine, Jean-Marc Petit
:
Extended dualization: Application to maximal pattern mining. Theor. Comput. Sci. 618: 107-121 (2016) - Alexander Okhotin
:
Input-driven languages are linear conjunctive. Theor. Comput. Sci. 618: 52-71 (2016) - Markus L. Schmid:
Computing equality-free and repetitive string factorisations. Theor. Comput. Sci. 618: 42-51 (2016) - Yingjie Xia, Xuejiao Liu, Fubiao Xia, Guilin Wang:
A reduction of security notions in designated confirmer signatures. Theor. Comput. Sci. 618: 1-20 (2016) - Haibin Zhu
, Dongning Liu
, Siqin Zhang, Yu Zhu, Luyao Teng, Shaohua Teng
:
Solving the Many to Many assignment problem by improving the Kuhn-Munkres algorithm with backtracking. Theor. Comput. Sci. 618: 30-41 (2016)
loading more results
failed to load more results, please try again later
![](https://dblp.org/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-23 13:03 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