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=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of ranking simple languages
Dung T. Huynh
Math. Systems Theory
23
, 1990, pp. 1-19
Classes of bounded nondeterminism
Josep Díaz
,
Jacobo Torán
Math. Systems Theory
23
, 1990, pp. 21-32
Communicating processes, scheduling, and the complexity of nondetermination
Hsu-Chun Yen
Math. Systems Theory
23
, 1990, pp. 33-59
Optimal embeddings of butterfly-like graphs in the hypercube
David S. Greenberg
,
Lenwood S. Heath
,
Arnold L. Rosenberg
Math. Systems Theory
23
, 1990, pp. 61-77
Single-exception sorting networks and the computational complexity of optimal sorting network verification
Ian Parberry
Math. Systems Theory
23
, 1990, pp. 81-93
On the power of parity polynomial time
Jin-yi Cai
,
Lane A. Hemachandra
Math. Systems Theory
23
, 1990, pp. 95-106
One-way multihead finite automata and 2-bounded languages
Mirosƚaw Kutyƚowski
Math. Systems Theory
23
, 1990, pp. 107-139
Extensions of an idea of McNaughton
David A. Mix Barrington
Math. Systems Theory
23
, 1990, pp. 147-164
Characterizing polynomial complexity classes by reducibilities
Ronald V. Book
,
Shouwen Tang
Math. Systems Theory
23
, 1990, pp. 165-174
Unnecessary inferences in associative-commutative completion procedures
Hantao Zhang
,
Deepak Kapur
Math. Systems Theory
23
, 1990, pp. 175-206
Power indices and easier hard problems
R.E. Stearns
,
H.B. Hunt III
Math. Systems Theory
23
, 1990, pp. 209-225
Exposing graph uniformities via algebraic specification
Arnold L. Rosenberg
Math. Systems Theory
23
, 1990, pp. 227-244
It is decidable whether a monadic Thue system is canonical over a regular set
Paliath Narendran
Math. Systems Theory
23
, 1990, pp. 245-254