Остановите войну!
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 33 matches
- 2005
- Marcella Anselmo, Dora Giammarresi, Maria Madonia:
New operations and regular expressions for two-dimensional languages over one-letter alphabet. Theor. Comput. Sci. 340(1): 408-431 (2005) - Isabel M. Araújo, Véronique Bruyère:
Words derivated from Sturmian words. Theor. Comput. Sci. 340(1): 204-219 (2005) - Marie-Pierre Béal, Dominique Perrin:
Codes and sofic constraints. Theor. Comput. Sci. 340(1): 381-393 (2005) - Jean Berstel:
Growth of repetition-free words -- a review. Theor. Comput. Sci. 340(1): 280-290 (2005) - Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Small size quantum automata recognizing some regular languages. Theor. Comput. Sci. 340(1): 394-407 (2005) - Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon:
A semantics for web services authentication. Theor. Comput. Sci. 340(1): 102-153 (2005) - Paola Bonizzoni, Giancarlo Mauri:
Regular splicing languages and subclasses. Theor. Comput. Sci. 340(1): 349-363 (2005) - Jean-Pierre Borel, Christophe Reutenauer:
Palindromic factors of billiard words. Theor. Comput. Sci. 340(1): 334-348 (2005) - Arturo Carpi, Aldo de Luca:
Codes of central Sturmian words. Theor. Comput. Sci. 340(1): 220-239 (2005) - Christian Choffrut, Berke Durak:
Collage of two-dimensional words. Theor. Comput. Sci. 340(1): 364-380 (2005) - Julien Clément, Jean-Pierre Duval, Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone:
Parsing with a finite dictionary. Theor. Comput. Sci. 340(1): 432-442 (2005) - Stefano Crespi-Reghizzi, Matteo Pradella:
Tile rewriting grammars and picture languages. Theor. Comput. Sci. 340(1): 257-272 (2005) - Mariangiola Dezani-Ciancaglini, Furio Honsell, Yoko Motohama:
Compositional characterisations of lambda-terms using intersection types. Theor. Comput. Sci. 340(3): 459-495 (2005) - Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3): 496-513 (2005) - Zoltán Ésik, Pascal Weil:
Algebraic recognizability of regular tree languages. Theor. Comput. Sci. 340(1): 291-321 (2005) - Clelia de Felice:
An enhanced property of factorizing codes. Theor. Comput. Sci. 340(1): 240-256 (2005) - Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
Radiocoloring in planar graphs: Complexity and approximations. Theor. Comput. Sci. 340(3): 514-538 (2005) - Roberto Gorrieri, Fabio Martinelli:
Theoretical foundations of security analysis and design II. Theor. Comput. Sci. 340(1): 1-2 (2005) - Tero Harju, Dirk Nowotka:
Counting bordered and primitive words with a fixed weight. Theor. Comput. Sci. 340(1): 273-279 (2005) - Jonathan Herzog:
A computational interpretation of Dolev-Yao adversaries. Theor. Comput. Sci. 340(1): 57-81 (2005) - Juhani Karhumäki, Michel Latteux, Ion Petre:
Commutation with codes. Theor. Comput. Sci. 340(1): 322-333 (2005) - Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg:
Preface. Theor. Comput. Sci. 340(1): 179-185 (2005) - Ugo Montanari, Marco Pistore:
Structured coalgebras and minimal HD-automata for the pi-calculus. Theor. Comput. Sci. 340(3): 539-576 (2005) - Mogens Nielsen, Branislav Rovan:
Introduction - Combined TCSA/TCSB issue - mathematical foundations of computer science 2000. Theor. Comput. Sci. 340(3): 457-458 (2005) - David Peleg:
Informative labeling schemes for graphs. Theor. Comput. Sci. 340(3): 577-593 (2005) - Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Measuring the confinement of probabilistic systems. Theor. Comput. Sci. 340(1): 3-56 (2005) - Jean-Eric Pin, Pedro V. Silva:
A topological approach to transductions. Theor. Comput. Sci. 340(1): 443-456 (2005) - Gordon Thomas Rohrmair, Gavin Lowe:
Using data-independence in the analysis of intrusion detection systems. Theor. Comput. Sci. 340(1): 82-101 (2005) - Arto Salomaa:
Connections between subwords and certain matrix mappings. Theor. Comput. Sci. 340(1): 188-203 (2005) - Petr Savický, Detlef Sieling:
A hierarchy result for read-once branching programs with restricted parity nondeterminism. Theor. Comput. Sci. 340(3): 594-605 (2005)
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-07-04 06:12 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