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=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New problems complete for nondeterministic log space
Neil D. Jones
,
Y. Edmund Lien
,
William T. Laaser
Math. Systems Theory
10
, 1976/77, pp. 1-17
Relativization of questions about log space computability
Richard E. Ladner
,
Nancy A. Lynch
Math. Systems Theory
10
, 1976/77, pp. 19-32
On the complexity of finite, pushdown, and stack automata
H.B. Hunt III
Math. Systems Theory
10
, 1976/77, pp. 33-52
A class of inifinite dimensional linear systems
F.N. Parr
Math. Systems Theory
10
, 1976/77, pp. 53-67
Almost surely continuous solutions of a nonlinear stochastic integral equation
W.J. Padgett
Math. Systems Theory
10
, 1976/77, pp. 69-75
On the asymptotic behaviour of solutions of differential equations in a Banach space
Wolfgang Hahn
Math. Systems Theory
10
, 1976/77, pp. 77-83
On perturbing Lyapunov functions
V. Lakshmikantham
,
S. Leela
Math. Systems Theory
10
, 1976/77, pp. 85-90
A forbidden subposet characterization of an order-dimension inequality
William T., Jr. Trotter
Math. Systems Theory
10
, 1976/77, pp. 91-96
Design and implementation of an efficient priority queue
P. van Emde Boas
,
R. Kaas
,
E. Zijlstra
Math. Systems Theory
10
, 1976/77, pp. 99-127
Information theory and the complexity of Boolean functions
Nicholas Pippenger
Math. Systems Theory
10
, 1976/77, pp. 129-167
Some bilinear forms whose multiplicative complexity depends on the field of constants
S. Winograd
Math. Systems Theory
10
, 1976/77, pp. 169-180
Total complexity and the inference of best programs
Jerome A. Feldman
,
Paul C. Shields
Math. Systems Theory
10
, 1976/77, pp. 181-191
On storing ragged arrays by hashing
Arnold L. Rosenberg
Math. Systems Theory
10
, 1976/77, pp. 193-210
Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
Zvi Galil
Math. Systems Theory
10
, 1976/77, pp. 211-228
On languages with a certain prefix property
Ronald V. Book
Math. Systems Theory
10
, 1976/77, pp. 229-237
Space bounds for a game on graphs
Wolfgang J. Paul
,
Robert Endre Tarjan
,
James R. Celoni
Math. Systems Theory
10
, 1976/77, pp. 239-251
Observations about bounded languages and developmental systems
Meera Blattner
,
Armin Cremers
Math. Systems Theory
10
, 1976/77, pp. 253-258
On the point transitivity of symbolic flows
E.G. Manes
Math. Systems Theory
10
, 1976/77, pp. 259-261
Existence and uniqueness of minimal realizations of nonlinear systems
Hector J. Sussmann
Math. Systems Theory
10
, 1976/77, pp. 263-284
Perturbations of open sets of attainability
Jan M. Gronski
Math. Systems Theory
10
, 1976/77, pp. 285-287
Top-down tree transducers with regular look-ahead
Joost Engelfriet
Math. Systems Theory
10
, 1976/77, pp. 289-303
Comparing language operations
Stephen Y. Itoga
Math. Systems Theory
10
, 1976/77, pp. 305-321
On the combinational complexity of certain symmetric Boolean functions
Larry J. Stockmeyer
Math. Systems Theory
10
, 1976/77, pp. 323-336
Rudimentary relatons and stack languages
Ytha Y. Yu
Math. Systems Theory
10
, 1976/77, pp. 337-343
Deterministic representation of probabilistic systems by ergodic machines
Sudhir Aggarwal
Math. Systems Theory
10
, 1976/77, pp. 345-361
Seiten 1
2
>