• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 87 matches

• 2024
• 
  Noga Ron-Zewi, Ron Rothblum:
  Local Proofs Approaching the Witness Length. J. ACM 71(3): 18 (2024)
• 
  Noga Ron-Zewi, Mor Weiss:
  Zero-Knowledge IOPs Approaching Witness Length. CRYPTO (10) 2024: 105-137
• 
  Elie Abboud, Noga Ron-Zewi:
  Finer-Grained Reductions in Fine-Grained Hardness of Approximation. ICALP 2024: 7:1-7:17
• 
  Noga Ron-Zewi, S. Venkitesh, Mary Wootters:
  Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size. CoRR abs/2401.14517 (2024)
• 
  Noga Ron-Zewi, Mor Weiss:
  Zero-knowledge IOPs Approaching Witness Length. IACR Cryptol. ePrint Arch. 2024: 816 (2024)
• 2023
• 
  Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
  Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. SIAM J. Comput. 52(3): 794-840 (2023)
• 
  Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
  Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. CoRR abs/2310.19149 (2023)
• 
  Elie Abboud, Noga Ron-Zewi:
  Finer-grained Reductions in Fine-grained Hardness of Approximation. CoRR abs/2311.00798 (2023)
• 
  Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
  Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. Electron. Colloquium Comput. Complex. TR23 (2023)
• 2022
• 
  Arkadev Chattopadhyay, Marek Cygan, Noga Ron-Zewi, Christian Wulff-Nilsen:
  Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020). SIAM J. Comput. 51(3): 20- (2022)
• 
  Zeyu Guo, Noga Ron-Zewi:
  Efficient List-Decoding With Constant Alphabet and List Sizes. IEEE Trans. Inf. Theory 68(3): 1663-1682 (2022)
• 
  Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi:
  From Local to Robust Testing via Agreement Testing. Theory Comput. 18: 1-25 (2022)
• 
  Noga Ron-Zewi, Ron D. Rothblum:
  Proving as fast as computing: succinct arguments with constant prover overhead. STOC 2022: 1353-1363
• 2021
• 
  Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
  Erasures versus errors in local decoding and property testing. Random Struct. Algorithms 59(4): 640-670 (2021)
• 
  Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
  On List Recovery of High-Rate Tensor Codes. IEEE Trans. Inf. Theory 67(1): 296-316 (2021)
• 
  Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
  Linear-Time Erasure List-Decoding of Expander Codes. IEEE Trans. Inf. Theory 67(9): 5827-5839 (2021)
• 
  Noga Ron-Zewi, Ivona Bezáková, László A. Végh:
  Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. Theory Comput. 17: 1-4 (2021)
• 
  Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma:
  Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists). ITCS 2021: 33:1-33:18
• 
  Zeyu Guo, Noga Ron-Zewi:
  Efficient list-decoding with constant alphabet and list sizes. STOC 2021: 1502-1515
• 
  Noga Ron-Zewi, Ron Rothblum:
  Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. Electron. Colloquium Comput. Complex. TR21 (2021)
• 
  Noga Ron-Zewi, Ron D. Rothblum:
  Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. IACR Cryptol. ePrint Arch. 2021: 1673 (2021)
• 2020
• 
  Brett Hemenway, Noga Ron-Zewi, Mary Wootters:
  Local List Recovery of High-Rate Tensor Codes and Applications. SIAM J. Comput. 49(4) (2020)
• 
  Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
  LDPC Codes Achieve List Decoding Capacity. FOCS 2020: 458-469
• 
  Noga Ron-Zewi, Ron D. Rothblum:
  Local Proofs Approaching the Witness Length [Extended Abstract]. FOCS 2020: 846-857
• 
  Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
  Linear-time Erasure List-decoding of Expander Codes. ISIT 2020: 379-383
• 
  Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
  Linear-time Erasure List-decoding of Expander Codes. CoRR abs/2002.08579 (2020)
• 
  Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi:
  Locally testable codes via high-dimensional expanders. CoRR abs/2005.01045 (2020)
• 
  Zeyu Guo, Noga Ron-Zewi:
  Efficient List-Decoding with Constant Alphabet and List Sizes. CoRR abs/2011.05884 (2020)
• 
  Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi:
  Locally testable codes via high-dimensional expanders. Electron. Colloquium Comput. Complex. TR20 (2020)
• 
  Zeyu Guo, Noga Ron-Zewi:
  Efficient List-Decoding with Constant Alphabet and List Sizes. Electron. Colloquium Comput. Complex. TR20 (2020)

skipping 57 more matches