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=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Embedding of grids into optimal hypercubes
Mee Yee Chan
SIAM Journal on Computing
20
(5), 1991, October, pp. 834-864
PP is as hard as the polynomial-time hierarchy
Seinosuke Toda
SIAM Journal on Computing
20
(5), 1991, October, pp. 865-877
Selection networks
Nicholas Pippenger
SIAM Journal on Computing
20
(5), 1991, October, pp. 878-887
An output-sensitive algorithm for computing visibility graphs
Subir Kumar Ghosh
,
David M. Mount
SIAM Journal on Computing
20
(5), 1991, October, pp. 888-910
Learning simple concepts under simple distributions
Ming Li
,
Paul M.B. Vitányi
SIAM Journal on Computing
20
(5), 1991, October, pp. 911-935
On the communication complexity of solving a polynomial equation
Zhi-Quan Luo
,
John N. Tsitsiklis
SIAM Journal on Computing
20
(5), 1991, October, pp. 936-950
The spectra of infinite hypertrees
Joel Friedman
SIAM Journal on Computing
20
(5), 1991, October, pp. 951-961
On the complexity of learning minimum time-bounded Turing machines
Ker-I Ko
SIAM Journal on Computing
20
(5), 1991, October, pp. 962-986
Minimum diameter spanning trees and related problems
Jan-Ming Ho
,
D.T. Lee
,
Chia-Hsiang Chang
,
C.K. Wong
SIAM Journal on Computing
20
(5), 1991, October, pp. 987-997
CREW PRAMs and decision trees
Noam Nisan
SIAM Journal on Computing
20
(6), 1991, December, pp. 999-1007
On the exact complexity of string matching: Lower bounds
Zvi Galil
,
Raffaele Giancarlo
SIAM Journal on Computing
20
(6), 1991, December, pp. 1008-1020
Self-P-printability and polynomial time Turing equivalence to a tally set
Roy S. Rubinstein
SIAM Journal on Computing
20
(6), 1991, December, pp. 1021-1033
New upper bounds in Klee's measure problem
Mark H. Overmars
,
Chee-Keng Yap
SIAM Journal on Computing
20
(6), 1991, December, pp. 1034-1045
An optimal randomized parallel algorithm for finding connected components in a graph
Hillel Gazit
SIAM Journal on Computing
20
(6), 1991, December, pp. 1046-1067
Asymptotically fast triangularization of matrices over rings
James L. Hafner
,
Kevin S. McCurley
SIAM Journal on Computing
20
(6), 1991, December, pp. 1068-1083
Noninteractive zero-knowledge
Manuel Blum
,
Alfredo de Santis
,
Silvio Micali
,
Giuseppe Persiano
SIAM Journal on Computing
20
(6), 1991, December, pp. 1084-1118
Elimination of infrequent variables improves average case performance of satisfiability algorithms
John Franco
SIAM Journal on Computing
20
(6), 1991, December, pp. 1119-1127
Parallel tree contraction, part 2: Further applications
Gary L. Miller
,
John H. Reif
SIAM Journal on Computing
20
(6), 1991, December, pp. 1128-1147
On sets with efficient implicit membership tests
Lane A. Hemachandra
,
Albrecht Hoene
SIAM Journal on Computing
20
(6), 1991, December, pp. 1148-1156
An almost linear-time algorithm for the dense subset-sum problem
Zvi Galil
,
Oded Margalit
SIAM Journal on Computing
20
(6), 1991, December, pp. 1157-1189
Seiten
<
1
2
3