Остановите войну!
for scientists:
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 31 matches
- 1986
- IJsbrand Jan Aalbersberg, Emo Welzl:
Trace Languages Defined by Regular String Languages. RAIRO Theor. Informatics Appl. 20(2): 103-119 (1986) - Foto N. Afrati, Stavros S. Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou:
The Complexity of the Travelling Repairman Problem. RAIRO Theor. Informatics Appl. 20(1): 79-87 (1986) - Didier Arquès:
Dénombrements de Chemins Dans -Real 2 Soumis A Contraintes. RAIRO Theor. Informatics Appl. 20(4): 473-482 (1986) - Jacques J. Arsac:
La Fonction D'ackermann: Un Nouveau Mode de Dérécursivation. RAIRO Theor. Informatics Appl. 20(2): 149-156 (1986) - R. Boonyavatana, Giora Slutzki:
Ogden's Lemma for Monterminal Bounded Languages. RAIRO Theor. Informatics Appl. 20(4): 457-471 (1986) - Janusz A. Brzozowski, Robert Knast:
Graph Congruences and Pair Testing. RAIRO Theor. Informatics Appl. 20(2): 129-147 (1986) - Philippe Darondeau:
Une Critique de La Notion de Test de Processus Fondée Sur La Non Séparabilité de Certaines Classes de Langages. RAIRO Theor. Informatics Appl. 20(3): 291-317 (1986) - Max Dauchet, Erick Timmerman:
Continuous Monoids and Yields of Infinite Trees. RAIRO Theor. Informatics Appl. 20(3): 251-274 (1986) - Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping. RAIRO Theor. Informatics Appl. 20(4): 405-424 (1986) - Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma. RAIRO Theor. Informatics Appl. 20(4): 425-439 (1986) - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Each Regular Code Is Included in A Maximal Regular Code. RAIRO Theor. Informatics Appl. 20(1): 89-96 (1986) - Jean Françon:
Une Approche Quantitative de L'Exclusion Mutuelle. RAIRO Theor. Informatics Appl. 20(3): 275-289 (1986) - Pavel Goralcik, A. Goralciková, Václav Koubek:
How much Semigroup Structure is Needed to Encode Graphs? RAIRO Theor. Informatics Appl. 20(2): 191-206 (1986) - Sheila A. Greibach, Celia Wrathall:
Single-Tape Reset Machines. RAIRO Theor. Informatics Appl. 20(1): 55-77 (1986) - Tero Harju, Matti Linna:
On the Periodicity of Morphisms on Free Monoids. RAIRO Theor. Informatics Appl. 20(1): 47-54 (1986) - Tom Head:
The Topological Structure of Adherences of Regular Languages. RAIRO Theor. Informatics Appl. 20(1): 31-41 (1986) - Jean-Jacques Hébrard, Maxime Crochemore:
Calcul de La Distance Par Les Sous-Mots. RAIRO Theor. Informatics Appl. 20(4): 441-456 (1986) - Juha Honkala:
A Decision Method for The Recognizability of Sets Defined by Number Systems. RAIRO Theor. Informatics Appl. 20(4): 395-403 (1986) - Helmut Jürgensen, M. Kunze:
Über die Implementierung Redundanzfreier Codes zur Datenverschlüsselung. RAIRO Theor. Informatics Appl. 20(1): 5-30 (1986) - Juha Kortelainen:
Every Commutative Quasirational Language is Regular. RAIRO Theor. Informatics Appl. 20(3): 319-337 (1986) - Choun Tong Lieu:
Point-Fixe Sur Un Ensemble Restreint. RAIRO Theor. Informatics Appl. 20(4): 383-394 (1986) - Yves Métivier:
Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif. RAIRO Theor. Informatics Appl. 20(2): 121-127 (1986) - Jean-Jacques Pansiot:
Decidability of Periodicity for Infinite Words. RAIRO Theor. Informatics Appl. 20(1): 43-46 (1986) - Marco Protasi, Maurizio Talamo:
A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs. RAIRO Theor. Informatics Appl. 20(3): 211-219 (1986) - Brigitte Rozoy:
Outils et Résultats Pour Les Transducteurs Boustrophedons. RAIRO Theor. Informatics Appl. 20(3): 221-249 (1986) - Patrice Séébold:
Complément A L'étude des Suites de Thue-Morse Généralisées. RAIRO Theor. Informatics Appl. 20(2): 157-181 (1986) - Ludwig Staiger:
On Infinitary Finite Length Codes. RAIRO Theor. Informatics Appl. 20(4): 483-494 (1986) - Wolfgang Thomas:
On Frontiers of Regular Trees. RAIRO Theor. Informatics Appl. 20(4): 371-381 (1986) - Hermann K.-G. Walter:
A Simple Proof of Valiant's Lemma. RAIRO Theor. Informatics Appl. 20(2): 183-190 (1986) - Alex Weiss:
The Local And Global Varieties Induced by Nilpotent Monoids. RAIRO Theor. Informatics Appl. 20(3): 339-355 (1986)
skipping 1 more match
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-27 10:48 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