Nisan, Noam - School of Computer Science and Engineering, Hebrew University of Jerusalem

• Lower Bounds for NonCommutative Computation Extended Abstract
• Tradeoffs Between Communication Throughput and Parallel Time Yishay Mansour \Lambda Noam Nisan y Uzi Vishkin z
• Auctions with severely bounded communication Liad Blumrosen and Noam Nisan
• On Rank vs. Communication Complexity N. Nisan and A. Wigderson
• On the Degree of Boolean Functions as Real Polynomials Noam Nisan \Lambda Mario Szegedy y
• Products and Help Bits in Decision Trees Preliminary Version
• Incentive Compatible Multi Unit Combinatorial Auctions Yair Bartal
• Fairplay --A Secure Two-Party Computation System Dahlia Malkhi
• A Modular Approach to Roberts' Theorem Shahar Dobzinski1
• On Randomized OneRound Communication Complexity Ilan Kremer Noam Nisan Dana Ron
• A Note on the Computational Hardness of Evolutionary Stable We present a very simple reduction that when given a graph G and an integer k produces
• Mechanisms for a Spatially Distributed Market 1 Moshe Babaioff 2 , Noam Nisan and Elan Pavlov 3
• A Parallel Approximation Algorithm Positive Linear Programming
• Truthful Approximation Mechanisms for Restricted Combinatorial Ahuva Mu'alem Noam Nisan
• Pointer Jumping Requires Concurrent Read \Lambda Department of Computer Science
• Free-Riding and Free-Labor in Combinatorial Moshe Babaioff1
• Symmetric Logspace is Closed Under Complement Noam Nisan \Lambda Amnon TaShma y
• Online Ascending Auctions for Gradually Expiring Items Ron Lavi and Noam Nisan
• Non-Price Equilibria in Markets of Discrete Goods (working paper)
• Lower Bounds on Arithmetic Circuits via Partial Derivatives
• Undirected Connectivity in O(log 1:5 n) Space Noam Nisan Endre Szemeredi Avi Wigderson
• Journal of Artificial Intelligence Research 29 (2007) 19--47 Submitted 03/06; published 05/07 Computationally Feasible VCG Mechanisms
• Mixed Strategies in Combinatorial Agency [Extended Abstract]
• Truthful Randomized Mechanisms for Combinatorial Auctions Shahar Dobzinski Noam Nisan Michael Schapira #
• Concurrent Auctions Across The Supply Chain Moshe Babaioff #
• Best-Response Auctions Michael Schapira
• On the Complexity of Bilinear Forms \Lambda (Extended Abstract)
• On ReadOnce vs. Multiple Access to Randomness in Logspace
• Towards a Characterization of Truthful Combinatorial Auctions # Ron Lavi, Ahuva Mu'alem and Noam Nisan
• Multiplayer and Multiround Auctions with Severely Bounded Communication
• Limitations of VCGBased Mechanisms Shahar Dobzinski Noam Nisan #
• Combinatorial Auctions with Decreasing Marginal Utilities 1 2
• Bidding Languages 1.1 Introduction
• Mechanisms for MultiUnit Auctions Shahar Dobzinski Noam Nisan #
• The communication complexity of threshold gates
• FairplayMP A System for Secure Multi-Party Computation Assaf Ben-David
• On Line Markets for Distributed Object Services: the MAJIC system
• Multi-Unit Auctions: Beyond Roberts Shahar Dobzinski
• Best-Response Mechanisms Noam Nisan1
• Google's Auction for TV Ads Preliminary version
• Asynchronous Best-Reply Dynamics Noam Nisan1
• Theory Research at Google Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman
• Elections Can be Manipulated Often (extended Ehud Friedgut Gil Kalai Noam Nisan
• Combinatorial Agency Moshe Babaioff
• The Communication Requirements of Efficient Allocations and Supporting Prices
• SIAM J. COMPUT. c 2009 Society for Industrial and Applied Mathematics Vol. 39, No. 4, pp. 13721391
• Journal of Economic Theory 145 (2010) 12031223 www.elsevier.com/locate/jet
• An Efficient Approximate Allocation Algorithm for Combinatorial Auctions
• Exponential Communication Ine ciency of Demand Queries
• Approximation Algorithms for Combinatorial Auctions with ComplementFree Bidders
• Bidding and Allocation in Combinatorial Auctions Noam Nisan \Lambda