Ronen Shaltiel

About Ronen Shaltiel

Ronen Shaltiel, With an exceptional h-index of 30 and a recent h-index of 17 (since 2020), a distinguished researcher at University of Haifa, specializes in the field of Theory of Computer Science, Complexity Theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

On Hardness Assumptions Needed for" Extreme High-End''PRGs and Fast Derandomization

Non-malleable codes with optimal rate for poly-size circuits

Explicit codes for poly-size circuits and functions that are hard to sample on low entropy distributions

Is it possible to improve Yao’s XOR lemma using reductions that exploit the efficiency of their oracle?

Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371)

Error correcting codes that achieve BSC capacity against channels that are poly-size circuits

Computation Theory

Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity

Ronen Shaltiel Information

University

Position

Professor of Computer Science

Citations(all)

3246

Citations(since 2020)

754

Cited By

2794

hIndex(all)

30

hIndex(since 2020)

17

i10Index(all)

47

i10Index(since 2020)

25

Email

University Profile Page

Google Scholar

Ronen Shaltiel Skills & Research Interests

Theory of Computer Science

Complexity Theory

Top articles of Ronen Shaltiel

On Hardness Assumptions Needed for" Extreme High-End''PRGs and Fast Derandomization

arXiv preprint arXiv:2311.11663

2023/11/20

Ronen Shaltiel
Ronen Shaltiel

H-Index: 16

Emanuele Viola
Emanuele Viola

H-Index: 18

Non-malleable codes with optimal rate for poly-size circuits

Electronic Colloquium on Computational Complexity (ECCC),(167)

2023/11/13

Ronen Shaltiel
Ronen Shaltiel

H-Index: 16

Explicit codes for poly-size circuits and functions that are hard to sample on low entropy distributions

Electronic Colloquium on Computational Complexity (ECCC)

2023/11/13

Ronen Shaltiel
Ronen Shaltiel

H-Index: 16

Is it possible to improve Yao’s XOR lemma using reductions that exploit the efficiency of their oracle?

computational complexity

2023/6

Ronen Shaltiel
Ronen Shaltiel

H-Index: 16

Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371)

2023

Markus Bläser
Markus Bläser

H-Index: 11

Ronen Shaltiel
Ronen Shaltiel

H-Index: 16

Error correcting codes that achieve BSC capacity against channels that are poly-size circuits

2022/10/31

Ronen Shaltiel
Ronen Shaltiel

H-Index: 16

Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity

2021/6/15

Ronen Shaltiel
Ronen Shaltiel

H-Index: 16

Explicit list-decodable codes with optimal rate for computationally bounded channels

computational complexity

2021/6

Ronen Shaltiel
Ronen Shaltiel

H-Index: 16

Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)

2021

Noga Ron-Zewi
Noga Ron-Zewi

H-Index: 9

Ronen Shaltiel
Ronen Shaltiel

H-Index: 16

Computational two-party correlation: A dichotomy for key-agreement protocols

SIAM Journal on Computing

2020

See List of Professors in Ronen Shaltiel University(University of Haifa)