An Expansion Tester for Bounded Degree Graphs

Authors:
Satyen Kale;C. Seshadhri
Affiliations:
Microsoft Research, Redmond, WA 98052;Dept. of Computer Science, Princeton University, Princeton NJ 08540
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Year:
2008

Citing 0
Cited 11

Tight Bounds for the Cover Time of Multiple Random Walks

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Algorithmic and Analysis Techniques in Property Testing

Foundations and Trends® in Theoretical Computer Science
Local graph exploration and fast property testing

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Testing expansion in bounded-degree graphs

Combinatorics, Probability and Computing
Introduction to testing graph properties

Property testing
Introduction to testing graph properties

Property testing
On testing expansion in bounded-degree graphs

Studies in complexity and cryptography
Introduction to testing graph properties

Studies in complexity and cryptography
An Expansion Tester for Bounded Degree Graphs

SIAM Journal on Computing
Sublinear Time Algorithms

SIAM Journal on Discrete Mathematics
Testing Closeness of Discrete Distributions

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

On the Internet, there are advertisements (ads) of different kinds: image, text, video and other specially marked objects that are distinct from the underlying content of the page. There is an industry behind the management of such ads, and they face ...