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.
The communication complexity of atomic commitment and of gossiping
Ouri Wolfson
,
Adrian Segall
SIAM Journal on Computing
20
(3), 1991, June, pp. 423-450
Some lower and upper complexity bounds for generalized Fourier transforms and their inverses
Ulrich Baum
,
Michael Clausen
SIAM Journal on Computing
20
(3), 1991, June, pp. 451-459
On vertical visibility in arrangements of segments and the queue size in the Bentley-Ottmann line sweeping algorithm
János Pach
,
Micha Sharir
SIAM Journal on Computing
20
(3), 1991, June, pp. 460-470
On polynomial-time bounded truth-table reducibility of
NP
sets to sparse sets
Mitsunori Ogiwara
,
Osamu Watanabe
SIAM Journal on Computing
20
(3), 1991, June, pp. 471-483
Nondeterministic computations in sublogarithmic space and space constructibility
Viliam Geffert
SIAM Journal on Computing
20
(3), 1991, June, pp. 484-498
A
4n
lower bound on the combinational complexity of certain symmetric boolean functions over the basis of unate dyadic boolean functions
Uri Zwick
SIAM Journal on Computing
20
(3), 1991, June, pp. 499-505
Near-testable sets
Judy Goldsmith
,
Lane A. Hemachandra
,
Deborah Joseph
,
Paul Young
SIAM Journal on Computing
20
(3), 1991, June, pp. 506-523
Compression and ranking
Andrew V. Goldberg
,
Michael Sipser
SIAM Journal on Computing
20
(3), 1991, June, pp. 524-536
Algorithms for scheduling imprecise computations with timing constraints
Wei-Kuan Shih
,
Jane W.S. Liu
,
Jen-Yao Chung
SIAM Journal on Computing
20
(3), 1991, June, pp. 537-552
Boolean functions, invariance groups, and parallel complexity
Peter Clote
,
Evangelos Kranakis
SIAM Journal on Computing
20
(3), 1991, June, pp. 553-590
Tests for permutation polynomials
Joachim von zur Gathen
SIAM Journal on Computing
20
(3), 1991, June, pp. 591-602
Constructive Whitney-Graustein theorem: Or how to untangle closed planar curves
Kurt Mehlhorn
,
Chee-Keng Yap
SIAM Journal on Computing
20
(4), 1991, August, pp. 603-621
Reversal complexity
Jian-er Chen
,
Chee-Keng Yap
SIAM Journal on Computing
20
(4), 1991, August, pp. 622-638
Computing the strength of a graph
Dan Gusfield
SIAM Journal on Computing
20
(4), 1991, August, pp. 639-654
Lower bounds for algebraic computation trees with integer inputs
Andrew Chi-Chih Yao
SIAM Journal on Computing
20
(4), 1991, August, pp. 655-668
Minimization of rational word functions
Christophe Reutenauer
,
Marcel-Paul Schützenberger
SIAM Journal on Computing
20
(4), 1991, August, pp. 669-685
The fast
m
-transform: A fast computation of cross-correlations with binary
m
-sequences
Erich E. Sutter
SIAM Journal on Computing
20
(4), 1991, August, pp. 686-694
On counting lattice points in polyhedra
Martin Dyer
SIAM Journal on Computing
20
(4), 1991, August, pp. 695-707
Parallel transitive closure and point location in planar structures
Roberto Tamassia
,
Jeffrey S. Vitter
SIAM Journal on Computing
20
(4), 1991, August, pp. 708-725
On nonblocking multirate interconnection networks
Shun-Ping Chung
,
Keith W. Ross
SIAM Journal on Computing
20
(4), 1991, August, pp. 726-736
Intersecting line segments in parallel with an output-sensitive number of processors
Michael T. Goodrich
SIAM Journal on Computing
20
(4), 1991, August, pp. 737-755
Fast parallel arithmetic via modular representation
George I. Davida
,
Bruce Litow
SIAM Journal on Computing
20
(4), 1991, August, pp. 756-765
Equality-test and if-then-else algebras: Axiomatization and specification
Don Pigozzi
SIAM Journal on Computing
20
(4), 1991, August, pp. 766-805
The maximum size of dynamic data structures
Claire M. Kenyon-Mathieu
,
Jeffrey Scott Vitter
SIAM Journal on Computing
20
(5), 1991, October, pp. 807-823
Time complexity of Boolean functions on CREW PRAMs
Mirosƚaw Kutyƚowski
SIAM Journal on Computing
20
(5), 1991, October, pp. 824-833
Seiten
<
1
2
3
>