The following pages link to Sublinear Time Algorithms (Q3225140):
Displaying 25 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Fast domino tileability (Q312152) (← links)
- Deterministic vs non-deterministic graph property testing (Q480810) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Boosting distinct random sampling for basic counting on the union of distributed streams (Q497679) (← links)
- Unavoidable tournaments (Q895998) (← links)
- A tight bound for Green's arithmetic triangle removal lemma in vector spaces (Q1673988) (← links)
- Detecting curved edges in noisy images in sublinear time (Q1703998) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Efficient approximation schemes for economic lot-sizing in continuous time (Q1751154) (← links)
- On approximating the stationary distribution of time-reversible Markov chains (Q1987513) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- An optimal tester for \(k\)-linear (Q2154097) (← links)
- Range partitioning within sublinear time: algorithms and lower bounds (Q2220789) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- An optimal tester for \(k\)-Linear (Q2690878) (← links)
- On Approximating the Stationary Distribution of Time-reversible Markov Chains (Q3304112) (← links)
- Multiscale Matrix Sampling and Sublinear-Time PageRank Computation (Q4985347) (← links)
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q5041265) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
- Detection of Long Edges on a Computational Budget: A Sublinear Approach (Q5250002) (← links)
- Partially Symmetric Functions Are Efficiently Isomorphism Testable (Q5252692) (← links)
- On the predictability of the abelian sandpile model (Q6155033) (← links)
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q6169898) (← links)
