Seguir
Noam Nisan
Título
Citado por
Citado por
Ano
Algorithmic game theory
T Roughgarden
Communications of the ACM 53 (7), 78-86, 2010
55262010
Communication complexity
E Kushilevitz
Advances in Computers 44, 331-360, 1997
26651997
Algorithmic mechanism design
N Nisan, A Ronen
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
22171999
Hardness vs randomness
N Nisan, A Wigderson
Journal of computer and System Sciences 49 (2), 149-167, 1994
12311994
Fairplay-Secure Two-Party Computation System.
D Malkhi, N Nisan, B Pinkas, Y Sella
USENIX security symposium 4, 9, 2004
12162004
Algebraic methods for interactive proof systems
C Lund, L Fortnow, H Karloff, N Nisan
Journal of the ACM (JACM) 39 (4), 859-868, 1992
11591992
Constant depth circuits, Fourier transform, and learnability
N Linial, Y Mansour, N Nisan
Journal of the ACM (JACM) 40 (3), 607-620, 1993
9241993
Combinatorial auctions with decreasing marginal utilities
B Lehmann, D Lehmann, N Nisan
Proceedings of the 3rd ACM conference on Electronic Commerce, 18-28, 2001
7972001
Randomness is linear in space
N Nisan, D Zuckerman
Journal of Computer and System Sciences 52 (1), 43-52, 1996
7911996
Pseudorandom generators for space-bounded computations
N Nisan
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
7531990
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
7342008
Bidding and allocation in combinatorial auctions
N Nisan
Proceedings of the 2nd ACM Conference on Electronic Commerce, 1-12, 2000
7302000
Computationally feasible VCG mechanisms
N Nisan, A Ronen
Journal of Artificial Intelligence Research 29, 19-47, 2007
7082007
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
5341998
On the degree of Boolean functions as real polynomials
N Nisan, M Szegedy
Computational complexity 4, 301-313, 1994
4711994
BPP has subexponential time simulations unless EXPTIME has publishable proofs
L aszl o Babai, L Fortnow, N Nisan, A Wigderson
Computational Complexity 3 (4), 307-318, 1993
4321993
Introduction to mechanism design (for computer scientists)
N Nisan
Algorithmic game theory 9, 209-242, 2007
4172007
On data structures and asymmetric communication complexity
PB Miltersen, N Nisan, S Safra, A Wigderson
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
4041995
Truthful approximation mechanisms for restricted combinatorial auctions
A Mu'Alem, N Nisan
Games and Economic Behavior 64 (2), 612-631, 2008
3972008
The communication requirements of efficient allocations and supporting prices
N Nisan, I Segal
Journal of Economic Theory 129 (1), 192-224, 2006
3772006
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20