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=Math.~Systems Theory AND YEAR=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cloture votes:
n/4
-resilient distributed consensus in
t+1
rounds
Piotr Berman
,
Juan A. Garay
Math. Systems Theory
26
, 1993, pp. 3-19
A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
Amotz Bar-Noy
,
Danny Dolev
Math. Systems Theory
26
, 1993, pp. 21-39
Message-optimal protocols for Byzantine agreement
Vassos Hadzilacos
,
Joseph Y. Halpern
Math. Systems Theory
26
, 1993, pp. 41-102
The failure discovery problem
Vassos Hadzilacos
,
Joseph Y. Halpern
Math. Systems Theory
26
, 1993, pp. 103-129
Modular construction of an efficient 1-bit Byzantine agreement protocol
Brian A. Coan
,
Jennifer L. Welch
Math. Systems Theory
26
, 1993, pp. 131-154
A note on balanced immunity
Haiko Müller
Math. Systems Theory
26
, 1993, pp. 157-167
Distance automata having large finite distance or finite ambiguity
Andreas Weber
Math. Systems Theory
26
, 1993, pp. 169-185
On lower bounds of the closeness between complexity classes
Bin Fu
Math. Systems Theory
26
, 1993, pp. 187-202
Structural analysis of the complexity of inverse functions
Osamu Watanabe
,
Seinosuke Toda
Math. Systems Theory
26
, 1993, pp. 203-214
On the power of deterministic reductions to
C_{=}P
Frederic Green
Math. Systems Theory
26
, 1993, pp. 215-233
State-complexity of finite-state devices, state compressibility and incompressibility
Jean-Camille Birget
Math. Systems Theory
26
(3), 1993, pp. 237-269
On the diameter and bisector size of Cayley graphs
Fred Annexstein
,
Marc Baumslag
Math. Systems Theory
26
(3), 1993, pp. 271-291
A relationship between difference hierarchies and relativized polynomial hierarchies
Richard Beigel
,
Richard Chang
,
Mitsunori Ogiwara
Math. Systems Theory
26
(3), 1993, pp. 293-310
On reducing the number of stack symbols in a PDA
Jonathan Goldstine
,
John K. Price
,
Detlef Wotschke
Math. Systems Theory
26
(4), 1993, pp. 313-326
On the effective generation of set elements within specified ranges
Laura A. Sanchis
Math. Systems Theory
26
(4), 1993, pp. 327-341
A model of sequential computation with pipelined access to memory
Fabrizio Luccio
,
Linda Pagli
Math. Systems Theory
26
(4), 1993, pp. 343-356
Complexity analysis of propositional concurrent programs using domino tiling
Hsu-Chun Yen
,
Namhee Pak
Math. Systems Theory
26
(4), 1993, pp. 357-378
Concise representations of regular languages by degree and probabilistic finite automata
Chandra M.R. Kintala
,
Kong-Yee Pun
,
Detlef Wotschke
Math. Systems Theory
26
(4), 1993, pp. 379-395