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=Inf.~Comput. AND YEAR=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Type inference for polymorphic references
Mads Tofte
Information and Computation
89
(1), 1990, pp. 1-34
A characterization of lambda definable tree operations
Marek Zaionc
Information and Computation
89
(1), 1990, pp. 35-46
Creating order in sequence spaces with simple machines
Rudolf Ahlswede
,
Jian-Ping Ye
,
Zhen Zhang
Information and Computation
89
(1), 1990, pp. 47-94
Rounds versus time for the two person pebble game
Bala Kalyanasundaram
,
Georg Schnitger
Information and Computation
88
(1), 1990, pp. 1-17
Easy multiplications. II. Extensions of rational semigroups
Maryse Pelletier
,
Jacques Sakarovitch
Information and Computation
88
(1), 1990, pp. 18-59
Symmetry breaking in distributed networks
Alon Itai
,
Michael Rodeh
Information and Computation
88
(1), 1990, pp. 60-87
Milking the Aanderaa argument
Ramamohan Paturi
,
Joel I. Seiferas
,
Janos Simon
,
Richard E. Newman-Wolfe
Information and Computation
88
(1), 1990, pp. 88-104
On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels
Chein-I Chang
,
Simon C. Fan
,
Lee D. Davisson
Information and Computation
86
(1), 1990, pp. 1-13
On ground-confluence of term rewriting systems
Deepak Kapur
,
Paliath Narendran
,
Friedrich Otto
Information and Computation
86
(1), 1990, pp. 14-31
On the varieties of languages associated with some varieties of finite monoids with commuting idempotents
C.J. Ash
,
T.E. Hall
,
J.E. Pin
Information and Computation
86
(1), 1990, pp. 32-42
CCS expressions, finite state processes, and three problems of equivalence
Paris C. Kanellakis
,
Scott A. Smolka
Information and Computation
86
(1), 1990, pp. 43-68
A characterization of heaps and its applications
Jörg-Rüdiger Sack
,
Thomas Strothotte
Information and Computation
86
(1), 1990, pp. 69-86
The complexity of finding uniform emulations on paths and ring networks
Hans L. Bodlaender
Information and Computation
86
(1), 1990, pp. 87-106
Parallel complexity of the regular code problem
Bruce E. Litow
Information and Computation
86
(1), 1990, pp. 107-114
Stability and computability in coherent domains
Andrea Asperti
Information and Computation
86
(2), 1990, pp. 115-139
A distributed shortest path algorithm for a planar network
Greg N. Frederickson
Information and Computation
86
(2), 1990, pp. 140-159
Kolmogorov complexity and degrees of tally sets
Eric Allender
,
Osamu Watanabe
Information and Computation
86
(2), 1990, pp. 160-178
On measuring nondeterminism in regular languages
Jonathan Goldstine
,
C.M.R. Kintala
,
Detlef Wotschke
Information and Computation
86
(2), 1990, pp. 179-194
A complete rewriting system for a monoid of tree transformation classes
Z. Fülöp
,
S. Vágvölgyi
Information and Computation
86
(2), 1990, pp. 195-212