Or Meir

Or Meir

University of Haifa

H-index: 14

Asia-Israel

About Or Meir

Or Meir, With an exceptional h-index of 14 and a recent h-index of 11 (since 2020), a distinguished researcher at University of Haifa, specializes in the field of Computational Complexity, Coding Theory, Pseudorandomness, Circuit Lower Bounds, Probabilistic Proof.

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

KRW composition theorems via lifting

Lifting with inner functions of polynomial discrepancy

Toward better depth lower bounds: A KRW-like theorem for strong composition

Nullstellensatz size-degree trade-offs from reversible pebbling

Shrinkage under random projections, and cubic formula lower bounds for AC0

Lifting with simple gadgets and applications to circuit and proof complexity

Toward better depth lower bounds: Two results on the multiplexor relation

Bridging a Small Gap in the Gap Amplification of Assignment Testers

Or Meir Information

University

Position

Senior Lecturer of Computer Science

Citations(all)

626

Citations(since 2020)

338

Cited By

424

hIndex(all)

14

hIndex(since 2020)

11

i10Index(all)

18

i10Index(since 2020)

12

Email

University Profile Page

University of Haifa

Google Scholar

View Google Scholar Profile

Or Meir Skills & Research Interests

Computational Complexity

Coding Theory

Pseudorandomness

Circuit Lower Bounds

Probabilistic Proof

Top articles of Or Meir

Title

Journal

Author(s)

Publication Date

KRW composition theorems via lifting

Susanna F De Rezende

Or Meir

Jakob Nordström

Toniann Pitassi

Robert Robere

2020/11/16

Lifting with inner functions of polynomial discrepancy

arXiv preprint arXiv:2404.07606

Yahel Manor

Or Meir

2024/4/11

Toward better depth lower bounds: A KRW-like theorem for strong composition

Or Meir

2023/11/6

Nullstellensatz size-degree trade-offs from reversible pebbling

computational complexity

Susanna F De Rezende

Or Meir

Jakob Nordström

Robert Robere

2021/6

Shrinkage under random projections, and cubic formula lower bounds for AC0

Yuval Filmus

Or Meir

Avishay Tal

2021

Lifting with simple gadgets and applications to circuit and proof complexity

Susanna De Rezende

Or Meir

Jakob Nordström

Toniann Pitassi

Robert Robere

...

2020/11/16

Toward better depth lower bounds: Two results on the multiplexor relation

computational complexity

Or Meir

2020/6

Bridging a Small Gap in the Gap Amplification of Assignment Testers

Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation

Oded Goldreich

Or Meir

2020

See List of Professors in Or Meir University(University of Haifa)