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=102
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Map theory
Klaus Grue
Theoretical Computer Science
102
, 1992, pp. 1-133
Complete restrictions of the intersection type discipline
Steffen van Bakel
Theoretical Computer Science
102
, 1992, pp. 135-163
Maximality preserving bisimulation
Raymond Devillers
Theoretical Computer Science
102
, 1992, pp. 165-183
A polynomial-time algorithm to decide liveness of bounded free choice nets
Javier Esparza
,
Manuel Silva
Theoretical Computer Science
102
, 1992, pp. 185-205
Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic
Kosta Dos̑en
Theoretical Computer Science
102
, 1992, pp. 207-214
Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets
Danilo Bruschi
Theoretical Computer Science
102
, 1992, pp. 215-252
Binary periodic synchronizing sequences
Marcin Skubiszewski
Theoretical Computer Science
102
, 1992, pp. 253-281
Approximating the permanent of graphs with large factors
Paul Dagum
,
Michael Luby
Theoretical Computer Science
102
, 1992, pp. 283-305
The multiplicative complexity of quadratic boolean forms
R. Mirwald
,
C.P. Schnorr
Theoretical Computer Science
102
, 1992, pp. 307-328
A classification of minimal standard-path
2\times 2
switching networks
Liam Halpenny
,
Christopher J. Smyth
Theoretical Computer Science
102
, 1992, pp. 329-354
An asymptotic equality for the number of necklaces in a shuffle-exchange network
Lakshman Prasad
,
S.S. Iyengar
Theoretical Computer Science
102
, 1992, pp. 355-365