![](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
Theoretical Computer Science, Volume 116
Volume 116, Number 1, August 1993
- Ronald Fagin:
Finite-Model Theory - A Personal Perspective. 3-31 - Gabriel M. Kuper, Moshe Y. Vardi:
On the Complexity of Queries in the Logical Data Model. 33-57 - Catriel Beeri, Yoram Kornatzky:
Algebraic Optimization of Object-Oriented Query Languages. 59-94 - Mariano P. Consens
, Alberto O. Mendelzon:
Low Complexity Aggregation in GraphLog and Datalog. 95-116 - Peter Z. Revesz
:
A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints. 117-149 - Ron van der Meyden:
Recursively Indefinite Databases. 151-194 - Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider, S. Seshadri:
Efficient Sampling Strategies for Relational Database Operations. 195-226
Volume 116, Number 2, August 1993
- Andrzej Ehrenfeucht, Grzegorz Rozenberg:
T-structures, T-functions, and texts. 227-290 - Beat D. Brüderlin:
Using geometric rewrite rules for solving geometric problems symbolically. 291-303 - Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek:
Efficient constructions of test sets for regular and context-free languages. 305-316 - Yannick Saouter, Patrice Quinton:
Computability of recurrence equations. 317-337 - Mircea Andrasiu, Gheorghe Paun, Jürgen Dassow, Arto Salomaa:
Language-theoretic problems arising from Richelieu cryptosystems. 339-357 - Esteban Feuerstein, Alberto Marchetti-Spaccamela
:
Dynamic algorithms for shortest paths in planar graphs. 359-371 - Karel Culík II, Simant Dube:
Affine automata and related techniques for generation of complex images. 373-398
- Elias Koutsoupias:
Improvements on Khrapchenko's theorem. 399-403 - Hans Kleine Büning:
On generalized Horn formulas and k-resolution. 405-413 - Pavel Pudlák, Petr Savický:
On shifting networks. 415-419 - Burkhard Monien, Wojciech Rytter, Leopold Schäpers:
Fast recognition of deterministic cfl's with a smaller number of processors. 421-429
![](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.