Sciweavers

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

71

Voted

SODA
2000
ACM

favoriteEmaildiscussreport

109views Algorithms» more SODA 2000»

Approximate congruence in nearly linear time

14 years 10 months ago

Approximate congruence in nearly linear time

Download www.cs.utah.edu

Piotr Indyk, Suresh Venkatasubramanian

Real-time Traffic

Algorithms | SODA 2000 |

claim paper

Related Content

» NearOptimal Pricing in NearLinear Time

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» NearLinear Time Approximation Algorithms for Curve Simplification

» Approximating Maximum Weight Matching in NearLinear Time

» NearLinear Time Construction of Sparse Neighborhood Covers

» Solving Elliptic Finite Element Systems in NearLinear Time with Support Preconditioners

» Nearly optimal solutions for the chow parameters problem and lowweight approximation of ha...

» A Geometric Approach to Lower Bounds for Approximate NearNeighbor Search and Partial Match

» Fast construction of nets in low dimensional metrics and their applications

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	SODA
Authors	Piotr Indyk, Suresh Venkatasubramanian

Comments (0)