![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 27 matches
- 2003
- André Arnold, Aymeric Vincent, Igor Walukiewicz:
Games for synthesis of controllers with partial observation. Theor. Comput. Sci. 303(1): 7-34 (2003) - Danièle Beauquier, Dimitri Grigoriev, Yuri V. Matiyasevich
:
Biography of A.O. Slissenko. Theor. Comput. Sci. 303(1): 3-5 (2003) - Danièle Beauquier, Maurice Nivat:
A codicity undecidable problem in the plane. Theor. Comput. Sci. 303(2-3): 417-430 (2003) - Alessandra Carbone
, Misha Gromov:
Functional labels and syntactic entropy on DNA strings and proteins. Theor. Comput. Sci. 303(1): 35-51 (2003) - Patrick Cégielski, François Heroult, Denis Richard:
On the amplitude of intervals of natural numbers whose every element has a common prime divisor with at least an extremity. Theor. Comput. Sci. 303(1): 53-62 (2003) - Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
On feasible cases of checking multi-agent systems behavior. Theor. Comput. Sci. 303(1): 63-81 (2003) - Sébastien Desreux:
An algorithm to generate exactly once every tiling with lozenges of a domain. Theor. Comput. Sci. 303(2-3): 375-408 (2003) - Kari Eloranta:
The bounded eight-vertex model. Theor. Comput. Sci. 303(2-3): 539-552 (2003) - Thomas L. Fitzkee, Kevin G. Hockett, E. Arthur Robinson Jr.:
A weakly mixing tiling dynamical system with a smooth model. Theor. Comput. Sci. 303(2-3): 447-462 (2003) - Jean-Claude Fournier:
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings. Theor. Comput. Sci. 303(2-3): 333-351 (2003) - Olaf Delgado-Friedrichs:
Data structures and algorithms for tilings I. Theor. Comput. Sci. 303(2-3): 431-445 (2003) - Christiane Frougny, Jean-Pierre Gazeau
, Rudolf Krejcar:
Additive and multiplicative properties of point sets based on beta-integers. Theor. Comput. Sci. 303(2-3): 491-516 (2003) - Dima Grigoriev, Edward A. Hirsch:
Algebraic proof systems over formulas. Theor. Comput. Sci. 303(1): 83-102 (2003) - Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati:
On temporal logic versus datalog. Theor. Comput. Sci. 303(1): 103-133 (2003) - Roman M. Kolpakov
, Gregory Kucherov
:
Finding approximate repetitions under Hamming distance. Theor. Comput. Sci. 303(1): 135-156 (2003) - Fumei Lam, Lior Pachter
:
Forcing numbers of stop signs. Theor. Comput. Sci. 303(2-3): 409-416 (2003) - Daniel Lenz:
Hierarchical structures in Sturmian dynamical systems. Theor. Comput. Sci. 303(2-3): 463-490 (2003) - Krzysztof Lorys, Katarzyna E. Paluch
:
New approximation algorithm for RTILE problem. Theor. Comput. Sci. 303(2-3): 517-537 (2003) - Johann A. Makowsky, Julian Mariño:
Tree-width and the monadic quantifier hierarchy. Theor. Comput. Sci. 303(1): 157-170 (2003) - Larisa Maksimova:
Complexity of some problems in positive and related calculi. Theor. Comput. Sci. 303(1): 171-185 (2003) - Grigori Mints:
A termination proof for epsilon substitution using partial derivations. Theor. Comput. Sci. 303(1): 187-213 (2003) - Damian Niwinski, Igor Walukiewicz:
A gap property of deterministic tree languages. Theor. Comput. Sci. 303(1): 215-231 (2003) - Igor Pak:
Tile invariants: new horizons. Theor. Comput. Sci. 303(2-3): 303-331 (2003) - James Gary Propp:
Generalized domino-shuffling. Theor. Comput. Sci. 303(2-3): 267-301 (2003) - Alexander A. Razborov:
Resolution lower bounds for the weak functional pigeonhole principle. Theor. Comput. Sci. 303(1): 233-243 (2003) - Sergei Soloviev, Vladimir Orevkov:
On categorical equivalence of Gentzen-style derivations in IMLL. Theor. Comput. Sci. 303(1): 245-260 (2003) - Nicolas Thiant:
An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. Theor. Comput. Sci. 303(2-3): 353-374 (2003)
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-09-08 04:08 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