| 2022 | WWW | Auctions between Regret-Minimizing Agents. | Yoav Kolumbus, Noam Nisan |
| 2022 | SAGT | Complexity of Public Goods Games on Graphs. | Matan Gilboa, Noam Nisan |
| 2021 | SODA | The Demand Query Model for Bipartite Matching. | Noam Nisan |
| 2021 | STOC | Bipartite perfect matching as a real polynomial. | Gal Beniamini, Noam Nisan |
| 2020 | AAAI | Designing Committees for Mitigating Biases. | Michal Feldman, Yishay Mansour, Noam Nisan, Sigal Oren, Moshe Tennenholtz |
| 2019 | EC | Communication Complexity of Cake Cutting. | Simina Brnzei, Noam Nisan |
| 2019 | EC | Matching for the Israeli: Handling Rich Diversity Requirements. | Yannai A. Gonczarowski, Noam Nisan, Lior Kovalio, Assaf Romm |
| 2019 | STOC | The communication complexity of local search. | Yakov Babichenko, Shahar Dobzinski, Noam Nisan |
| 2017 | ICALP | Selling Complementary Goods: Dynamics, Efficiency and Revenue. | Moshe Babaioff, Liad Blumrosen, Noam Nisan |
| 2017 | WWW | ERA: A Framework for Economic Resource Allocation for the Cloud. | Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat |
| 2017 | WWW | An Experimental Evaluation of Regret-Based Econometrics. | Noam Nisan, Gali Noti |
| 2017 | STOC | The menu-size complexity of revenue approximation. | Moshe Babaioff, Yannai A. Gonczarowski, Noam Nisan |
| 2017 | STOC | Efficient empirical revenue maximization in single-parameter auction environments. | Yannai A. Gonczarowski, Noam Nisan |
| 2016 | FOCS | Knuth Prize Lecture: Complexity of Communication in Markets. | Noam Nisan |
| 2016 | ICALP | Networks of Complements. | Moshe Babaioff, Liad Blumrosen, Noam Nisan |
| 2015 | FOCS | Welfare Maximization with Limited Interaction. | Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein |
| 2015 | SODA | A Stable Marriage Requires Communication. | Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum |
| 2014 | WWW | Price competition in online combinatorial markets. | Moshe Babaioff, Noam Nisan, Renato Paes Leme |
| 2014 | WWW | An experimental evaluation of bidders' behavior in ad auctions. | Gali Noti, Noam Nisan, Ilan Yaniv |
| 2014 | STOC | Economic efficiency requires interaction. | Shahar Dobzinski, Noam Nisan, Sigal Oren |
| 2012 | AAMAS | Fair allocation without trade. | Avital Gutman, Noam Nisan |
| 2012 | SODA | Sketching valuation functions. | Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden |
| 2011 | PODC | Incentive-compatible distributed greedy protocols. | Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar |
| 2010 | SODA | Google's Auction for TV Ads. | Noam Nisan |
| 2009 | ESA | Google's Auction for TV Ads. | Noam Nisan |
| 2009 | ICALP | Google's Auction for TV Ads. | Noam Nisan, Jason Bayer, Deepak Chandra, Tal Franji, Robert Gardner, Yossi Matias, Neil Rhodes, Misha Seltzer, Danny Tom, Hal R. Varian, Dan Zigmond |
| 2009 | SIGCSE | A synthesis course in hardware architecture, compilers, and software engineering. | Shimon Schocken, Noam Nisan, Michal Armoni |
| 2009 | SAGT | Free-Riding and Free-Labor in Combinatorial Agency. | Moshe Babaioff, Michal Feldman, Noam Nisan |
| 2009 | SAGT | A Modular Approach to Roberts' Theorem. | Shahar Dobzinski, Noam Nisan |
| 2008 | CCS | FairplayMP: a system for secure multi-party computation. | Assaf Ben-David, Noam Nisan, Benny Pinkas |
| 2008 | FOCS | Multi-unit Auctions with Budget Limits. | Shahar Dobzinski, Ron Lavi, Noam Nisan |
| 2008 | FOCS | Elections Can be Manipulated Often. | Ehud Friedgut, Gil Kalai, Noam Nisan |
| 2007 | STOC | Limitations of VCG-based mechanisms. | Shahar Dobzinski, Noam Nisan |
| 2006 | STOC | Truthful randomized mechanisms for combinatorial auctions. | Shahar Dobzinski, Noam Nisan, Michael Schapira |
| 2005 | SODA | Online ascending auctions for gradually expiring items. | Ron Lavi, Noam Nisan |
| 2005 | STOC | Approximation algorithms for combinatorial auctions with complement-free bidders. | Shahar Dobzinski, Noam Nisan, Michael Schapira |
| 2005 | TARK | Exponential communication inefficiency of demand queries. | Noam Nisan, Ilya Segal |
| 2004 | SPAA | Compact name-independent routing with minimum stretch. | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup |
| 2003 | ESA | Multi-player and Multi-round Auctions with Severely Bounded Communication. | Liad Blumrosen, Noam Nisan, Ilya Segal |
| 2003 | FOCS | Towards a Characterization of Truthful Combinatorial Auctions. | Ron Lavi, Ahuva Mu'alem, Noam Nisan |
| 2003 | TARK | Incentive compatible multi unit combinatorial auctions. | Yair Bartal, Rica Gonen, Noam Nisan |
| 2002 | AAAI | Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. | Ahuva Mu'alem, Noam Nisan |
| 2002 | FOCS | Auctions with Severely Bounded Communication. | Liad Blumrosen, Noam Nisan |
| 2002 | ICALP | The Communication Complexity of Approximate Set Packing and Covering. | Noam Nisan |
| 1999 | STOC | Algorithmic Mechanism Design (Extended Abstract). | Noam Nisan, Amir Ronen |
| 1999 | STACS | Algorithms for Selfish Agents. | Noam Nisan |
| 1998 | ICDCS | Globally Distributed Computation over the Internet - The POPCORN Project. | Noam Nisan, Shmulik London, Oded Regev, Noam Camiel |
| 1998 | STOC | Quantum Circuits with Mixed States. | Dorit Aharonov, Alexei Y. Kitaev, Noam Nisan |
| 1997 | STOC | Pointer Jumping Requires Concurrent Read. | Noam Nisan, Ziv Bar-Yossef |
| 1995 | FOCS | Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). | Noam Nisan, Avi Wigderson |
| 1995 | STOC | On randomized one-round communication complexity. | Ilan Kremer, Noam Nisan, Dana Ron |
| 1995 | STOC | On data structures and asymmetric communication complexity. | Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson |
| 1995 | STOC | Symmetric logspace is closed under complement. | Noam Nisan, Amnon Ta-Shma |
| 1995 | STOC | On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. | Noam Nisan, Avi Wigderson |
| 1994 | FOCS | Products and Help Bits in Decision Trees | Noam Nisan, Steven Rudich, Michael E. Saks |
| 1994 | FOCS | On Rank vs. Communication Complexity | Noam Nisan, Avi Wigderson |
| 1994 | SODA | Neighborhood Preserving Hashing and Approximate Queries. | Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas |
| 1994 | STOC | Pseudorandomness for network algorithms. | Russell Impagliazzo, Noam Nisan, Avi Wigderson |
| 1994 | STOC | Trade-offs between communication throughput and parallel time. | Yishay Mansour, Noam Nisan, Uzi Vishkin |
| 1993 | STOC | A parallel approximation algorithm for positive linear programming. | Michael Luby, Noam Nisan |
| 1993 | STOC | More deterministic simulation in logspace. | Noam Nisan, David Zuckerman |
| 1992 | FOCS | Undirected Connectivity in O(log ^1.5 n) Space | Noam Nisan, Endre Szemerdi, Avi Wigderson |
| 1992 | STOC | Approximations of General Independent Distributions | Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic |
| 1992 | STOC | RL ⊆ SC | Noam Nisan |
| 1992 | STOC | On the Degree of Boolean Functions as Real Polynomials | Noam Nisan, Mario Szegedy |
| 1992 | SPAA | Fast Connected Components Algorithms for the EREW PRAM. | David R. Karger, Noam Nisan, Michal Parnas |
| 1991 | STOC | Lower Bounds for Non-Commutative Computation (Extended Abstract) | Noam Nisan |
| 1991 | STOC | Rounds in Communication Complexity Revisited | Noam Nisan, Avi Wigderson |
| 1990 | FOCS | Algebraic Methods for Interactive Proof Systems | Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan |
| 1990 | STOC | Approximate Inclusion-Exclusion | Nathan Linial, Noam Nisan |
| 1990 | STOC | The Computational Complexity of Universal Hashing | Yishay Mansour, Noam Nisan, Prasoon Tiwari |
| 1990 | STOC | Psuedorandom Generators for Space-Bounded Computation | Noam Nisan |
| 1989 | FOCS | Constant Depth Circuits, Fourier Transform, and Learnability | Nathan Linial, Yishay Mansour, Noam Nisan |
| 1989 | ICALP | On Dice and Coins: Models of Computation for Random Generation. | David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir |
| 1989 | STOC | Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract) | Lszl Babai, Noam Nisan, Mario Szegedy |
| 1989 | STOC | CREW PRAMs and Decision Trees | Noam Nisan |
| 1988 | FOCS | Hardness vs. Randomness (Extended Abstract) | Noam Nisan, Avi Wigderson |