Noga Ron-Zewi Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Elad Haramaty, Noga Ron-Zewi, Madhu Sudan: Absolutely Sound Testing of Lifted Codes. Electronic Colloquium on Computational Complexity (ECCC) 20: 30 (2013)
2012
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Noga Ron-Zewi, Madhu Sudan: A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes. APPROX-RANDOM 2012: 639-650
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi: Space Complexity in Polynomial Calculus. IEEE Conference on Computational Complexity 2012: 334-344
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi: An Additive Combinatorics Approach Relating Rank to Communication Complexity. FOCS 2012: 177-186
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan: Sparse Affine-Invariant Linear Codes Are Locally Testable. FOCS 2012: 561-570
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Noga Ron-Zewi, Madhu Sudan: A new upper bound on the query complexity for testing generalized Reed-Muller codes. CoRR abs/1204.5467 (2012)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf: Sampling-based proofs of almost-periodicity results and algorithmic applications. CoRR abs/1210.6917 (2012)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan: Sparse affine-invariant linear codes are locally testable. Electronic Colloquium on Computational Complexity (ECCC) 19: 49 (2012)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen: Space Complexity in Polynomial Calculus. Electronic Colloquium on Computational Complexity (ECCC) 19: 132 (2012)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf: Sampling-based proofs of almost-periodicity results and algorithmic applications. Electronic Colloquium on Computational Complexity (ECCC) 19: 135 (2012)

Coauthor Index

1Eli Ben-Sasson
[c2] [c1] [i4] [i3] [i1]
2Yuval Filmus
[c3] [i2]
3Elad Haramaty
[i6]
4Massimo Lauria
[c3] [i2]
5Shachar Lovett
[c2]
6Jakob Nordström
[c3] [i2]
7Madhu Sudan
[i6] [c4] [c1] [i5] [i3]
8Neil Thapen
[c3] [i2]
9Madhur Tulsiani
[i4] [i1]
10Julia Wolf
[i4] [i1]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Fri May 24 10:50:39 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page