• 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 116 matches

• 2024
• 
  Marshall Ball, Ronen Shaltiel, Jad Silbak:
  Non-malleable Codes with Optimal Rate for Poly-Size Circuits. EUROCRYPT (4) 2024: 33-54
• 
  Ronen Shaltiel, Jad Silbak:
  Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions. STOC 2024: 2028-2038
• 2023
• 
  Ronen Shaltiel:
  Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? Comput. Complex. 32(1): 5 (2023)
• 
  Ronen Shaltiel, Emanuele Viola:
  On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. CoRR abs/2311.11663 (2023)
• 
  Marshall Ball, Ronen Shaltiel, Jad Silbak:
  Non-malleable codes with optimal rate for poly-size circuits. Electron. Colloquium Comput. Complex. TR23 (2023)
• 
  Ronen Shaltiel, Jad Silbak:
  Explicit Codes for Poly-Size Circuits and Functions that are Hard to Sample on Low Entropy Distributions. Electron. Colloquium Comput. Complex. TR23 (2023)
• 2022
• 
  Ronen Shaltiel, Jad Silbak:
  Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. FOCS 2022: 13-23
• 
  Ronen Shaltiel, Emanuele Viola:
  On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. ITCS 2022: 116:1-116:17
• 
  Markus Bläser, Valentine Kabanets, Ronen Shaltiel, Jacobo Torán:
  Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371). Dagstuhl Reports 12(9): 41-59 (2022)
• 
  Ronen Shaltiel, Jad Silbak:
  Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. Electron. Colloquium Comput. Complex. TR22 (2022)
• 2021
• 
  Ronen Shaltiel, Jad Silbak:
  Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. Comput. Complex. 30(1): 3 (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
• 
  Ronen Shaltiel, Jad Silbak:
  Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity. STOC 2021: 1516-1526
• 
  Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
  Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. CoRR abs/2105.00765 (2021)
• 
  Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
  Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. CoRR abs/2105.00770 (2021)
• 
  Ronen Shaltiel, Emanuele Viola:
  On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. Electron. Colloquium Comput. Complex. TR21 (2021)
• 2020
• 
  Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
  Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. SIAM J. Comput. 49(6): 1041-1082 (2020)
• 
  Ronen Shaltiel:
  Is It Possible to Improve Yao's XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle? APPROX-RANDOM 2020: 10:1-10:20
• 
  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). Electron. Colloquium Comput. Complex. TR20 (2020)
• 
  Ronen Shaltiel:
  Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? Electron. Colloquium Comput. Complex. TR20 (2020)
• 
  Ronen Shaltiel, Jad Silbak:
  Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. TR20 (2020)
• 2019
• 
  Shiri Chechik, Ronen Shaltiel:
  Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword. Theory Comput. 15: 1-3 (2019)
• 
  Jad Silbak, Swastik Kopparty, Ronen Shaltiel:
  Quasilinear Time List-Decodable Codes for Space Bounded Channels. FOCS 2019: 302-333
• 
  Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
  Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. TCC (1) 2019: 531-560
• 
  Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
  Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. Electron. Colloquium Comput. Complex. TR19 (2019)
• 
  Ronen Shaltiel, Swastik Kopparty, Jad Silbak:
  Quasilinear time list-decodable codes for space bounded channels. Electron. Colloquium Comput. Complex. TR19 (2019)
• 
  Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
  Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. IACR Cryptol. ePrint Arch. 2019: 616 (2019)
• 2018
• 
  Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola:
  Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs. FOCS 2018: 956-966
• 
  Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
  Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. FOCS 2018: 136-147
• 
  Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola:
  Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs. Electron. Colloquium Comput. Complex. TR18 (2018)

skipping 86 more matches