Or Meir
Orcid: 0000-0001-5031-0750Affiliations:
- University of Haifa, Department of Computer Science, Israel
- Weizmann Institute of Science, Rehovot, Israel
According to our database1,
Or Meir
authored at least 36 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
1
2
1
2
2
4
3
3
1
1
2
3
2
2
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Electron. Colloquium Comput. Complex., 2024
2023
Electron. Colloquium Comput. Complex., 2023
2021
Comput. Complex., 2021
Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
2020
Proceedings of the Computational Complexity and Property Testing, 2020
Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC<sup>0</sup>.
Electron. Colloquium Comput. Complex., 2020
Comput. Complex., 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016).
SIAM J. Comput., 2019
Electron. Colloquium Comput. Complex., 2019
Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds.
Comput. Complex., 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity.
Comput. Complex., 2018
Proceedings of the Approximation, 2018
2017
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation.
SIAM J. Comput., 2017
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity.
J. ACM, 2017
An Efficient Randomized Protocol for every Karchmer-Wigderson Relation with Two Rounds.
Electron. Colloquium Comput. Complex., 2017
2016
2015
Electron. Colloquium Comput. Complex., 2015
2014
Electron. Colloquium Comput. Complex., 2014
2013
Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture.
Electron. Colloquium Comput. Complex., 2013
Electron. Colloquium Comput. Complex., 2013
2012
Inf. Process. Lett., 2012
Inf. Process. Lett., 2012
2011
Electron. Colloquium Comput. Complex., 2011
2010
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010
2009
2008
Electron. Colloquium Comput. Complex., 2008