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=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the capabilities of systolic systems
Shimon Even
,
Ami Litman
Math. Systems Theory
27
(1), 1994, pp. 3-28
Parallel algorithms for routing in nonblocking networks
Geng Lin
,
Nicholas Pippenger
Math. Systems Theory
27
(1), 1994, pp. 29-40
An approach to emulating separable graphs
Bojana Obrenić
Math. Systems Theory
27
(1), 1994, pp. 41-63
Understanding retiming through maximum average-delay cycles
Marios C. Papaefthymiou
Math. Systems Theory
27
(1), 1994, pp. 65-84
Optimal speedup for backtrack search on a butterfly network
Abhiram Ranade
Math. Systems Theory
27
(1), 1994, pp. 85-101
Some results on uniform arithmetic circuit complexity
Gudmund S. Frandsen
,
Mark Valence
,
David A. Mix Barrington
Math. Systems Theory
27
(2), 1994, pp. 105-124
On completeness for NP via projection translations
Iain A. Stewart
Math. Systems Theory
27
(2), 1994, pp. 125-157
Semantics of trees
A. Ehrenfeucht
,
G. Rozenberg
,
K. Salomaa
Math. Systems Theory
27
(2), 1994, pp. 159-181
An application of the translational method
Bin Fu
,
Hong-zhou Li
,
Yong Zhong
Math. Systems Theory
27
(2), 1994, pp. 183-186
Generalized theorems on relationships among reducibility notions to certain complexity classes
Mitsunori Ogiwara
Math. Systems Theory
27
(3), 1994, pp. 189-200
An observation on probability versus randomness with applications to complexity classes
Ronald V. Book
,
Jack H. Lutz
,
Klaus W. Wagner
Math. Systems Theory
27
(3), 1994, pp. 201-209
A framework for polynomial-time query learnability
Osamu Watanabe
Math. Systems Theory
27
(3), 1994, pp. 211-229
Structural analysis of polynomial-time query learnability
Osamu Watanabe
,
Ricard Gavaldà
Math. Systems Theory
27
(3), 1994, pp. 231-256
On the complexity of graph reconstruction
Dieter Kratsch
,
Lane A. Hemaspaandra
Math. Systems Theory
27
(3), 1994, pp. 257-273
Computability by finite automata and Pisot bases
Daniel Berend
,
Christiane Frougny
Math. Systems Theory
27
(3), 1994, pp. 275-282
Equivalence of finite-valued tree transducers is decidable
H. Seidl
Math. Systems Theory
27
(4), 1994, pp. 285-346
A note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
Montserrat Hermo
,
Elvira Mayordomo
Math. Systems Theory
27
(4), 1994, pp. 347-356
A new polynomial-time algorithm for the maximum weighted
(\chi(G)-1)
-coloring problem in comparability graphs
A. Hertz
Math. Systems Theory
27
(4), 1994, pp. 357-363
Statistical properties of finite sequences with high Kolmogorov complexity
Ming Li
,
Paul M.B. Vitányi
Math. Systems Theory
27
(4), 1994, pp. 365-376
Universality of iterated networks
R.F. Chamberlain
,
C.M. Fiduccia
Math. Systems Theory
27
(5), 1994, pp. 381-430
Designing broadcasting algorithms in the postal model for message-passing systems
Amotz Bar-Noy
,
S. Kipnis
Math. Systems Theory
27
(5), 1994, pp. 431-452
Primitives for asynchronous list compression
R.J. Anderson
Math. Systems Theory
27
(5), 1994, pp. 453-470
Branch-and-bound and backtrack search on mesh-connected arrays of processors
C. Kaklamanis
,
G. Persiano
Math. Systems Theory
27
(5), 1994, pp. 471-489
The equivalence of four extensions of context-free grammars
K. Vijay-Shanker
,
D.J. Weir
Math. Systems Theory
27
(6), 1994, pp. 511-546
Efficiency of semisynchronous versus asynchronous networks
H. Attiya
,
M. Mavronicolas
Math. Systems Theory
27
(6), 1994, pp. 547-571