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=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the existence of Cook semantics
A. de Bruin
SIAM Journal on Computing
13
(1), 1984, February, pp. 1-13
Generalized selection and ranking: sorted matrices
G.N. Frederickson
,
D.B. Johnson
SIAM Journal on Computing
13
(1), 1984, February, pp. 14-30
Linear time algorithms for two- and three-variable linear programs
M.E. Dyer
SIAM Journal on Computing
13
(1), 1984, February, pp. 31-45
On synchronous parallel computations with independent probabilistic choice
John H. Reif
SIAM Journal on Computing
13
(1), 1984, February, pp. 46-56
Clique covering of graphs IV. Algorithms
N.J. Pullman
SIAM Journal on Computing
13
(1), 1984, February, pp. 57-75
Formal systems for tuple and equality generating dependencies
C. Beeri
,
M.Y. Vardi
SIAM Journal on Computing
13
(1), 1984, February, pp. 76-98
The traveling salesman problem with many visits to few cities
S.S. Cosmadakis
,
C.H. Papadimitriou
SIAM Journal on Computing
13
(1), 1984, February, pp. 99-108
The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem
U. Manber
,
M. Tompa
SIAM Journal on Computing
13
(1), 1984, February, pp. 109-115
Optimizing chain queries in a distributed database system
Dah-Ming Chiu
,
P.A. Bernstein
,
Yu-Chi Ho
SIAM Journal on Computing
13
(1), 1984, February, pp. 116-134
Alternating pushdown and stack automata
R.E. Ladner
,
R.J. Lipton
,
L.J. Stockmeyer
SIAM Journal on Computing
13
(1), 1984, February, pp. 135-155
Limitations on explicit constructions of expanding graphs
M. Klawe
SIAM Journal on Computing
13
(1), 1984, February, pp. 156-166
Pushdown permuter characterization theorem
Prakash V. Ramanan
SIAM Journal on Computing
13
(1), 1984, February, pp. 167-169
Tighter bounds for the multifit processor scheduling algorithm
D.K. Friesen
SIAM Journal on Computing
13
(1), 1984, February, pp. 170-181
On the complexity of some common geometric location problems
N. Megiddo
,
K.J. Supowit
SIAM Journal on Computing
13
(1), 1984, February, pp. 182-196
Minimal-cost brother trees
T. Ottmann
,
D.S. Parker
,
A.L. Rosenberg
,
H.W. Six
,
D. Wood
SIAM Journal on Computing
13
, 1984, pp. 197-218
Two tapes are better than one for nondeterministic machines
P. Dúris
,
Z. Galil
SIAM Journal on Computing
13
(2), 1984, May, pp. 219-227
Computation of matrix chain products. Part II
T.C. Hu
,
M.T. Shing
SIAM Journal on Computing
13
(2), 1984, May, pp. 228-251
N
by
N
checkers is exptime complete
J.M. Robson
SIAM Journal on Computing
13
(2), 1984, May, pp. 252-267
Parallel solution of certain Toeplitz linear systems
D. Bini
SIAM Journal on Computing
13
(2), 1984, May, pp. 268-276
Self-organizing heuristics for implicit data structures
G.N. Frederickson
SIAM Journal on Computing
13
(2), 1984, May, pp. 277-291
Verification of probabilistic programs
M. Sharir
,
A. Pnueli
,
S. Hart
SIAM Journal on Computing
13
(2), 1984, May, pp. 292-314
Constrained optimum communication trees and sensitivity analysis
S. Agarwal
,
A.K. Mittal
,
P. Sharma
SIAM Journal on Computing
13
(2), 1984, May, pp. 315-328
Immunity, relativizations, and nondeterminism
Uwe Schöning
,
Ronald V. Book
SIAM Journal on Computing
13
(2), 1984, May, pp. 329-337
Fast algorithms for finding nearest common ancestors
Dov Harel
,
Robert E. Tarjan
SIAM Journal on Computing
13
(2), 1984, May, pp. 338-355
The spectra of first-order sentences and computational complexity
E. Grandjean
SIAM Journal on Computing
13
(2), 1984, May, pp. 356-373
Seiten 1
2
3
>