Noam Nisan
Noam Nisan
Professor of Computer Science, Hebrew University of Jerusalem
Verified email at cs.huji.ac.il - Homepage
Title
Cited by
Cited by
Year
Algorithmic game theory
T Roughgarden
Communications of the ACM 53 (7), 78-86, 2010
44282010
Communication complexity
E Kushilevitz
Advances in Computers 44, 331-360, 1997
23881997
Algorithmic mechanism design
N Nisan, A Ronen
Games and Economic behavior 35 (1-2), 166-196, 2001
19812001
Fairplay-Secure Two-Party Computation System.
D Malkhi, N Nisan, B Pinkas, Y Sella
USENIX Security Symposium 4, 9, 2004
10722004
Hardness vs randomness
N Nisan, A Wigderson
Journal of computer and System Sciences 49 (2), 149-167, 1994
10701994
Algebraic methods for interactive proof systems
C Lund, L Fortnow, H Karloff, N Nisan
Journal of the ACM (JACM) 39 (4), 859-868, 1992
9221992
Constant depth circuits, Fourier transform, and learnability
N Linial, Y Mansour, N Nisan
Journal of the ACM (JACM) 40 (3), 607-620, 1993
8041993
Randomness is linear in space
N Nisan, D Zuckerman
Journal of Computer and System Sciences 52 (1), 43-52, 1996
7061996
Bidding and allocation in combinatorial auctions
N Nisan
Proceedings of the 2nd ACM Conference on Electronic Commerce, 1-12, 2000
6932000
Combinatorial auctions with decreasing marginal utilities
B Lehmann, D Lehmann, N Nisan
Games and Economic Behavior 55 (2), 270-296, 2006
6712006
Pseudorandom generators for space-bounded computation
N Nisan
Combinatorica 12 (4), 449-461, 1992
6531992
FairplayMP: a system for secure multi-party computation
A Ben-David, N Nisan, B Pinkas
Proceedings of the 15th ACM conference on Computer and communications …, 2008
6372008
Computationally feasible VCG mechanisms
N Nisan, A Ronen
Journal of Artificial Intelligence Research 29, 19-47, 2007
6342007
Quantum circuits with mixed states
D Aharonov, A Kitaev, N Nisan
Proceedings of the thirtieth annual ACM symposium on Theory of computing, 20-30, 1998
4231998
On the degree of Boolean functions as real polynomials
N Nisan, M Szegedy
Computational complexity 4 (4), 301-313, 1994
3901994
BPP has subexponential time simulations unlessEXPTIME has publishable proofs
L Babai, L Fortnow, N Nisan, A Wigderson
Computational Complexity 3 (4), 307-318, 1993
3871993
Truthful approximation mechanisms for restricted combinatorial auctions
A Mu'Alem, N Nisan
Games and Economic Behavior 64 (2), 612-631, 2008
3672008
Introduction to mechanism design (for computer scientists)
N Nisan
Algorithmic game theory 9, 209-242, 2007
3632007
On data structures and asymmetric communication complexity
PB Miltersen, N Nisan, S Safra, A Wigderson
Journal of Computer and System Sciences 57 (1), 37-49, 1998
3631998
The communication requirements of efficient allocations and supporting prices
N Nisan, I Segal
Journal of Economic Theory 129 (1), 192-224, 2006
3352006
The system can't perform the operation now. Try again later.
Articles 1–20