Noam Nisan - RankMe

269 papers A* 89A 9B 7Journal 138Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Existence of Optimal Mechanisms for Selling Multiple Goods: An Elementary Proof. CoRR Sergiu Hart, Noam Nisan
2025	J	`jnl`	Complexity of Unambiguous Problems in Σ CoRR Matan Gilboa, Paul W. Goldberg, Elias Koutsoupias, Noam Nisan
2025	J	`jnl`	Does Your Blockchain Need Multidimensional Transaction Fees? CoRR Nir Lavee, Noam Nisan, Mallesh M. Pai, Max Resnick
2025	A*	`conf`	On the Welfare of EIP-1559 with Patient Bidders. EC Moshe Babaioff, Noam Nisan
2025	J	`jnl`	On the Welfare of EIP-1559 with Patient Bidders. CoRR Moshe Babaioff, Noam Nisan
2025	J	`jnl`	Online Block Packing. CoRR Ariel Ben Eliezer, Noam Nisan
2025	J	`jnl`	The Root of Revenue Continuity. CoRR Sergiu Hart, Noam Nisan
2024	A*	`conf`	Learning to Maximize Gains From Trade in Small Markets. EC Moshe Babaioff, Amitai Frey, Noam Nisan
2024	J	`jnl`	Learning to Maximize Gains From Trade in Small Markets. CoRR Moshe Babaioff, Amitai Frey, Noam Nisan
2023	J	`jnl`	Asynchronous Proportional Response Dynamics in Markets with Adversarial Scheduling. CoRR Yoav Kolumbus, Menahem Levy, Noam Nisan
2023	A*	`conf`	Asynchronous Proportional Response Dynamics: Convergence in Markets with Adversarial Scheduling. NeurIPS Yoav Kolumbus, Menahem Levy, Noam Nisan
2023	J	`jnl`	Serial Monopoly on Blockchains. CoRR Noam Nisan
2022	A*	`conf`	Auctions between Regret-Minimizing Agents. WWW Yoav Kolumbus, Noam Nisan
2022	B	`conf`	Complexity of Public Goods Games on Graphs. SAGT Matan Gilboa, Noam Nisan
2022	J	`jnl`	Complexity of Public Goods Games on Graphs. CoRR Matan Gilboa, Noam Nisan
2022	J	`jnl`	Finding a Hidden Edge. CoRR Ron Kupfer, Noam Nisan
2022	A*	`conf`	How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agents. NeurIPS Yoav Kolumbus, Noam Nisan
2022	J	`jnl`	Monotonic Mechanisms for Selling Multiple Goods. CoRR Ran Ben Moshe, Sergiu Hart, Noam Nisan
2022	A*	`conf`	The Query Complexity of Cake Cutting. NeurIPS Simina Brânzei, Noam Nisan
2022	J	`jnl`	The menu-size complexity of revenue approximation. Games Econ. Behav. Moshe Babaioff, Yannai A. Gonczarowski, Noam Nisan
2021	J	`jnl`	Auctions Between Regret-Minimizing Agents. CoRR Yoav Kolumbus, Noam Nisan
2021	—	`conf`	Beyond Pigouvian Taxes: A Worst Case Analysis. WINE Moshe Babaioff, Ruty Mundel, Noam Nisan
2021	J	`jnl`	Beyond Pigouvian Taxes: A Worst Case Analysis. CoRR Moshe Babaioff, Ruty Mundel, Noam Nisan
2021	A*	`conf`	Bipartite perfect matching as a real polynomial. STOC Gal Beniamini, Noam Nisan
2021	J	`jnl`	Competitive Equilibrium with Indivisible Goods and Generic Budgets. Math. Oper. Res. Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen
2021	J	`jnl`	How and Why to Manipulate Your Own Agent. CoRR Yoav Kolumbus, Noam Nisan
2021	A*	`conf`	The Demand Query Model for Bipartite Matching. SODA Noam Nisan
2020	J	`jnl`	Bipartite Perfect Matching as a Real Polynomial. CoRR Gal Beniamini, Noam Nisan
2020	A*	`conf`	Designing Committees for Mitigating Biases. AAAI Michal Feldman, Yishay Mansour, Noam Nisan, Sigal Oren, Moshe Tennenholtz
2020	J	`jnl`	On the Effectiveness of Tracking and Testing in SEIR Models. CoRR Yoav Kolumbus, Noam Nisan
2019	J	`jnl`	A stable marriage requires communication. Games Econ. Behav. Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum
2019	A*	`conf`	Communication Complexity of Cake Cutting. EC Simina Brânzei, Noam Nisan
2019	J	`jnl`	Competitive Equilibrium with Generic Budgets: Beyond Additive. CoRR Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen
2019	J	`jnl`	Economic efficiency requires interaction. Games Econ. Behav. Shahar Dobzinski, Noam Nisan, Sigal Oren
2019	—	`conf`	Fair Allocation through Competitive Equilibrium from Generic Incomes. FAT Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen
2019	J	`jnl`	Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements. CoRR Yannai A. Gonczarowski, Lior Kovalio, Noam Nisan, Assaf Romm
2019	A*	`conf`	Matching for the Israeli: Handling Rich Diversity Requirements. EC Yannai A. Gonczarowski, Noam Nisan, Lior Kovalio, Assaf Romm
2019	J	`jnl`	Selling multiple correlated goods: Revenue maximization and menu-size complexity. J. Econ. Theory Sergiu Hart, Noam Nisan
2019	J	`jnl`	The Demand Query Model for Bipartite Matching. CoRR Noam Nisan
2019	A*	`conf`	The communication complexity of local search. STOC Yakov Babichenko, Shahar Dobzinski, Noam Nisan
2018	A*	`conf`	Optimal Deterministic Mechanisms for an Additive Buyer. EC Moshe Babaioff, Noam Nisan, Aviad Rubinstein
2018	J	`jnl`	Optimal Deterministic Mechanisms for an Additive Buyer. CoRR Moshe Babaioff, Noam Nisan, Aviad Rubinstein
2018	J	`jnl`	Public Projects, Boolean Functions, and the Borders of Border's Theorem. ACM Trans. Economics and Comput. Parikshit Gopalan, Noam Nisan, Tim Roughgarden
2018	J	`jnl`	The Communication Complexity of Local Search. CoRR Yakov Babichenko, Shahar Dobzinski, Noam Nisan
2018	J	`jnl`	The query complexity of correlated equilibria. Games Econ. Behav. Sergiu Hart, Noam Nisan
2018	A*	`conf`	Universal Growth in Production Economies. NeurIPS Simina Brânzei, Ruta Mehta, Noam Nisan
2018	J	`jnl`	Universal Growth in Production Economies. CoRR Simina Brânzei, Ruta Mehta, Noam Nisan
2017	A*	`conf`	A "Quantal Regret" Method for Structural Econometrics in Repeated Games. EC Noam Nisan, Gali Noti
2017	J	`jnl`	A "Quantal Regret" Method for Structural Econometrics in Repeated Games. CoRR Noam Nisan, Gali Noti
2017	A*	`conf`	An Experimental Evaluation of Regret-Based Econometrics. WWW Noam Nisan, Gali Noti
2017	J	`jnl`	Approximate revenue maximization with multiple items. J. Econ. Theory Sergiu Hart, Noam Nisan
2017	J	`jnl`	Communication Complexity of Cake Cutting. CoRR Simina Brânzei, Noam Nisan
2017	J	`jnl`	Competitive Equilibria with Indivisible Goods and Generic Budgets. CoRR Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen
2017	—	`conf`	ERA: A Framework for Economic Resource Allocation for the Cloud. WWW (Companion Volume) Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat
2017	J	`jnl`	ERA: A Framework for Economic Resource Allocation for the Cloud. CoRR Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat
2017	A*	`conf`	Efficient empirical revenue maximization in single-parameter auction environments. STOC Yannai A. Gonczarowski, Noam Nisan
2017	A*	`conf`	Selling Complementary Goods: Dynamics, Efficiency and Revenue. ICALP Moshe Babaioff, Liad Blumrosen, Noam Nisan
2017	J	`jnl`	Selling Complementary Goods: Dynamics, Efficiency and Revenue. CoRR Moshe Babaioff, Liad Blumrosen, Noam Nisan
2017	J	`jnl`	The Query Complexity of Cake Cutting. CoRR Simina Brânzei, Noam Nisan
2017	A*	`conf`	The menu-size complexity of revenue approximation. STOC Moshe Babaioff, Yannai A. Gonczarowski, Noam Nisan
2016	J	`jnl`	An Experimental Evaluation of Regret-Based Econometrics. CoRR Noam Nisan, Gali Noti
2016	—	`conf`	Correlated and Coarse Equilibria of Single-Item Auctions. WINE Michal Feldman, Brendan Lucier, Noam Nisan
2016	J	`jnl`	Correlated- and Coarse- equilibria of Single-item auctions. CoRR Michal Feldman, Brendan Lucier, Noam Nisan
2016	J	`jnl`	Efficient Empirical Revenue Maximization in Single-Parameter Auction Environments. CoRR Yannai A. Gonczarowski, Noam Nisan
2016	A*	`conf`	Knuth Prize Lecture: Complexity of Communication in Markets. FOCS Noam Nisan
2016	A*	`conf`	Networks of Complements. ICALP Moshe Babaioff, Liad Blumrosen, Noam Nisan
2016	J	`jnl`	Networks of Complements. CoRR Moshe Babaioff, Liad Blumrosen, Noam Nisan
2016	A	`conf`	Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. ITCS Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson
2016	J	`jnl`	The AND-OR Game. ACM Trans. Economics and Comput. Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2016	J	`jnl`	The Menu-Size Complexity of Revenue Approximation. CoRR Moshe Babaioff, Yannai A. Gonczarowski, Noam Nisan
2015	A*	`conf`	A Stable Marriage Requires Communication. SODA Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum
2015	J	`jnl`	Multi-unit auctions: Beyond Roberts. J. Econ. Theory Shahar Dobzinski, Noam Nisan
2015	J	`jnl`	Online ascending auctions for gradually expiring items. J. Econ. Theory Ron Lavi, Noam Nisan
2015	A*	`conf`	Public Projects, Boolean Functions, and the Borders of Border's Theorem. EC Parikshit Gopalan, Noam Nisan, Tim Roughgarden
2015	J	`jnl`	Public projects, Boolean functions and the borders of Border's theorem. CoRR Parikshit Gopalan, Noam Nisan, Tim Roughgarden
2015	J	`jnl`	Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. CoRR Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson
2015	J	`jnl`	Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson
2015	A*	`conf`	Welfare Maximization with Limited Interaction. FOCS Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
2015	J	`jnl`	Welfare Maximization with Limited Interaction. CoRR Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
2015	J	`jnl`	Welfare Maximization with Limited Interaction. Electron. Colloquium Comput. Complex. Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
2014	J	`jnl`	A Stable Marriage Requires Communication. CoRR Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum
2014	A*	`conf`	An experimental evaluation of bidders' behavior in ad auctions. WWW Gali Noti, Noam Nisan, Ilan Yaniv
2014	A*	`conf`	Economic efficiency requires interaction. STOC Shahar Dobzinski, Noam Nisan, Sigal Oren
2014	J	`jnl`	Mechanisms for Multi-Unit Auctions. CoRR Shahar Dobzinski, Noam Nisan
2014	J	`jnl`	Mixed Strategies in Combinatorial Agency. CoRR Moshe Babaioff, Michal Feldman, Noam Nisan
2014	A*	`conf`	On the efficiency of the walrasian mechanism. EC Moshe Babaioff, Brendan Lucier, Noam Nisan, Renato Paes Leme
2014	J	`jnl`	Price Competition in Online Combinatorial Markets. CoRR Moshe Babaioff, Noam Nisan, Renato Paes Leme
2014	A*	`conf`	Price competition in online combinatorial markets. WWW Moshe Babaioff, Noam Nisan, Renato Paes Leme
2014	—	`conf`	Sampling and Representation Complexity of Revenue Maximization. WINE Shaddin Dughmi, Li Han, Noam Nisan
2014	J	`jnl`	Sampling and Representation Complexity of Revenue Maximization. CoRR Shaddin Dughmi, Li Han, Noam Nisan
2013	J	`jnl`	Bertrand Networks CoRR Moshe Babaioff, Brendan Lucier, Noam Nisan
2013	A*	`conf`	Bertrand networks. EC Moshe Babaioff, Brendan Lucier, Noam Nisan
2013	J	`jnl`	Economic Efficiency Requires Interaction. CoRR Shahar Dobzinski, Noam Nisan, Sigal Oren
2013	J	`jnl`	Electronic Markets and Auctions (Dagstuhl Seminar 13461). Dagstuhl Reports Yishay Mansour, Benny Moldovanu, Noam Nisan, Berthold Vöcking
2013	J	`jnl`	Introduction to the Special Issue on Algorithmic Game Theory. ACM Trans. Economics and Comput. Michal Feldman, Noam Nisan
2013	J	`jnl`	On the Efficiency of the Walrasian Mechanism. CoRR Moshe Babaioff, Brendan Lucier, Noam Nisan, Renato Paes Leme
2013	J	`jnl`	The Menu-Size Complexity of Auctions CoRR Sergiu Hart, Noam Nisan
2013	J	`jnl`	The Query Complexity of Correlated Equilibria CoRR Sergiu Hart, Noam Nisan
2013	A*	`conf`	The menu-size complexity of auctions. EC Sergiu Hart, Noam Nisan
2012	J	`jnl`	Approximate Revenue Maximization with Multiple Items CoRR Sergiu Hart, Noam Nisan
2012	A*	`conf`	Approximate revenue maximization with multiple items. EC Sergiu Hart, Noam Nisan
2012	J	`jnl`	Combinatorial agency. J. Econ. Theory Moshe Babaioff, Michal Feldman, Noam Nisan, Eyal Winter
2012	J	`jnl`	Doubleclick Ad Exchange Auction CoRR Yishay Mansour, S. Muthukrishnan, Noam Nisan
2012	J	`jnl`	Fair Allocation Without Trade CoRR Avital Gutman, Noam Nisan
2012	A	`conf`	Fair allocation without trade. AAMAS Avital Gutman, Noam Nisan
2012	J	`jnl`	Incentive Compatible Two Player Cake Cutting CoRR Avishay Maya, Noam Nisan
2012	—	`conf`	Incentive Compatible Two Player Cake Cutting. WINE Avishay Maya, Noam Nisan
2012	J	`jnl`	Multi-unit auctions with budget limits. Games Econ. Behav. Shahar Dobzinski, Ron Lavi, Noam Nisan
2012	A*	`conf`	Sketching valuation functions. SODA Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden
2012	—	`conf`	The AND-OR Game: Equilibrium Characterization - (Working Paper). WINE Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2012	J	`jnl`	The AND-OR game: Equilibrium Characterization (Working Paper) CoRR Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2012	J	`jnl`	Truthful randomized mechanisms for combinatorial auctions. J. Comput. Syst. Sci. Shahar Dobzinski, Noam Nisan, Michael Schapira
2011	J	`jnl`	A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives CoRR Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan
2011	J	`jnl`	A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. SIAM J. Comput. Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan
2011	J	`jnl`	Auctions with Severely Bounded Communication CoRR Liad Blumrosen, Noam Nisan, Ilya Segal
2011	A	`conf`	Best-Response Mechanisms. ICS Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar
2011	A*	`conf`	Best-response auctions. EC Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar
2011	J	`jnl`	Computationally Feasible VCG Mechanisms CoRR Noam Nisan, Amir Ronen
2011	J	`jnl`	Concurrent Auctions Across The Supply Chain CoRR Moshe Babaioff, Noam Nisan
2011	A*	`conf`	Incentive-compatible distributed greedy protocols. PODC Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar
2011	J	`jnl`	Limitations of VCG-based mechanisms. Comb. Shahar Dobzinski, Noam Nisan
2011	A*	`conf`	Multi-unit auctions: beyond roberts. EC Shahar Dobzinski, Noam Nisan
2011	J	`jnl`	Non-Price Equilibria in Markets of Discrete Goods CoRR Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2011	A*	`conf`	Non-price equilibria in markets of discrete goods. EC Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2011	—	`ch.`	On Constructing 1-1 One-Way Functions. Studies in Complexity and Cryptography Oded Goldreich, Leonid A. Levin, Noam Nisan
2011	—	`ch.`	On Yao's XOR-Lemma. Studies in Complexity and Cryptography Oded Goldreich, Noam Nisan, Avi Wigderson
2011	J	`jnl`	When is it best to best-respond? SIGecom Exch. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar
2010	J	`jnl`	Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. Math. Oper. Res. Shahar Dobzinski, Noam Nisan, Michael Schapira
2010	A*	`conf`	Google's Auction for TV Ads. SODA Noam Nisan
2010	J	`jnl`	Informational limitations of ascending combinatorial auctions. J. Econ. Theory Liad Blumrosen, Noam Nisan
2010	J	`jnl`	Mechanisms for Multi-Unit Auctions. J. Artif. Intell. Res. Shahar Dobzinski, Noam Nisan
2010	J	`jnl`	Mixed Strategies in Combinatorial Agency. J. Artif. Intell. Res. Moshe Babaioff, Michal Feldman, Noam Nisan
2010	J	`jnl`	Multi-Unit Auctions: Beyond Roberts CoRR Shahar Dobzinski, Noam Nisan
2009	B	`conf`	A Modular Approach to Roberts' Theorem. SAGT Shahar Dobzinski, Noam Nisan
2009	A	`conf`	A synthesis course in hardware architecture, compilers, and software engineering. SIGCSE Shimon Schocken, Noam Nisan, Michal Armoni
2009	B	`conf`	Free-Riding and Free-Labor in Combinatorial Agency. SAGT Moshe Babaioff, Michal Feldman, Noam Nisan
2009	A	`conf`	Google's Auction for TV Ads. ESA Noam Nisan
2009	—	`conf`	Google's Auction for TV Ads. ICALP (2) Noam Nisan, Jason Bayer, Deepak Chandra, Tal Franji, Robert Gardner, Yossi Matias, Neil Rhodes, Misha Seltzer, Danny Tom, Hal R. Varian, Dan Zigmond
2009	J	`jnl`	Mechanisms for a spatially distributed market. Games Econ. Behav. Moshe Babaioff, Noam Nisan, Elan Pavlov
2009	J	`jnl`	On the Computational Power of Demand Queries. SIAM J. Comput. Liad Blumrosen, Noam Nisan
2009	J	`jnl`	Two simplified proofs for Roberts' theorem. Soc. Choice Welf. Ron Lavi, Ahuva Mu'alem, Noam Nisan
2008	—	`conf`	Asynchronous Best-Reply Dynamics. WINE Noam Nisan, Michael Schapira, Aviv Zohar
2008	J	`jnl`	Compact name-independent routing with minimum stretch. ACM Trans. Algorithms Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
2008	A*	`conf`	Elections Can be Manipulated Often. FOCS Ehud Friedgut, Gil Kalai, Noam Nisan
2008	A*	`conf`	FairplayMP: a system for secure multi-party computation. CCS Assaf Ben-David, Noam Nisan, Benny Pinkas
2008	A*	`conf`	Multi-unit Auctions with Budget Limits. FOCS Shahar Dobzinski, Ron Lavi, Noam Nisan
2008	—	`book`	The Elements of Computing Systems - Building a Modern Computer from First Principles. Noam Nisan, Shimon Schocken
2008	J	`jnl`	Theory research at Google. SIGACT News Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos
2008	J	`jnl`	Truthful approximation mechanisms for restricted combinatorial auctions. Games Econ. Behav. Ahuva Mu'alem, Noam Nisan
2007	—	`book`	Algorithmic Game Theory Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay V. Vazirani
2007	J	`jnl`	Auctions with Severely Bounded Communication. J. Artif. Intell. Res. Liad Blumrosen, Noam Nisan, Ilya Segal
2007	J	`jnl`	Computationally Feasible VCG Mechanisms. J. Artif. Intell. Res. Noam Nisan, Amir Ronen
2007	A*	`conf`	Limitations of VCG-based mechanisms. STOC Shahar Dobzinski, Noam Nisan
2007	A*	`conf`	Mechanisms for multi-unit auctions. EC Shahar Dobzinski, Noam Nisan
2006	J	`jnl`	A Note on the computational hardness of evolutionary stable strategies. Electron. Colloquium Comput. Complex. Noam Nisan
2006	J	`jnl`	Approximations by Computationally-Efficient VCG-Based Mechanisms. Electron. Colloquium Comput. Complex. Shahar Dobzinski, Noam Nisan
2006	A*	`conf`	Combinatorial agency. EC Moshe Babaioff, Michal Feldman, Noam Nisan
2006	J	`jnl`	Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. Benny Lehmann, Daniel Lehmann, Noam Nisan
2006	—	`conf`	Mixed Strategies in Combinatorial Agency. WINE Moshe Babaioff, Michal Feldman, Noam Nisan
2006	J	`jnl`	The communication requirements of efficient allocations and supporting prices. J. Econ. Theory Noam Nisan, Ilya Segal
2006	A*	`conf`	Truthful randomized mechanisms for combinatorial auctions. STOC Shahar Dobzinski, Noam Nisan, Michael Schapira
2005	A*	`conf`	Approximation algorithms for combinatorial auctions with complement-free bidders. STOC Shahar Dobzinski, Noam Nisan, Michael Schapira
2005	B	`conf`	Exponential communication inefficiency of demand queries. TARK Noam Nisan, Ilya Segal
2005	A*	`conf`	On the computational power of iterative auctions. EC Liad Blumrosen, Noam Nisan
2005	A*	`conf`	Online ascending auctions for gradually expiring items. SODA Ron Lavi, Noam Nisan
2005	—	`book`	The Elements of Computing Systems - Building a Modern Computer from First Principles. Noam Nisan, Shimon Schocken
2004	B	`conf`	Compact name-independent routing with minimum stretch. SPAA Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
2004	J	`jnl`	Competitive analysis of incentive compatible on-line auctions. Theor. Comput. Sci. Ron Lavi, Noam Nisan
2004	J	`jnl`	Concurrent Auctions Across The Supply Chain. J. Artif. Intell. Res. Moshe Babaioff, Noam Nisan
2004	A*	`conf`	Fairplay - Secure Two-Party Computation System. USENIX Security Symposium Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella
2004	A*	`conf`	Mechanisms for a spatially distributed market. EC Moshe Babaioff, Noam Nisan, Elan Pavlov
2003	B	`conf`	Incentive compatible multi unit combinatorial auctions. TARK Yair Bartal, Rica Gonen, Noam Nisan
2003	A	`conf`	Multi-player and Multi-round Auctions with Severely Bounded Communication. ESA Liad Blumrosen, Noam Nisan, Ilya Segal
2003	A*	`ed.`	Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9-12, 2003 EC Daniel A. Menascé, Noam Nisan
2003	A*	`conf`	Towards a Characterization of Truthful Combinatorial Auctions. FOCS Ron Lavi, Ahuva Mu'alem, Noam Nisan
2002	A*	`conf`	Auctions with Severely Bounded Communication. FOCS Liad Blumrosen, Noam Nisan
2002	J	`jnl`	Combinatorial Auctions with Decreasing Marginal Utilities CoRR Benny Lehmann, Daniel Lehmann, Noam Nisan
2002	A*	`conf`	The Communication Complexity of Approximate Set Packing and Covering. ICALP Noam Nisan
2002	—	`conf`	Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. AAAI/IAAI Ahuva Mu'alem, Noam Nisan
2001	J	`jnl`	Algorithmic Mechanism Design. Games Econ. Behav. Noam Nisan, Amir Ronen
2001	A*	`conf`	An efficient approximate allocation algorithm for combinatorial auctions. EC Edo Zurel, Noam Nisan
2001	A*	`conf`	Combinatorial auctions with decreasing marginal utilities. EC Benny Lehmann, Daniel Lehmann, Noam Nisan
2001	A*	`conf`	Concurrent auctions across the supply chain. EC Moshe Babaioff, Noam Nisan
2001	J	`jnl`	Errata for: "On randomized one-round communication complexity". Comput. Complex. Ilan Kremer, Noam Nisan, Dana Ron
2001	J	`jnl`	Neighborhood Preserving Hashing and Approximate Queries. SIAM J. Discret. Math. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
2001	—	`conf`	On-Line Markets for Distributed Object Services: The MAJIC System. USITS Lior Levy, Liad Blumrosen, Noam Nisan
2000	A*	`conf`	Bidding and allocation in combinatorial auctions. EC Noam Nisan
2000	A*	`conf`	Competitive analysis of incentive compatible on-line auctions. EC Ron Lavi, Noam Nisan
2000	A*	`conf`	Computationally feasible VCG mechanisms. EC Noam Nisan, Amir Ronen
2000	J	`jnl`	The POPCORN market. Online markets for computational resources. Decis. Support Syst. Ori Regev, Noam Nisan
1999	A*	`conf`	Algorithmic Mechanism Design (Extended Abstract). STOC Noam Nisan, Amir Ronen
1999	A	`conf`	Algorithms for Selfish Agents. STACS Noam Nisan
1999	J	`jnl`	Extracting Randomness: A Survey and New Constructions. J. Comput. Syst. Sci. Noam Nisan, Amnon Ta-Shma
1999	J	`jnl`	Fast Connected Components Algorithms for the EREW PRAM. SIAM J. Comput. David R. Karger, Noam Nisan, Michal Parnas
1999	J	`jnl`	On Randomized One-Round Communication Complexity. Comput. Complex. Ilan Kremer, Noam Nisan, Dana Ron
1999	J	`jnl`	Products and Help Bits in Decision Trees. SIAM J. Comput. Noam Nisan, Steven Rudich, Michael E. Saks
1999	J	`jnl`	Trade-offs between Communication Throughput and Parallel Time. J. Complex. Yishay Mansour, Noam Nisan, Uzi Vishkin
1998	J	`jnl`	Efficient approximation of product distributions. Random Struct. Algorithms Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic
1998	A	`conf`	Globally Distributed Computation over the Internet - The POPCORN Project. ICDCS Noam Nisan, Shmulik London, Oded Regev, Noam Camiel
1998	J	`jnl`	On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson
1998	A*	`conf`	Quantum Circuits with Mixed States. STOC Dorit Aharonov, Alexei Y. Kitaev, Noam Nisan
1998	—	`conf`	The POPCORN market - an online market for computational resources. ICE Ori Regev, Noam Nisan
1997	—	`book`	Communication complexity. Eyal Kushilevitz, Noam Nisan
1997	J	`jnl`	Lower Bounds on Arithmetic Circuits Via Partial Derivatives. Comput. Complex. Noam Nisan, Avi Wigderson
1997	J	`jnl`	Pointer Jumping Requires Concurrent Read Electron. Colloquium Comput. Complex. Noam Nisan, Ziv Bar-Yossef
1997	A*	`conf`	Pointer Jumping Requires Concurrent Read. STOC Noam Nisan, Ziv Bar-Yossef
1996	A	`conf`	Extracting Randomness: How and Why A survey. CCC Noam Nisan
1996	J	`jnl`	Randomness is Linear in Space. J. Comput. Syst. Sci. Noam Nisan, David Zuckerman
1995	J	`jnl`	Amortized Communication Complexity. SIAM J. Comput. Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan
1995	J	`jnl`	Fractional Covers and Communication Complexity. SIAM J. Discret. Math. Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan
1995	A*	`conf`	Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). FOCS Noam Nisan, Avi Wigderson
1995	J	`jnl`	On Constructing 1-1 One-Way Functions Electron. Colloquium Comput. Complex. Oded Goldreich, Leonid A. Levin, Noam Nisan
1995	J	`jnl`	On Rank vs. Communication Complexity. Comb. Noam Nisan, Avi Wigderson
1995	J	`jnl`	On Yao's XOR-Lemma Electron. Colloquium Comput. Complex. Oded Goldreich, Noam Nisan, Avi Wigderson
1995	A*	`conf`	On data structures and asymmetric communication complexity. STOC Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson
1995	A*	`conf`	On randomized one-round communication complexity. STOC Ilan Kremer, Noam Nisan, Dana Ron
1995	A*	`conf`	On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. STOC Noam Nisan, Avi Wigderson
1995	J	`jnl`	Symmetric Logspace is Closed Under Complement. Chic. J. Theor. Comput. Sci. Noam Nisan, Amnon Ta-Shma
1995	A*	`conf`	Symmetric logspace is closed under complement. STOC Noam Nisan, Amnon Ta-Shma
1994	J	`jnl`	Hardness vs Randomness. J. Comput. Syst. Sci. Noam Nisan, Avi Wigderson
1994	A*	`conf`	Neighborhood Preserving Hashing and Approximate Queries. SODA Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
1994	A*	`conf`	On Rank vs. Communication Complexity FOCS Noam Nisan, Avi Wigderson
1994	J	`jnl`	On Rank vs. Communication Complexity Electron. Colloquium Comput. Complex. Noam Nisan, Avi Wigderson
1994	J	`jnl`	On the Degree of Boolean Functions as Real Polynomials. Comput. Complex. Noam Nisan, Mario Szegedy
1994	A*	`conf`	Products and Help Bits in Decision Trees FOCS Noam Nisan, Steven Rudich, Michael E. Saks
1994	A*	`conf`	Pseudorandomness for network algorithms. STOC Russell Impagliazzo, Noam Nisan, Avi Wigderson
1994	J	`jnl`	RL <= SC. Comput. Complex. Noam Nisan
1994	J	`jnl`	Symmetric Logspace is Closed Under Complement Electron. Colloquium Comput. Complex. Noam Nisan, Amnon Ta-Shma
1994	A*	`conf`	Trade-offs between communication throughput and parallel time. STOC Yishay Mansour, Noam Nisan, Uzi Vishkin
1993	A*	`conf`	A parallel approximation algorithm for positive linear programming. STOC Michael Luby, Noam Nisan
1993	J	`jnl`	BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. Comput. Complex. László Babai, Lance Fortnow, Noam Nisan, Avi Wigderson
1993	J	`jnl`	Constant Depth Circuits, Fourier Transform, and Learnability. J. ACM Nathan Linial, Yishay Mansour, Noam Nisan
1993	A*	`conf`	More deterministic simulation in logspace. STOC Noam Nisan, David Zuckerman
1993	J	`jnl`	On Dice and Coins: Models of Computation for Random Generation Inf. Comput. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
1993	J	`jnl`	On Read-Once vs. Multiple Access to Randomness in Logspace. Theor. Comput. Sci. Noam Nisan
1993	J	`jnl`	Probabilistic Analysis of Network Flow Algorithms. Math. Oper. Res. Richard M. Karp, Rajeev Motwani, Noam Nisan
1993	J	`jnl`	Rounds in Communication Complexity Revisited. SIAM J. Comput. Noam Nisan, Avi Wigderson
1993	J	`jnl`	The Computational Complexity of Universal Hashing. Theor. Comput. Sci. Yishay Mansour, Noam Nisan, Prasoon Tiwari
1993	J	`jnl`	The Effect of Random Restrictions on Formula Size. Random Struct. Algorithms Russell Impagliazzo, Noam Nisan
1992	J	`jnl`	Algebraic Methods for Interactive Proof Systems. J. ACM Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
1992	A*	`conf`	Approximations of General Independent Distributions STOC Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic
1992	B	`conf`	Fast Connected Components Algorithms for the EREW PRAM. SPAA David R. Karger, Noam Nisan, Michal Parnas
1992	—	`conf`	Fractional Covers and Communication Complexity. SCT Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan
1992	J	`jnl`	Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs. J. Comput. Syst. Sci. László Babai, Noam Nisan, Mario Szegedy
1992	A*	`conf`	On the Degree of Boolean Functions as Real Polynomials STOC Noam Nisan, Mario Szegedy
1992	J	`jnl`	Pseudorandom generators for space-bounded computation. Comb. Noam Nisan
1992	A*	`conf`	RL ⊆ SC STOC Noam Nisan
1992	A*	`conf`	Undirected Connectivity in O(log ^1.5 n) Space FOCS Noam Nisan, Endre Szemerédi, Avi Wigderson
1992	—	`book`	Using hard problems to create pseudorandom generators. Noam Nisan
1991	—	`conf`	BPP has Subexponential Time Simulation unless EXPTIME has Pubishable Proofs. SCT László Babai, Noam Nisan
1991	J	`jnl`	CREW PRAMs and Decision Trees. SIAM J. Comput. Noam Nisan
1991	A*	`conf`	Lower Bounds for Non-Commutative Computation (Extended Abstract) STOC Noam Nisan
1991	J	`jnl`	Pseudorandom bits for constant depth circuits. Comb. Noam Nisan
1991	A*	`conf`	Rounds in Communication Complexity Revisited STOC Noam Nisan, Avi Wigderson
1990	A*	`conf`	Algebraic Methods for Interactive Proof Systems FOCS Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
1990	A*	`conf`	Approximate Inclusion-Exclusion STOC Nathan Linial, Noam Nisan
1990	J	`jnl`	Approximate inclusion-exclusion. Comb. Nathan Linial, Noam Nisan
1990	—	`conf`	Lower Bounds on Random-Self-Reducibility. SCT Joan Feigenbaum, Sampath Kannan, Noam Nisan
1990	—	`conf`	On Read-Once vs. Multiple Access to Randomness in Logspace. SCT Noam Nisan
1990	A*	`conf`	Psuedorandom Generators for Space-Bounded Computation STOC Noam Nisan
1990	A*	`conf`	The Computational Complexity of Universal Hashing STOC Yishay Mansour, Noam Nisan, Prasoon Tiwari
1990	—	`conf`	The Computational Complexity of Universal Hashing. SCT Yishay Mansour, Noam Nisan, Prasoon Tiwari
1989	A*	`conf`	CREW PRAMs and Decision Trees STOC Noam Nisan
1989	A*	`conf`	Constant Depth Circuits, Fourier Transform, and Learnability FOCS Nathan Linial, Yishay Mansour, Noam Nisan
1989	—	`conf`	Hardness vs. Randomness - A Survey (abstract). SCT Noam Nisan, Avi Wigderson
1989	A*	`conf`	Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract) STOC László Babai, Noam Nisan, Mario Szegedy
1989	A*	`conf`	On Dice and Coins: Models of Computation for Random Generation. ICALP David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
1989	J	`jnl`	Parallel Algorithms for Zero-One Supply-Demand Problems. SIAM J. Discret. Math. Noam Nisan, Danny Soroker
1988	A*	`conf`	Hardness vs. Randomness (Extended Abstract) FOCS Noam Nisan, Avi Wigderson