Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Home
Researchers
Research units
Research output
Search by expertise, name or affiliation
View Scopus Profile
Or Meir
Associate Professor
,
Faculty of Computer & Information Science
,
Department of Computer Science
https://orcid.org/0000-0001-5031-0750
2008
2025
Research activity per year
Overview
Fingerprint
Network
Research output
(40)
Similar Profiles
(2)
Fingerprint
Dive into the research topics where Or Meir is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Formula Lower Bounds
82%
KRW Conjecture
72%
Query Complexity
63%
Direct Sum
61%
Verifier
57%
Universal Relations
57%
Inner Function
54%
Depth Complexity
51%
Communication Complexity
51%
Combinatorial Construction
46%
Composition Conjecture
44%
Function Composition
43%
Depth Lower Bound
43%
Random Restrictions
43%
Complexity Theory
41%
Composition Theorem
41%
Locally Testable Codes
41%
Probabilistically Checkable Proofs
41%
Gadgets
41%
Lifting Theorems
33%
Nullstellensatz
32%
Tensor Product
30%
Monotone
30%
Reversible Pebbling
29%
Circuit Complexity
29%
Error Correction Codes
28%
PCP Theorem
27%
Locally Correctable Codes
27%
Parallel Repetition
27%
Random Projection
27%
Boolean Functions
26%
Sum Problem
24%
Relative Distance
24%
Algebraic Construction
24%
Proof System
23%
De Morgan Formulas
22%
Sudan
22%
Formula Size
20%
Mathematics
Polynomial
100%
Direct Sum
82%
Inner Functions
68%
Open Problem
59%
Combinatorial Construction
56%
Probability Theory
48%
Boolean Function
41%
Composition Theorem
41%
Query Complexity
34%
Error Correcting Codes
33%
Tensor
32%
Direct Product
27%
Manifold
27%
Probabilistically checkable proofs
24%
Low Degree
21%
Arbitrary Function
20%
Starting Point
20%
Decision Tree
20%
Computer Science
Universal Relation
61%
Soundness
54%
Communication Complexity
49%
Proof System
35%
Computational Complexity
27%
Algebraic Method
27%
Relative Distance
27%
Boolean Function
26%
Circuit Complexity
20%
Message Length
20%
