default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 303
Volume 303, Number 1, 28 June 2003
- Danièle Beauquier, Dimitri Grigoriev, Yuri V. Matiyasevich
:
Biography of A.O. Slissenko. 3-5 - André Arnold, Aymeric Vincent, Igor Walukiewicz:
Games for synthesis of controllers with partial observation. 7-34 - Alessandra Carbone, Misha Gromov:
Functional labels and syntactic entropy on DNA strings and proteins. 35-51 - 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. 53-62 - Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
On feasible cases of checking multi-agent systems behavior. 63-81 - Dima Grigoriev, Edward A. Hirsch:
Algebraic proof systems over formulas. 83-102 - Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati:
On temporal logic versus datalog. 103-133 - Roman M. Kolpakov, Gregory Kucherov:
Finding approximate repetitions under Hamming distance. 135-156 - Johann A. Makowsky, Julian Mariño:
Tree-width and the monadic quantifier hierarchy. 157-170 - Larisa Maksimova:
Complexity of some problems in positive and related calculi. 171-185 - Grigori Mints:
A termination proof for epsilon substitution using partial derivations. 187-213 - Damian Niwinski, Igor Walukiewicz:
A gap property of deterministic tree languages. 215-231 - Alexander A. Razborov:
Resolution lower bounds for the weak functional pigeonhole principle. 233-243 - Sergei Soloviev, Vladimir Orevkov:
On categorical equivalence of Gentzen-style derivations in IMLL. 245-260
Volume 303, Number 2-3, 15 July 2003
- James Gary Propp:
Generalized domino-shuffling. 267-301 - Igor Pak:
Tile invariants: new horizons. 303-331 - Jean-Claude Fournier:
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings. 333-351 - Nicolas Thiant:
An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. 353-374 - Sébastien Desreux:
An algorithm to generate exactly once every tiling with lozenges of a domain. 375-408 - Fumei Lam, Lior Pachter:
Forcing numbers of stop signs. 409-416 - Danièle Beauquier, Maurice Nivat:
A codicity undecidable problem in the plane. 417-430 - Olaf Delgado-Friedrichs:
Data structures and algorithms for tilings I. 431-445 - Thomas L. Fitzkee, Kevin G. Hockett, E. Arthur Robinson Jr.:
A weakly mixing tiling dynamical system with a smooth model. 447-462 - Daniel Lenz:
Hierarchical structures in Sturmian dynamical systems. 463-490 - Christiane Frougny, Jean-Pierre Gazeau, Rudolf Krejcar:
Additive and multiplicative properties of point sets based on beta-integers. 491-516 - Krzysztof Lorys, Katarzyna E. Paluch:
New approximation algorithm for RTILE problem. 517-537 - Kari Eloranta:
The bounded eight-vertex model. 539-552
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.
last updated on 2025-12-05 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
