Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
28
click to vote
SODA
2000
ACM
favorite
Email
discuss
report
109
views
Algorithms
»
more
SODA 2000
»
Approximate congruence in nearly linear time
14 years 7 days ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision