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.
Absolute factorization of polynomials: A geometric approach
Dominique Duval
SIAM Journal on Computing
20
(1), 1991, February, pp. 1-21
Deterministic sampling - A new technique for fast pattern matching
Uzi Vishkin
SIAM Journal on Computing
20
(1), 1991, February, pp. 22-40
Amplification of bounded depth monotone read-once Boolean formulae
Qian Ping Gu
,
Akira Maruoka
SIAM Journal on Computing
20
(1), 1991, February, pp. 41-55
Simple local search problems that are hard to solve
Alejandro A. Shäffer
,
Mihalis Yannakakis
SIAM Journal on Computing
20
(1), 1991, February, pp. 56-87
Improved upper and lower time bounds for parallel random access machines without simultaneous writes
Ian Parberry
,
Pei Yuan Yan
SIAM Journal on Computing
20
(1), 1991, February, pp. 88-99
High-probability parallel transitive-closure algorithms
Jeffrey D. Ullman
,
Mihalis Yannakakis
SIAM Journal on Computing
20
(1), 1991, February, pp. 100-125
Complexity of sentences over number rings
Shih Ping Tung
SIAM Journal on Computing
20
(1), 1991, February, pp. 126-143
An optimal on-line algorithm for
k
-servers on trees
Marek Chrobak
,
Lawrence L. Larmore
SIAM Journal on Computing
20
(1), 1991, February, pp. 144-148
The complexity of the residual node connectedness reliability problem
K. Sutner
,
A. Satyanarayana
,
C. Suffel
SIAM Journal on Computing
20
(1), 1991, February, pp. 149-155
More nearly optimal algorithms for unbounded searching. Part I: The finite case
Edward M. Reingold
,
Xiaojun Shen
SIAM Journal on Computing
20
(1), 1991, February, pp. 156-183
More nearly optimal algorithms for unbounded searching, Part II: The transfinite case
Edward M. Reingold
,
Xiajun Shen
SIAM Journal on Computing
20
(1), 1991, February, pp. 184-208
Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs
Egon Balas
,
Jue Xue
SIAM Journal on Computing
20
(2), 1991, April, pp. 209-221
Approximate levels in line arrangements
Jiȓi Matous̑ek
SIAM Journal on Computing
20
(2), 1991, April, pp. 222-227
Parallel algorithms for channel routing in the knock-knee model
Joseph JáJá
,
Shing-Chong Chang
SIAM Journal on Computing
20
(2), 1991, April, pp. 228-245
Some observations on separating complexity classes
Ronald V. Book
SIAM Journal on Computing
20
(2), 1991, April, pp. 246-258
An
O(n log^2 h)
time algorithm for the three-dimensional convex hull problem
Herbert Edelsbrunner
,
Weiping Shi
SIAM Journal on Computing
20
(2), 1991, April, pp. 259-269
A general sequential time-space tradeoff for finding unique elements
Paul Beame
SIAM Journal on Computing
20
(2), 1991, April, pp. 270-277
The power of alternating one-reversal counters and stacks
Oscar H. Ibarra
,
Tao Jiang
SIAM Journal on Computing
20
(2), 1991, April, pp. 278-290
Interpolation and approximtion of sparse multivariate polynomials over
GF(2)
Ron M. Roth
,
Gyora M. Benedek
SIAM Journal on Computing
20
(2), 1991, April, pp. 291-314
Lower bounds for computations with the floor operation
Yishay Mansour
,
Baruch Schieber
,
Prasoon Tiwari
SIAM Journal on Computing
20
(2), 1991, April, pp. 315-327
Probably approximate learning of sets and functiosn
B.K. Natarajan
SIAM Journal on Computing
20
(2), 1991, April, pp. 328-351
Efficient parallel algorithms for testing
k
-connectivity and finding disjoint
s-t
paths in graphs
Samir Khuller
,
Baruch Schieber
SIAM Journal on Computing
20
(2), 1991, April, pp. 352-375
Time and message bounds for election in synchronous and asynchronous complete networks
Yehuda Afek
,
Eli Gafni
SIAM Journal on Computing
20
(2), 1991, April, pp. 376-394
Good and bad radii of convex polygons
Peter Gritzmann
,
Laurent Habsieger
,
Victor Klee
SIAM Journal on Computing
20
(2), 1991, April, pp. 395-403
Fast matching algorithms for points on a polygon
Odile Marcotte
,
Subhash Suri
SIAM Journal on Computing
20
(3), 1991, June, pp. 405-422
Seiten 1
2
3
>