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=97
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The parallel complexity of finite-state automata problems
Sang Cho
,
Dung T. Huynh
Information and Computation
97
(1), 1992, March, pp. 1-22
Efficient learning of context-free grammars from positive structural examples
Yasubumi Sakakibara
Information and Computation
97
(1), 1992, March, pp. 23-60
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Brian A. Coan
,
Jennifer L. Welch
Information and Computation
97
(1), 1992, March, pp. 61-85
The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than
n\log n + 1.1n
Ingo Wegener
Information and Computation
97
(1), 1992, March, pp. 86-96
An algebraic model of synchronous systems
Miklós Bartha
Information and Computation
97
(1), 1992, March, pp. 97-131
A model classifying algorithms as inherently sequential with applications to graph searching
Raymond Greenlaw
Information and Computation
97
(2), 1992, April, pp. 133-149
A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
Dan E. Willard
Information and Computation
97
(2), 1992, April, pp. 150-204
Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
Amotz Bar-Noy
,
Danny Dolev
,
Cynthia Dwork
,
H. Raymond Strong
Information and Computation
97
(2), 1992, April, pp. 205-233
The synchronization of nonuniform networks of finite automata
Tao Jiang
Information and Computation
97
(2), 1992, April, pp. 234-261
Polynomial time algorithms for sentences over number fields
Shih Ping Tung
Information and Computation
97
(2), 1992, April, pp. 262-276