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=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Probabilistic asynchronous automata
S. Jesi
,
G. Pighizzini
,
N. Sabadini
Math. Systems Theory
29
(1), 1996, pp. 5-31
On the power of generalized MOD-classes
J. Köbler
,
Seinsosuke Toda
Math. Systems Theory
29
(1), 1996, pp. 33-46
Representation of reversible cellular automata with block permutations
J. Kari
Math. Systems Theory
29
(1), 1996, pp. 47-61
Upper bounds for the complexity of sparse and tally descriptions
V. Arvind
,
J. Köbler
,
M. Mundhenk
Math. Systems Theory
29
(1), 1996, pp. 63-94
The bisection width of grid graphs
C.H. Papadimitriou
,
M. Sideri
Math. Systems Theory
29
(2), 1996, pp. 97-110
Representing shared data on distributed-memory parallel computers
K.T. Herley
Math. Systems Theory
29
(2), 1996, pp. 111-156
Improved approximations for the minimum-cut ratio and the flux
S. Tragoudas
Math. Systems Theory
29
(2), 1996, pp. 157-167
A hierarchy of deterministic top-down tree transformations
G. Slutzki
,
S. Vágvölgyi
Math. Systems Theory
29
(2), 1996, pp. 169-188
Two-way automata and length-preserving homomorphisms
J.-C. Birget
Math. Systems Theory
29
(3), 1996, pp. 191-226
Tree-stack automata
W. Golubski
,
W.M. Lippe
Math. Systems Theory
29
(3), 1996, pp. 227-244
On the correlation of symmetric functions
Jin-Yi Cai
,
F. Green
,
T. Thierauf
Math. Systems Theory
29
(3), 1996, pp. 245-258
Learning two-tape automata from queries and counterexamples
T. Yokomori
Math. Systems Theory
29
(3), 1996, pp. 259-270
Relations between varieties of Kolmogorov complexities
V.A. Uspensky
,
A. Shen
Math. Systems Theory
29
(3), 1996, pp. 271-292
An enlarged family of packing polynomials on multidimensional lattices
L.B. Morales
,
J.S. Lew
Math. Systems Theory
29
(3), 1996, pp. 293-303
Diagonal polynomials for small dimensions
J.S. Lew
,
L.B. Morales
,
A. Sánchez-Flores
Math. Systems Theory
29
(3), 1996, pp. 305-310
Flit-serial packet routing on meshes and tori
F. Makedon
,
A. Symvonis
Math. Systems Theory
29
(4), 1996, pp. 311-330
Computing functions on asynchronous anonymous networks
M. Yamashita
,
T. Kameda
Math. Systems Theory
29
(4), 1996, pp. 331-356
\Pi-\Sigma-\Pi
threshold formulas
J. Radhakrishnan
Math. Systems Theory
29
(4), 1996, pp. 357-374
A note on busy beavers and other creatures
A.M. Ben-Amram
,
B.A. Julstrom
,
U. Zwick
Math. Systems Theory
29
(4), 1996, pp. 375-386
DNA sequencing and string learning
Tao Jiang
,
Ming Li
Math. Systems Theory
29
(4), 1996, pp. 387-405
On small cuts separating an Abelian Cayley graph into two equal parts
Y.O. Hamidoune
,
O. Serra
Math. Systems Theory
29
(4), 1996, pp. 407-409
On balanced versus unbalanced computation trees
U. Hertrampf
,
H. Vollmer
,
K.W. Wagner
Math. Systems Theory
29
(4), 1996, pp. 411-421
UP
and the low and high hierarchies: A relativized separation
M.-J. Sheu
,
T.J. Long
Math. Systems Theory
29
(5), 1996, pp. 423-449
Algebraic specification of interconnection network relationships by permutation voltage graph mappings
J.L. Gross
,
Jianer Chen
Math. Systems Theory
29
(5), 1996, pp. 451-470
The shuffle exchange network has a Hamiltonian path
R. Feldmann
,
P. Mysliwietz
Math. Systems Theory
29
(5), 1996, pp. 471-485
Seiten 1
2
>