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=SIAM J. Comput. AND Volume=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Information dissemination in trees
P.J. Slater
,
E.J. Cockayne
,
S.T. Hedetniemi
SIAM Journal on Computing
10
(4), 1981, November, pp. 692-701
Some complexity results in the design of deadlock-free packet switching networks
S. Toueg
,
K. Steiglitz
SIAM Journal on Computing
10
(4), 1981, November, pp. 702-712
The NP-completeness of some edge-partition problems
I. Holyer
SIAM Journal on Computing
10
(4), 1981, November, pp. 713-717
The NP-completeness of edge-coloring
I. Holyer
SIAM Journal on Computing
10
(4), 1981, November, pp. 718-720
Optimal retrieval algorithms for small region queries
A. Bolour
SIAM Journal on Computing
10
(4), 1981, November, pp. 721-741
Limitations on separating nondeterministic complexity classes
Charles W. Rackoff
,
Joel I. Seiferas
SIAM Journal on Computing
10
(4), 1981, November, pp. 742-745
Covering graphs by simple circuits
A. Itai
,
R.J. Lipton
,
C.H. Papadimitriou
,
M. Rodeh
SIAM Journal on Computing
10
(4), 1981, November, pp. 746-750
Power of natural semijoins
P.A. Bernstein
,
N. Goodman
SIAM Journal on Computing
10
(4), 1981, November, pp. 751-771
Minimizing the number of evaluation passes for attribute grammars
K.-J. Räihä
,
E. Ukkonen
SIAM Journal on Computing
10
(4), 1981, November, pp. 772-786
Completeness, approximation and density
K.-I. Ko
,
D. Moore
SIAM Journal on Computing
10
(4), 1981, November, pp. 787-796
An efficient cycle vector space algorithm for listing all cycles of a planar graph
Maciej M. Sysƚo
SIAM Journal on Computing
10
(4), 1981, November, pp. 797-808
Distributed processor scheduling and user countermeasures
A.B. Barak
,
P.J. Downey
SIAM Journal on Computing
10
(4), 1981, November, pp. 809-819
Seiten
<
1
2
3