Editing Bibliography
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 251: | Line 251: | ||
{{bibentry|GilbertSTV-07|A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin. ''One sketch for all: fast algorithms for compressed sensing.'' ACM Symposium on Theory of Computing, 2007.}} | {{bibentry|GilbertSTV-07|A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin. ''One sketch for all: fast algorithms for compressed sensing.'' ACM Symposium on Theory of Computing, 2007.}} | ||
− | |||
− | |||
{{bibentry|Goldreich-19a|Oded Goldreich. ''Testing graphs in vertex-distribution-free models.'' In ''STOC'', pages 527–534, 2019.}} | {{bibentry|Goldreich-19a|Oded Goldreich. ''Testing graphs in vertex-distribution-free models.'' In ''STOC'', pages 527–534, 2019.}} | ||
{{bibentry|Goldreich-19b|Oded Goldreich. ''On the complexity of estimating the effective support size.'' Electronic Colloquium on Computational Complexity (ECCC), 26:88, 2019.}} | {{bibentry|Goldreich-19b|Oded Goldreich. ''On the complexity of estimating the effective support size.'' Electronic Colloquium on Computational Complexity (ECCC), 26:88, 2019.}} | ||
+ | |||
+ | {{bibentry|Goldreich-17|Oded Goldreich. ''Introduction to Property Testing.'' Cambridge University Press, November 2017.}} | ||
{{bibentry|GoldreichR-02|Oded Goldreich and Dana Ron. ''Property Testing in Bounded Degree Graphs.'' Algorithmica, 32(2):302-343, 2002}} | {{bibentry|GoldreichR-02|Oded Goldreich and Dana Ron. ''Property Testing in Bounded Degree Graphs.'' Algorithmica, 32(2):302-343, 2002}} |