Theoretical Computer Science
user avatar
user avatar
user avatar
Or Meir
  • Member for 10 years, 3 months
  • Last seen this week
Profile Activity
Stats
5,055
reputation
130k
reached
44
answers
11
questions
Communities
About

I am a faculty member in the Department of Computer Science at the University of Haifa. I did my Ph.d. at the Weizmann Institute of Science under the supervision of Prof. Oded Goldreich.

I am interested in all areas of Theoretical Computer Science, and in particular in Complexity Theory, Circuit Lower bounds, Communication complexity, Probabilistically Checkable Proofs, Coding Theory and Derandomization.

Badges
View all badges
This user doesn’t have any gold badges yet.
20
silver badges
32
bronze badges
Top tags
View all tags
133
Score
18
Posts
33
Posts %
85
Score
5
Posts
9
Posts %
35
Score
9
Posts
16
Posts %
32
Score
4
Posts
7
Posts %
29
Score
4
Posts
7
Posts %
25
Score
6
Posts
11
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
70
Why does Fourier analysis of Boolean functions "work"?
Sep 21, 2012
answer
19
$d$-regular bipartite expander graph
Jun 12, 2015
question
19
Linearly independent Fourier coefficients
Jul 10, 2012
answer
18
The utility of Renyi entropies?
Apr 7, 2015
answer
17
AM/MA and NP in analogy to P and BPP
Apr 11, 2012
answer
16
Landscape of interactive proof systems
Aug 20, 2012
question
15
Mutual information vs. Product sets
Feb 16, 2012
question
15
Fano's inequality in the high error regime
May 8, 2013
answer
15
What's known about basing one-way function on the $P \neq NP$ assumption?
May 22, 2015
answer
12
Book on Probability
Jun 13, 2012
Top network posts
View all network posts
32
Advances in CS appropriate for CS1 and CS2 made by female computer scientists
5
Vertex expansion of the Hamming graph

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.