Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=116
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finite-model theory - a personal perspective
Ronald Fagin
Theoretical Computer Science
116
(1), 1993, pp. 3-31
On the complexity of queries in the logical data model
Gabriel M. Kuper
,
Moshe Y. Vardi
Theoretical Computer Science
116
(1), 1993, pp. 33-57
Algebraic optimization of object-oriented query languages
Catriel Beeri
,
Yoram Kornatzky
Theoretical Computer Science
116
(1), 1993, pp. 59-94
Low-complexity aggregation in GraphLog and Datalog
Mariano P. Consens
,
Alberto O. Mendelzon
Theoretical Computer Science
116
(1), 1993, pp. 95-116
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
Peter Z. Revesz
Theoretical Computer Science
116
(1), 1993, pp. 117-149
Recursively indefinite databases
Ron van der Meyden
Theoretical Computer Science
116
(1), 1993, pp. 151-194
Efficient sampling strategies for relational database operations
Richard J. Lipton
,
Jeffrey F. Naughton
,
Donovan A. Schneider
,
S. Seshadri
Theoretical Computer Science
116
(1), 1993, pp. 195-226
T-structures, T-functions, and texts
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
116
(2), 1993, pp. 227-290
Using geometric rewrite rules for solving geometric problems symbolically
Beat Brüderlin
Theoretical Computer Science
116
(2), 1993, pp. 291-303
Efficient constructions of test sets for regular and context-free languages
Juhani Karhumäki
,
Wojciech Rytter
,
Stefan Jarominek
Theoretical Computer Science
116
(2), 1993, pp. 305-316
Computability of recurrence equations
Yannick Saouter
,
Patrice Quinton
Theoretical Computer Science
116
(2), 1993, pp. 317-337
Language-theoretic problems arising from Richelieu cryptosystems
Mircea Andraşiu
,
Gheorghe Păun
,
Jürgen Dassow
,
Arto Salomaa
Theoretical Computer Science
116
(2), 1993, pp. 339-357
Dynamic algorithms for shortest paths in planar graphs
Esteban Feuerstein
,
Alberto Marchetti-Spaccamela
Theoretical Computer Science
116
(2), 1993, pp. 359-371
Affine automata and related techniques for generation of complex images
Karel Culik II
,
Simant Dube
Theoretical Computer Science
116
(2), 1993, pp. 373-398
Improvements on Khrapchenko's theorem
Elias Koutsoupias
Theoretical Computer Science
116
(2), 1993, pp. 399-403
On generalized Horn formulas and
k
-resolution
Hans Kleine Büning
Theoretical Computer Science
116
(2), 1993, pp. 405-413
On shifting networks
Pavel Pudlák
,
Petr Savický
Theoretical Computer Science
116
(2), 1993, pp. 415-419
Fast recognition of deterministic cfl's with a smaller number of processors
Burkhard Monien
,
Wojciech Rytter
,
Leopold Schäpers
Theoretical Computer Science
116
(2), 1993, pp. 421-429