Noam Nisan

Management Science and Operations Research · 1996–2008

A researcher in the Science corpus: 11 papers; trusts 28 researchers and is trusted by 56 researchers here, as inferred from the citation graph.

Subfields

• Management Science and Operations Research — 29 citations into it; #1,050 of 11,946 by trust here, #869 by citations
• Marketing — 20 citations into it; #477 of 6,289 by trust here, #838 by citations
• Economics and Econometrics — 16 citations into it; #2,708 of 23,481 by trust here, #4,221 by citations
• Artificial Intelligence — 8 citations into it; #8,549 of 35,345 by trust here, #12,580 by citations
• Computational Theory and Mathematics — 8 citations into it; #2,396 of 12,182 by trust here, #2,419 by citations
• Computer Networks and Communications — 8 citations into it
• Privacy & Security — 8 citations into it
• Game & Decision Theory — 5 citations into it; #150 of 249 by trust here, #135 by citations

Whom Noam Nisan trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Daniel J. Lehmann
2. Martin J. Osborne
3. Ariel Rubinstein
4. Arne Andersson
5. Oded Goldreich
6. Sushil Bikhchandani
7. Joan Feigenbaum
8. Liadan O'Callaghan
9. Moni Naor
10. Kenneth J. Arrow

Who trusts Noam Nisan overall

1. Benny Pinkas
2. Yehuda Lindell
3. Omer Reingold
4. Hugo Krawczyk
5. Ronen Shaltiel
6. Thomas Schneider
7. Oded Goldreich
8. Roel Maes
9. Srinath T. V. Setty
10. Mihir Bellare

Papers from Noam Nisan's perspective

Ordered by how strongly the researchers Noam Nisan trusts endorse each paper. Same corpus, a different order for every researcher.

1. Computationally feasible VCG mechanisms (ACM Conference on Economics and Computation)
2. New Directions in Cryptography
3. Completeness theorems for non-cryptographic fault-tolerant distributed computation
4. Optimal Auction Design
5. Random oracles are practical: a paradigm for designing efficient protocols
6. Integer programming for combinatorial auction winner determination (Proceedings Fourth International Conference on MultiAgent Systems)
7. Privacy preserving auctions and mechanism design
8. A method for obtaining digital signatures and public-key cryptosystems
9. Private information retrieval
10. Combinatorial auctions with decreasing marginal utilities

Their papers

• FairplayMP: a system for secure multi-party computation (2008) — 593 citations
• Bidding and allocation in combinatorial auctions (2000) — 598 citations
• Combinatorial auctions with decreasing marginal utilities (2001) — 728 citations
• Computationally feasible VCG mechanisms (2000) — 583 citations
• Algorithmic Mechanism Design (2001) — 705 citations
• Truthful approximation mechanisms for restricted combinatorial auctions (2008) — 352 citations
• The communication requirements of efficient allocations and supporting prices (2006) — 328 citations
• Introduction to Mechanism Design (for Computer Scientists) (2007) — 344 citations
• Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation (2006) — 233 citations
• Fairplay - Secure Two-Party Computation System (2004) — 865 citations
• Randomness is Linear in Space (1996)