Skip to main content
SpringerLink
Log in

The Program of the Mini-Workshop

  • Chapter
Property Testing

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6390))

  • 1078 Accesses

Abstract

This article provides an annotated version of the program of the mini-workshop on propoerty testing that took place in January 2010 in the Institute for Computer Science (ITCS) at Tsinghua University (Beijing). The mini-workshop brought together a couple of dozen of leading researchers in Property Testing and related areas.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Krivelevich, M., Kaufman, T., Litsyn, S., Ron, D.: Testing Reed-Muller codes. IEEE Transactions on Information Theory 51(11), 4032–4038 (2005); An extended abstract appeared in the proceedings of RANDOM 2003 (under the title Testing Low-Degree Polynomials over GF(2)

    Article  MathSciNet  MATH  Google Scholar 

  2. Benjamini, I., Schramm, O., Shapira, A.: Every Minor-Closed Property of Sparse Graphs is Testable. In: 40th STOC, pp. 393–402 (2008)

    Google Scholar 

  3. Marko, S., Ron, D.: Approximating the Distance to Properties in Bounded-Degree and General Sparse Graphs. ACM Transactions on Algorithms 5(2) (2009); Extended abstarct in the proceedings of Random (2006)

    Google Scholar 

  4. Parnas, M., Ron, D.: Approximating the Minimum Vertex Cover in Sublinear Time and a Connection to Distributed Algorithms. TCS 381(1-3), 183–196 (2007); Preliminary version in ECCC (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Parnas, M., Ron, D., Rubinfeld, R.: Tolerant Property Testing and Distance Approximation. JCSS 72(6), 1012–1042 (2006); Preliminary version in ECCC (2004)

    MathSciNet  MATH  Google Scholar 

  6. Tamaki, S., Yoshida, Y.: A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness. In: ECCC, TR09-074 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel

    Oded Goldreich

Authors
  1. Oded Goldreich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics and Computer Science, Weizmann Institute of Science, 76100, Rehovot, Israel

    Oded Goldreich

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Goldreich, O. (2010). The Program of the Mini-Workshop. In: Goldreich, O. (eds) Property Testing. Lecture Notes in Computer Science, vol 6390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16367-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16367-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16366-1

  • Online ISBN: 978-3-642-16367-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation