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 16 matches
- 2015
- Ersin Aslan:
Neighbor Isolated Tenacity of Graphs. RAIRO Theor. Informatics Appl. 49(4): 269-284 (2015) - Mikhail Barash, Alexander Okhotin:
Linear grammars with one-sided contexts and their automaton representation. RAIRO Theor. Informatics Appl. 49(2): 153-178 (2015) - Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol:
Exact location of the phase transition for random (1, 2)-QSAT. RAIRO Theor. Informatics Appl. 49(1): 23-45 (2015) - Lunzhi Deng:
Certificateless ring signature based on RSA problem and DL problem. RAIRO Theor. Informatics Appl. 49(4): 307-318 (2015) - Olivier Finkel, Dominique Lecomte, Pierre Simonnet:
An upper bound on the complexity of recognizable tree languages. RAIRO Theor. Informatics Appl. 49(2): 121-137 (2015) - Juha Honkala:
The finiteness problem for monoids of morphisms. RAIRO Theor. Informatics Appl. 49(1): 61-65 (2015) - Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann:
Optimal strategy synthesis for request-response games. RAIRO Theor. Informatics Appl. 49(3): 179-203 (2015) - Raed Jaberi:
Computing the 2-blocks of directed graphs. RAIRO Theor. Informatics Appl. 49(2): 93-119 (2015) - Sacha Krug:
Towards using the history in online computation with advice. RAIRO Theor. Informatics Appl. 49(2): 139-152 (2015) - Manfred Kufleitner, Tobias Walter:
One quantifier alternation in first-order logic with modular predicates. RAIRO Theor. Informatics Appl. 49(1): 1-22 (2015) - Lan Lin, Yixun Lin:
New bounds on the edge-bandwidth of triangular grids. RAIRO Theor. Informatics Appl. 49(1): 47-60 (2015) - Alexander Okhotin:
On language equations with concatenation and various sets of Boolean operations. RAIRO Theor. Informatics Appl. 49(3): 205-232 (2015) - Alexey E. Rastegin:
Further results on generalized conditional entropies. RAIRO Theor. Informatics Appl. 49(1): 67-92 (2015) - Abdalhossein Rezai, Parviz Keshavarzi:
Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers. RAIRO Theor. Informatics Appl. 49(3): 255-268 (2015) - Nasim Samei, Roberto Solis-Oba:
Analysis of a local search algorithm for the k-facility location problem. RAIRO Theor. Informatics Appl. 49(4): 285-306 (2015) - Itamar Stein:
Reducing the gradedness problem of string rewriting systems to a termination problem. RAIRO Theor. Informatics Appl. 49(3): 233-254 (2015)
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-10-03 01:05 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