| 2011 |
|---|
| 1 |
Non-price equilibria in markets of discrete goods. Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan. ACM Conference on Electronic Commerce 2011, 295-296. Web SearchBibTeXDownload |
| 2 |
When is it best to best-respond?. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. SIGecom Exchanges (10): 16-18 (2011). Web SearchBibTeXDownload |
| 3 |
Best-Response Mechanisms. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. ICS 2011, 155-165. Web SearchBibTeXDownload |
| 4 |
Non-Price Equilibria in Markets of Discrete Goods. Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan. CoRR (abs/1103.3950) (2011). Web SearchBibTeXDownload |
| 5 |
Best-response auctions. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. ACM Conference on Electronic Commerce 2011, 351-360. Web SearchBibTeXDownload |
| 6 |
Incentive-compatible distributed greedy protocols. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. PODC 2011, 335-336. Web SearchBibTeXDownload |
| 2010 |
|---|
| 1 |
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. SODA 2010, 741. Cited by 1Web SearchBibTeXDownload |
| 2009 |
|---|
| 1 |
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. ICALP (2) 2009, 309-327. Cited by 1Web SearchBibTeXDownload |
| 2008 |
|---|
| 1 |
Theory research at Google. Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos. SIGACT News (39): 10-28 (2008). Cited by 3Web SearchBibTeXDownload |
| 2 |
Compact name-independent routing with minimum stretch. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload |
| 3 |
FairplayMP: a system for secure multi-party computation. Assaf Ben-David, Noam Nisan, Benny Pinkas. ACM Conference on Computer and Communications Security 2008, 257-266. Web SearchBibTeXDownload |
| 2004 |
|---|
| 1 |
Compact name-independent routing with minimum stretch. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup. SPAA 2004, 20-24. Web SearchBibTeXDownload |
| 2001 |
|---|
| 1 |
Neighborhood Preserving Hashing and Approximate Queries. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas. SIAM J. Discrete Math. (15): 73-85 (2001). Web SearchBibTeXDownload |
| 1999 |
|---|
| 1 |
Fast Connected Components Algorithms for the EREW PRAM. David R. Karger, Noam Nisan, Michal Parnas. SIAM J. Comput. (28): 1021-1034 (1999). Web SearchBibTeXDownload |
| 1997 |
|---|
| 1 |
Pointer Jumping Requires Concurrent Read. Noam Nisan, Ziv Bar-Yossef. STOC 1997, 549-558. Web SearchBibTeXDownload |
| 1995 |
|---|
| 1 |
Amortized Communication Complexity. Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan. SIAM J. Comput. (24): 736-750 (1995). Web SearchBibTeXDownload |
| 1994 |
|---|
| 1 |
On the Degree of Boolean Functions as Real Polynomials. Noam Nisan, Mario Szegedy. Computational Complexity (4): 301-313 (1994). Web SearchBibTeXDownload |
| 2 |
Neighborhood Preserving Hashing and Approximate Queries. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas. SODA 1994, 251-259. Web SearchBibTeXDownload |
| 1993 |
|---|
| 1 |
On Dice and Coins: Models of Computation for Random Generation. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir. Inf. Comput. (104): 159-174 (1993). Web SearchBibTeXDownload |
| 1992 |
|---|
| 1 |
Algebraic Methods for Interactive Proof Systems. Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan. J. ACM (39): 859-868 (1992). Cited by 404Web SearchBibTeXDownload |
| 2 |
On the Degree of Boolean Functions as Real Polynomials. Noam Nisan, Mario Szegedy. STOC 1992, 462-467. Web SearchBibTeXDownload |
| 3 |
Fast Connected Components Algorithms for the EREW PRAM. David R. Karger, Noam Nisan, Michal Parnas. SPAA 1992, 373-381. Web SearchBibTeXDownload |
| 4 |
Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs. László Babai, Noam Nisan, Mario Szegedy. J. Comput. Syst. Sci. (45): 204-232 (1992). Web SearchBibTeXDownload |
| 1990 |
|---|
| 1 |
Algebraic Methods for Interactive Proof Systems. Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan. FOCS 1990, 2-10. Cited by 404Web SearchBibTeXDownload |
| 1989 |
|---|
| 1 |
Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract). László Babai, Noam Nisan, Mario Szegedy. STOC 1989, 1-11. Web SearchBibTeXDownload |
| 2 |
On Dice and Coins: Models of Computation for Random Generation. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir. ICALP 1989, 319-340. Web SearchBibTeXDownload |
