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 Volume=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Robust algorithms for packet routing in a mesh
P. Raghavan
Math. Systems Theory
28
(1), 1995, pp. 1-11
A fast algorithm to compute irreducible and primitive polynomials in finite fields
J. Rifà
,
J. Borrell
Math. Systems Theory
28
(1), 1995, pp. 13-20
Separating complexity classes related to bounded alternating
\omega
-branching programs
C. Meinel
,
S. Waack
Math. Systems Theory
28
(1), 1995, pp. 21-39
Different local controls for graph relabeling systems
I. Litovsky
,
Y. Métivier
,
E. Sopena
Math. Systems Theory
28
(1), 1995, pp. 41-65
On unification of terms with integer exponents
H. Comon
Math. Systems Theory
28
(1), 1995, pp. 67-88
Fast parallel Lyndon factorization with applications
A. Apostolico
,
M. Crochemore
Math. Systems Theory
28
(2), 1995, pp. 89-108
Productive functions and isomorphisms
Wang Jie
Math. Systems Theory
28
(2), 1995, pp. 109-116
Adaptive logspace reducibility and parallel time
C. Àlvarez
,
J.L. Balcázar
,
B. Jenner
Math. Systems Theory
28
(2), 1995, pp. 117-140
Learning reliably and with one-sided error
J. Kivinen
Math. Systems Theory
28
(2), 1995, pp. 141-172
On computing Boolean connectives of characteristic functions
R. Chang
,
J. Kadin
Math. Systems Theory
28
(3), 1995, pp. 173-198
Pumping lemmas for the control language hierarchy
M.A. Palis
,
S.M. Shende
Math. Systems Theory
28
(3), 1995, pp. 199-213
Communication complexity of matrix computation over finite fields
J.I. Chu
,
G. Schnitger
Math. Systems Theory
28
(3), 1995, pp. 215-228
On closure properties of bounded two-sided error complexity classes
K.W. Regan
,
J.S. Royer
Math. Systems Theory
28
(3), 1995, pp. 229-243
Power of interconnections and of nondeterminism in regular
Y
-tree systolic automata
E. Fachini
,
J. Gruska
,
M. Napoli
,
D. Parente
Math. Systems Theory
28
(3), 1995, pp. 245-266
Prudence in vacillatory language identification
S. Jain
,
A. Sharma
Math. Systems Theory
28
(3), 1995, pp. 267-279
A lower bound for monotone perceptrons
F. Green
Math. Systems Theory
28
(4), 1995, pp. 283-298
A refinement of the low and high hierarchies
T.J. Long
,
Ming-Jye Sheu
Math. Systems Theory
28
(4), 1995, pp. 299-327
On the power of 1-tape off-line ATMs running in a bounded number of reversals
M. Liśkievicz
Math. Systems Theory
28
(4), 1995, pp. 329-339
On confluence of one-rule trace-rewriting systems
C. Wrathall
,
V. Diekert
Math. Systems Theory
28
(4), 1995, pp. 341-361
On confluence versus strong confluence for one-rule trace-rewriting systems
F. Otto
Math. Systems Theory
28
(4), 1995, pp. 363-384
Recognizing binary Hamming graphs in
O(n^2\log n)
time
F. Aurenhammer
,
J. Hagauer
Math. Systems Theory
28
(5), 1995, pp. 387-395
Logical definability of some rational trace languages
C. Choffrut
,
L. Guerra
Math. Systems Theory
28
(5), 1995, pp. 397-420
Unison, canon, and sluggish clocks in networks controlled by a synchronizer
S. Even
,
S. Rajsbaum
Math. Systems Theory
28
(5), 1995, pp. 421-435
Rational transductions and complexity of counting problems
C. Choffrut
,
M. Goldwurm
Math. Systems Theory
28
(5), 1995, pp. 437-450
The performance of greedy algorithms for the on-line Steiner tree and related problems
J. Westbrook
,
D.C.K. Yan
Math. Systems Theory
28
(5), 1995, pp. 451-468
Seiten 1
2
>