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=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On intractability of the class
UP
Osamu Watanabe
Math. Systems Theory
24
, 1991, pp. 1-10
A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
Zvi Miller
,
I.H. Sudborough
Math. Systems Theory
24
, 1991, pp. 11-40
On problems for which no oracle can help
Juraj Hromkovic̑
Math. Systems Theory
24
, 1991, pp. 41-52
Limitations of the upward separation technique
Eric Allender
Math. Systems Theory
24
, 1991, pp. 53-67
On polynomial-time truth-table reducibility of intractable sets to
P
-selective sets
Seinosuke Toda
Math. Systems Theory
24
, 1991, pp. 69-82
Self-reducible sets of small density
Antoni Lozano
,
Jacobo Torán
Math. Systems Theory
24
, 1991, pp. 83-100
A computer-assisted optimal depth lower bound for nine-input sorting networks
Ian Parberry
Math. Systems Theory
24
, 1991, pp. 101-116
A geometrical view of the determinization and minimization of finite-state automata
Bruno Courcelle
,
Damian Niwinski
,
Andreas Podelski
Math. Systems Theory
24
, 1991, pp. 117-146
On limitations of transformations between combinatorial problems
William Slough
,
Karl Winklmann
Math. Systems Theory
24
, 1991, pp. 149-168
Bandwidth minimization: An approximation algorithm for caterpillars
J. Haralambides
,
F. Makedon
,
B. Monien
Math. Systems Theory
24
, 1991, pp. 169-177
Completeness for nondeterministic complexity classes
Harry Buhrman
,
Steven Homer
,
Leen Torenvliet
Math. Systems Theory
24
, 1991, pp. 179-200
Selection and sorting in totally monotone arrays
Dina Kravets
,
James K. Park
Math. Systems Theory
24
, 1991, pp. 201-220
Tight bounds for oblivious routing in the hypercube
Christos Kaklamanis
,
Danny Krizanc
,
Thanasis Tsantilas
Math. Systems Theory
24
, 1991, pp. 223-232
A unified framework for off-line permutation routing in parallel networks
Marc Baumslag
,
Fred Annexstein
Math. Systems Theory
24
, 1991, pp. 233-251
Fast algorithms for bit-serial routing on a hypercube
William A. Aiello
,
F.T. Leighton
,
Bruce M. Maggs
,
Mark Newman
Math. Systems Theory
24
, 1991, pp. 253-271
Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
Yuh-Dauh Lyuu
Math. Systems Theory
24
, 1991, pp. 273-294
Routing multiple paths in hypercubes
David S. Greenberg
,
Sandeep N. Bhatt
Math. Systems Theory
24
, 1991, pp. 295-321