![](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 28 matches
- 1995
- V. B. Balayogan, C. Pandu Rangan:
Parallel Algorithms on Interval Graphs. RAIRO Theor. Informatics Appl. 29(6): 451-470 (1995) - Dominique Barth, François Pellegrini, André Raspaud, Jean Roman:
On Bandwidth, Cutwidth, and Quotient Graphs. RAIRO Theor. Informatics Appl. 29(6): 487-508 (1995) - Marie-Pierre Béal:
Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique. RAIRO Theor. Informatics Appl. 29(2): 85-103 (1995) - Francine Blanchet-Sadri:
Equations on the Semidirect Product of a Finite Semilattice by a J-Trivial Monoid of Height k. RAIRO Theor. Informatics Appl. 29(3): 157-170 (1995) - M. Boffa:
Une condition impliquant toutes les identités rationnelles. RAIRO Theor. Informatics Appl. 29(6): 515-518 (1995) - Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette:
On-Line Evaluation of Powers Using Euclid's Algorithm. RAIRO Theor. Informatics Appl. 29(5): 431-450 (1995) - Helen Cameron, Derick Wood:
Binary Trees, Fringe Thickness and Minimum Path Length. RAIRO Theor. Informatics Appl. 29(3): 171-191 (1995) - Bruno Courcelle, A. Pariès:
Mineurs d'arbres avec racines. RAIRO Theor. Informatics Appl. 29(5): 401-422 (1995) - Krzysztof Diks, Adam Malinowski, Andrzej Pelc:
Token Transfer in a Faulty Network. RAIRO Theor. Informatics Appl. 29(5): 383-400 (1995) - Juha Honkala:
On Morphycally Generated Formal Power Series. RAIRO Theor. Informatics Appl. 29(2): 105-127 (1995) - Marc Huou, Jean-Pierre Elloy:
Sémantique du parallélisme et du choix du langage electre. RAIRO Theor. Informatics Appl. 29(4): 315-338 (1995) - Claude Jard, Guy-Vincent Jourdan, Jean-Xavier Rampon:
On-Line Computations of the Ideal Lattice of Posets. RAIRO Theor. Informatics Appl. 29(3): 227-244 (1995) - Stasys Jukna:
A Note on Read-k Times Branching Programs. RAIRO Theor. Informatics Appl. 29(1): 75-83 (1995) - Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
On Parallel Deletions Applied to a Word. RAIRO Theor. Informatics Appl. 29(2): 129-144 (1995) - Rainer Kemp:
Uniformly Growing Backtrack Trees. RAIRO Theor. Informatics Appl. 29(1): 45-73 (1995) - Nguyen Huong Lam:
On Codes Having no Finite Completion. RAIRO Theor. Informatics Appl. 29(2): 145-155 (1995) - Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe:
Analysis of Quickselect: An Algorithm for Order Statistics. RAIRO Theor. Informatics Appl. 29(4): 255-276 (1995) - Marianne Maksimenko:
Algorithme quadratique de calcul de la solution général d'équation en mots à une variable. RAIRO Theor. Informatics Appl. 29(4): 277-284 (1995) - Richard Mijoule:
Fibrations and Recursivity. RAIRO Theor. Informatics Appl. 29(3): 193-208 (1995) - Karim Nour:
Entiers intuitionnistes et entiers classiques en lambda C-calcul. RAIRO Theor. Informatics Appl. 29(4): 293-313 (1995) - Helmut Prodinger:
Comments on the Analysis of Parameters in a Random Graph Model. RAIRO Theor. Informatics Appl. 29(3): 245-253 (1995) - André Raspaud, Ondrej Sýkora, Imrich Vrto:
Cutwidth of the Bruijn Graph. RAIRO Theor. Informatics Appl. 29(6): 509-514 (1995) - Roman R. Redziejowski:
Schützenberger-Like Products in Non-Free Monoids. RAIRO Theor. Informatics Appl. 29(3): 209-226 (1995) - John Rhodes, Pascal Weil:
Algebraic and Topological Theory of Languages. RAIRO Theor. Informatics Appl. 29(1): 1-44 (1995) - Laurent Rosaz:
Unavoidable Languages, Cuts and Innocent Sets of Words. RAIRO Theor. Informatics Appl. 29(5): 339-382 (1995) - Kai Salomaa, Derick Wood, Sheng Yu:
Complexity of E0L Structural Equivalence. RAIRO Theor. Informatics Appl. 29(6): 471-485 (1995) - Maciej Slusarek:
Optimal On-Line Coloring of Circular Arc Graphs. RAIRO Theor. Informatics Appl. 29(5): 423-429 (1995) - T. Tapsoba:
Minimum Complexity of Automatic non Sturmian Sequences. RAIRO Theor. Informatics Appl. 29(4): 285-291 (1995)
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-23 17: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