Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Noam Nisan
@article{DBLP:journals/corr/abs-2401-11596, author = {Moshe Babaioff and Amitai Frey and Noam Nisan}, title = {Learning to Maximize Gains From Trade in Small Markets}, journal = {CoRR}, volume = {abs/2401.11596}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2401.11596}, doi = {10.48550/ARXIV.2401.11596}, eprinttype = {arXiv}, eprint = {2401.11596}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2401-11596.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/KolumbusLN23, author = {Yoav Kolumbus and Menahem Levy and Noam Nisan}, editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine}, title = {Asynchronous Proportional Response Dynamics: Convergence in Markets with Adversarial Scheduling}, booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023}, year = {2023}, url = {http://papers.nips.cc/paper\_files/paper/2023/hash/5049acb0d5d976130388f3e8edcae183-Abstract-Conference.html}, timestamp = {Fri, 01 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/KolumbusLN23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2307-04108, author = {Yoav Kolumbus and Menahem Levy and Noam Nisan}, title = {Asynchronous Proportional Response Dynamics in Markets with Adversarial Scheduling}, journal = {CoRR}, volume = {abs/2307.04108}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2307.04108}, doi = {10.48550/ARXIV.2307.04108}, eprinttype = {arXiv}, eprint = {2307.04108}, timestamp = {Mon, 24 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2307-04108.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2311-12731, author = {Noam Nisan}, title = {Serial Monopoly on Blockchains}, journal = {CoRR}, volume = {abs/2311.12731}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2311.12731}, doi = {10.48550/ARXIV.2311.12731}, eprinttype = {arXiv}, eprint = {2311.12731}, timestamp = {Wed, 29 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2311-12731.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/BabaioffGN22, author = {Moshe Babaioff and Yannai A. Gonczarowski and Noam Nisan}, title = {The menu-size complexity of revenue approximation}, journal = {Games Econ. Behav.}, volume = {134}, pages = {281--307}, year = {2022}, url = {https://doi.org/10.1016/j.geb.2021.03.001}, doi = {10.1016/J.GEB.2021.03.001}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/geb/BabaioffGN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/BranzeiN22, author = {Simina Br{\^{a}}nzei and Noam Nisan}, editor = {Sanmi Koyejo and S. Mohamed and A. Agarwal and Danielle Belgrave and K. Cho and A. Oh}, title = {The Query Complexity of Cake Cutting}, 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/f7a7bb369e48f10e85fce85b67d8c516-Abstract-Conference.html}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/BranzeiN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/KolumbusN22, author = {Yoav Kolumbus and Noam Nisan}, editor = {Sanmi Koyejo and S. Mohamed and A. Agarwal and Danielle Belgrave and K. Cho and A. Oh}, title = {How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agents}, 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/b39fcf2e88dad4c38386b3af6edf88c7-Abstract-Conference.html}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/KolumbusN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/GilboaN22, author = {Matan Gilboa and Noam Nisan}, editor = {Panagiotis Kanellopoulos and Maria Kyropoulou and Alexandros A. Voudouris}, title = {Complexity of Public Goods Games on Graphs}, booktitle = {Algorithmic Game Theory - 15th International Symposium, {SAGT} 2022, Colchester, UK, September 12-15, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13584}, pages = {151--168}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15714-1\_9}, doi = {10.1007/978-3-031-15714-1\_9}, timestamp = {Mon, 19 Sep 2022 19:04:18 +0200}, biburl = {https://dblp.org/rec/conf/sagt/GilboaN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/www/KolumbusN22, author = {Yoav Kolumbus and Noam Nisan}, editor = {Fr{\'{e}}d{\'{e}}rique Laforest and Rapha{\"{e}}l Troncy and Elena Simperl and Deepak Agarwal and Aristides Gionis and Ivan Herman and Lionel M{\'{e}}dini}, title = {Auctions between Regret-Minimizing Agents}, booktitle = {{WWW} '22: The {ACM} Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022}, pages = {100--111}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3485447.3512055}, doi = {10.1145/3485447.3512055}, timestamp = {Thu, 23 Jun 2022 19:54:34 +0200}, biburl = {https://dblp.org/rec/conf/www/KolumbusN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-02344, author = {Ron Kupfer and Noam Nisan}, title = {Finding a Hidden Edge}, journal = {CoRR}, volume = {abs/2207.02344}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.02344}, doi = {10.48550/ARXIV.2207.02344}, eprinttype = {arXiv}, eprint = {2207.02344}, timestamp = {Wed, 13 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-02344.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-04238, author = {Matan Gilboa and Noam Nisan}, title = {Complexity of Public Goods Games on Graphs}, journal = {CoRR}, volume = {abs/2207.04238}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.04238}, doi = {10.48550/ARXIV.2207.04238}, eprinttype = {arXiv}, eprint = {2207.04238}, timestamp = {Wed, 13 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-04238.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2210-17150, author = {Ran Ben Moshe and Sergiu Hart and Noam Nisan}, title = {Monotonic Mechanisms for Selling Multiple Goods}, journal = {CoRR}, volume = {abs/2210.17150}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.17150}, doi = {10.48550/ARXIV.2210.17150}, eprinttype = {arXiv}, eprint = {2210.17150}, timestamp = {Thu, 03 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-17150.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mor/BabaioffNT21, author = {Moshe Babaioff and Noam Nisan and Inbal Talgam{-}Cohen}, title = {Competitive Equilibrium with Indivisible Goods and Generic Budgets}, journal = {Math. Oper. Res.}, volume = {46}, number = {1}, pages = {382--403}, year = {2021}, url = {https://doi.org/10.1287/moor.2020.1062}, doi = {10.1287/MOOR.2020.1062}, timestamp = {Tue, 23 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mor/BabaioffNT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Nisan21, author = {Noam Nisan}, editor = {D{\'{a}}niel Marx}, title = {The Demand Query Model for Bipartite Matching}, booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2021, Virtual Conference, January 10 - 13, 2021}, pages = {592--599}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976465.36}, doi = {10.1137/1.9781611976465.36}, timestamp = {Thu, 15 Jul 2021 13:48:55 +0200}, biburl = {https://dblp.org/rec/conf/soda/Nisan21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BeniaminiN21, author = {Gal Beniamini and Noam Nisan}, editor = {Samir Khuller and Virginia Vassilevska Williams}, title = {Bipartite perfect matching as a real polynomial}, booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021}, pages = {1118--1131}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3406325.3451002}, doi = {10.1145/3406325.3451002}, timestamp = {Tue, 22 Jun 2021 19:47:11 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BeniaminiN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/BabaioffMN21, author = {Moshe Babaioff and Ruty Mundel and Noam Nisan}, editor = {Michal Feldman and Hu Fu and Inbal Talgam{-}Cohen}, title = {Beyond Pigouvian Taxes: {A} Worst Case Analysis}, booktitle = {Web and Internet Economics - 17th International Conference, {WINE} 2021, Potsdam, Germany, December 14-17, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13112}, pages = {226--243}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-94676-0\_13}, doi = {10.1007/978-3-030-94676-0\_13}, timestamp = {Mon, 30 Oct 2023 12:09:00 +0100}, biburl = {https://dblp.org/rec/conf/wine/BabaioffMN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-12023, author = {Moshe Babaioff and Ruty Mundel and Noam Nisan}, title = {Beyond Pigouvian Taxes: {A} Worst Case Analysis}, journal = {CoRR}, volume = {abs/2107.12023}, year = {2021}, url = {https://arxiv.org/abs/2107.12023}, eprinttype = {arXiv}, eprint = {2107.12023}, timestamp = {Thu, 29 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-12023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2110-11855, author = {Yoav Kolumbus and Noam Nisan}, title = {Auctions Between Regret-Minimizing Agents}, journal = {CoRR}, volume = {abs/2110.11855}, year = {2021}, url = {https://arxiv.org/abs/2110.11855}, eprinttype = {arXiv}, eprint = {2110.11855}, timestamp = {Thu, 28 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2110-11855.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2112-07640, author = {Yoav Kolumbus and Noam Nisan}, title = {How and Why to Manipulate Your Own Agent}, journal = {CoRR}, volume = {abs/2112.07640}, year = {2021}, url = {https://arxiv.org/abs/2112.07640}, eprinttype = {arXiv}, eprint = {2112.07640}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2112-07640.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/FeldmanMNOT20, author = {Michal Feldman and Yishay Mansour and Noam Nisan and Sigal Oren and Moshe Tennenholtz}, title = {Designing Committees for Mitigating Biases}, booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI} 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA, February 7-12, 2020}, pages = {1942--1949}, publisher = {{AAAI} Press}, year = {2020}, url = {https://doi.org/10.1609/aaai.v34i02.5564}, doi = {10.1609/AAAI.V34I02.5564}, timestamp = {Mon, 04 Sep 2023 12:29:24 +0200}, biburl = {https://dblp.org/rec/conf/aaai/FeldmanMNOT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2001-07642, author = {Gal Beniamini and Noam Nisan}, title = {Bipartite Perfect Matching as a Real Polynomial}, journal = {CoRR}, volume = {abs/2001.07642}, year = {2020}, url = {https://arxiv.org/abs/2001.07642}, eprinttype = {arXiv}, eprint = {2001.07642}, timestamp = {Fri, 24 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-07642.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-06291, author = {Yoav Kolumbus and Noam Nisan}, title = {On the Effectiveness of Tracking and Testing in {SEIR} Models}, journal = {CoRR}, volume = {abs/2007.06291}, year = {2020}, url = {https://arxiv.org/abs/2007.06291}, eprinttype = {arXiv}, eprint = {2007.06291}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-06291.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/DobzinskiNO19, author = {Shahar Dobzinski and Noam Nisan and Sigal Oren}, title = {Economic efficiency requires interaction}, journal = {Games Econ. Behav.}, volume = {118}, pages = {589--608}, year = {2019}, url = {https://doi.org/10.1016/j.geb.2018.02.010}, doi = {10.1016/J.GEB.2018.02.010}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/DobzinskiNO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/GonczarowskiNOR19, author = {Yannai A. Gonczarowski and Noam Nisan and Rafail Ostrovsky and Will Rosenbaum}, title = {A stable marriage requires communication}, journal = {Games Econ. Behav.}, volume = {118}, pages = {626--647}, year = {2019}, url = {https://doi.org/10.1016/j.geb.2018.10.013}, doi = {10.1016/J.GEB.2018.10.013}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/geb/GonczarowskiNOR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jet/HartN19, author = {Sergiu Hart and Noam Nisan}, title = {Selling multiple correlated goods: Revenue maximization and menu-size complexity}, journal = {J. Econ. Theory}, volume = {183}, pages = {991--1029}, year = {2019}, url = {https://doi.org/10.1016/j.jet.2019.07.006}, doi = {10.1016/J.JET.2019.07.006}, timestamp = {Mon, 24 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jet/HartN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ec/GonczarowskiNKR19, author = {Yannai A. Gonczarowski and Noam Nisan and Lior Kovalio and Assaf Romm}, editor = {Anna R. Karlin and Nicole Immorlica and Ramesh Johari}, title = {Matching for the Israeli: Handling Rich Diversity Requirements}, booktitle = {Proceedings of the 2019 {ACM} Conference on Economics and Computation, {EC} 2019, Phoenix, AZ, USA, June 24-28, 2019}, pages = {321}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3328526.3329620}, doi = {10.1145/3328526.3329620}, timestamp = {Thu, 04 Apr 2024 16:56:10 +0200}, biburl = {https://dblp.org/rec/conf/ec/GonczarowskiNKR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ec/BranzeiN19, author = {Simina Br{\^{a}}nzei and Noam Nisan}, editor = {Anna R. Karlin and Nicole Immorlica and Ramesh Johari}, title = {Communication Complexity of Cake Cutting}, booktitle = {Proceedings of the 2019 {ACM} Conference on Economics and Computation, {EC} 2019, Phoenix, AZ, USA, June 24-28, 2019}, pages = {525}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3328526.3329644}, doi = {10.1145/3328526.3329644}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ec/BranzeiN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fat/BabaioffNT19, author = {Moshe Babaioff and Noam Nisan and Inbal Talgam{-}Cohen}, editor = {danah boyd and Jamie H. Morgenstern}, title = {Fair Allocation through Competitive Equilibrium from Generic Incomes}, booktitle = {Proceedings of the Conference on Fairness, Accountability, and Transparency, FAT* 2019, Atlanta, GA, USA, January 29-31, 2019}, pages = {180}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3287560.3287582}, doi = {10.1145/3287560.3287582}, timestamp = {Fri, 26 Mar 2021 16:46:37 +0100}, biburl = {https://dblp.org/rec/conf/fat/BabaioffNT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BabichenkoDN19, author = {Yakov Babichenko and Shahar Dobzinski and Noam Nisan}, editor = {Moses Charikar and Edith Cohen}, title = {The communication complexity of local search}, booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019}, pages = {650--661}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3313276.3316354}, doi = {10.1145/3313276.3316354}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BabichenkoDN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1905-00364, author = {Yannai A. Gonczarowski and Lior Kovalio and Noam Nisan and Assaf Romm}, title = {Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements}, journal = {CoRR}, volume = {abs/1905.00364}, year = {2019}, url = {http://arxiv.org/abs/1905.00364}, eprinttype = {arXiv}, eprint = {1905.00364}, timestamp = {Mon, 27 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1905-00364.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-04213, author = {Noam Nisan}, title = {The Demand Query Model for Bipartite Matching}, journal = {CoRR}, volume = {abs/1906.04213}, year = {2019}, url = {http://arxiv.org/abs/1906.04213}, eprinttype = {arXiv}, eprint = {1906.04213}, timestamp = {Fri, 14 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-04213.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1911-09992, author = {Moshe Babaioff and Noam Nisan and Inbal Talgam{-}Cohen}, title = {Competitive Equilibrium with Generic Budgets: Beyond Additive}, journal = {CoRR}, volume = {abs/1911.09992}, year = {2019}, url = {http://arxiv.org/abs/1911.09992}, eprinttype = {arXiv}, eprint = {1911.09992}, timestamp = {Tue, 03 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1911-09992.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/HartN18, author = {Sergiu Hart and Noam Nisan}, title = {The query complexity of correlated equilibria}, journal = {Games Econ. Behav.}, volume = {108}, pages = {401--410}, year = {2018}, url = {https://doi.org/10.1016/j.geb.2016.11.003}, doi = {10.1016/J.GEB.2016.11.003}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/geb/HartN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/GopalanNR18, author = {Parikshit Gopalan and Noam Nisan and Tim Roughgarden}, title = {Public Projects, Boolean Functions, and the Borders of Border's Theorem}, journal = {{ACM} Trans. Economics and Comput.}, volume = {6}, number = {3-4}, pages = {18:1--18:21}, year = {2018}, url = {https://doi.org/10.1145/3274645}, doi = {10.1145/3274645}, timestamp = {Fri, 10 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/teco/GopalanNR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/BranzeiMN18, author = {Simina Br{\^{a}}nzei and Ruta Mehta and Noam Nisan}, editor = {Samy Bengio and Hanna M. Wallach and Hugo Larochelle and Kristen Grauman and Nicol{\`{o}} Cesa{-}Bianchi and Roman Garnett}, title = {Universal Growth in Production Economies}, booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montr{\'{e}}al, Canada}, pages = {1975}, year = {2018}, url = {https://proceedings.neurips.cc/paper/2018/hash/692f93be8c7a41525c0baf2076aecfb4-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/BranzeiMN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/BabaioffNR18, author = {Moshe Babaioff and Noam Nisan and Aviad Rubinstein}, editor = {{\'{E}}va Tardos and Edith Elkind and Rakesh Vohra}, title = {Optimal Deterministic Mechanisms for an Additive Buyer}, booktitle = {Proceedings of the 2018 {ACM} Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018}, pages = {429}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3219166.3219188}, doi = {10.1145/3219166.3219188}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/BabaioffNR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1802-07385, author = {Simina Br{\^{a}}nzei and Ruta Mehta and Noam Nisan}, title = {Universal Growth in Production Economies}, journal = {CoRR}, volume = {abs/1802.07385}, year = {2018}, url = {http://arxiv.org/abs/1802.07385}, eprinttype = {arXiv}, eprint = {1802.07385}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1802-07385.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-02676, author = {Yakov Babichenko and Shahar Dobzinski and Noam Nisan}, title = {The Communication Complexity of Local Search}, journal = {CoRR}, volume = {abs/1804.02676}, year = {2018}, url = {http://arxiv.org/abs/1804.02676}, eprinttype = {arXiv}, eprint = {1804.02676}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-02676.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-06867, author = {Moshe Babaioff and Noam Nisan and Aviad Rubinstein}, title = {Optimal Deterministic Mechanisms for an Additive Buyer}, journal = {CoRR}, volume = {abs/1804.06867}, year = {2018}, url = {http://arxiv.org/abs/1804.06867}, eprinttype = {arXiv}, eprint = {1804.06867}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-06867.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jet/HartN17, author = {Sergiu Hart and Noam Nisan}, title = {Approximate revenue maximization with multiple items}, journal = {J. Econ. Theory}, volume = {172}, pages = {313--347}, year = {2017}, url = {https://doi.org/10.1016/j.jet.2017.09.001}, doi = {10.1016/J.JET.2017.09.001}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jet/HartN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BabaioffBN17, author = {Moshe Babaioff and Liad Blumrosen and Noam Nisan}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, title = {Selling Complementary Goods: Dynamics, Efficiency and Revenue}, booktitle = {44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {80}, pages = {134:1--134:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.134}, doi = {10.4230/LIPICS.ICALP.2017.134}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BabaioffBN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/NisanN17, author = {Noam Nisan and Gali Noti}, editor = {Constantinos Daskalakis and Moshe Babaioff and Herv{\'{e}} Moulin}, title = {A "Quantal Regret" Method for Structural Econometrics in Repeated Games}, booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation, {EC} '17, Cambridge, MA, USA, June 26-30, 2017}, pages = {123}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3033274.3085111}, doi = {10.1145/3033274.3085111}, timestamp = {Mon, 30 Jan 2023 21:01:44 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/NisanN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GonczarowskiN17, author = {Yannai A. Gonczarowski and Noam Nisan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Efficient empirical revenue maximization in single-parameter auction environments}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {856--868}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055427}, doi = {10.1145/3055399.3055427}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GonczarowskiN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BabaioffGN17, author = {Moshe Babaioff and Yannai A. Gonczarowski and Noam Nisan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {The menu-size complexity of revenue approximation}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {869--877}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055426}, doi = {10.1145/3055399.3055426}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BabaioffGN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/www/NisanN17, author = {Noam Nisan and Gali Noti}, editor = {Rick Barrett and Rick Cummings and Eugene Agichtein and Evgeniy Gabrilovich}, title = {An Experimental Evaluation of Regret-Based Econometrics}, booktitle = {Proceedings of the 26th International Conference on World Wide Web, {WWW} 2017, Perth, Australia, April 3-7, 2017}, pages = {73--81}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3038912.3052621}, doi = {10.1145/3038912.3052621}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/www/NisanN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/www/BabaioffMNNCGMR17, author = {Moshe Babaioff and Yishay Mansour and Noam Nisan and Gali Noti and Carlo Curino and Nar Ganapathy and Ishai Menache and Omer Reingold and Moshe Tennenholtz and Erez Timnat}, editor = {Rick Barrett and Rick Cummings and Eugene Agichtein and Evgeniy Gabrilovich}, title = {{ERA:} {A} Framework for Economic Resource Allocation for the Cloud}, booktitle = {Proceedings of the 26th International Conference on World Wide Web Companion, Perth, Australia, April 3-7, 2017}, pages = {635--642}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3041021.3054186}, doi = {10.1145/3041021.3054186}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/www/BabaioffMNNCGMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/NisanN17, author = {Noam Nisan and Gali Noti}, title = {A "Quantal Regret" Method for Structural Econometrics in Repeated Games}, journal = {CoRR}, volume = {abs/1702.04254}, year = {2017}, url = {http://arxiv.org/abs/1702.04254}, eprinttype = {arXiv}, eprint = {1702.04254}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/NisanN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabaioffMNNCGMR17, author = {Moshe Babaioff and Yishay Mansour and Noam Nisan and Gali Noti and Carlo Curino and Nar Ganapathy and Ishai Menache and Omer Reingold and Moshe Tennenholtz and Erez Timnat}, title = {{ERA:} {A} Framework for Economic Resource Allocation for the Cloud}, journal = {CoRR}, volume = {abs/1702.07311}, year = {2017}, url = {http://arxiv.org/abs/1702.07311}, eprinttype = {arXiv}, eprint = {1702.07311}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabaioffMNNCGMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabaioffNT17, author = {Moshe Babaioff and Noam Nisan and Inbal Talgam{-}Cohen}, title = {Competitive Equilibria with Indivisible Goods and Generic Budgets}, journal = {CoRR}, volume = {abs/1703.08150}, year = {2017}, url = {http://arxiv.org/abs/1703.08150}, eprinttype = {arXiv}, eprint = {1703.08150}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabaioffNT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BranzeiN17, author = {Simina Br{\^{a}}nzei and Noam Nisan}, title = {The Query Complexity of Cake Cutting}, journal = {CoRR}, volume = {abs/1705.02946}, year = {2017}, url = {http://arxiv.org/abs/1705.02946}, eprinttype = {arXiv}, eprint = {1705.02946}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BranzeiN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabaioffBN17, author = {Moshe Babaioff and Liad Blumrosen and Noam Nisan}, title = {Selling Complementary Goods: Dynamics, Efficiency and Revenue}, journal = {CoRR}, volume = {abs/1706.00219}, year = {2017}, url = {http://arxiv.org/abs/1706.00219}, eprinttype = {arXiv}, eprint = {1706.00219}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabaioffBN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1709-09876, author = {Simina Br{\^{a}}nzei and Noam Nisan}, title = {Communication Complexity of Cake Cutting}, journal = {CoRR}, volume = {abs/1709.09876}, year = {2017}, url = {http://arxiv.org/abs/1709.09876}, eprinttype = {arXiv}, eprint = {1709.09876}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1709-09876.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/HassidimKMN16, author = {Avinatan Hassidim and Haim Kaplan and Yishay Mansour and Noam Nisan}, title = {The {AND-OR} Game}, journal = {{ACM} Trans. Economics and Comput.}, volume = {5}, number = {1}, pages = {1:1--1:22}, year = {2016}, url = {http://dl.acm.org/citation.cfm?id=2897186}, timestamp = {Tue, 03 Jan 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/teco/HassidimKMN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Nisan16, author = {Noam Nisan}, editor = {Irit Dinur}, title = {Knuth Prize Lecture: Complexity of Communication in Markets}, booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS} 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, {USA}}, pages = {385}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/FOCS.2016.97}, doi = {10.1109/FOCS.2016.97}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Nisan16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BabaioffBN16, author = {Moshe Babaioff and Liad Blumrosen and Noam Nisan}, editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi}, title = {Networks of Complements}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy}, series = {LIPIcs}, volume = {55}, pages = {140:1--140:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.140}, doi = {10.4230/LIPICS.ICALP.2016.140}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BabaioffBN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GopalanNSTW16, author = {Parikshit Gopalan and Noam Nisan and Rocco A. Servedio and Kunal Talwar and Avi Wigderson}, editor = {Madhu Sudan}, title = {Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions}, booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016}, pages = {59--70}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2840728.2840738}, doi = {10.1145/2840728.2840738}, timestamp = {Tue, 14 Jun 2022 13:12:41 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GopalanNSTW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/FeldmanLN16, author = {Michal Feldman and Brendan Lucier and Noam Nisan}, editor = {Yang Cai and Adrian Vetta}, title = {Correlated and Coarse Equilibria of Single-Item Auctions}, booktitle = {Web and Internet Economics - 12th International Conference, {WINE} 2016, Montreal, Canada, December 11-14, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10123}, pages = {131--144}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-54110-4\_10}, doi = {10.1007/978-3-662-54110-4\_10}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wine/FeldmanLN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FeldmanLN16, author = {Michal Feldman and Brendan Lucier and Noam Nisan}, title = {Correlated- and Coarse- equilibria of Single-item auctions}, journal = {CoRR}, volume = {abs/1601.07702}, year = {2016}, url = {http://arxiv.org/abs/1601.07702}, eprinttype = {arXiv}, eprint = {1601.07702}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FeldmanLN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabaioffGN16, author = {Moshe Babaioff and Yannai A. Gonczarowski and Noam Nisan}, title = {The Menu-Size Complexity of Revenue Approximation}, journal = {CoRR}, volume = {abs/1604.06580}, year = {2016}, url = {http://arxiv.org/abs/1604.06580}, eprinttype = {arXiv}, eprint = {1604.06580}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabaioffGN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabaioffBN16, author = {Moshe Babaioff and Liad Blumrosen and Noam Nisan}, title = {Networks of Complements}, journal = {CoRR}, volume = {abs/1605.00136}, year = {2016}, url = {http://arxiv.org/abs/1605.00136}, eprinttype = {arXiv}, eprint = {1605.00136}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabaioffBN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/NisanN16, author = {Noam Nisan and Gali Noti}, title = {An Experimental Evaluation of Regret-Based Econometrics}, journal = {CoRR}, volume = {abs/1605.03838}, year = {2016}, url = {http://arxiv.org/abs/1605.03838}, eprinttype = {arXiv}, eprint = {1605.03838}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/NisanN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GonczarowskiN16, author = {Yannai A. Gonczarowski and Noam Nisan}, title = {Efficient Empirical Revenue Maximization in Single-Parameter Auction Environments}, journal = {CoRR}, volume = {abs/1610.09976}, year = {2016}, url = {http://arxiv.org/abs/1610.09976}, eprinttype = {arXiv}, eprint = {1610.09976}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GonczarowskiN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jet/DobzinskiN15, author = {Shahar Dobzinski and Noam Nisan}, title = {Multi-unit auctions: Beyond Roberts}, journal = {J. Econ. Theory}, volume = {156}, pages = {14--44}, year = {2015}, url = {https://doi.org/10.1016/j.jet.2014.04.006}, doi = {10.1016/J.JET.2014.04.006}, timestamp = {Mon, 24 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jet/DobzinskiN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jet/LaviN15, author = {Ron Lavi and Noam Nisan}, title = {Online ascending auctions for gradually expiring items}, journal = {J. Econ. Theory}, volume = {156}, pages = {45--76}, year = {2015}, url = {https://doi.org/10.1016/j.jet.2014.07.010}, doi = {10.1016/J.JET.2014.07.010}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jet/LaviN15.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/sigecom/GopalanNR15, author = {Parikshit Gopalan and Noam Nisan and Tim Roughgarden}, editor = {Tim Roughgarden and Michal Feldman and Michael Schwarz}, title = {Public Projects, Boolean Functions, and the Borders of Border's Theorem}, booktitle = {Proceedings of the Sixteenth {ACM} Conference on Economics and Computation, {EC} '15, Portland, OR, USA, June 15-19, 2015}, pages = {395}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2764468.2764538}, doi = {10.1145/2764468.2764538}, timestamp = {Fri, 02 Jun 2023 16:54:30 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/GopalanNR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GonczarowskiNOR15, author = {Yannai A. Gonczarowski and Noam Nisan and Rafail Ostrovsky and Will Rosenbaum}, editor = {Piotr Indyk}, title = {A Stable Marriage Requires Communication}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015}, pages = {1003--1017}, publisher = {{SIAM}}, year = {2015}, url = {https://doi.org/10.1137/1.9781611973730.68}, doi = {10.1137/1.9781611973730.68}, timestamp = {Tue, 02 Feb 2021 17:07:30 +0100}, biburl = {https://dblp.org/rec/conf/soda/GonczarowskiNOR15.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/GopalanNR15, author = {Parikshit Gopalan and Noam Nisan and Tim Roughgarden}, title = {Public projects, Boolean functions and the borders of Border's theorem}, journal = {CoRR}, volume = {abs/1504.07687}, year = {2015}, url = {http://arxiv.org/abs/1504.07687}, eprinttype = {arXiv}, eprint = {1504.07687}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GopalanNR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GopalanNSTW15, author = {Parikshit Gopalan and Noam Nisan and Rocco A. Servedio and Kunal Talwar and Avi Wigderson}, title = {Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions}, journal = {CoRR}, volume = {abs/1508.02420}, year = {2015}, url = {http://arxiv.org/abs/1508.02420}, eprinttype = {arXiv}, eprint = {1508.02420}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GopalanNSTW15.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/GopalanNSTW15, author = {Parikshit Gopalan and Noam Nisan and Rocco A. Servedio and Kunal Talwar and Avi Wigderson}, title = {Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-131}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/131}, eprinttype = {ECCC}, eprint = {TR15-131}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GopalanNSTW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/BabaioffLNL14, author = {Moshe Babaioff and Brendan Lucier and Noam Nisan and Renato Paes Leme}, editor = {Moshe Babaioff and Vincent Conitzer and David A. Easley}, title = {On the efficiency of the walrasian mechanism}, booktitle = {{ACM} Conference on Economics and Computation, {EC} '14, Stanford , CA, USA, June 8-12, 2014}, pages = {783--800}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2600057.2602850}, doi = {10.1145/2600057.2602850}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/BabaioffLNL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DobzinskiNO14, author = {Shahar Dobzinski and Noam Nisan and Sigal Oren}, editor = {David B. Shmoys}, title = {Economic efficiency requires interaction}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {233--242}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591815}, doi = {10.1145/2591796.2591815}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DobzinskiNO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/DughmiHN14, author = {Shaddin Dughmi and Li Han and Noam Nisan}, editor = {Tie{-}Yan Liu and Qi Qi and Yinyu Ye}, title = {Sampling and Representation Complexity of Revenue Maximization}, booktitle = {Web and Internet Economics - 10th International Conference, {WINE} 2014, Beijing, China, December 14-17, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8877}, pages = {277--291}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13129-0\_22}, doi = {10.1007/978-3-319-13129-0\_22}, timestamp = {Sun, 18 Dec 2022 19:02:44 +0100}, biburl = {https://dblp.org/rec/conf/wine/DughmiHN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/www/NotiNY14, author = {Gali Noti and Noam Nisan and Ilan Yaniv}, editor = {Chin{-}Wan Chung and Andrei Z. Broder and Kyuseok Shim and Torsten Suel}, title = {An experimental evaluation of bidders' behavior in ad auctions}, booktitle = {23rd International World Wide Web Conference, {WWW} '14, Seoul, Republic of Korea, April 7-11, 2014}, pages = {619--630}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2566486.2568004}, doi = {10.1145/2566486.2568004}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/www/NotiNY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/www/BabaioffNL14, author = {Moshe Babaioff and Noam Nisan and Renato Paes Leme}, editor = {Chin{-}Wan Chung and Andrei Z. Broder and Kyuseok Shim and Torsten Suel}, title = {Price competition in online combinatorial markets}, booktitle = {23rd International World Wide Web Conference, {WWW} '14, Seoul, Republic of Korea, April 7-11, 2014}, pages = {711--722}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2566486.2568016}, doi = {10.1145/2566486.2568016}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/www/BabaioffNL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabaioffNL14, author = {Moshe Babaioff and Noam Nisan and Renato Paes Leme}, title = {Price Competition in Online Combinatorial Markets}, journal = {CoRR}, volume = {abs/1401.1559}, year = {2014}, url = {http://arxiv.org/abs/1401.1559}, eprinttype = {arXiv}, eprint = {1401.1559}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabaioffNL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DobzinskiN14, author = {Shahar Dobzinski and Noam Nisan}, title = {Mechanisms for Multi-Unit Auctions}, journal = {CoRR}, volume = {abs/1401.3834}, year = {2014}, url = {http://arxiv.org/abs/1401.3834}, eprinttype = {arXiv}, eprint = {1401.3834}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DobzinskiN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabaioffFN14, author = {Moshe Babaioff and Michal Feldman and Noam Nisan}, title = {Mixed Strategies in Combinatorial Agency}, journal = {CoRR}, volume = {abs/1401.3837}, year = {2014}, url = {http://arxiv.org/abs/1401.3837}, eprinttype = {arXiv}, eprint = {1401.3837}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabaioffFN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DughmiHN14, author = {Shaddin Dughmi and Li Han and Noam Nisan}, title = {Sampling and Representation Complexity of Revenue Maximization}, journal = {CoRR}, volume = {abs/1402.4535}, year = {2014}, url = {http://arxiv.org/abs/1402.4535}, eprinttype = {arXiv}, eprint = {1402.4535}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DughmiHN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GonczarowskiNOR14, author = {Yannai A. Gonczarowski and Noam Nisan and Rafail Ostrovsky and Will Rosenbaum}, title = {A Stable Marriage Requires Communication}, journal = {CoRR}, volume = {abs/1405.7709}, year = {2014}, url = {http://arxiv.org/abs/1405.7709}, eprinttype = {arXiv}, eprint = {1405.7709}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GonczarowskiNOR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/FeldmanN13, author = {Michal Feldman and Noam Nisan}, title = {Introduction to the Special Issue on Algorithmic Game Theory}, journal = {{ACM} Trans. Economics and Comput.}, volume = {1}, number = {2}, pages = {5:1}, year = {2013}, url = {https://doi.org/10.1145/2465769.2465770}, doi = {10.1145/2465769.2465770}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/teco/FeldmanN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/BabaioffLN13, author = {Moshe Babaioff and Brendan Lucier and Noam Nisan}, editor = {Michael J. Kearns and R. Preston McAfee and {\'{E}}va Tardos}, title = {Bertrand networks}, booktitle = {Proceedings of the fourteenth {ACM} Conference on Electronic Commerce, {EC} 2013, Philadelphia, PA, USA, June 16-20, 2013}, pages = {33--34}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2492002.2482564}, doi = {10.1145/2492002.2482564}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/BabaioffLN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/HartN13, author = {Sergiu Hart and Noam Nisan}, editor = {Michael J. Kearns and R. Preston McAfee and {\'{E}}va Tardos}, title = {The menu-size complexity of auctions}, booktitle = {Proceedings of the fourteenth {ACM} Conference on Electronic Commerce, {EC} 2013, Philadelphia, PA, USA, June 16-20, 2013}, pages = {565--566}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2492002.2482544}, doi = {10.1145/2492002.2482544}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/HartN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-6116, author = {Sergiu Hart and Noam Nisan}, title = {The Menu-Size Complexity of Auctions}, journal = {CoRR}, volume = {abs/1304.6116}, year = {2013}, url = {http://arxiv.org/abs/1304.6116}, eprinttype = {arXiv}, eprint = {1304.6116}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-6116.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-6806, author = {Moshe Babaioff and Brendan Lucier and Noam Nisan}, title = {Bertrand Networks}, journal = {CoRR}, volume = {abs/1304.6806}, year = {2013}, url = {http://arxiv.org/abs/1304.6806}, eprinttype = {arXiv}, eprint = {1304.6806}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-6806.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1305-4874, author = {Sergiu Hart and Noam Nisan}, title = {The Query Complexity of Correlated Equilibria}, journal = {CoRR}, volume = {abs/1305.4874}, year = {2013}, url = {http://arxiv.org/abs/1305.4874}, eprinttype = {arXiv}, eprint = {1305.4874}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1305-4874.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabaioffLNL13, author = {Moshe Babaioff and Brendan Lucier and Noam Nisan and Renato Paes Leme}, title = {On the Efficiency of the Walrasian Mechanism}, journal = {CoRR}, volume = {abs/1311.0924}, year = {2013}, url = {http://arxiv.org/abs/1311.0924}, eprinttype = {arXiv}, eprint = {1311.0924}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabaioffLNL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DobzinskiNO13, author = {Shahar Dobzinski and Noam Nisan and Sigal Oren}, title = {Economic Efficiency Requires Interaction}, journal = {CoRR}, volume = {abs/1311.4721}, year = {2013}, url = {http://arxiv.org/abs/1311.4721}, eprinttype = {arXiv}, eprint = {1311.4721}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DobzinskiNO13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/MansourMNV13, author = {Yishay Mansour and Benny Moldovanu and Noam Nisan and Berthold V{\"{o}}cking}, title = {Electronic Markets and Auctions (Dagstuhl Seminar 13461)}, journal = {Dagstuhl Reports}, volume = {3}, number = {11}, pages = {58--78}, year = {2013}, url = {https://doi.org/10.4230/DagRep.3.11.58}, doi = {10.4230/DAGREP.3.11.58}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/MansourMNV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/DobzinskiLN12, author = {Shahar Dobzinski and Ron Lavi and Noam Nisan}, title = {Multi-unit auctions with budget limits}, journal = {Games Econ. Behav.}, volume = {74}, number = {2}, pages = {486--503}, year = {2012}, url = {https://doi.org/10.1016/j.geb.2011.08.003}, doi = {10.1016/J.GEB.2011.08.003}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/DobzinskiLN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DobzinskiNS12, author = {Shahar Dobzinski and Noam Nisan and Michael Schapira}, title = {Truthful randomized mechanisms for combinatorial auctions}, journal = {J. Comput. Syst. Sci.}, volume = {78}, number = {1}, pages = {15--25}, year = {2012}, url = {https://doi.org/10.1016/j.jcss.2011.02.010}, doi = {10.1016/J.JCSS.2011.02.010}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/DobzinskiNS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jet/BabaioffFNW12, author = {Moshe Babaioff and Michal Feldman and Noam Nisan and Eyal Winter}, title = {Combinatorial agency}, journal = {J. Econ. Theory}, volume = {147}, number = {3}, pages = {999--1034}, year = {2012}, url = {https://doi.org/10.1016/j.jet.2012.01.010}, doi = {10.1016/J.JET.2012.01.010}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jet/BabaioffFNW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aamas/GutmanN12, author = {Avital Gutman and Noam Nisan}, editor = {Wiebe van der Hoek and Lin Padgham and Vincent Conitzer and Michael Winikoff}, title = {Fair allocation without trade}, booktitle = {International Conference on Autonomous Agents and Multiagent Systems, {AAMAS} 2012, Valencia, Spain, June 4-8, 2012 {(3} Volumes)}, pages = {719--728}, publisher = {{IFAAMAS}}, year = {2012}, url = {http://dl.acm.org/citation.cfm?id=2343799}, timestamp = {Thu, 19 Mar 2015 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/aamas/GutmanN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/HartN12, author = {Sergiu Hart and Noam Nisan}, editor = {Boi Faltings and Kevin Leyton{-}Brown and Panos Ipeirotis}, title = {Approximate revenue maximization with multiple items}, booktitle = {Proceedings of the 13th {ACM} Conference on Electronic Commerce, {EC} 2012, Valencia, Spain, June 4-8, 2012}, pages = {656}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2229012.2229061}, doi = {10.1145/2229012.2229061}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/HartN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BadanidiyuruDFKNR12, author = {Ashwinkumar Badanidiyuru and Shahar Dobzinski and Hu Fu and Robert Kleinberg and Noam Nisan and Tim Roughgarden}, editor = {Yuval Rabani}, title = {Sketching valuation functions}, booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012}, pages = {1025--1035}, publisher = {{SIAM}}, year = {2012}, url = {https://doi.org/10.1137/1.9781611973099.81}, doi = {10.1137/1.9781611973099.81}, timestamp = {Mon, 30 Oct 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BadanidiyuruDFKNR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/MayaN12, author = {Avishay Maya and Noam Nisan}, editor = {Paul W. Goldberg}, title = {Incentive Compatible Two Player Cake Cutting}, booktitle = {Internet and Network Economics - 8th International Workshop, {WINE} 2012, Liverpool, UK, December 10-12, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7695}, pages = {170--183}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35311-6\_13}, doi = {10.1007/978-3-642-35311-6\_13}, timestamp = {Tue, 14 May 2019 10:00:36 +0200}, biburl = {https://dblp.org/rec/conf/wine/MayaN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/HassidimKMN12, author = {Avinatan Hassidim and Haim Kaplan and Yishay Mansour and Noam Nisan}, editor = {Paul W. Goldberg}, title = {The {AND-OR} Game: Equilibrium Characterization - (Working Paper)}, booktitle = {Internet and Network Economics - 8th International Workshop, {WINE} 2012, Liverpool, UK, December 10-12, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7695}, pages = {561}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35311-6\_49}, doi = {10.1007/978-3-642-35311-6\_49}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wine/HassidimKMN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-0535, author = {Yishay Mansour and S. Muthukrishnan and Noam Nisan}, title = {Doubleclick Ad Exchange Auction}, journal = {CoRR}, volume = {abs/1204.0535}, year = {2012}, url = {http://arxiv.org/abs/1204.0535}, eprinttype = {arXiv}, eprint = {1204.0535}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-0535.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-1846, author = {Sergiu Hart and Noam Nisan}, title = {Approximate Revenue Maximization with Multiple Items}, journal = {CoRR}, volume = {abs/1204.1846}, year = {2012}, url = {http://arxiv.org/abs/1204.1846}, eprinttype = {arXiv}, eprint = {1204.1846}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-1846.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-4286, author = {Avital Gutman and Noam Nisan}, title = {Fair Allocation Without Trade}, journal = {CoRR}, volume = {abs/1204.4286}, year = {2012}, url = {http://arxiv.org/abs/1204.4286}, eprinttype = {arXiv}, eprint = {1204.4286}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-4286.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1210-0155, author = {Avishay Maya and Noam Nisan}, title = {Incentive Compatible Two Player Cake Cutting}, journal = {CoRR}, volume = {abs/1210.0155}, year = {2012}, url = {http://arxiv.org/abs/1210.0155}, eprinttype = {arXiv}, eprint = {1210.0155}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1210-0155.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1210-1757, author = {Avinatan Hassidim and Haim Kaplan and Yishay Mansour and Noam Nisan}, title = {The {AND-OR} game: Equilibrium Characterization (Working Paper)}, journal = {CoRR}, volume = {abs/1210.1757}, year = {2012}, url = {http://arxiv.org/abs/1210.1757}, eprinttype = {arXiv}, eprint = {1210.1757}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1210-1757.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/DobzinskiN11, author = {Shahar Dobzinski and Noam Nisan}, title = {Limitations of VCG-based mechanisms}, journal = {Comb.}, volume = {31}, number = {4}, pages = {379--396}, year = {2011}, url = {https://doi.org/10.1007/s00493-011-2528-4}, doi = {10.1007/S00493-011-2528-4}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/DobzinskiN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FriedgutKKN11, author = {Ehud Friedgut and Gil Kalai and Nathan Keller and Noam Nisan}, title = {A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives}, journal = {{SIAM} J. Comput.}, volume = {40}, number = {3}, pages = {934--952}, year = {2011}, url = {https://doi.org/10.1137/090756740}, doi = {10.1137/090756740}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FriedgutKKN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigecom/NisanSVZ11, author = {Noam Nisan and Michael Schapira and Gregory Valiant and Aviv Zohar}, title = {When is it best to best-respond?}, journal = {SIGecom Exch.}, volume = {10}, number = {2}, pages = {16--18}, year = {2011}, url = {https://doi.org/10.1145/1998549.1998552}, doi = {10.1145/1998549.1998552}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigecom/NisanSVZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/NisanSVZ11, author = {Noam Nisan and Michael Schapira and Gregory Valiant and Aviv Zohar}, editor = {Bernard Chazelle}, title = {Best-Response Mechanisms}, booktitle = {Innovations in Computer Science - {ICS} 2011, Tsinghua University, Beijing, China, January 7-9, 2011. Proceedings}, pages = {155--165}, publisher = {Tsinghua University Press}, year = {2011}, url = {http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/24.html}, timestamp = {Mon, 23 Mar 2020 08:26:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/NisanSVZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/NisanSVZ11, author = {Noam Nisan and Michael Schapira and Gregory Valiant and Aviv Zohar}, editor = {Cyril Gavoille and Pierre Fraigniaud}, title = {Incentive-compatible distributed greedy protocols}, booktitle = {Proceedings of the 30th Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2011, San Jose, CA, USA, June 6-8, 2011}, pages = {335--336}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993806.1993871}, doi = {10.1145/1993806.1993871}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/podc/NisanSVZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/DobzinskiN11, author = {Shahar Dobzinski and Noam Nisan}, editor = {Yoav Shoham and Yan Chen and Tim Roughgarden}, title = {Multi-unit auctions: beyond roberts}, booktitle = {Proceedings 12th {ACM} Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011}, pages = {233--242}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993574.1993611}, doi = {10.1145/1993574.1993611}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/DobzinskiN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/HassidimKMN11, author = {Avinatan Hassidim and Haim Kaplan and Yishay Mansour and Noam Nisan}, editor = {Yoav Shoham and Yan Chen and Tim Roughgarden}, title = {Non-price equilibria in markets of discrete goods}, booktitle = {Proceedings 12th {ACM} Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011}, pages = {295--296}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993574.1993619}, doi = {10.1145/1993574.1993619}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/HassidimKMN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/NisanSVZ11, author = {Noam Nisan and Michael Schapira and Gregory Valiant and Aviv Zohar}, editor = {Yoav Shoham and Yan Chen and Tim Roughgarden}, title = {Best-response auctions}, booktitle = {Proceedings 12th {ACM} Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011}, pages = {351--360}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993574.1993633}, doi = {10.1145/1993574.1993633}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/NisanSVZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/sp/goldreich2011/GoldreichLN11, author = {Oded Goldreich and Leonid A. Levin and Noam Nisan}, editor = {Oded Goldreich}, title = {On Constructing 1-1 One-Way Functions}, booktitle = {Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman}, series = {Lecture Notes in Computer Science}, volume = {6650}, pages = {13--25}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22670-0\_3}, doi = {10.1007/978-3-642-22670-0\_3}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/books/sp/goldreich2011/GoldreichLN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/sp/goldreich2011/GoldreichNW11, author = {Oded Goldreich and Noam Nisan and Avi Wigderson}, editor = {Oded Goldreich}, title = {On Yao's XOR-Lemma}, booktitle = {Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman}, series = {Lecture Notes in Computer Science}, volume = {6650}, pages = {273--301}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22670-0\_23}, doi = {10.1007/978-3-642-22670-0\_23}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/sp/goldreich2011/GoldreichNW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1103-3950, author = {Avinatan Hassidim and Haim Kaplan and Yishay Mansour and Noam Nisan}, title = {Non-Price Equilibria in Markets of Discrete Goods}, journal = {CoRR}, volume = {abs/1103.3950}, year = {2011}, url = {http://arxiv.org/abs/1103.3950}, eprinttype = {arXiv}, eprint = {1103.3950}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1103-3950.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1105-5129, author = {Ehud Friedgut and Gil Kalai and Nathan Keller and Noam Nisan}, title = {A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives}, journal = {CoRR}, volume = {abs/1105.5129}, year = {2011}, url = {http://arxiv.org/abs/1105.5129}, eprinttype = {arXiv}, eprint = {1105.5129}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1105-5129.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1107-0028, author = {Moshe Babaioff and Noam Nisan}, title = {Concurrent Auctions Across The Supply Chain}, journal = {CoRR}, volume = {abs/1107.0028}, year = {2011}, url = {http://arxiv.org/abs/1107.0028}, eprinttype = {arXiv}, eprint = {1107.0028}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1107-0028.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1110-0025, author = {Noam Nisan and Amir Ronen}, title = {Computationally Feasible {VCG} Mechanisms}, journal = {CoRR}, volume = {abs/1110.0025}, year = {2011}, url = {http://arxiv.org/abs/1110.0025}, eprinttype = {arXiv}, eprint = {1110.0025}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1110-0025.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1110-2733, author = {Liad Blumrosen and Noam Nisan and Ilya Segal}, title = {Auctions with Severely Bounded Communication}, journal = {CoRR}, volume = {abs/1110.2733}, year = {2011}, url = {http://arxiv.org/abs/1110.2733}, eprinttype = {arXiv}, eprint = {1110.2733}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1110-2733.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/DobzinskiN10, author = {Shahar Dobzinski and Noam Nisan}, title = {Mechanisms for Multi-Unit Auctions}, journal = {J. Artif. Intell. Res.}, volume = {37}, pages = {85--98}, year = {2010}, url = {https://doi.org/10.1613/jair.2950}, doi = {10.1613/JAIR.2950}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/DobzinskiN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/BabaioffFN10, author = {Moshe Babaioff and Michal Feldman and Noam Nisan}, title = {Mixed Strategies in Combinatorial Agency}, journal = {J. Artif. Intell. Res.}, volume = {38}, pages = {339--369}, year = {2010}, url = {https://doi.org/10.1613/jair.2961}, doi = {10.1613/JAIR.2961}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jair/BabaioffFN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jet/BlumrosenN10, author = {Liad Blumrosen and Noam Nisan}, title = {Informational limitations of ascending combinatorial auctions}, journal = {J. Econ. Theory}, volume = {145}, number = {3}, pages = {1203--1223}, year = {2010}, url = {https://doi.org/10.1016/j.jet.2009.10.012}, doi = {10.1016/J.JET.2009.10.012}, timestamp = {Mon, 24 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jet/BlumrosenN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mor/DobzinskiNS10, author = {Shahar Dobzinski and Noam Nisan and Michael Schapira}, title = {Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders}, journal = {Math. Oper. Res.}, volume = {35}, number = {1}, pages = {1--13}, year = {2010}, url = {https://doi.org/10.1287/moor.1090.0436}, doi = {10.1287/MOOR.1090.0436}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mor/DobzinskiNS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Nisan10, author = {Noam Nisan}, editor = {Moses Charikar}, title = {Google's Auction for {TV} Ads}, booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010}, pages = {741}, publisher = {{SIAM}}, year = {2010}, url = {https://doi.org/10.1137/1.9781611973075.60}, doi = {10.1137/1.9781611973075.60}, timestamp = {Tue, 02 Feb 2021 17:07:39 +0100}, biburl = {https://dblp.org/rec/conf/soda/Nisan10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1004-1449, author = {Shahar Dobzinski and Noam Nisan}, title = {Multi-Unit Auctions: Beyond Roberts}, journal = {CoRR}, volume = {abs/1004.1449}, year = {2010}, url = {http://arxiv.org/abs/1004.1449}, eprinttype = {arXiv}, eprint = {1004.1449}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1004-1449.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/BabaioffNP09, author = {Moshe Babaioff and Noam Nisan and Elan Pavlov}, title = {Mechanisms for a spatially distributed market}, journal = {Games Econ. Behav.}, volume = {66}, number = {2}, pages = {660--684}, year = {2009}, url = {https://doi.org/10.1016/j.geb.2008.07.005}, doi = {10.1016/J.GEB.2008.07.005}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/BabaioffNP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scw/LaviMN09, author = {Ron Lavi and Ahuva Mu'alem and Noam Nisan}, title = {Two simplified proofs for Roberts' theorem}, journal = {Soc. Choice Welf.}, volume = {32}, number = {3}, pages = {407--423}, year = {2009}, url = {https://doi.org/10.1007/s00355-008-0331-y}, doi = {10.1007/S00355-008-0331-Y}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scw/LaviMN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BlumrosenN09, author = {Liad Blumrosen and Noam Nisan}, title = {On the Computational Power of Demand Queries}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {4}, pages = {1372--1391}, year = {2009}, url = {https://doi.org/10.1137/050641181}, doi = {10.1137/050641181}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BlumrosenN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/Nisan09, author = {Noam Nisan}, editor = {Amos Fiat and Peter Sanders}, title = {Google's Auction for {TV} Ads}, booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5757}, pages = {553}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04128-0\_49}, doi = {10.1007/978-3-642-04128-0\_49}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/Nisan09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/NisanBCFGMRSTVZ09, author = {Noam Nisan and Jason Bayer and Deepak Chandra and Tal Franji and Robert Gardner and Yossi Matias and Neil Rhodes and Misha Seltzer and Danny Tom and Hal R. Varian and Dan Zigmond}, editor = {Susanne Albers and Alberto Marchetti{-}Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas}, title = {Google's Auction for {TV} Ads}, booktitle = {Automata, Languages and Programming, 36th Internatilonal Colloquium, {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {5556}, pages = {309--327}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02930-1\_26}, doi = {10.1007/978-3-642-02930-1\_26}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/NisanBCFGMRSTVZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/DobzinskiN09, author = {Shahar Dobzinski and Noam Nisan}, editor = {Marios Mavronicolas and Vicky G. Papadopoulou}, title = {A Modular Approach to Roberts' Theorem}, booktitle = {Algorithmic Game Theory, Second International Symposium, {SAGT} 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5814}, pages = {14--23}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04645-2\_3}, doi = {10.1007/978-3-642-04645-2\_3}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sagt/DobzinskiN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/BabaioffFN09, author = {Moshe Babaioff and Michal Feldman and Noam Nisan}, editor = {Marios Mavronicolas and Vicky G. Papadopoulou}, title = {Free-Riding and Free-Labor in Combinatorial Agency}, booktitle = {Algorithmic Game Theory, Second International Symposium, {SAGT} 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5814}, pages = {109--121}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04645-2\_11}, doi = {10.1007/978-3-642-04645-2\_11}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sagt/BabaioffFN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/SchockenNA09, author = {Shimon Schocken and Noam Nisan and Michal Armoni}, editor = {Sue Fitzgerald and Mark Guzdial and Gary Lewandowski and Steven A. Wolfman}, title = {A synthesis course in hardware architecture, compilers, and software engineering}, booktitle = {Proceedings of the 40th {SIGCSE} Technical Symposium on Computer Science Education, {SIGCSE} 2009, Chattanooga, TN, USA, March 4-7, 2009}, pages = {443--447}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1508865.1509021}, doi = {10.1145/1508865.1509021}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigcse/SchockenNA09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0024041, author = {Noam Nisan and Shimon Schocken}, title = {The Elements of Computing Systems - Building a Modern Computer from First Principles}, publisher = {{MIT} Press}, year = {2008}, url = {http://mitpress.mit.edu/catalog/item/default.asp?ttype=2\&\#38;tid=11453}, isbn = {978-0-262-64068-8}, timestamp = {Wed, 09 Feb 2011 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/daglib/0024041.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/MualemN08, author = {Ahuva Mu'alem and Noam Nisan}, title = {Truthful approximation mechanisms for restricted combinatorial auctions}, journal = {Games Econ. Behav.}, volume = {64}, number = {2}, pages = {612--631}, year = {2008}, url = {https://doi.org/10.1016/j.geb.2007.12.009}, doi = {10.1016/J.GEB.2007.12.009}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/MualemN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/AggarwalACEFFHMNPSS08, author = {Gagan Aggarwal and Nir Ailon and Florin Constantin and Eyal Even{-}Dar and Jon Feldman and Gereon Frahling and Monika Rauch Henzinger and S. Muthukrishnan and Noam Nisan and Martin P{\'{a}}l and Mark Sandler and Anastasios Sidiropoulos}, title = {Theory research at Google}, journal = {{SIGACT} News}, volume = {39}, number = {2}, pages = {10--28}, year = {2008}, url = {https://doi.org/10.1145/1388240.1388242}, doi = {10.1145/1388240.1388242}, timestamp = {Fri, 07 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/AggarwalACEFFHMNPSS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/AbrahamGMNT08, author = {Ittai Abraham and Cyril Gavoille and Dahlia Malkhi and Noam Nisan and Mikkel Thorup}, title = {Compact name-independent routing with minimum stretch}, journal = {{ACM} Trans. Algorithms}, volume = {4}, number = {3}, pages = {37:1--37:12}, year = {2008}, url = {https://doi.org/10.1145/1367064.1367077}, doi = {10.1145/1367064.1367077}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/AbrahamGMNT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ccs/Ben-DavidNP08, author = {Assaf Ben{-}David and Noam Nisan and Benny Pinkas}, editor = {Peng Ning and Paul F. Syverson and Somesh Jha}, title = {FairplayMP: a system for secure multi-party computation}, booktitle = {Proceedings of the 2008 {ACM} Conference on Computer and Communications Security, {CCS} 2008, Alexandria, Virginia, USA, October 27-31, 2008}, pages = {257--266}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1455770.1455804}, doi = {10.1145/1455770.1455804}, timestamp = {Tue, 10 Nov 2020 19:59:27 +0100}, biburl = {https://dblp.org/rec/conf/ccs/Ben-DavidNP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/FriedgutKN08, author = {Ehud Friedgut and Gil Kalai and Noam Nisan}, title = {Elections Can be Manipulated Often}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {243--249}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.87}, doi = {10.1109/FOCS.2008.87}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/FriedgutKN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DobzinskiLN08, author = {Shahar Dobzinski and Ron Lavi and Noam Nisan}, title = {Multi-unit Auctions with Budget Limits}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {260--269}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.39}, doi = {10.1109/FOCS.2008.39}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DobzinskiLN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/NisanSZ08, author = {Noam Nisan and Michael Schapira and Aviv Zohar}, editor = {Christos H. Papadimitriou and Shuzhong Zhang}, title = {Asynchronous Best-Reply Dynamics}, booktitle = {Internet and Network Economics, 4th International Workshop, {WINE} 2008, Shanghai, China, December 17-20, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5385}, pages = {531--538}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92185-1\_59}, doi = {10.1007/978-3-540-92185-1\_59}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/wine/NisanSZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/BlumrosenNS07, author = {Liad Blumrosen and Noam Nisan and Ilya Segal}, title = {Auctions with Severely Bounded Communication}, journal = {J. Artif. Intell. Res.}, volume = {28}, pages = {233--266}, year = {2007}, url = {https://doi.org/10.1613/jair.2081}, doi = {10.1613/JAIR.2081}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/BlumrosenNS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/NisanR07, author = {Noam Nisan and Amir Ronen}, title = {Computationally Feasible {VCG} Mechanisms}, journal = {J. Artif. Intell. Res.}, volume = {29}, pages = {19--47}, year = {2007}, url = {https://doi.org/10.1613/jair.2046}, doi = {10.1613/JAIR.2046}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/NisanR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/DobzinskiN07, author = {Shahar Dobzinski and Noam Nisan}, editor = {Jeffrey K. MacKie{-}Mason and David C. Parkes and Paul Resnick}, title = {Mechanisms for multi-unit auctions}, booktitle = {Proceedings 8th {ACM} Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007}, pages = {346--351}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1250910.1250960}, doi = {10.1145/1250910.1250960}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/DobzinskiN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DobzinskiN07, author = {Shahar Dobzinski and Noam Nisan}, editor = {David S. Johnson and Uriel Feige}, title = {Limitations of VCG-based mechanisms}, booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007}, pages = {338--344}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1250790.1250842}, doi = {10.1145/1250790.1250842}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DobzinskiN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/cu/NRTV2007, editor = {Noam Nisan and Tim Roughgarden and {\'{E}}va Tardos and Vijay V. Vazirani}, title = {Algorithmic Game Theory}, publisher = {Cambridge University Press}, year = {2007}, url = {https://doi.org/10.1017/CBO9780511800481}, doi = {10.1017/CBO9780511800481}, isbn = {9780511800481}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/cu/NRTV2007.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/LehmannLN06, author = {Benny Lehmann and Daniel Lehmann and Noam Nisan}, title = {Combinatorial auctions with decreasing marginal utilities}, journal = {Games Econ. Behav.}, volume = {55}, number = {2}, pages = {270--296}, year = {2006}, url = {https://doi.org/10.1016/j.geb.2005.02.006}, doi = {10.1016/J.GEB.2005.02.006}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/LehmannLN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jet/NisanS06, author = {Noam Nisan and Ilya Segal}, title = {The communication requirements of efficient allocations and supporting prices}, journal = {J. Econ. Theory}, volume = {129}, number = {1}, pages = {192--224}, year = {2006}, url = {https://doi.org/10.1016/j.jet.2004.10.007}, doi = {10.1016/J.JET.2004.10.007}, timestamp = {Mon, 24 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jet/NisanS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/BabaioffFN06, author = {Moshe Babaioff and Michal Feldman and Noam Nisan}, editor = {Joan Feigenbaum and John C.{-}I. Chuang and David M. Pennock}, title = {Combinatorial agency}, booktitle = {Proceedings 7th {ACM} Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006}, pages = {18--28}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1134707.1134710}, doi = {10.1145/1134707.1134710}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/BabaioffFN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DobzinskiNS06, author = {Shahar Dobzinski and Noam Nisan and Michael Schapira}, editor = {Jon M. Kleinberg}, title = {Truthful randomized mechanisms for combinatorial auctions}, booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006}, pages = {644--652}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1132516.1132607}, doi = {10.1145/1132516.1132607}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DobzinskiNS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/BabaioffFN06, author = {Moshe Babaioff and Michal Feldman and Noam Nisan}, editor = {Paul G. Spirakis and Marios Mavronicolas and Spyros C. Kontogiannis}, title = {Mixed Strategies in Combinatorial Agency}, booktitle = {Internet and Network Economics, Second International Workshop, {WINE} 2006, Patras, Greece, December 15-17, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4286}, pages = {353--364}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11944874\_32}, doi = {10.1007/11944874\_32}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wine/BabaioffFN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DobzinskiN06, author = {Shahar Dobzinski and Noam Nisan}, title = {Approximations by Computationally-Efficient VCG-Based Mechanisms}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR06-074}}, year = {2006}, url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-074/index.html}, eprinttype = {ECCC}, eprint = {TR06-074}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DobzinskiN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Nisan06, author = {Noam Nisan}, title = {A Note on the computational hardness of evolutionary stable strategies}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR06-076}}, year = {2006}, url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-076/index.html}, eprinttype = {ECCC}, eprint = {TR06-076}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Nisan06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0014694, author = {Noam Nisan and Shimon Schocken}, title = {The Elements of Computing Systems - Building a Modern Computer from First Principles}, publisher = {{MIT} Press}, year = {2005}, isbn = {978-0-262-14087-4}, timestamp = {Fri, 01 Apr 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0014694.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/BlumrosenN05, author = {Liad Blumrosen and Noam Nisan}, editor = {John Riedl and Michael J. Kearns and Michael K. Reiter}, title = {On the computational power of iterative auctions}, booktitle = {Proceedings 6th {ACM} Conference on Electronic Commerce (EC-2005), Vancouver, BC, Canada, June 5-8, 2005}, pages = {29--43}, publisher = {{ACM}}, year = {2005}, url = {https://doi.org/10.1145/1064009.1064013}, doi = {10.1145/1064009.1064013}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/BlumrosenN05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LaviN05, author = {Ron Lavi and Noam Nisan}, title = {Online ascending auctions for gradually expiring items}, booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {1146--1155}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070596}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/LaviN05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DobzinskiNS05, author = {Shahar Dobzinski and Noam Nisan and Michael Schapira}, editor = {Harold N. Gabow and Ronald Fagin}, title = {Approximation algorithms for combinatorial auctions with complement-free bidders}, booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005}, pages = {610--618}, publisher = {{ACM}}, year = {2005}, url = {https://doi.org/10.1145/1060590.1060681}, doi = {10.1145/1060590.1060681}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DobzinskiNS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tark/NisanS05, author = {Noam Nisan and Ilya Segal}, editor = {Ron van der Meyden}, title = {Exponential communication inefficiency of demand queries}, booktitle = {Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2005), Singapore, June 10-12, 2005}, pages = {158--164}, publisher = {National University of Singapore}, year = {2005}, url = {https://dl.acm.org/citation.cfm?id=1089951}, timestamp = {Thu, 29 Nov 2018 12:50:42 +0100}, biburl = {https://dblp.org/rec/conf/tark/NisanS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/BabaioffN04, author = {Moshe Babaioff and Noam Nisan}, title = {Concurrent Auctions Across The Supply Chain}, journal = {J. Artif. Intell. Res.}, volume = {21}, pages = {595--629}, year = {2004}, url = {https://doi.org/10.1613/jair.1316}, doi = {10.1613/JAIR.1316}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/BabaioffN04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LaviN04, author = {Ron Lavi and Noam Nisan}, title = {Competitive analysis of incentive compatible on-line auctions}, journal = {Theor. Comput. Sci.}, volume = {310}, number = {1-3}, pages = {159--180}, year = {2004}, url = {https://doi.org/10.1016/S0304-3975(03)00391-8}, doi = {10.1016/S0304-3975(03)00391-8}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LaviN04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/BabaioffNP04, author = {Moshe Babaioff and Noam Nisan and Elan Pavlov}, editor = {Jack S. Breese and Joan Feigenbaum and Margo I. Seltzer}, title = {Mechanisms for a spatially distributed market}, booktitle = {Proceedings 5th {ACM} Conference on Electronic Commerce (EC-2004), New York, NY, USA, May 17-20, 2004}, pages = {9--20}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/988772.988776}, doi = {10.1145/988772.988776}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/BabaioffNP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/AbrahamGMNT04, author = {Ittai Abraham and Cyril Gavoille and Dahlia Malkhi and Noam Nisan and Mikkel Thorup}, editor = {Phillip B. Gibbons and Micah Adler}, title = {Compact name-independent routing with minimum stretch}, booktitle = {{SPAA} 2004: Proceedings of the Sixteenth Annual {ACM} Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain}, pages = {20--24}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/1007912.1007916}, doi = {10.1145/1007912.1007916}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spaa/AbrahamGMNT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/uss/MalkhiNPS04, author = {Dahlia Malkhi and Noam Nisan and Benny Pinkas and Yaron Sella}, editor = {Matt Blaze}, title = {Fairplay - Secure Two-Party Computation System}, booktitle = {Proceedings of the 13th {USENIX} Security Symposium, August 9-13, 2004, San Diego, CA, {USA}}, pages = {287--302}, publisher = {{USENIX}}, year = {2004}, url = {http://www.usenix.org/publications/library/proceedings/sec04/tech/malkhi.html}, timestamp = {Mon, 01 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/uss/MalkhiNPS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BlumrosenNS03, author = {Liad Blumrosen and Noam Nisan and Ilya Segal}, editor = {Giuseppe Di Battista and Uri Zwick}, title = {Multi-player and Multi-round Auctions with Severely Bounded Communication}, booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2832}, pages = {102--113}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39658-1\_12}, doi = {10.1007/978-3-540-39658-1\_12}, timestamp = {Sun, 02 Jun 2019 21:14:37 +0200}, biburl = {https://dblp.org/rec/conf/esa/BlumrosenNS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LaviMN03, author = {Ron Lavi and Ahuva Mu'alem and Noam Nisan}, title = {Towards a Characterization of Truthful Combinatorial Auctions}, booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings}, pages = {574--583}, publisher = {{IEEE} Computer Society}, year = {2003}, url = {https://doi.org/10.1109/SFCS.2003.1238230}, doi = {10.1109/SFCS.2003.1238230}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LaviMN03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tark/BartalGN03, author = {Yair Bartal and Rica Gonen and Noam Nisan}, editor = {Joseph Y. Halpern and Moshe Tennenholtz}, title = {Incentive compatible multi unit combinatorial auctions}, booktitle = {Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2003), Bloomington, Indiana, USA, June 20-22, 2003}, pages = {72--87}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/846241.846250}, doi = {10.1145/846241.846250}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tark/BartalGN03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/sigecom/2003, editor = {Daniel A. Menasc{\'{e}} and Noam Nisan}, title = {Proceedings 4th {ACM} Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9-12, 2003}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/779928}, doi = {10.1145/779928}, isbn = {1-58113-679-X}, timestamp = {Tue, 27 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/2003.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/MualemN02, author = {Ahuva Mu'alem and Noam Nisan}, editor = {Rina Dechter and Michael J. Kearns and Richard S. Sutton}, title = {Truthful Approximation Mechanisms for Restricted Combinatorial Auctions}, booktitle = {Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada}, pages = {379--384}, publisher = {{AAAI} Press / The {MIT} Press}, year = {2002}, url = {http://www.aaai.org/Library/AAAI/2002/aaai02-058.php}, timestamp = {Tue, 05 Sep 2023 09:10:47 +0200}, biburl = {https://dblp.org/rec/conf/aaai/MualemN02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BlumrosenN02, author = {Liad Blumrosen and Noam Nisan}, title = {Auctions with Severely Bounded Communication}, booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings}, pages = {406--415}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/SFCS.2002.1181965}, doi = {10.1109/SFCS.2002.1181965}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BlumrosenN02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Nisan02, author = {Noam Nisan}, editor = {Peter Widmayer and Francisco Triguero Ruiz and Rafael Morales Bueno and Matthew Hennessy and Stephan J. Eidenbenz and Ricardo Conejo}, title = {The Communication Complexity of Approximate Set Packing and Covering}, booktitle = {Automata, Languages and Programming, 29th International Colloquium, {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2380}, pages = {868--875}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45465-9\_74}, doi = {10.1007/3-540-45465-9\_74}, timestamp = {Wed, 11 Sep 2019 13:15:53 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Nisan02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-GT-0202015, author = {Benny Lehmann and Daniel Lehmann and Noam Nisan}, title = {Combinatorial Auctions with Decreasing Marginal Utilities}, journal = {CoRR}, volume = {cs.GT/0202015}, year = {2002}, url = {https://arxiv.org/abs/cs/0202015}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-GT-0202015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/KremerNR01, author = {Ilan Kremer and Noam Nisan and Dana Ron}, title = {Errata for: "On randomized one-round communication complexity"}, journal = {Comput. Complex.}, volume = {10}, number = {4}, pages = {314--315}, year = {2001}, url = {https://doi.org/10.1007/s000370100003}, doi = {10.1007/S000370100003}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/KremerNR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/NisanR01, author = {Noam Nisan and Amir Ronen}, title = {Algorithmic Mechanism Design}, journal = {Games Econ. Behav.}, volume = {35}, number = {1-2}, pages = {166--196}, year = {2001}, url = {https://doi.org/10.1006/game.1999.0790}, doi = {10.1006/GAME.1999.0790}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/NisanR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/DolevHLNP01, author = {Danny Dolev and Yuval Harari and Nathan Linial and Noam Nisan and Michal Parnas}, title = {Neighborhood Preserving Hashing and Approximate Queries}, journal = {{SIAM} J. Discret. Math.}, volume = {15}, number = {1}, pages = {73--85}, year = {2001}, url = {https://doi.org/10.1137/S089548019731809X}, doi = {10.1137/S089548019731809X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/DolevHLNP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/BabaioffN01, author = {Moshe Babaioff and Noam Nisan}, editor = {Michael P. Wellman and Yoav Shoham}, title = {Concurrent auctions across the supply chain}, booktitle = {Proceedings 3rd {ACM} Conference on Electronic Commerce (EC-2001), Tampa, Florida, USA, October 14-17, 2001}, pages = {1--10}, publisher = {{ACM}}, year = {2001}, url = {https://doi.org/10.1145/501158.501159}, doi = {10.1145/501158.501159}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/BabaioffN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/LehmannLN01, author = {Benny Lehmann and Daniel Lehmann and Noam Nisan}, editor = {Michael P. Wellman and Yoav Shoham}, title = {Combinatorial auctions with decreasing marginal utilities}, booktitle = {Proceedings 3rd {ACM} Conference on Electronic Commerce (EC-2001), Tampa, Florida, USA, October 14-17, 2001}, pages = {18--28}, publisher = {{ACM}}, year = {2001}, url = {https://doi.org/10.1145/501158.501161}, doi = {10.1145/501158.501161}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/LehmannLN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/ZurelN01, author = {Edo Zurel and Noam Nisan}, editor = {Michael P. Wellman and Yoav Shoham}, title = {An efficient approximate allocation algorithm for combinatorial auctions}, booktitle = {Proceedings 3rd {ACM} Conference on Electronic Commerce (EC-2001), Tampa, Florida, USA, October 14-17, 2001}, pages = {125--136}, publisher = {{ACM}}, year = {2001}, url = {https://doi.org/10.1145/501158.501172}, doi = {10.1145/501158.501172}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/ZurelN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/usits/LevyBN01, author = {Lior Levy and Liad Blumrosen and Noam Nisan}, editor = {Tom Anderson}, title = {On-Line Markets for Distributed Object Services: The {MAJIC} System}, booktitle = {3rd {USENIX} Symposium on Internet Technologies and Systems, USITS'01, San Francisco, California, USA, March 26-28, 2001}, pages = {85--96}, publisher = {{USENIX}}, year = {2001}, url = {http://www.usenix.org/events/usits01/levy.html}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/usits/LevyBN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dss/RegevN00, author = {Ori Regev and Noam Nisan}, title = {The {POPCORN} market. Online markets for computational resources}, journal = {Decis. Support Syst.}, volume = {28}, number = {1-2}, pages = {177--189}, year = {2000}, url = {https://doi.org/10.1016/S0167-9236(99)00067-6}, doi = {10.1016/S0167-9236(99)00067-6}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dss/RegevN00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/Nisan00, author = {Noam Nisan}, editor = {Anant Jhingran and Jeff MacKie{-}Mason and Doug J. Tygar}, title = {Bidding and allocation in combinatorial auctions}, booktitle = {Proceedings of the 2nd {ACM} Conference on Electronic Commerce (EC-00), Minneapolis, MN, USA, October 17-20, 2000}, pages = {1--12}, publisher = {{ACM}}, year = {2000}, url = {https://doi.org/10.1145/352871.352872}, doi = {10.1145/352871.352872}, timestamp = {Sat, 15 May 2021 14:27:12 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/Nisan00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/LaviN00, author = {Ron Lavi and Noam Nisan}, editor = {Anant Jhingran and Jeff MacKie{-}Mason and Doug J. Tygar}, title = {Competitive analysis of incentive compatible on-line auctions}, booktitle = {Proceedings of the 2nd {ACM} Conference on Electronic Commerce (EC-00), Minneapolis, MN, USA, October 17-20, 2000}, pages = {233--241}, publisher = {{ACM}}, year = {2000}, url = {https://doi.org/10.1145/352871.352897}, doi = {10.1145/352871.352897}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/LaviN00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/NisanR00, author = {Noam Nisan and Amir Ronen}, editor = {Anant Jhingran and Jeff MacKie{-}Mason and Doug J. Tygar}, title = {Computationally feasible {VCG} mechanisms}, booktitle = {Proceedings of the 2nd {ACM} Conference on Electronic Commerce (EC-00), Minneapolis, MN, USA, October 17-20, 2000}, pages = {242--252}, publisher = {{ACM}}, year = {2000}, url = {https://doi.org/10.1145/352871.352898}, doi = {10.1145/352871.352898}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/NisanR00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/KremerNR99, author = {Ilan Kremer and Noam Nisan and Dana Ron}, title = {On Randomized One-Round Communication Complexity}, journal = {Comput. Complex.}, volume = {8}, number = {1}, pages = {21--49}, year = {1999}, url = {https://doi.org/10.1007/s000370050018}, doi = {10.1007/S000370050018}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/KremerNR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/MansourNV99, author = {Yishay Mansour and Noam Nisan and Uzi Vishkin}, title = {Trade-offs between Communication Throughput and Parallel Time}, journal = {J. Complex.}, volume = {15}, number = {1}, pages = {148--166}, year = {1999}, url = {https://doi.org/10.1006/jcom.1998.0498}, doi = {10.1006/JCOM.1998.0498}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jc/MansourNV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/NisanT99, author = {Noam Nisan and Amnon Ta{-}Shma}, title = {Extracting Randomness: {A} Survey and New Constructions}, journal = {J. Comput. Syst. Sci.}, volume = {58}, number = {1}, pages = {148--173}, year = {1999}, url = {https://doi.org/10.1006/jcss.1997.1546}, doi = {10.1006/JCSS.1997.1546}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/NisanT99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KargerNP99, author = {David R. Karger and Noam Nisan and Michal Parnas}, title = {Fast Connected Components Algorithms for the {EREW} {PRAM}}, journal = {{SIAM} J. Comput.}, volume = {28}, number = {3}, pages = {1021--1034}, year = {1999}, url = {https://doi.org/10.1137/S009753979325247X}, doi = {10.1137/S009753979325247X}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KargerNP99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/NisanRS99, author = {Noam Nisan and Steven Rudich and Michael E. Saks}, title = {Products and Help Bits in Decision Trees}, journal = {{SIAM} J. Comput.}, volume = {28}, number = {3}, pages = {1035--1050}, year = {1999}, url = {https://doi.org/10.1137/S0097539795282444}, doi = {10.1137/S0097539795282444}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/NisanRS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Nisan99, author = {Noam Nisan}, editor = {Christoph Meinel and Sophie Tison}, title = {Algorithms for Selfish Agents}, booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1563}, pages = {1--15}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-49116-3\_1}, doi = {10.1007/3-540-49116-3\_1}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Nisan99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NisanR99, author = {Noam Nisan and Amir Ronen}, editor = {Jeffrey Scott Vitter and Lawrence L. Larmore and Frank Thomson Leighton}, title = {Algorithmic Mechanism Design (Extended Abstract)}, booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, {USA}}, pages = {129--140}, publisher = {{ACM}}, year = {1999}, url = {https://doi.org/10.1145/301250.301287}, doi = {10.1145/301250.301287}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NisanR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/MiltersenNSW98, author = {Peter Bro Miltersen and Noam Nisan and Shmuel Safra and Avi Wigderson}, title = {On Data Structures and Asymmetric Communication Complexity}, journal = {J. Comput. Syst. Sci.}, volume = {57}, number = {1}, pages = {37--49}, year = {1998}, url = {https://doi.org/10.1006/jcss.1998.1577}, doi = {10.1006/JCSS.1998.1577}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/MiltersenNSW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/EvenGLNV98, author = {Guy Even and Oded Goldreich and Michael Luby and Noam Nisan and Boban Velickovic}, title = {Efficient approximation of product distributions}, journal = {Random Struct. Algorithms}, volume = {13}, number = {1}, pages = {1--16}, year = {1998}, url = {https://doi.org/10.1002/(SICI)1098-2418(199808)13:1\&\#60;1::AID-RSA1\&\#62;3.0.CO;2-W}, doi = {10.1002/(SICI)1098-2418(199808)13:1\&\#60;1::AID-RSA1\&\#62;3.0.CO;2-W}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/EvenGLNV98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icdcs/NisanLRC98, author = {Noam Nisan and Shmulik London and Oded Regev and Noam Camiel}, title = {Globally Distributed Computation over the Internet - The {POPCORN} Project}, booktitle = {Proceedings of the 18th International Conference on Distributed Computing Systems, Amsterdam, The Netherlands, May 26-29, 1998}, pages = {592--601}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/ICDCS.1998.679836}, doi = {10.1109/ICDCS.1998.679836}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icdcs/NisanLRC98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iceco/RegevN98, author = {Ori Regev and Noam Nisan}, editor = {Yechiam Yemini and Donald F. Ferguson and Jeff MacKie{-}Mason}, title = {The {POPCORN} market - an online market for computational resources}, booktitle = {Proceedings of the First International Conference on Information and Computation Economies, {ICE} 1998, Charleston, South Carolina, USA, October 25-28, 1998}, pages = {148--157}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/288994.289027}, doi = {10.1145/288994.289027}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iceco/RegevN98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AharonovKN98, author = {Dorit Aharonov and Alexei Y. Kitaev and Noam Nisan}, editor = {Jeffrey Scott Vitter}, title = {Quantum Circuits with Mixed States}, booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998}, pages = {20--30}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/276698.276708}, doi = {10.1145/276698.276708}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AharonovKN98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0011756, author = {Eyal Kushilevitz and Noam Nisan}, title = {Communication complexity}, publisher = {Cambridge University Press}, year = {1997}, isbn = {978-0-521-56067-2}, timestamp = {Tue, 12 Apr 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0011756.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/NisanW97, author = {Noam Nisan and Avi Wigderson}, title = {Lower Bounds on Arithmetic Circuits Via Partial Derivatives}, journal = {Comput. Complex.}, volume = {6}, number = {3}, pages = {217--234}, year = {1997}, url = {https://doi.org/10.1007/BF01294256}, doi = {10.1007/BF01294256}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/NisanW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NisanB97, author = {Noam Nisan and Ziv Bar{-}Yossef}, editor = {Frank Thomson Leighton and Peter W. Shor}, title = {Pointer Jumping Requires Concurrent Read}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997}, pages = {549--558}, publisher = {{ACM}}, year = {1997}, url = {https://doi.org/10.1145/258533.258648}, doi = {10.1145/258533.258648}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NisanB97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-008, author = {Noam Nisan and Ziv Bar{-}Yossef}, title = {Pointer Jumping Requires Concurrent Read}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-008}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-008/index.html}, eprinttype = {ECCC}, eprint = {TR97-008}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-008.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/NisanZ96, author = {Noam Nisan and David Zuckerman}, title = {Randomness is Linear in Space}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {43--52}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0004}, doi = {10.1006/JCSS.1996.0004}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/NisanZ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Nisan96, author = {Noam Nisan}, editor = {Steven Homer and Jin{-}Yi Cai}, title = {Extracting Randomness: How and Why {A} survey}, booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996}, pages = {44--58}, publisher = {{IEEE} Computer Society}, year = {1996}, url = {https://doi.org/10.1109/CCC.1996.507667}, doi = {10.1109/CCC.1996.507667}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Nisan96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/NisanT95, author = {Noam Nisan and Amnon Ta{-}Shma}, title = {Symmetric Logspace is Closed Under Complement}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1995}, year = {1995}, url = {http://cjtcs.cs.uchicago.edu/articles/1995/1/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/NisanT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/NisanW95, author = {Noam Nisan and Avi Wigderson}, title = {On Rank vs. Communication Complexity}, journal = {Comb.}, volume = {15}, number = {4}, pages = {557--565}, year = {1995}, url = {https://doi.org/10.1007/BF01192527}, doi = {10.1007/BF01192527}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/NisanW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FederKNN95, author = {Tom{\'{a}}s Feder and Eyal Kushilevitz and Moni Naor and Noam Nisan}, title = {Amortized Communication Complexity}, journal = {{SIAM} J. Comput.}, volume = {24}, number = {4}, pages = {736--750}, year = {1995}, url = {https://doi.org/10.1137/S0097539792235864}, doi = {10.1137/S0097539792235864}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FederKNN95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KarchmerKN95, author = {Mauricio Karchmer and Eyal Kushilevitz and Noam Nisan}, title = {Fractional Covers and Communication Complexity}, journal = {{SIAM} J. Discret. Math.}, volume = {8}, number = {1}, pages = {76--92}, year = {1995}, url = {https://doi.org/10.1137/S0895480192238482}, doi = {10.1137/S0895480192238482}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KarchmerKN95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/NisanW95, author = {Noam Nisan and Avi Wigderson}, title = {Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version)}, booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995}, pages = {16--25}, publisher = {{IEEE} Computer Society}, year = {1995}, url = {https://doi.org/10.1109/SFCS.1995.492458}, doi = {10.1109/SFCS.1995.492458}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/NisanW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MiltersenNSW95, author = {Peter Bro Miltersen and Noam Nisan and Shmuel Safra and Avi Wigderson}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {On data structures and asymmetric communication complexity}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {103--111}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225093}, doi = {10.1145/225058.225093}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/MiltersenNSW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NisanT95, author = {Noam Nisan and Amnon Ta{-}Shma}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Symmetric logspace is closed under complement}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {140--146}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225101}, doi = {10.1145/225058.225101}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NisanT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KremerNR95, author = {Ilan Kremer and Noam Nisan and Dana Ron}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {On randomized one-round communication complexity}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {596--605}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225277}, doi = {10.1145/225058.225277}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KremerNR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NisanW95, author = {Noam Nisan and Avi Wigderson}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {723--732}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225290}, doi = {10.1145/225058.225290}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NisanW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR95-029, author = {Oded Goldreich and Leonid A. Levin and Noam Nisan}, title = {On Constructing 1-1 One-Way Functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR95-029}}, year = {1995}, url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-029/index.html}, eprinttype = {ECCC}, eprint = {TR95-029}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-029.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR95-050, author = {Oded Goldreich and Noam Nisan and Avi Wigderson}, title = {On Yao's XOR-Lemma}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR95-050}}, year = {1995}, url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-050/index.html}, eprinttype = {ECCC}, eprint = {TR95-050}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-050.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Nisan94, author = {Noam Nisan}, title = {{RL} {\textless}= {SC}}, journal = {Comput. Complex.}, volume = {4}, pages = {1--11}, year = {1994}, url = {https://doi.org/10.1007/BF01205052}, doi = {10.1007/BF01205052}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Nisan94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/NisanS94, author = {Noam Nisan and Mario Szegedy}, title = {On the Degree of Boolean Functions as Real Polynomials}, journal = {Comput. Complex.}, volume = {4}, pages = {301--313}, year = {1994}, url = {https://doi.org/10.1007/BF01263419}, doi = {10.1007/BF01263419}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/NisanS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/NisanW94, author = {Noam Nisan and Avi Wigderson}, title = {Hardness vs Randomness}, journal = {J. Comput. Syst. Sci.}, volume = {49}, number = {2}, pages = {149--167}, year = {1994}, url = {https://doi.org/10.1016/S0022-0000(05)80043-1}, doi = {10.1016/S0022-0000(05)80043-1}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/NisanW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/NisanRS94, author = {Noam Nisan and Steven Rudich and Michael E. Saks}, title = {Products and Help Bits in Decision Trees}, booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994}, pages = {318--329}, publisher = {{IEEE} Computer Society}, year = {1994}, url = {https://doi.org/10.1109/SFCS.1994.365683}, doi = {10.1109/SFCS.1994.365683}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/NisanRS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/NisanW94, author = {Noam Nisan and Avi Wigderson}, title = {On Rank vs. Communication Complexity}, booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994}, pages = {831--836}, publisher = {{IEEE} Computer Society}, year = {1994}, url = {https://doi.org/10.1109/SFCS.1994.365711}, doi = {10.1109/SFCS.1994.365711}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/NisanW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DolevHLNP94, author = {Danny Dolev and Yuval Harari and Nathan Linial and Noam Nisan and Michal Parnas}, editor = {Daniel Dominic Sleator}, title = {Neighborhood Preserving Hashing and Approximate Queries}, booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, {USA}}, pages = {251--259}, publisher = {{ACM/SIAM}}, year = {1994}, url = {http://dl.acm.org/citation.cfm?id=314464.314501}, timestamp = {Thu, 05 Jul 2018 07:29:19 +0200}, biburl = {https://dblp.org/rec/conf/soda/DolevHLNP94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ImpagliazzoNW94, author = {Russell Impagliazzo and Noam Nisan and Avi Wigderson}, editor = {Frank Thomson Leighton and Michael T. Goodrich}, title = {Pseudorandomness for network algorithms}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {356--364}, publisher = {{ACM}}, year = {1994}, url = {https://doi.org/10.1145/195058.195190}, doi = {10.1145/195058.195190}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoNW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MansourNV94, author = {Yishay Mansour and Noam Nisan and Uzi Vishkin}, editor = {Frank Thomson Leighton and Michael T. Goodrich}, title = {Trade-offs between communication throughput and parallel time}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {372--381}, publisher = {{ACM}}, year = {1994}, url = {https://doi.org/10.1145/195058.195199}, doi = {10.1145/195058.195199}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/MansourNV94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR94-001, author = {Noam Nisan and Avi Wigderson}, title = {On Rank vs. Communication Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR94-001}}, year = {1994}, url = {https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-001/index.html}, eprinttype = {ECCC}, eprint = {TR94-001}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR94-001.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR94-003, author = {Noam Nisan and Amnon Ta{-}Shma}, title = {Symmetric Logspace is Closed Under Complement}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR94-003}}, year = {1994}, url = {https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-003/index.html}, eprinttype = {ECCC}, eprint = {TR94-003}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR94-003.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BabaiFNW93, author = {L{\'{a}}szl{\'{o}} Babai and Lance Fortnow and Noam Nisan and Avi Wigderson}, title = {{BPP} Has Subexponential Time Simulations Unless {EXPTIME} has Publishable Proofs}, journal = {Comput. Complex.}, volume = {3}, pages = {307--318}, year = {1993}, url = {https://doi.org/10.1007/BF01275486}, doi = {10.1007/BF01275486}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/BabaiFNW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/FeldmanINNRS93, author = {David Feldman and Russell Impagliazzo and Moni Naor and Noam Nisan and Steven Rudich and Adi Shamir}, title = {On Dice and Coins: Models of Computation for Random Generation}, journal = {Inf. Comput.}, volume = {104}, number = {2}, pages = {159--174}, year = {1993}, url = {https://doi.org/10.1006/inco.1993.1028}, doi = {10.1006/INCO.1993.1028}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FeldmanINNRS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/LinialMN93, author = {Nathan Linial and Yishay Mansour and Noam Nisan}, title = {Constant Depth Circuits, Fourier Transform, and Learnability}, journal = {J. {ACM}}, volume = {40}, number = {3}, pages = {607--620}, year = {1993}, url = {https://doi.org/10.1145/174130.174138}, doi = {10.1145/174130.174138}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/LinialMN93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mor/KarpMN93, author = {Richard M. Karp and Rajeev Motwani and Noam Nisan}, title = {Probabilistic Analysis of Network Flow Algorithms}, journal = {Math. Oper. Res.}, volume = {18}, number = {1}, pages = {71--97}, year = {1993}, url = {https://doi.org/10.1287/moor.18.1.71}, doi = {10.1287/MOOR.18.1.71}, timestamp = {Thu, 02 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mor/KarpMN93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/ImpagliazzoN93, author = {Russell Impagliazzo and Noam Nisan}, title = {The Effect of Random Restrictions on Formula Size}, journal = {Random Struct. Algorithms}, volume = {4}, number = {2}, pages = {121--134}, year = {1993}, url = {https://doi.org/10.1002/rsa.3240040202}, doi = {10.1002/RSA.3240040202}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/ImpagliazzoN93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/NisanW93, author = {Noam Nisan and Avi Wigderson}, title = {Rounds in Communication Complexity Revisited}, journal = {{SIAM} J. Comput.}, volume = {22}, number = {1}, pages = {211--219}, year = {1993}, url = {https://doi.org/10.1137/0222016}, doi = {10.1137/0222016}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/NisanW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MansourNT93, author = {Yishay Mansour and Noam Nisan and Prasoon Tiwari}, title = {The Computational Complexity of Universal Hashing}, journal = {Theor. Comput. Sci.}, volume = {107}, number = {1}, pages = {121--133}, year = {1993}, url = {https://doi.org/10.1016/0304-3975(93)90257-T}, doi = {10.1016/0304-3975(93)90257-T}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MansourNT93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Nisan93, author = {Noam Nisan}, title = {On Read-Once vs. Multiple Access to Randomness in Logspace}, journal = {Theor. Comput. Sci.}, volume = {107}, number = {1}, pages = {135--144}, year = {1993}, url = {https://doi.org/10.1016/0304-3975(93)90258-U}, doi = {10.1016/0304-3975(93)90258-U}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Nisan93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NisanZ93, author = {Noam Nisan and David Zuckerman}, editor = {S. Rao Kosaraju and David S. Johnson and Alok Aggarwal}, title = {More deterministic simulation in logspace}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, {USA}}, pages = {235--244}, publisher = {{ACM}}, year = {1993}, url = {https://doi.org/10.1145/167088.167162}, doi = {10.1145/167088.167162}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NisanZ93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LubyN93, author = {Michael Luby and Noam Nisan}, editor = {S. Rao Kosaraju and David S. Johnson and Alok Aggarwal}, title = {A parallel approximation algorithm for positive linear programming}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, {USA}}, pages = {448--457}, publisher = {{ACM}}, year = {1993}, url = {https://doi.org/10.1145/167088.167211}, doi = {10.1145/167088.167211}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LubyN93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0069194, author = {Noam Nisan}, title = {Using hard problems to create pseudorandom generators}, series = {{ACM} Distinguished Dissertations}, publisher = {{MIT} Press}, year = {1992}, isbn = {978-0-262-14051-5}, timestamp = {Fri, 29 Apr 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0069194.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/Nisan92, author = {Noam Nisan}, title = {Pseudorandom generators for space-bounded computation}, journal = {Comb.}, volume = {12}, number = {4}, pages = {449--461}, year = {1992}, url = {https://doi.org/10.1007/BF01305237}, doi = {10.1007/BF01305237}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/Nisan92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/LundFKN92, author = {Carsten Lund and Lance Fortnow and Howard J. Karloff and Noam Nisan}, title = {Algebraic Methods for Interactive Proof Systems}, journal = {J. {ACM}}, volume = {39}, number = {4}, pages = {859--868}, year = {1992}, url = {https://doi.org/10.1145/146585.146605}, doi = {10.1145/146585.146605}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/LundFKN92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BabaiNS92, author = {L{\'{a}}szl{\'{o}} Babai and Noam Nisan and Mario Szegedy}, title = {Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs}, journal = {J. Comput. Syst. Sci.}, volume = {45}, number = {2}, pages = {204--232}, year = {1992}, url = {https://doi.org/10.1016/0022-0000(92)90047-M}, doi = {10.1016/0022-0000(92)90047-M}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/BabaiNS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/KarchmerKN92, author = {Mauricio Karchmer and Eyal Kushilevitz and Noam Nisan}, title = {Fractional Covers and Communication Complexity}, booktitle = {Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, Massachusetts, USA, June 22-25, 1992}, pages = {262--274}, publisher = {{IEEE} Computer Society}, year = {1992}, url = {https://doi.org/10.1109/SCT.1992.215401}, doi = {10.1109/SCT.1992.215401}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/KarchmerKN92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/NisanSW92, author = {Noam Nisan and Endre Szemer{\'{e}}di and Avi Wigderson}, title = {Undirected Connectivity in O(log {\^{}}1.5 n) Space}, booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992}, pages = {24--29}, publisher = {{IEEE} Computer Society}, year = {1992}, url = {https://doi.org/10.1109/SFCS.1992.267822}, doi = {10.1109/SFCS.1992.267822}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/NisanSW92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/KargerNP92, author = {David R. Karger and Noam Nisan and Michal Parnas}, editor = {Lawrence Snyder}, title = {Fast Connected Components Algorithms for the {EREW} {PRAM}}, booktitle = {Proceedings of the 4th Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '92, San Diego, CA, USA, June 29 - July 1, 1992}, pages = {373--381}, publisher = {{ACM}}, year = {1992}, url = {https://doi.org/10.1145/140901.141920}, doi = {10.1145/140901.141920}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spaa/KargerNP92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/EvenGLNV92, author = {Guy Even and Oded Goldreich and Michael Luby and Noam Nisan and Boban Velickovic}, editor = {S. Rao Kosaraju and Mike Fellows and Avi Wigderson and John A. Ellis}, title = {Approximations of General Independent Distributions}, booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada}, pages = {10--16}, publisher = {{ACM}}, year = {1992}, url = {https://doi.org/10.1145/129712.129714}, doi = {10.1145/129712.129714}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/EvenGLNV92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NisanS92, author = {Noam Nisan and Mario Szegedy}, editor = {S. Rao Kosaraju and Mike Fellows and Avi Wigderson and John A. Ellis}, title = {On the Degree of Boolean Functions as Real Polynomials}, booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada}, pages = {462--467}, publisher = {{ACM}}, year = {1992}, url = {https://doi.org/10.1145/129712.129757}, doi = {10.1145/129712.129757}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NisanS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Nisan92, author = {Noam Nisan}, editor = {S. Rao Kosaraju and Mike Fellows and Avi Wigderson and John A. Ellis}, title = {{RL} {\(\subseteq\)} {SC}}, booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada}, pages = {619--623}, publisher = {{ACM}}, year = {1992}, url = {https://doi.org/10.1145/129712.129772}, doi = {10.1145/129712.129772}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Nisan92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/Nisan91, author = {Noam Nisan}, title = {Pseudorandom bits for constant depth circuits}, journal = {Comb.}, volume = {11}, number = {1}, pages = {63--70}, year = {1991}, url = {https://doi.org/10.1007/BF01375474}, doi = {10.1007/BF01375474}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/Nisan91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Nisan91, author = {Noam Nisan}, title = {{CREW} PRAMs and Decision Trees}, journal = {{SIAM} J. Comput.}, volume = {20}, number = {6}, pages = {999--1007}, year = {1991}, url = {https://doi.org/10.1137/0220062}, doi = {10.1137/0220062}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Nisan91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BabaiN91, author = {L{\'{a}}szl{\'{o}} Babai and Noam Nisan}, title = {{BPP} has Subexponential Time Simulation unless {EXPTIME} has Pubishable Proofs}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {213--219}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160263}, doi = {10.1109/SCT.1991.160263}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BabaiN91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Nisan91, author = {Noam Nisan}, editor = {Cris Koutsougeras and Jeffrey Scott Vitter}, title = {Lower Bounds for Non-Commutative Computation (Extended Abstract)}, booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, {USA}}, pages = {410--418}, publisher = {{ACM}}, year = {1991}, url = {https://doi.org/10.1145/103418.103462}, doi = {10.1145/103418.103462}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Nisan91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NisanW91, author = {Noam Nisan and Avi Wigderson}, editor = {Cris Koutsougeras and Jeffrey Scott Vitter}, title = {Rounds in Communication Complexity Revisited}, booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, {USA}}, pages = {419--429}, publisher = {{ACM}}, year = {1991}, url = {https://doi.org/10.1145/103418.103463}, doi = {10.1145/103418.103463}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NisanW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/LinialN90, author = {Nathan Linial and Noam Nisan}, title = {Approximate inclusion-exclusion}, journal = {Comb.}, volume = {10}, number = {4}, pages = {349--365}, year = {1990}, url = {https://doi.org/10.1007/BF02128670}, doi = {10.1007/BF02128670}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/LinialN90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/MansourNT90, author = {Yishay Mansour and Noam Nisan and Prasoon Tiwari}, title = {The Computational Complexity of Universal Hashing}, booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July 8-11, 1990}, pages = {90}, publisher = {{IEEE} Computer Society}, year = {1990}, url = {https://doi.org/10.1109/SCT.1990.113957}, doi = {10.1109/SCT.1990.113957}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/MansourNT90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/FeigenbaumKN90, author = {Joan Feigenbaum and Sampath Kannan and Noam Nisan}, title = {Lower Bounds on Random-Self-Reducibility}, booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July 8-11, 1990}, pages = {100--109}, publisher = {{IEEE} Computer Society}, year = {1990}, url = {https://doi.org/10.1109/SCT.1990.113959}, doi = {10.1109/SCT.1990.113959}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/FeigenbaumKN90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Nisan90, author = {Noam Nisan}, title = {On Read-Once vs. Multiple Access to Randomness in Logspace}, booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July 8-11, 1990}, pages = {179--184}, publisher = {{IEEE} Computer Society}, year = {1990}, url = {https://doi.org/10.1109/SCT.1990.113966}, doi = {10.1109/SCT.1990.113966}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Nisan90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LundFKN90, author = {Carsten Lund and Lance Fortnow and Howard J. Karloff and Noam Nisan}, title = {Algebraic Methods for Interactive Proof Systems}, booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume {I}}, pages = {2--10}, publisher = {{IEEE} Computer Society}, year = {1990}, url = {https://doi.org/10.1109/FSCS.1990.89518}, doi = {10.1109/FSCS.1990.89518}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LundFKN90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Nisan90, author = {Noam Nisan}, editor = {Harriet Ortiz}, title = {Psuedorandom Generators for Space-Bounded Computation}, booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, {USA}}, pages = {204--212}, publisher = {{ACM}}, year = {1990}, url = {https://doi.org/10.1145/100216.100242}, doi = {10.1145/100216.100242}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Nisan90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MansourNT90, author = {Yishay Mansour and Noam Nisan and Prasoon Tiwari}, editor = {Harriet Ortiz}, title = {The Computational Complexity of Universal Hashing}, booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, {USA}}, pages = {235--243}, publisher = {{ACM}}, year = {1990}, url = {https://doi.org/10.1145/100216.100246}, doi = {10.1145/100216.100246}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/MansourNT90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LinialN90, author = {Nathan Linial and Noam Nisan}, editor = {Harriet Ortiz}, title = {Approximate Inclusion-Exclusion}, booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, {USA}}, pages = {260--270}, publisher = {{ACM}}, year = {1990}, url = {https://doi.org/10.1145/100216.100250}, doi = {10.1145/100216.100250}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LinialN90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/NisanS89, author = {Noam Nisan and Danny Soroker}, title = {Parallel Algorithms for Zero-One Supply-Demand Problems}, journal = {{SIAM} J. Discret. Math.}, volume = {2}, number = {1}, pages = {108--125}, year = {1989}, url = {https://doi.org/10.1137/0402012}, doi = {10.1137/0402012}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/NisanS89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Nisan89, author = {Noam Nisan and Avi Wigderson}, title = {Hardness vs. Randomness - {A} Survey (abstract)}, booktitle = {Proceedings: Fourth Annual Structure in Complexity Theory Conference, University of Oregon, Eugene, Oregon, USA, June 19-22, 1989}, pages = {54}, publisher = {{IEEE} Computer Society}, year = {1989}, url = {https://doi.org/10.1109/SCT.1989.41802}, doi = {10.1109/SCT.1989.41802}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Nisan89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LinialMN89, author = {Nathan Linial and Yishay Mansour and Noam Nisan}, title = {Constant Depth Circuits, Fourier Transform, and Learnability}, booktitle = {30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989}, pages = {574--579}, publisher = {{IEEE} Computer Society}, year = {1989}, url = {https://doi.org/10.1109/SFCS.1989.63537}, doi = {10.1109/SFCS.1989.63537}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LinialMN89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FeldmanINNRS89, author = {David Feldman and Russell Impagliazzo and Moni Naor and Noam Nisan and Steven Rudich and Adi Shamir}, editor = {Giorgio Ausiello and Mariangiola Dezani{-}Ciancaglini and Simona Ronchi Della Rocca}, title = {On Dice and Coins: Models of Computation for Random Generation}, booktitle = {Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {372}, pages = {319--340}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/BFb0035769}, doi = {10.1007/BFB0035769}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FeldmanINNRS89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BabaiNS89, author = {L{\'{a}}szl{\'{o}} Babai and Noam Nisan and Mario Szegedy}, editor = {David S. Johnson}, title = {Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract)}, booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, {USA}}, pages = {1--11}, publisher = {{ACM}}, year = {1989}, url = {https://doi.org/10.1145/73007.73008}, doi = {10.1145/73007.73008}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BabaiNS89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Nisan89, author = {Noam Nisan}, editor = {David S. Johnson}, title = {{CREW} PRAMs and Decision Trees}, booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, {USA}}, pages = {327--335}, publisher = {{ACM}}, year = {1989}, url = {https://doi.org/10.1145/73007.73038}, doi = {10.1145/73007.73038}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Nisan89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/NisanW88, author = {Noam Nisan and Avi Wigderson}, title = {Hardness vs. Randomness (Extended Abstract)}, booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988}, pages = {2--11}, publisher = {{IEEE} Computer Society}, year = {1988}, url = {https://doi.org/10.1109/SFCS.1988.21916}, doi = {10.1109/SFCS.1988.21916}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/NisanW88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.