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=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructing sets of functions which have a given
F
-cardinality
Ulrich Huckenbeck
Math. Systems Theory
25
, 1992, pp. 3-22
Simultaneous strong separations of probabilistic and unambiguous complexity classes
David Eppstein
,
Lane A. Hemachandra
,
James Tisdall
,
Bülent Yener
Math. Systems Theory
25
, 1992, pp. 23-36
Representations of numbers and finite automata
Christiane Frougny
Math. Systems Theory
25
, 1992, pp. 37-60
The equivalence of pre-NTS grammars is decidable
J.-M. Autebert
,
L. Boasson
Math. Systems Theory
25
, 1992, pp. 61-74
A time-space hierarchy between polynomial time and polynomial space
P. Clote
Math. Systems Theory
25
, 1992, pp. 77-92
Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
Ravi Janardan
,
Siu Wing Cheng
Math. Systems Theory
25
, 1992, pp. 93-122
A note on weighted distributed match-making
Evangelos Kranakis
,
Paul M.B. Vitányi
Math. Systems Theory
25
, 1992, pp. 123-140
The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
Raymond Greenlaw
Math. Systems Theory
25
, 1992, pp. 161-175
Structural properties for feasibly computable classes of type two
Tomoyuki Yamakami
Math. Systems Theory
25
, 1992, pp. 177-201
A survey of one-way functions in complexity theory
Alan L. Selman
Math. Systems Theory
25
, 1992, pp. 203-221
Structure and importance of logspace-MOD class
Gerhard Buntrock
,
Carsten Damm
,
Ulrich Hertrampf
,
Christoph Meinel
Math. Systems Theory
25
, 1992, pp. 223-237
The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems
Friedrich Otto
Math. Systems Theory
25
, 1992, pp. 241-251
Semigroups of shift register counting matrices
Andrew Gleason
Math. Systems Theory
25
, 1992, pp. 253-267
General circular permutation layout
R.D. Lou
,
Majid Sarrafzadeh
,
C.S. Rim
,
Kazuo Nakajima
,
Sumio Masuda
Math. Systems Theory
25
, 1992, pp. 269-292
The complexity of on-line simulations between multidimensional Turing machines and random access machines
Michael C. Loui
,
David R. Luginbuhl
Math. Systems Theory
25
, 1992, pp. 293-308
A result about languages concerning paperfolding sequences
S. Lehr
Math. Systems Theory
25
, 1992, pp. 309-313