Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Omri Weinstein
@article{DBLP:journals/algorithmica/JiangNW23,
author = {Shunhua Jiang and
Bento Natura and
Omri Weinstein},
title = {A Faster Interior-Point Method for Sum-of-Squares Optimization},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2843--2884},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01112-4},
doi = {10.1007/S00453-023-01112-4},
timestamp = {Sun, 01 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JiangNW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/00020W023,
author = {Zhao Song and
Baocheng Sun and
Omri Weinstein and
Ruizhe Zhang},
title = {Quartic Samples Suffice for Fourier Interpolation},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1414--1425},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00087},
doi = {10.1109/FOCS57990.2023.00087},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/00020W023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JiangPW23,
author = {Shunhua Jiang and
Binghui Peng and
Omri Weinstein},
title = {The Complexity of Dynamic Least-Squares Regression},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1605--1627},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00097},
doi = {10.1109/FOCS57990.2023.00097},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JiangPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-05966,
author = {Amit Suliman and
Omri Weinstein},
title = {Infinite Lewis Weights in Spectral Graph Theory},
journal = {CoRR},
volume = {abs/2302.05966},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.05966},
doi = {10.48550/ARXIV.2302.05966},
eprinttype = {arXiv},
eprint = {2302.05966},
timestamp = {Sun, 19 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-05966.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JiangNW22,
author = {Shunhua Jiang and
Bento Natura and
Omri Weinstein},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {A Faster Interior-Point Method for Sum-Of-Squares Optimization},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {79:1--79:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.79},
doi = {10.4230/LIPICS.ICALP.2022.79},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/JiangNW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/00020W022,
author = {Yichuan Deng and
Zhao Song and
Omri Weinstein and
Ruizhe Zhang},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Fast Distance Oracles for Any Symmetric Norm},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/2fc6b8a3fc23108f184daa4759024c25-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/00020W022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-00228,
author = {Shunhua Jiang and
Binghui Peng and
Omri Weinstein},
title = {Dynamic Least-Squares Regression},
journal = {CoRR},
volume = {abs/2201.00228},
year = {2022},
url = {https://arxiv.org/abs/2201.00228},
eprinttype = {arXiv},
eprint = {2201.00228},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-00228.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-08489,
author = {Shunhua Jiang and
Bento Natura and
Omri Weinstein},
title = {A Faster Interior-Point Method for Sum-of-Squares Optimization},
journal = {CoRR},
volume = {abs/2202.08489},
year = {2022},
url = {https://arxiv.org/abs/2202.08489},
eprinttype = {arXiv},
eprint = {2202.08489},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-08489.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-12329,
author = {Baihe Huang and
Zhao Song and
Omri Weinstein and
Hengjie Zhang and
Ruizhe Zhang},
title = {A Dynamic Fast Gaussian Transform},
journal = {CoRR},
volume = {abs/2202.12329},
year = {2022},
url = {https://arxiv.org/abs/2202.12329},
eprinttype = {arXiv},
eprint = {2202.12329},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-12329.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-00658,
author = {Zhao Song and
Baocheng Sun and
Omri Weinstein and
Ruizhe Zhang},
title = {Sparse Fourier Transform over Lattices: {A} Unified Approach to Signal
Reconstruction},
journal = {CoRR},
volume = {abs/2205.00658},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.00658},
doi = {10.48550/ARXIV.2205.00658},
eprinttype = {arXiv},
eprint = {2205.00658},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-00658.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-14816,
author = {Yichuan Deng and
Zhao Song and
Omri Weinstein and
Ruizhe Zhang},
title = {Fast Distance Oracles for Any Symmetric Norm},
journal = {CoRR},
volume = {abs/2205.14816},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.14816},
doi = {10.48550/ARXIV.2205.14816},
eprinttype = {arXiv},
eprint = {2205.14816},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-14816.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-04508,
author = {Hang Hu and
Zhao Song and
Omri Weinstein and
Danyang Zhuo},
title = {Training Overparametrized Neural Networks in Sublinear Time},
journal = {CoRR},
volume = {abs/2208.04508},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.04508},
doi = {10.48550/ARXIV.2208.04508},
eprinttype = {arXiv},
eprint = {2208.04508},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-04508.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-12468,
author = {Yichuan Deng and
Zhao Song and
Omri Weinstein},
title = {Discrepancy Minimization in Input-Sparsity Time},
journal = {CoRR},
volume = {abs/2210.12468},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.12468},
doi = {10.48550/ARXIV.2210.12468},
eprinttype = {arXiv},
eprint = {2210.12468},
timestamp = {Fri, 28 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-12468.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-12495,
author = {Zhao Song and
Baocheng Sun and
Omri Weinstein and
Ruizhe Zhang},
title = {Quartic Samples Suffice for Fourier Interpolation},
journal = {CoRR},
volume = {abs/2210.12495},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.12495},
doi = {10.48550/ARXIV.2210.12495},
eprinttype = {arXiv},
eprint = {2210.12495},
timestamp = {Fri, 28 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-12495.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-14825,
author = {Yichuan Deng and
Wenyu Jin and
Zhao Song and
Xiaorui Sun and
Omri Weinstein},
title = {Dynamic Kernel Sparsifiers},
journal = {CoRR},
volume = {abs/2211.14825},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.14825},
doi = {10.48550/ARXIV.2211.14825},
eprinttype = {arXiv},
eprint = {2211.14825},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-14825.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BrandP0W21,
author = {Jan van den Brand and
Binghui Peng and
Zhao Song and
Omri Weinstein},
editor = {James R. Lee},
title = {Training (Overparametrized) Neural Networks in Near-Linear Time},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {63:1--63:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.63},
doi = {10.4230/LIPICS.ITCS.2021.63},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BrandP0W21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Jiang0WZ21,
author = {Shunhua Jiang and
Zhao Song and
Omri Weinstein and
Hengjie Zhang},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A faster algorithm for solving general LPs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {823--832},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451058},
doi = {10.1145/3406325.3451058},
timestamp = {Tue, 22 Jun 2021 19:47:11 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Jiang0WZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LarsenWY20,
author = {Kasper Green Larsen and
Omri Weinstein and
Huacheng Yu},
title = {Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure
Lower Bounds},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {5},
year = {2020},
url = {https://doi.org/10.1137/18M1198429},
doi = {10.1137/18M1198429},
timestamp = {Thu, 26 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LarsenWY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/FeldmanTW20,
author = {Moran Feldman and
Moshe Tennenholtz and
Omri Weinstein},
title = {Distributed Signaling Games},
journal = {{ACM} Trans. Economics and Comput.},
volume = {8},
number = {2},
pages = {7:1--7:26},
year = {2020},
url = {https://doi.org/10.1145/3381529},
doi = {10.1145/3381529},
timestamp = {Fri, 29 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/FeldmanTW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LecomteW20,
author = {Victor Lecomte and
Omri Weinstein},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Settling the Relationship Between Wilber's Bounds for Dynamic Optimality},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {68:1--68:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.68},
doi = {10.4230/LIPICS.ESA.2020.68},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/esa/LecomteW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GolovnevP0W20,
author = {Alexander Golovnev and
Gleb Posobin and
Oded Regev and
Omri Weinstein},
editor = {Sandy Irani},
title = {Polynomial Data Structure Lower Bounds in the Group Model},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {740--751},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00074},
doi = {10.1109/FOCS46700.2020.00074},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/GolovnevP0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kun-KoW20,
author = {Young Kun{-}Ko and
Omri Weinstein},
editor = {Sandy Irani},
title = {An Adaptive Step Toward the Multiphase Conjecture},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {752--761},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00075},
doi = {10.1109/FOCS46700.2020.00075},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kun-KoW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ViolaWY20,
author = {Emanuele Viola and
Omri Weinstein and
Huacheng Yu},
editor = {Shuchi Chawla},
title = {How to Store a Random Walk},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {426--445},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.26},
doi = {10.1137/1.9781611975994.26},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/ViolaWY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LarsenMWY20,
author = {Kasper Green Larsen and
Tal Malkin and
Omri Weinstein and
Kevin Yeo},
editor = {Shuchi Chawla},
title = {Lower Bounds for Oblivious Near-Neighbor Search},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1116--1134},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.68},
doi = {10.1137/1.9781611975994.68},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/LarsenMWY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-07470,
author = {Shunhua Jiang and
Zhao Song and
Omri Weinstein and
Hengjie Zhang},
title = {Faster Dynamic Matrix Inverse for Faster LPs},
journal = {CoRR},
volume = {abs/2004.07470},
year = {2020},
url = {https://arxiv.org/abs/2004.07470},
eprinttype = {arXiv},
eprint = {2004.07470},
timestamp = {Sat, 05 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-07470.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-11648,
author = {Jan van den Brand and
Binghui Peng and
Zhao Song and
Omri Weinstein},
title = {Training (Overparametrized) Neural Networks in Near-Linear Time},
journal = {CoRR},
volume = {abs/2006.11648},
year = {2020},
url = {https://arxiv.org/abs/2006.11648},
eprinttype = {arXiv},
eprint = {2006.11648},
timestamp = {Sat, 05 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-11648.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GolovnevPRW20,
author = {Alexander Golovnev and
Gleb Posobin and
Oded Regev and
Omri Weinstein},
title = {Polynomial Data Structure Lower Bounds in the Group Model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-057}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/057},
eprinttype = {ECCC},
eprint = {TR20-057},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GolovnevPRW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AssadiSW19,
author = {Sepehr Assadi and
Xiaorui Sun and
Omri Weinstein},
editor = {Peter Robinson and
Faith Ellen},
title = {Massively Parallel Algorithms for Finding Well-Connected Components
in Sparse Graphs},
booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
pages = {461--470},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3293611.3331596},
doi = {10.1145/3293611.3331596},
timestamp = {Fri, 19 Jul 2019 08:02:49 +0200},
biburl = {https://dblp.org/rec/conf/podc/AssadiSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SinhaW19,
author = {Sandip Sinha and
Omri Weinstein},
editor = {Moses Charikar and
Edith Cohen},
title = {Local decodability of the Burrows-Wheeler transform},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {744--755},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316317},
doi = {10.1145/3313276.3316317},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SinhaW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DvirGW19,
author = {Zeev Dvir and
Alexander Golovnev and
Omri Weinstein},
editor = {Moses Charikar and
Edith Cohen},
title = {Static data structure lower bounds imply rigidity},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {967--978},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316348},
doi = {10.1145/3313276.3316348},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DvirGW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-04828,
author = {Kasper Green Larsen and
Tal Malkin and
Omri Weinstein and
Kevin Yeo},
title = {Lower Bounds for Oblivious Near-Neighbor Search},
journal = {CoRR},
volume = {abs/1904.04828},
year = {2019},
url = {http://arxiv.org/abs/1904.04828},
eprinttype = {arXiv},
eprint = {1904.04828},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-04828.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-10874,
author = {Emanuele Viola and
Omri Weinstein and
Huacheng Yu},
title = {How to Store a Random Walk},
journal = {CoRR},
volume = {abs/1907.10874},
year = {2019},
url = {http://arxiv.org/abs/1907.10874},
eprinttype = {arXiv},
eprint = {1907.10874},
timestamp = {Thu, 01 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-10874.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-13543,
author = {Young Kun{-}Ko and
Omri Weinstein},
title = {An Adaptive Step Toward the Multiphase Conjecture},
journal = {CoRR},
volume = {abs/1910.13543},
year = {2019},
url = {http://arxiv.org/abs/1910.13543},
eprinttype = {arXiv},
eprint = {1910.13543},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-13543.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-02858,
author = {Victor Lecomte and
Omri Weinstein},
title = {Settling the relationship between Wilber's bounds for dynamic optimality},
journal = {CoRR},
volume = {abs/1912.02858},
year = {2019},
url = {http://arxiv.org/abs/1912.02858},
eprinttype = {arXiv},
eprint = {1912.02858},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-02858.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KoW19,
author = {Young Ko and
Omri Weinstein},
title = {An Adaptive Step Toward the Multiphase Conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-144}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/144},
eprinttype = {ECCC},
eprint = {TR19-144},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KoW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LarsenMWY19,
author = {Kasper Green Larsen and
Tal Malkin and
Omri Weinstein and
Kevin Yeo},
title = {Lower Bounds for Oblivious Near-Neighbor Search},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-055}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/055},
eprinttype = {ECCC},
eprint = {TR19-055},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LarsenMWY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/LarsenMWY19,
author = {Kasper Green Larsen and
Tal Malkin and
Omri Weinstein and
Kevin Yeo},
title = {Lower Bounds for Oblivious Near-Neighbor Search},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {377},
year = {2019},
url = {https://eprint.iacr.org/2019/377},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/LarsenMWY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GolovnevRW18,
author = {Alexander Golovnev and
Oded Regev and
Omri Weinstein},
title = {The Minrank of Random Graphs},
journal = {{IEEE} Trans. Inf. Theory},
volume = {64},
number = {11},
pages = {6990--6995},
year = {2018},
url = {https://doi.org/10.1109/TIT.2018.2810384},
doi = {10.1109/TIT.2018.2810384},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GolovnevRW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ita/LarsenWY18,
author = {Kasper Green Larsen and
Omri Weinstein and
Huacheng Yu},
title = {Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure
Lower Bounds},
booktitle = {2018 Information Theory and Applications Workshop, {ITA} 2018, San
Diego, CA, USA, February 11-16, 2018},
pages = {1--40},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/ITA.2018.8503262},
doi = {10.1109/ITA.2018.8503262},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/ita/LarsenWY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LarsenWY18,
author = {Kasper Green Larsen and
Omri Weinstein and
Huacheng Yu},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Crossing the logarithmic barrier for dynamic Boolean data structure
lower bounds},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {978--989},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188790},
doi = {10.1145/3188745.3188790},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LarsenWY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02974,
author = {Sepehr Assadi and
Xiaorui Sun and
Omri Weinstein},
title = {Massively Parallel Algorithms for Finding Well-Connected Components
in Sparse Graphs},
journal = {CoRR},
volume = {abs/1805.02974},
year = {2018},
url = {http://arxiv.org/abs/1805.02974},
eprinttype = {arXiv},
eprint = {1805.02974},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-02974.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-03978,
author = {Sandip Sinha and
Omri Weinstein},
title = {Local Decodability of the Burrows-Wheeler Transform},
journal = {CoRR},
volume = {abs/1808.03978},
year = {2018},
url = {http://arxiv.org/abs/1808.03978},
eprinttype = {arXiv},
eprint = {1808.03978},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-03978.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-02725,
author = {Zeev Dvir and
Alexander Golovnev and
Omri Weinstein},
title = {Static Data Structure Lower Bounds Imply Rigidity},
journal = {CoRR},
volume = {abs/1811.02725},
year = {2018},
url = {http://arxiv.org/abs/1811.02725},
eprinttype = {arXiv},
eprint = {1811.02725},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-02725.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DvirGW18,
author = {Zeev Dvir and
Alexander Golovnev and
Omri Weinstein},
title = {Static Data Structure Lower Bounds Imply Rigidity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-188}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/188},
eprinttype = {ECCC},
eprint = {TR18-188},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DvirGW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SinhaW18,
author = {Sandip Sinha and
Omri Weinstein},
title = {Local Decodability of the Burrows-Wheeler Transform},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-141}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/141},
eprinttype = {ECCC},
eprint = {TR18-141},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SinhaW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GavinskyMWW17,
author = {Dmitry Gavinsky and
Or Meir and
Omri Weinstein and
Avi Wigderson},
title = {Toward Better Formula Lower Bounds: The Composition of a Function
and a Universal Relation},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {1},
pages = {114--131},
year = {2017},
url = {https://doi.org/10.1137/15M1018319},
doi = {10.1137/15M1018319},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GavinskyMWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Golovnev0W17,
author = {Alexander Golovnev and
Oded Regev and
Omri Weinstein},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {The Minrank of Random Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {46:1--46:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.46},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.46},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Golovnev0W17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BravermanKRW17,
author = {Mark Braverman and
Young Kun{-}Ko and
Aviad Rubinstein and
Omri Weinstein},
editor = {Philip N. Klein},
title = {{ETH} Hardness for Densest-\emph{k}-Subgraph with Perfect Completeness},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1326--1341},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.86},
doi = {10.1137/1.9781611974782.86},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/BravermanKRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LarsenWY17,
author = {Kasper Green Larsen and
Omri Weinstein and
Huacheng Yu},
title = {Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure
Lower Bounds},
journal = {CoRR},
volume = {abs/1703.03575},
year = {2017},
url = {http://arxiv.org/abs/1703.03575},
eprinttype = {arXiv},
eprint = {1703.03575},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LarsenWY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AndoniGHRW17,
author = {Alexandr Andoni and
Javad Ghaderi and
Daniel J. Hsu and
Dan Rubenstein and
Omri Weinstein},
title = {Coding with asymmetric prior knowledge},
journal = {CoRR},
volume = {abs/1707.04875},
year = {2017},
url = {http://arxiv.org/abs/1707.04875},
eprinttype = {arXiv},
eprint = {1707.04875},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AndoniGHRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LarsenWY17,
author = {Kasper Green Larsen and
Omri Weinstein and
Huacheng Yu},
title = {Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure
Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-047}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/047},
eprinttype = {ECCC},
eprint = {TR17-047},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LarsenWY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BravermanW16a,
author = {Mark Braverman and
Omri Weinstein},
title = {A Discrepancy Lower Bound for Information Complexity},
journal = {Algorithmica},
volume = {76},
number = {3},
pages = {846--864},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0093-8},
doi = {10.1007/S00453-015-0093-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BravermanW16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BravermanGPW16,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
title = {Information Lower Bounds via Self-Reducibility},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {377--396},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9655-z},
doi = {10.1007/S00224-015-9655-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BravermanGPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FeldmanTW16,
author = {Moran Feldman and
Moshe Tennenholtz and
Omri Weinstein},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Distributed Signaling Games},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {41:1--41:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.41},
doi = {10.4230/LIPICS.ESA.2016.41},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/FeldmanTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RoughgardenW16,
author = {Tim Roughgarden and
Omri Weinstein},
editor = {Irit Dinur},
title = {On the Communication Complexity of Approximate Fixed Points},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {229--238},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.32},
doi = {10.1109/FOCS.2016.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RoughgardenW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/WeinsteinY16,
author = {Omri Weinstein and
Huacheng Yu},
editor = {Irit Dinur},
title = {Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {305--314},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.41},
doi = {10.1109/FOCS.2016.41},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/WeinsteinY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/OrdentlichSW16,
author = {Or Ordentlich and
Ofer Shayevitz and
Omri Weinstein},
title = {An improved upper bound for the most informative boolean function
conjecture},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2016,
Barcelona, Spain, July 10-15, 2016},
pages = {500--504},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/ISIT.2016.7541349},
doi = {10.1109/ISIT.2016.7541349},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/OrdentlichSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/WeinsteinY16,
author = {Omri Weinstein and
Huacheng Yu},
title = {Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication},
journal = {CoRR},
volume = {abs/1604.03030},
year = {2016},
url = {http://arxiv.org/abs/1604.03030},
eprinttype = {arXiv},
eprint = {1604.03030},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/WeinsteinY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovnevRW16,
author = {Alexander Golovnev and
Oded Regev and
Omri Weinstein},
title = {The Minrank of Random Graphs},
journal = {CoRR},
volume = {abs/1607.04842},
year = {2016},
url = {http://arxiv.org/abs/1607.04842},
eprinttype = {arXiv},
eprint = {1607.04842},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolovnevRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GolovnevRW16,
author = {Alexander Golovnev and
Oded Regev and
Omri Weinstein},
title = {The Minrank of Random Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-110}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/110},
eprinttype = {ECCC},
eprint = {TR16-110},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GolovnevRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RoughgardenW16,
author = {Tim Roughgarden and
Omri Weinstein},
title = {On the Communication Complexity of Approximate Fixed Points},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-055}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/055},
eprinttype = {ECCC},
eprint = {TR16-055},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RoughgardenW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/WeinsteinY16,
author = {Omri Weinstein and
Huacheng Yu},
title = {Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-054}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/054},
eprinttype = {ECCC},
eprint = {TR16-054},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WeinsteinY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Weinstein15,
author = {Omri Weinstein},
title = {Information Complexity and the Quest for Interactive Compression},
journal = {{SIGACT} News},
volume = {46},
number = {2},
pages = {41--64},
year = {2015},
url = {https://doi.org/10.1145/2789149.2789161},
doi = {10.1145/2789149.2789161},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Weinstein15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonNRW15,
author = {Noga Alon and
Noam Nisan and
Ran Raz and
Omri Weinstein},
editor = {Venkatesan Guruswami},
title = {Welfare Maximization with Limited Interaction},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1499--1512},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.95},
doi = {10.1109/FOCS.2015.95},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AlonNRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/WeinsteinW15,
author = {Omri Weinstein and
David P. Woodruff},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {The Simultaneous Communication of Disjointness with Applications to
Data Streams},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {1082--1093},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_88},
doi = {10.1007/978-3-662-47672-7\_88},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/WeinsteinW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BravermanKW15,
author = {Mark Braverman and
Young Kun{-}Ko and
Omri Weinstein},
editor = {Piotr Indyk},
title = {Approximating the best Nash Equilibrium in \emph{n\({}^{\mbox{o}}\)}\({}^{\mbox{(log
\emph{n})}}\)-time breaks the Exponential Time Hypothesis},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {970--982},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.66},
doi = {10.1137/1.9781611973730.66},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/BravermanKW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanW15,
author = {Mark Braverman and
Omri Weinstein},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {An Interactive Information Odometer and Applications},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {341--350},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746548},
doi = {10.1145/2746539.2746548},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BravermanW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/DobzinskiFTW15,
author = {Shahar Dobzinski and
Michal Feldman and
Inbal Talgam{-}Cohen and
Omri Weinstein},
editor = {Evangelos Markakis and
Guido Sch{\"{a}}fer},
title = {Welfare and Revenue Guarantees for Competitive Bundling Equilibrium},
booktitle = {Web and Internet Economics - 11th International Conference, {WINE}
2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9470},
pages = {300--313},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48995-6\_22},
doi = {10.1007/978-3-662-48995-6\_22},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/DobzinskiFTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlonNRW15,
author = {Noga Alon and
Noam Nisan and
Ran Raz and
Omri Weinstein},
title = {Welfare Maximization with Limited Interaction},
journal = {CoRR},
volume = {abs/1504.01780},
year = {2015},
url = {http://arxiv.org/abs/1504.01780},
eprinttype = {arXiv},
eprint = {1504.01780},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlonNRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Weinstein15,
author = {Omri Weinstein},
title = {Information Complexity and the Quest for Interactive Compression {(A}
Survey)},
journal = {CoRR},
volume = {abs/1504.06830},
year = {2015},
url = {http://arxiv.org/abs/1504.06830},
eprinttype = {arXiv},
eprint = {1504.06830},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Weinstein15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BravermanKRW15,
author = {Mark Braverman and
Young Kun{-}Ko and
Aviad Rubinstein and
Omri Weinstein},
title = {{ETH} Hardness for Densest-{\textdollar}k{\textdollar}-Subgraph with
Perfect Completeness},
journal = {CoRR},
volume = {abs/1504.08352},
year = {2015},
url = {http://arxiv.org/abs/1504.08352},
eprinttype = {arXiv},
eprint = {1504.08352},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BravermanKRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/OrdentlichSW15,
author = {Or Ordentlich and
Ofer Shayevitz and
Omri Weinstein},
title = {Dictatorship is the Most Informative Balanced Function at the Extremes},
journal = {CoRR},
volume = {abs/1505.05794},
year = {2015},
url = {http://arxiv.org/abs/1505.05794},
eprinttype = {arXiv},
eprint = {1505.05794},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/OrdentlichSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlonNRW15,
author = {Noga Alon and
Noam Nisan and
Ran Raz and
Omri Weinstein},
title = {Welfare Maximization with Limited Interaction},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-054}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/054},
eprinttype = {ECCC},
eprint = {TR15-054},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlonNRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanKRW15,
author = {Mark Braverman and
Young Kun{-}Ko and
Aviad Rubinstein and
Omri Weinstein},
title = {{ETH} Hardness for Densest-\emph{k}-Subgraph with Perfect Completeness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-074}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/074},
eprinttype = {ECCC},
eprint = {TR15-074},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanKRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/OrdentlichSW15,
author = {Or Ordentlich and
Ofer Shayevitz and
Omri Weinstein},
title = {Dictatorship is the Most Informative Balanced Function at the Extremes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-084}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/084},
eprinttype = {ECCC},
eprint = {TR15-084},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/OrdentlichSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Weinstein15,
author = {Omri Weinstein},
title = {Information Complexity and the Quest for Interactive Compression},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-060}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/060},
eprinttype = {ECCC},
eprint = {TR15-060},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Weinstein15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/WeinsteinW15,
author = {Omri Weinstein and
David P. Woodruff},
title = {The Simultaneous Communication of Disjointness with Applications to
Data Streams},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-083}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/083},
eprinttype = {ECCC},
eprint = {TR15-083},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WeinsteinW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GavinskyMWW14,
author = {Dmitry Gavinsky and
Or Meir and
Omri Weinstein and
Avi Wigderson},
editor = {David B. Shmoys},
title = {Toward better formula lower bounds: an information complexity approach
to the {KRW} composition conjecture},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {213--222},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591856},
doi = {10.1145/2591796.2591856},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GavinskyMWW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmanTW14,
author = {Moran Feldman and
Moshe Tennenholtz and
Omri Weinstein},
title = {Display Advertising with Information Mediators},
journal = {CoRR},
volume = {abs/1404.2861},
year = {2014},
url = {http://arxiv.org/abs/1404.2861},
eprinttype = {arXiv},
eprint = {1404.2861},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmanTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DobzinskiFTW14,
author = {Shahar Dobzinski and
Michal Feldman and
Inbal Talgam{-}Cohen and
Omri Weinstein},
title = {Welfare and Revenue Guarantees for Competitive Bundling Equilibrium},
journal = {CoRR},
volume = {abs/1406.0576},
year = {2014},
url = {http://arxiv.org/abs/1406.0576},
eprinttype = {arXiv},
eprint = {1406.0576},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DobzinskiFTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanKW14,
author = {Mark Braverman and
Young Kun{-}Ko and
Omri Weinstein},
title = {Approximating the best Nash Equilibrium in n\({}^{\mbox{o(log n)}}\)-time
breaks the Exponential Time Hypothesis},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-092}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/092},
eprinttype = {ECCC},
eprint = {TR14-092},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanW14,
author = {Mark Braverman and
Omri Weinstein},
title = {An Interactive Information Odometer with Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-047}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/047},
eprinttype = {ECCC},
eprint = {TR14-047},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BravermanGPW13,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
editor = {Andrei A. Bulatov and
Arseny M. Shur},
title = {Information Lower Bounds via Self-reducibility},
booktitle = {Computer Science - Theory and Applications - 8th International Computer
Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June
25-29, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7913},
pages = {183--194},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38536-0\_16},
doi = {10.1007/978-3-642-38536-0\_16},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/BravermanGPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanRWY13,
author = {Mark Braverman and
Anup Rao and
Omri Weinstein and
Amir Yehudayoff},
title = {Direct Products in Communication Complexity},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {746--755},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.85},
doi = {10.1109/FOCS.2013.85},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanRWY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BravermanRWY13,
author = {Mark Braverman and
Anup Rao and
Omri Weinstein and
Amir Yehudayoff},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Direct Product via Round-Preserving Compression},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {232--243},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_20},
doi = {10.1007/978-3-642-39206-1\_20},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BravermanRWY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanGPW13,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {From information to exact communication},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {151--160},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488628},
doi = {10.1145/2488608.2488628},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BravermanGPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanRWY13,
author = {Mark Braverman and
Anup Rao and
Omri Weinstein and
Amir Yehudayoff},
title = {Direct product via round-preserving compression},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-035}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/035},
eprinttype = {ECCC},
eprint = {TR13-035},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanRWY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GavinskyMWW13,
author = {Dmitry Gavinsky and
Or Meir and
Omri Weinstein and
Avi Wigderson},
title = {Toward Better Formula Lower Bounds: An Information Complexity Approach
to the {KRW} Composition Conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-190}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/190},
eprinttype = {ECCC},
eprint = {TR13-190},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GavinskyMWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/RonRSSW12,
author = {Dana Ron and
Ronitt Rubinfeld and
Muli Safra and
Alex Samorodnitsky and
Omri Weinstein},
title = {Approximating the Influence of Monotone Boolean Functions in O({\(\surd\)}n)
Query Complexity},
journal = {{ACM} Trans. Comput. Theory},
volume = {4},
number = {4},
pages = {11:1--11:12},
year = {2012},
url = {https://doi.org/10.1145/2382559.2382562},
doi = {10.1145/2382559.2382562},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/RonRSSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BravermanW12,
author = {Mark Braverman and
Omri Weinstein},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {A Discrepancy Lower Bound for Information Complexity},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {459--470},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_39},
doi = {10.1007/978-3-642-32512-0\_39},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BravermanW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KarninLLSW12,
author = {Zohar Shay Karnin and
Edo Liberty and
Shachar Lovett and
Roy Schwartz and
Omri Weinstein},
editor = {Shie Mannor and
Nathan Srebro and
Robert C. Williamson},
title = {Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem},
booktitle = {{COLT} 2012 - The 25th Annual Conference on Learning Theory, June
25-27, 2012, Edinburgh, Scotland},
series = {{JMLR} Proceedings},
volume = {23},
pages = {2.1--2.17},
publisher = {JMLR.org},
year = {2012},
url = {http://proceedings.mlr.press/v23/karnin12/karnin12.pdf},
timestamp = {Wed, 23 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/KarninLLSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanGPW12,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
title = {From Information to Exact Communication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-171}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/171},
eprinttype = {ECCC},
eprint = {TR12-171},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanGPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanGPW12a,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
title = {Information lower bounds via self-reducibility},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-177}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/177},
eprinttype = {ECCC},
eprint = {TR12-177},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanGPW12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanRWY12,
author = {Mark Braverman and
Anup Rao and
Omri Weinstein and
Amir Yehudayoff},
title = {Direct Products in Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-143}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/143},
eprinttype = {ECCC},
eprint = {TR12-143},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanRWY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RonRSW11,
author = {Dana Ron and
Ronitt Rubinfeld and
Muli Safra and
Omri Weinstein},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {Approximating the Influence of Monotone Boolean Functions in {\textdollar}O({\textbackslash}sqrt\{n\}){\textdollar}
Query Complexity},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {664--675},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_56},
doi = {10.1007/978-3-642-22935-0\_56},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/RonRSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-5345,
author = {Dana Ron and
Ronitt Rubinfeld and
Muli Safra and
Omri Weinstein},
title = {Approximating the Influence of a monotone Boolean function in O({\textbackslash}sqrt\{n\})
query complexity},
journal = {CoRR},
volume = {abs/1101.5345},
year = {2011},
url = {http://arxiv.org/abs/1101.5345},
eprinttype = {arXiv},
eprint = {1101.5345},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-5345.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-1358,
author = {Edo Liberty and
Shachar Lovett and
Omri Weinstein},
title = {On the Furthest Hyperplane Problem and Maximal Margin Clustering},
journal = {CoRR},
volume = {abs/1107.1358},
year = {2011},
url = {http://arxiv.org/abs/1107.1358},
eprinttype = {arXiv},
eprint = {1107.1358},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-1358.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-2000,
author = {Mark Braverman and
Omri Weinstein},
title = {A discrepancy lower bound for information complexity},
journal = {CoRR},
volume = {abs/1112.2000},
year = {2011},
url = {http://arxiv.org/abs/1112.2000},
eprinttype = {arXiv},
eprint = {1112.2000},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-2000.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanW11,
author = {Mark Braverman and
Omri Weinstein},
title = {A discrepancy lower bound for information complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-164}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/164},
eprinttype = {ECCC},
eprint = {TR11-164},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-01-09 20:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
