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
[1]
Hilfe
Suche: Author="Steiger, W.L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal parallel selection has complexity
O(\log\log n)
Miklós Ajtai
,
János Komlós
,
W.L. Steiger
,
Endre Szemerédi
Journal of Computer and System Sciences
38
, 1989, pp. 125-133
An optimal-time algorithm for slope selection
Richard Cole
,
Jeffrey S. Salowe
,
W.L. Steiger
,
Endre Szemerédi
SIAM Journal on Computing
18
, 1989, pp. 792-810
Optimal slope selection
R. Cole
,
J. Salowe
,
W.L. Steiger
,
E. Szemerédi
Lecture Notes in Computer Science
317
, 1988, pp. 133-146
Almost sorting in one round
M. Ajtai
,
J. Komlós
,
W.L. Steiger
,
E. Szemerédi
Technical Report (DCS-TR-212), 1987, March
The parallel complexity of element distinctness is
\Omega(\log n)^{1/2}
P. Ragde
,
W.L. Steiger
,
E. Szemerédi
,
A. Wigderson
Technical Report (DCS-TR-214), 1987, May
Stable unmerging in linear time and constant space
J.S. Salowe
,
W.L. Steiger
Information Processing Letters
25
(5), 1987, July, pp. 285-294
Deterministic selection in
O(\log\log n)
parallel time
M. Ajtai
,
J. Komlós
,
W.L. Steiger
,
E. Szemerédi
Technical Report (DCS-TR-174), 1986, February
Deterministic selection in
O(\log\log N)
parallel time
M. Ajtai
,
J. Komlós
,
W.L. Steiger
,
E. Szemerédi
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 188-195
Algorithms and complexity for least median of squares regression
J.M. Steele
,
W.L. Steiger
Discrete Applied Mathematics
14
, 1986, pp. 93-100
A new LAD curve-fitting algorithm: Slighthly overdetermined equation systems in
L_1
Eugene Seneta
,
W.L. Steiger
Discrete Applied Mathematics
7
, 1984, pp. 79-91