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=107
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A very hard log-space counting class
Carme Álvarez
,
Birgit Jenner
Theoretical Computer Science
107
, 1993, pp. 3-30
Extensions to Barrington's M-program model
François Bédard
,
François Lemieux
,
Pierre McKenzie
Theoretical Computer Science
107
, 1993, pp. 31-61
On read-once threshold formulae and their randomized decision tree complexity
Rafi Heiman
,
Ilan Newman
,
Avi Wigderson
Theoretical Computer Science
107
, 1993, pp. 63-76
Unambiguity of circuits
Klaus-Jörn Lange
Theoretical Computer Science
107
, 1993, pp. 77-94
Circuit size relative to pseudorandom oracles
Jack H. Lutz
,
William J. Schmidt
Theoretical Computer Science
107
, 1993, pp. 95-120
The computational complexity of universal hashing
Yishay Mansour
,
Noam Nisan
,
Prasoon Tiwari
Theoretical Computer Science
107
, 1993, pp. 121-133
On read-once vs.\ multiple access to randomness in logspace
Noam Nisan
Theoretical Computer Science
107
, 1993, pp. 135-144
Quantifiers and approximation
Alessandro Panconesi
,
Desh Ranjan
Theoretical Computer Science
107
, 1993, pp. 145-163
Comprehension categories and the semantics of type dependency
Bart Jacobs
Theoretical Computer Science
107
, 1993, pp. 169-207
C-expressions: a variable-free calculus for equational logic programming
Marco Bellia
,
M. Eugenia Occhiuto
Theoretical Computer Science
107
, 1993, pp. 209-252
Principal types of BCK-lambda-terms
Sachio Hirokawa
Theoretical Computer Science
107
, 1993, pp. 253-276
Graph properties for normal logic programs
Agostino Cortesi
,
Gilberto Filé
Theoretical Computer Science
107
, 1993, pp. 277-303
Semantic models for total correctness and fairness
Michael G. Main
,
David L. Black
Theoretical Computer Science
107
, 1993, pp. 305-332
Capturing strong reduction in director string calculus
Vugranam Sreedhar
,
Kazem Taghva
Theoretical Computer Science
107
, 1993, pp. 333-347
The undecidability of pattern matching in calculi where primitive recursive functions are representable
Gilles Dowek
Theoretical Computer Science
107
, 1993, pp. 349-356
Unique decomposition of processes
Robin Milner
,
Faron Moller
Theoretical Computer Science
107
, 1993, pp. 357-363