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=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient test for circular-arc graphs
A. Tucker
SIAM Journal on Computing
9
(1), 1980, February, pp. 1-24
Solutions of the iteration equation and extensions of the scalar iteration operation
S.L. Bloom
,
C.C. Elgot
,
J.B. Wright
SIAM Journal on Computing
9
(1), 1980, February, pp. 25-45
Refining nondeterminism in relativized polynomial-time bounded computations
C.M.R. Kintala
,
P.C. Fischer
SIAM Journal on Computing
9
(1), 1980, February, pp. 46-53
On the complexity of composition and generalized composition of power series
R.P. Brent
,
J.F. Traub
SIAM Journal on Computing
9
(1), 1980, February, pp. 54-66
The semantics of call-by-value and call-by-name in a nondeterministic environment
M.C.B. Hennessy
SIAM Journal on Computing
9
(1), 1980, February, pp. 67-84
On the optimality of linear merge
P.K. Stockmeyer
,
F.F. Yao
SIAM Journal on Computing
9
(1), 1980, February, pp. 85-90
Bounds for list schedules on uniform processors
Y. Cho
,
S. Sahni
SIAM Journal on Computing
9
(1), 1980, February, pp. 91-103
Worst case exponential lower bounds for input resolution with paramodulation
R. Statman
SIAM Journal on Computing
9
(1), 1980, February, pp. 104-110
An efficient method for weighted sampling without replacement
C.K. Wong
,
M.C. Easton
SIAM Journal on Computing
9
(1), 1980, February, pp. 111-113
On the succinctness of different representations of languages
J. Hartmanis
SIAM Journal on Computing
9
(1), 1980, February, pp. 114-120
Addition chain methods for the evaluation of specific polynomials
D. Dobkin
,
R.J. Lipton
SIAM Journal on Computing
9
(1), 1980, February, pp. 121-125
On the complexity of searching a set of vectors
D.S. Hirschberg
SIAM Journal on Computing
9
(1), 1980, February, pp. 126-129
Combinatorial Gray codes
J.T. Joichi
,
D.E. White
,
S.G. Williamson
SIAM Journal on Computing
9
(1), 1980, February, pp. 130-141
A note on Gray code and odd-even merge
P. Flajolet
,
L. Ramshaw
SIAM Journal on Computing
9
(1), 1980, February, pp. 142-158
Monoids for rapid data flow analysis
B.K. Rosen
SIAM Journal on Computing
9
(1), 1980, February, pp. 159-196
Finding the vertex connectivity of graphs
Z. Galil
SIAM Journal on Computing
9
(1), 1980, February, pp. 197-199
Voronoi diagrams in
L_1
(
L_{\infty}
) metrics with 2-dimensional storage applications
D.T. Lee
,
C.K. Wong
SIAM Journal on Computing
9
(1), 1980, February, pp. 200-211
On the complexity of canonical labeling of strongly regular graphs
L. Babai
SIAM Journal on Computing
9
(1), 1980, February, pp. 212-216
A multi-terminal minimum cut algorithm for planar graphs
Y. Shiloach
SIAM Journal on Computing
9
(2), 1980, May, pp. 219-224
On multiplication of polynomials modulo a polynomial
S. Winograd
SIAM Journal on Computing
9
(2), 1980, May, pp. 225-229
On the evaluation of powers and monomials
N. Pippenger
SIAM Journal on Computing
9
(2), 1980, May, pp. 230-250
Efficient synthesis and implementation of large discrete Fourier transformations
S.D. Morgera
SIAM Journal on Computing
9
(2), 1980, May, pp. 251-272
Probabilistic algorithms in finite fields
M.O. Rabin
SIAM Journal on Computing
9
(2), 1980, May, pp. 273-280
A theoretical analysis of various heuristics for the graph isomorphism problem
D.G. Corneil
,
D.G. Kirkpatrick
SIAM Journal on Computing
9
(2), 1980, May, pp. 281-297
Optimal merging of 3 elements with
n
elements
F.K. Hwang
SIAM Journal on Computing
9
, 1980, pp. 298-320
Seiten 1
2
3
>