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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient motion planning for an
L
-shaped object
Dan Halperin
,
Mark H. Overmars
,
Micha Sharir
SIAM Journal on Computing
21
(1), 1992, February, pp. 1-23
On the average size of the intersection of binary trees
R. Baeza-Yates
,
R. Casas
,
J. Díaz
,
C. Martínez
SIAM Journal on Computing
21
(1), 1992, February, pp. 24-32
Polynomial threshold functions,
\mbox{AC}^0
functions, and spectral norms
Jehoshua Bruck
,
Roman Smolensky
SIAM Journal on Computing
21
(1), 1992, February, pp. 33-42
The average complexity of parallel comparison merging
Mihály Geréb-Graus
,
Danny Krizanc
SIAM Journal on Computing
21
(1), 1992, February, pp. 43-47
A note on the height of suffix trees
Luc Devroye
,
Wojciech Szpankowski
,
Bonita Rais
SIAM Journal on Computing
21
(1), 1992, February, pp. 48-53
Computing algebraic formulas using a constant number of registers
Michael Ben-Or
,
Richard Cleve
SIAM Journal on Computing
21
(1), 1992, February, pp. 54-58
Asymptotic analysis of an algorithm for balanced parallel processor scheduling
Li-Hui Tsai
SIAM Journal on Computing
21
(1), 1992, February, pp. 59-64
Conditions for unique graph realizations
Bruce Hendrickson
SIAM Journal on Computing
21
(1), 1992, February, pp. 65-84
Simplification of nested radicals
Susan Landau
SIAM Journal on Computing
21
(1), 1992, February, pp. 85-110
Gossiping in minimal time
David W. Krumme
,
George Cybenko
,
K.N. Venkataraman
SIAM Journal on Computing
21
(1), 1992, February, pp. 111-139
Using interior-point methods for fast parallel algorithms for bipartite matching and related problems
Andrew V. Goldberg
,
Serge A. Plotkin
,
David B. Shmoys
,
Eva Tardos
SIAM Journal on Computing
21
(1), 1992, February, pp. 140-150
Efficient embeddings of trees in hypercubes
Sandeep N. Bhatt
,
Fan R.K. Chung
,
F. Thomson Leighton
,
Arnold L. Rosenberg
SIAM Journal on Computing
21
(1), 1992, February, pp. 151-162
On the exact location of Steiner points in general dimension
Timothy Law Snyder
SIAM Journal on Computing
21
(1), 1992, February, pp. 163-180
On learning ring-sum-expansions
Paul Fischer
,
Hans Ulrich Simon
SIAM Journal on Computing
21
(1), 1992, February, pp. 181-192
Locality in distributed graph algorithms
Nathan Linial
SIAM Journal on Computing
21
(1), 1992, February, pp. 193-201
Partitioning planar graphs
Thang Nguyen Bui
,
Andrew Peck
SIAM Journal on Computing
21
(2), 1992, April, pp. 203-215
A polynomial-time algorithm for the equivalence of probabilistic automata
Wen-Guey Tzeng
SIAM Journal on Computing
21
(2), 1992, April, pp. 216-227
Subgroup refinement algorithms for root finding in
GF(q)
A.J. Menezes
,
P.C. van Oorschot
,
S.A. Vanstone
SIAM Journal on Computing
21
(2), 1992, April, pp. 228-239
Learning integer lattices
David Helmbold
,
Robert Sloan
,
Manfred K. Warmuth
SIAM Journal on Computing
21
(2), 1992, April, pp. 240-266
Efficient point location in a convex spatial cell-complex
Franco P. Preparata
,
Roberto Tamassia
SIAM Journal on Computing
21
(2), 1992, April, pp. 267-280
A heuristic of scheduling parallel tasks and its analysis
Qingzhou Wang
,
Kam Hoi Cheng
SIAM Journal on Computing
21
(2), 1992, April, pp. 281-294
Heuristic sampling: A method for predicting the performance of tree searching programs
Pang C. Chen
SIAM Journal on Computing
21
(2), 1992, April, pp. 295-315
Counting classes are at least as hard as the polynomial-time hierarchy
Seinosuke Toda
,
Mitsunori Ogiwara
SIAM Journal on Computing
21
(2), 1992, April, pp. 316-328
Lower bounds for threshold and symmetric functions in parallel computation
Yossi Azar
SIAM Journal on Computing
21
(2), 1992, April, pp. 329-338
Convex decomposition of polyhedra and robustness
Chanderjit L. Bajaj
,
Tamal K. Dey
SIAM Journal on Computing
21
(2), 1992, April, pp. 339-364
Seiten 1
2
3
>