Amanote Research

Amanote Research

    RegisterSign In

Sublinear Time Algorithms

doi 10.4171/022-3/53
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
Ronitt Rubinfeld
Publisher

European Mathematical Society Publishing House


Related search

Near-Optimal Sublinear Time Algorithms for Ulam Distance

2010English

Sublinear-Time Parallel Algorithms for Matching and Related Problems

1988English

Sublinear Algorithms for Massive Data Sets

2013English

Sublinear Algorithms for Testing Monotone and Unimodal Distributions

2004English

Private Database Search With Sublinear Query Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Sublinear Time, Measurement-Optimal, Sparse Recovery for All

2012English

Networks Cannot Compute Their Diameter in Sublinear Time

2012English

Approximating the Minimum Spanning Tree Weight in Sublinear Time

SIAM Journal on Computing
MathematicsComputer Science
2005English

String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy