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 33 matches
- 2000
- Luca Aceto, Anna Ingólfsdóttir, Mikkel Lykke Pedersen, Jan Poulsen:
Characteristic formulae for timed automata. RAIRO Theor. Informatics Appl. 34(6): 565-584 (2000) - Evripidis Bampis, Aristotelis Giannakos, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis:
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases. RAIRO Theor. Informatics Appl. 34(2): 87-98 (2000) - Elena Barcucci, Sara Brunetti, Francesco Del Ristoro:
Succession rules and deco polyominoes. RAIRO Theor. Informatics Appl. 34(1): 1-14 (2000) - Marie-Pierre Béal, Olivier Carton:
Asynchronous sliding block maps. RAIRO Theor. Informatics Appl. 34(2): 139-156 (2000) - Marie-Pierre Béal, Olivier Carton:
Computing the prefix of an automaton. RAIRO Theor. Informatics Appl. 34(6): 503-514 (2000) - Valérie Berthé:
Complexité et automates cellulaires linéaires. RAIRO Theor. Informatics Appl. 34(5): 403-423 (2000) - Hans-Joachim Böckenhauer, Sebastian Seibert:
Improved lower bounds on the approximability of the Traveling Salesman Problem. RAIRO Theor. Informatics Appl. 34(3): 213-255 (2000) - Serge Burckel, Marianne Morillon:
Three generators for minimal writing-space computations. RAIRO Theor. Informatics Appl. 34(2): 131-138 (2000) - Mireille Clerbout, Yves Roos, Isabelle Ryl:
Semi-commutations and partial commutations. RAIRO Theor. Informatics Appl. 34(4): 307-330 (2000) - Roy L. Crole:
Encoding FIX in object calculi. RAIRO Theor. Informatics Appl. 34(1): 15-38 (2000) - Jeanne Devolder:
Codes générateurs minimaux de langages de mots bi-infinis. RAIRO Theor. Informatics Appl. 34(6): 585-596 (2000) - Ken-etsu Fujita:
Domain-free [lambda][mu]-calculus. RAIRO Theor. Informatics Appl. 34(6): 433-466 (2000) - Viliam Geffert, Norbert Popély:
A space lower bound for acceptance by one-way II2-alternating machines. RAIRO Theor. Informatics Appl. 34(5): 357-372 (2000) - Yannick Guesnet:
On codes with finite interpreting delay: A defect theorem. RAIRO Theor. Informatics Appl. 34(1): 47-60 (2000) - Christian Hagenah, Anca Muscholl:
Computing epsilon-free NFA from regular expressions in O(n log2(n)) time. RAIRO Theor. Informatics Appl. 34(4): 257-278 (2000) - Pierre-Cyrille Héam:
A Lower Bound For Reversible Automata. RAIRO Theor. Informatics Appl. 34(5): 331-341 (2000) - Juha Honkala:
A Kleene-Schützenberger theorem for Lindenmayerian rational power series. RAIRO Theor. Informatics Appl. 34(4): 297-306 (2000) - Marianne Huchard, Hervé Dicky, Hervé Leblanc:
Galois lattice as a framework to specify building class hierarchies algorithms. RAIRO Theor. Informatics Appl. 34(6): 521-548 (2000) - Lucian Ilie, Wojciech Plandowski:
Two-variable word equations. RAIRO Theor. Informatics Appl. 34(6): 467-501 (2000) - Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa:
A characterization of poly-slender context-free languages. RAIRO Theor. Informatics Appl. 34(1): 77-86 (2000) - Jacques Justin:
On a paper by Castelli, Mignosi, Restivo. RAIRO Theor. Informatics Appl. 34(5): 373-377 (2000) - Jacques Justin, Laurent Vuillon:
Return words in Sturmian and episturmian words. RAIRO Theor. Informatics Appl. 34(5): 343-356 (2000) - D. Arun Kumar, C. Pandu Rangan:
Approximation algorithms for the Traveling Salesman Problem with range condition. RAIRO Theor. Informatics Appl. 34(3): 173-182 (2000) - Ján Manuch:
Construction of very hard functions for multiparty communication complexity. RAIRO Theor. Informatics Appl. 34(1): 61-76 (2000) - Carlo Mereghetti, Beatrice Palano:
Threshold circuits for iterated matrix product and powering. RAIRO Theor. Informatics Appl. 34(1): 39-46 (2000) - Markus E. Nebel:
On the Horton-Strahler number for combinatorial tries. RAIRO Theor. Informatics Appl. 34(4): 279-296 (2000) - Masanao Ozawa, Harumichi Nishimura:
Local transition functions of quantum Turing machines. RAIRO Theor. Informatics Appl. 34(5): 379-402 (2000) - David Simplot, Alain Terlutte:
Closure under union and composition of iterated rational transductions. RAIRO Theor. Informatics Appl. 34(3): 183-212 (2000) - Osamu Takaki:
Finite presentability of strongly finite dilators. RAIRO Theor. Informatics Appl. 34(6): 425-431 (2000) - Alain Terlutte, David Simplot:
Iteration of rational transductions. RAIRO Theor. Informatics Appl. 34(2): 99-130 (2000)
skipping 3 more matches
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-11 10:23 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