受强制性开放获取政策约束的文章 - Omri Weinstein了解详情
可在其他位置公开访问的文章：18 篇
A faster algorithm for solving general lps
S Jiang, Z Song, O Weinstein, H Zhang
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
强制性开放获取政策： US National Science Foundation
Massively parallel algorithms for finding well-connected components in sparse graphs
S Assadi, X Sun, O Weinstein
Proceedings of the 2019 ACM Symposium on principles of distributed computing …, 2019
强制性开放获取政策： US National Science Foundation
A discrepancy lower bound for information complexity
M Braverman, O Weinstein
Algorithmica 76, 846-864, 2016
强制性开放获取政策： US National Science Foundation
ETH Hardness for Densest-k-Subgraph with Perfect Completeness
M Braverman, YK Ko, A Rubinstein, O Weinstein
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
强制性开放获取政策： US National Science Foundation
Crossing the logarithmic barrier for dynamic boolean data structure lower bounds
KG Larsen, O Weinstein, H Yu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
强制性开放获取政策： US National Science Foundation
Information lower bounds via self-reducibility
M Braverman, A Garg, D Pankratov, O Weinstein
Theory of Computing Systems 59, 377-396, 2016
强制性开放获取政策： US National Science Foundation
Static data structure lower bounds imply rigidity
Z Dvir, A Golovnev, O Weinstein
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
强制性开放获取政策： US National Science Foundation
The minrank of random graphs
A Golovnev, O Regev, O Weinstein
IEEE Transactions on Information Theory 64 (11), 6990-6995, 2018
强制性开放获取政策： US National Science Foundation
Toward better formula lower bounds: The composition of a function and a universal relation
D Gavinsky, O Meir, O Weinstein, A Wigderson
SIAM Journal on Computing 46 (1), 114-131, 2017
强制性开放获取政策： US National Science Foundation, National Research Foundation, Singapore
An improved upper bound for the most informative boolean function conjecture
O Ordentlich, O Shayevitz, O Weinstein
2016 IEEE International Symposium on Information Theory (ISIT), 500-504, 2016
强制性开放获取政策： European Commission
A faster interior-point method for sum-of-squares optimization
S Jiang, B Natura, O Weinstein
Algorithmica 85 (9), 2843-2884, 2023
强制性开放获取政策： US National Science Foundation, European Commission
Quartic samples suffice for fourier interpolation
Z Song, B Sun, O Weinstein, R Zhang
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
强制性开放获取政策： European Commission
Welfare and revenue guarantees for competitive bundling equilibrium
S Dobzinski, M Feldman, I Talgam-Cohen, O Weinstein
Web and Internet Economics: 11th International Conference, WINE 2015 …, 2015
强制性开放获取政策： European Commission
How to store a random walk
E Viola, O Weinstein, H Yu
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
强制性开放获取政策： US National Science Foundation, US Department of Defense
Local decodability of the burrows-wheeler transform
S Sinha, O Weinstein
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
强制性开放获取政策： US National Science Foundation
The complexity of dynamic least-squares regression
S Jiang, B Peng, O Weinstein
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
强制性开放获取政策： US National Science Foundation, European Commission
Distributed signaling games
M Feldman, M Tennenholtz, O Weinstein
ACM Transactions on Economics and Computation (TEAC) 8 (2), 1-26, 2020
强制性开放获取政策： US National Science Foundation, European Commission
Polynomial data structure lower bounds in the group model
A Golovnev, G Posobin, O Regev, O Weinstein
SIAM Journal on Computing, FOCS20-74-FOCS20-101, 2022
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定