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=81
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A complete classification of deterministic root-to-frontier tree transformation classes
Z. Fülöp
,
S. Vágvölgyi
Theoretical Computer Science
81
, 1991, pp. 1-15
Les boîtes
Jean-Marie Boë
Theoretical Computer Science
81
, 1991, pp. 17-34
Polynomial-time reducibilities and ``almost all'' oracle sets
Shouwen Tang
,
Ronald V. Book
Theoretical Computer Science
81
, 1991, pp. 35-47
Counting the number of solutions for instances of satisfiability
Olivier Dubois
Theoretical Computer Science
81
, 1991, pp. 49-64
Probabilistic approach to the satisfiability problem
Olivier Dubois
,
Jacques Carlier
Theoretical Computer Science
81
, 1991, pp. 65-75
On the complexity of counting in the polynomial hierarchy
Marek Piotrów
Theoretical Computer Science
81
, 1991, pp. 77-95
Fast parallel and serial multidimensional approximate array matching
Amihood Amir
,
Gad M. Landau
Theoretical Computer Science
81
, 1991, pp. 97-115
Abstract functional dependency structures
Frantis̑ek Matús̑
Theoretical Computer Science
81
, 1991, pp. 117-126
An upward measure separation theorem
Jack H. Lutz
Theoretical Computer Science
81
, 1991, pp. 127-135
Limitedness theorem on finite automata with distance functions: an algebraic proof
Hing Leung
Theoretical Computer Science
81
, 1991, pp. 137-145
On the number of partially abelian square-free words on a three-letter alphabet
Robert Cori
,
Maria Rosaria Formisano
Theoretical Computer Science
81
, 1991, pp. 147-153
One-way functions and the nonisomorphism of NP-complete sets
Juris Hartmanis
,
Lane A. Hemachandra
Theoretical Computer Science
81
, 1991, pp. 155-163
Semi-unification
Deepak Kapur
,
David Musser
,
Paliath Narendran
,
Jonathan Stillman
Theoretical Computer Science
81
, 1991, pp. 169-187
Padding, commitment and self-reducibility
Sanjeev N. Khadilkar
,
Somenath Biswas
Theoretical Computer Science
81
, 1991, pp. 189-199
Accumulators: new logic variable abstractions for functional languages
Keshav Pingali
,
Kattamuri Ekanadham
Theoretical Computer Science
81
, 1991, pp. 201-221
A resolution rule for well-formed formulae
K.S.H.S.R. Bhatta
,
Harish Karnick
Theoretical Computer Science
81
, 1991, pp. 223-235
New lower bound techniques for distributed leader finding and other problems on rings of processors
Hans L. Bodlaender
Theoretical Computer Science
81
, 1991, pp. 237-256
The conjunctive complexity of quadratic Boolean functions
Katja Lenz
,
Ingo Wegener
Theoretical Computer Science
81
, 1991, pp. 257-268
Abstract grammars based on transductions
Peter R.J. Asveld
Theoretical Computer Science
81
, 1991, pp. 269-288
On the connectedness of pictures in chain code picture languages
Jürgen Dassow
Theoretical Computer Science
81
, 1991, pp. 289-294
Recognizing different types of beta-cycles in a database scheme
To-Yat Cheung
,
Yunzhou Zhu
Theoretical Computer Science
81
, 1991, pp. 295-304
On the power of cooperation: a regular representation of recursively enumerable languages
Erzsébet Csuhaj-Varjú
,
Jozef Kelemen
Theoretical Computer Science
81
, 1991, pp. 305-310
On the parallel recognition of unambiguous context-free languages
Michal Chytil
,
Maxime Crochemore
,
Burkhard Monien
,
Wojciech Rytter
Theoretical Computer Science
81
, 1991, pp. 311-316
On total functions, existence theorems and computational complexity
Nimrod Megiddo
,
Christos H. Papadimitriou
Theoretical Computer Science
81
, 1991, pp. 317-324