Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SODA
1992
ACM

favoriteEmaildiscussreport

72views Algorithms» more SODA 1992»

Tail Estimates for the Space Complexity of Randomized Incremental Algorithms

13 years 5 months ago

Tail Estimates for the Space Complexity of Randomized Incremental Algorithms

Download edocs.fu-berlin.de

Kurt Mehlhorn, Micha Sharir, Emo Welzl

Real-time Traffic

Algorithms | SODA 1992 |

claim paper

Related Content

» Distributed and Recursive Parameter Estimation in Parametrized Linear StateSpace Models

» Graftinglight fast incremental feature selection and structure learning of Markov random f...

» Estimating Frequency Moments of Data Streams Using Random Linear Combinations

» A Note on the Expected Time for Finding Maxima by List Algorithms

» Randomized algorithms for tracking distributed count frequencies and ranks

» Streaming Algorithms with OneSided Estimation

» On the performance of random linear projections for samplingbased motion planning

» Clustering Large Attributed Graphs An Efficient Incremental Approach

» The averagecase complexity of counting distinct elements

Post Info
More Details (n/a)

Added	07 Nov 2010
Updated	07 Nov 2010
Type	Conference
Year	1992
Where	SODA
Authors	Kurt Mehlhorn, Micha Sharir, Emo Welzl

Comments (0)