(PDF) Near-Optimal Sublinear Time Algorithms for Ulam

Near-Optimal Sublinear Time Algorithms for Ulam Distance

doi 10.1137/1.9781611973075.8

Full Text

Abstract

Available in full text

Date

January 17, 2010

Authors

Alexandr Andoni

Publisher

Society for Industrial and Applied Mathematics

Related search

Sublinear Time Algorithms

English

Sublinear Time, Measurement-Optimal, Sparse Recovery for All

English

Sublinear-Time Parallel Algorithms for Matching and Related Problems

English

Sublinear Algorithms for Massive Data Sets

English

New Near-Optimal Feedback Guidance Algorithms for Space Missions

English

Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity

English

Optimal Algorithms and Approximation Algorithms for Replica Placement With Distance Constraints in Tree Networks

English

Sublinear Algorithms for Testing Monotone and Unimodal Distributions

English

Optimal Expected-Time Algorithms for Closest Point Problems

ACM Transactions on Mathematical Software

Applied Mathematics

English