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
[2]
Hilfe
Suche: Journal=SIAM J. Comput. AND YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Phase change of limit laws in the Quicksort recurrence under varying toll functions
Hsien-Kuei Hwang
,
Ralph Neininger
SIAM Journal on Computing
31
(6), 2002, pp. 1687-1722
Are bitvectors optimal?
H. Buhrman
,
P.B. Miltersen
,
J. Radhakrishnan
,
S. Venkatesh
SIAM Journal on Computing
31
(6), 2002, pp. 1723-1744
On the boundary complexity of the union of fat triangles
János Pach
,
Gábor Tardos
SIAM Journal on Computing
31
(6), 2002, pp. 1745-1760
Approximate string matching: A simpler faster algorithm
Richard Cole
,
Ramesh Hariharan
SIAM Journal on Computing
31
(6), 2002, pp. 1761-1782
A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees
J. Könemann
,
R. Ravi
SIAM Journal on Computing
31
(6), 2002, pp. 1783-1793
Maintaining stream statistics over sliding windows
Mayur Datar
,
Aristides Gionis
,
Piotr Indyk
,
Rajeev Motwani
SIAM Journal on Computing
31
(6), 2002, pp. 1794-1813
Curvature-constrained shortest paths in a convex polygon
Pankaj K. Agarwal
,
Therese Biedl
,
Sylvain Lazard
,
Steve Robbins
,
Subhash Suri
,
Sue Whitesides
SIAM Journal on Computing
31
(6), 2002, pp. 1814-1851
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs
Yijie Han
,
Xiaojun Shen
SIAM Journal on Computing
31
(6), 2002, pp. 1852-1878
A randomized time-work optimal parallel algorithm for finding a minimum spanning forest
Seth Pettie
,
Vijaya Ramachandran
SIAM Journal on Computing
31
(6), 2002, pp. 1879-1895
Lower bounds for Lucas chains
Martin Kutz
SIAM Journal on Computing
31
(6), 2002, pp. 1896-1908
Simple learning algorithms for decision trees and multivariate polynomials
Nader H. Bshouty
,
Yishay Mansour
SIAM Journal on Computing
31
(6), 2002, pp. 1909-1925
A deterministic polynomial-time algorithm for Heilbronn's problem in three dimensions
Hanno Lefmann
,
Niels Schmitt
SIAM Journal on Computing
31
(6), 2002, pp. 1926-1947
The minimization problem for Boolean formulas
Edith Hemaspaandra
,
Gerd Wechsung
SIAM Journal on Computing
31
(6), 2002, pp. 1948-1958
Seiten
<
1
2
3