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 Volume=92
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms
Richard Cole
,
Uzi Vishkin
Information and Computation
92
(1), 1991, May, pp. 1-47
Type inference with recursive types: Syntax and semantics
Felice Cardone
,
Mario Coppo
Information and Computation
92
(1), 1991, May, pp. 48-80
Deterministic P-RAM simulation with constant redundancy
Scot W. Hornick
,
Franco P. Preparata
Information and Computation
92
(1), 1991, May, pp. 81-96
A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes
John G. Geske
,
Dung T. Huynh
,
Joel I. Seiferas
Information and Computation
92
(1), 1991, May, pp. 97-104
Simple consequence relations
Arnon Avron
Information and Computation
92
(1), 1991, May, pp. 105-139
Fringe analysis for Extquick: An in situ distributive external sorting algorithm
Walter Cunto
,
Gastón H. Gonnet
,
J. Ian Munro
,
Patricio V. Poblete
Information and Computation
92
(2), 1991, June, pp. 141-160
A domain equation for bisimulation
Samson Abramsky
Information and Computation
92
(2), 1991, June, pp. 161-218
Scheduling chain-structured tasks to minimize makespan and mean flow time
Jianzhong Du
,
Joseph Y.-T. Leung
,
Gilbert H. Young
Information and Computation
92
(2), 1991, June, pp. 219-236
Two dynamic programming algorithms for which interpreted pebbling helps
H. Venkateswaran
Information and Computation
92
(2), 1991, June, pp. 237-252
One-sided error probabilistic inductive inference and reliable frequency identification
Efim Kinber
,
Thomas Zeugmann
Information and Computation
92
(2), 1991, June, pp. 253-284