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=11
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the accepting density hierarchy in
NP
S. Moran
SIAM Journal on Computing
11
(2), 1982, May, pp. 344-349
A scheme for fast parallel communication
L.G. Valiant
SIAM Journal on Computing
11
(2), 1982, May, pp. 350-361
Computation of matrix chain products. Part I
T.C. Hu
,
M.T. Shing
SIAM Journal on Computing
11
(2), 1982, May, pp. 362-373
On primality tests
Daniel J. Lehmann
SIAM Journal on Computing
11
(2), 1982, May, pp. 374-375
The complexity of finding cycles in periodic functions
R. Sedgewick
,
T.G. Szymanski
,
A.C. Yao
SIAM Journal on Computing
11
(2), 1982, May, pp. 376-390
Freedom from deadlock of safe locking patterns
M. Yannakakis
SIAM Journal on Computing
11
(2), 1982, May, pp. 391-408
The counterfeit coin problem revisited
N. Linial
,
M. Tarsi
SIAM Journal on Computing
11
(3), 1982, August, pp. 409-415
\Omega(n\log n)
lower bounds on length of Boolean formulas
M.J. Fischer
,
A.R. Meyer
,
M.S. Paterson
SIAM Journal on Computing
11
, 1982, pp. 416-427
On the average-case complexity of selecting the
k
th best
A.C.-C. Yao
,
F.F. Yao
SIAM Journal on Computing
11
(3), 1982, August, pp. 428-447
The equivalence problem for deterministic two-way sequential transducers is decidable
Eitan M. Gurari
SIAM Journal on Computing
11
(3), 1982, August, pp. 448-452
The working set size distribution for the Markov chain model of program behavior
M. Hofri
,
P. Tzelnic
SIAM Journal on Computing
11
(3), 1982, August, pp. 453-466
Rapid multiplication of rectangular matrices
D. Coppersmith
SIAM Journal on Computing
11
(3), 1982, August, pp. 467-471
On the asymptotic complexity of matrix multiplication
D. Coppersmith
,
S. Winograd
SIAM Journal on Computing
11
(3), 1982, August, pp. 472-492
A lubricant for data flow analysis
B.K. Rosen
SIAM Journal on Computing
11
(3), 1982, August, pp. 493-511
Complexity results for scheduling tasks in fixed intervals on two types of machines
K. Nakajima
,
S.L. Hakimi
,
J.K. Lenstra
SIAM Journal on Computing
11
(3), 1982, August, pp. 512-520
Completions of partially ordered sets
B. Banaschewski
,
E. Nelson
SIAM Journal on Computing
11
(3), 1982, August, pp. 521-528
The Hamiltonian circuit problem is polynomial for 4-connected planar graphs
D. Gouyou-Beauchamps
SIAM Journal on Computing
11
(3), 1982, August, pp. 529-539
On edge coloring bipartite graphs
R. Cole
,
J. Hopcroft
SIAM Journal on Computing
11
(3), 1982, August, pp. 540-546
Computational power in query languages
H.W. Davis
,
L.E. Winslow
SIAM Journal on Computing
11
(3), 1982, August, pp. 547-554
Approximation algorithms for the set covering and vertex cover problems
D.S. Hochbaum
SIAM Journal on Computing
11
(3), 1982, August, pp. 555-556
Two spectra of self-organizing sequential search algorithms
A.M. Tenenbaum
,
R.M. Nemes
SIAM Journal on Computing
11
(3), 1982, August, pp. 557-566
Finding the cyclic index of an irreducible, nonnegative matrix
M.J. Atallah
SIAM Journal on Computing
11
(3), 1982, August, pp. 567-570
Relativizing time, space, and time-space
R.V. Book
,
C.B. Wilson
,
Xu Mei-Rui
SIAM Journal on Computing
11
(3), 1982, August, pp. 571-581
Ranking and unranking of 2-3 trees
U. Gupta
,
D.T. Lee
,
C.K. Wong
SIAM Journal on Computing
11
(3), 1982, August, pp. 582-590
On some deterministic space complexity problems
Jia-Wei Hong
SIAM Journal on Computing
11
(3), 1982, August, pp. 591-601
Seiten
<
1
2
3
>