Travelled to:1 × Greece
1 × Italy
1 × Spain
12 × USA
2 × Canada
Collaborated with:∅ A.Wigderson S.Dobzinski M.Szegedy M.Luby M.Schapira Y.Mansour A.Ronen Z.Bar-Yossef A.Ta-Shma R.Impagliazzo D.Zuckerman N.Linial S.Oren D.Aharonov A.Kitaev I.Kremer D.Ron U.Vishkin P.Tiwari L.Babai P.B.Miltersen S.Safra G.Even O.Goldreich B.Velickovic D.Feldman M.Naor S.Rudich A.Shamir J.Bayer D.Chandra T.Franji R.Gardner Y.Matias N.Rhodes M.Seltzer D.Tom H.R.Varian D.Zigmond
Talks about:complex (6) communic (5) approxim (5) algorithm (4) comput (4) logspac (3) auction (3) random (3) mechan (3) pseudorandom (2)
Person: Noam Nisan
DBLP: Nisan:Noam
Contributed to:
2014
2009200720062005200219991998199719951994199319921991199019891989Wrote 28 papers:
- STOC-2014-DobzinskiNO #interactive #performance
- Economic efficiency requires interaction (SD, NN, SO), pp. 233–242.
- ICALP-v2-2009-NisanBCFGMRSTVZ
- Google’s Auction for TV Ads (NN, JB, DC, TF, RG, YM, NR, MS, DT, HRV, DZ), pp. 309–327.
- STOC-2007-DobzinskiN
- Limitations of VCG-based mechanisms (SD, NN), pp. 338–344.
- STOC-2006-DobzinskiNS #combinator #random
- Truthful randomized mechanisms for combinatorial auctions (SD, NN, MS), pp. 644–652.
- STOC-2005-DobzinskiNS #algorithm #approximate #combinator
- Approximation algorithms for combinatorial auctions with complement-free bidders (SD, NN, MS), pp. 610–618.
- ICALP-2002-Nisan #approximate #communication #complexity #set
- The Communication Complexity of Approximate Set Packing and Covering (NN), pp. 868–875.
- STOC-1999-NisanR #algorithm #design
- Algorithmic Mechanism Design (NN, AR), pp. 129–140.
- STOC-1998-AharonovKN #quantum
- Quantum Circuits with Mixed States (DA, AK, NN), pp. 20–30.
- STOC-1997-NisanB #concurrent #pointer
- Pointer Jumping Requires Concurrent Read (NN, ZBY), pp. 549–558.
- STOC-1995-KremerNR #communication #complexity #on the #random
- On randomized one-round communication complexity (IK, NN, DR), pp. 596–605.
- STOC-1995-MiltersenNSW #communication #complexity #data type #on the #symmetry
- On data structures and asymmetric communication complexity (PBM, NN, SS, AW), pp. 103–111.
- STOC-1995-NisanT #symmetry
- Symmetric logspace is closed under complement (NN, ATS), pp. 140–146.
- STOC-1995-NisanW #complexity #memory management #on the
- On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern (NN, AW), pp. 723–732.
- STOC-1994-ImpagliazzoNW #algorithm #network #pseudo
- Pseudorandomness for network algorithms (RI, NN, AW), pp. 356–364.
- STOC-1994-MansourNV #communication #parallel #throughput #trade-off
- Trade-offs between communication throughput and parallel time (YM, NN, UV), pp. 372–381.
- STOC-1993-LubyN #algorithm #approximate #linear #parallel #programming
- A parallel approximation algorithm for positive linear programming (ML, NN), pp. 448–457.
- STOC-1993-NisanZ #simulation
- More deterministic simulation in logspace (NN, DZ), pp. 235–244.
- STOC-1992-EvenGLNV #approximate #independence
- Approximations of General Independent Distributions (GE, OG, ML, NN, BV), pp. 10–16.
- STOC-1992-Nisan
- RL ⊆ SC (NN), pp. 619–623.
- STOC-1992-NisanS #on the
- On the Degree of Boolean Functions as Real Polynomials (NN, MS), pp. 462–467.
- STOC-1991-Nisan #bound #commutative
- Lower Bounds for Non-Commutative Computation (NN), pp. 410–418.
- STOC-1991-NisanW #communication #complexity #revisited
- Rounds in Communication Complexity Revisited (NN, AW), pp. 419–429.
- STOC-1990-LinialN #approximate
- Approximate Inclusion-Exclusion (NL, NN), pp. 260–270.
- STOC-1990-MansourNT #complexity
- The Computational Complexity of Universal Hashing (YM, NN, PT), pp. 235–243.
- STOC-1990-Nisan #bound #generative
- Psuedorandom Generators for Space-Bounded Computation (NN), pp. 204–212.
- ICALP-1989-FeldmanINNRS #generative #modelling #on the #random
- On Dice and Coins: Models of Computation for Random Generation (DF, RI, MN, NN, SR, AS), pp. 319–340.
- STOC-1989-BabaiNS #multi #protocol #pseudo #sequence
- Multiparty Protocols and Logspace-hard Pseudorandom Sequences (LB, NN, MS), pp. 1–11.
- STOC-1989-Nisan
- CREW PRAMs and Decision Trees (NN), pp. 327–335.