Noam Nisan

Q: What Schools Are Affiliated With Noam Nisan

Noam Nisan is affiliated with the following schools: University of California, Berkeley, Hebrew University of Jerusalem, Stanford University

Noam Nisan's AcademicInfluence.com Rankings

Noam Nisan

Computer Science

#646

World Rank

#666

Historical Rank

Database

#1456

World Rank

#1531

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Noam Nisan Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Noam Nisan is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory.

(See a Problem?)

Noam Nisan's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Hardness vs. randomness (1988) (944)
Algebraic methods for interactive proof systems (1990) (840)
Fairplay - Secure Two-Party Computation System (2004) (761)
Constant depth circuits, Fourier transform, and learnability (1989) (742)
Randomness is Linear in Space (1996) (662)
Algorithmic Mechanism Design (2001) (660)
Combinatorial auctions with decreasing marginal utilities (2001) (623)
Bidding and allocation in combinatorial auctions (2000) (603)
Computationally feasible VCG mechanisms (2000) (549)
FairplayMP: a system for secure multi-party computation (2008) (545)
Pseudorandom generators for space-bounded computation (1992) (497)
On the degree of boolean functions as real polynomials (1992) (484)
Algorithmic mechanism design (extended abstract) (1999) (439)
Quantum circuits with mixed states (1998) (428)
Introduction to Mechanism Design (for Computer Scientists) (2007) (334)
On data structures and asymmetric communication complexity (1994) (330)
BPP has subexponential time simulations unlessEXPTIME has publishable proofs (1991) (329)
Truthful approximation mechanisms for restricted combinatorial auctions (2008) (323)
The communication requirements of efficient allocations and supporting prices (2006) (293)
Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs (1992) (270)
Communication Complexity: Basics (1996) (261)
Towards a characterization of truthful combinatorial auctions (2003) (260)
CREW PRAMS and decision trees (1989) (254)
Approximation algorithms for combinatorial auctions with complement-free bidders (2005) (240)
Pseudorandom generators for space-bounded computations (1990) (240)
Extracting Randomness: A Survey and New Constructions (1999) (232)
Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!) (2004) (232)
Multi-unit Auctions with Budget Limits (2008) (229)
On Randomized One-round Communication Complexity (1995) (227)
Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation (2006) (223)
Rounds in communication complexity revisited (1991) (220)
Lower bounds on arithmetic circuits via partial derivatives (1995) (214)
The computational complexity of universal hashing (1990) (213)
Incentive compatible multi unit combinatorial auctions (2003) (210)
Approximate revenue maximization with multiple items (2012) (207)
A parallel approximation algorithm for positive linear programming (1993) (206)
Globally distributed computation over the Internet-the POPCORN project (1998) (203)
Communication Complexity: Index of Notation (1996) (202)
Lower bounds for non-commutative computation (1991) (202)
Pseudorandomness for network algorithms (1994) (201)
Competitive analysis of incentive compatible on-line auctions (2000) (192)
Pseudorandom bits for constant depth circuits (1991) (190)
On Yao's XOR-Lemma (1995) (186)
Truthful randomized mechanisms for combinatorial auctions (2006) (175)
The POPCORN market—an online market for computational resources (1998) (172)
An efficient approximate allocation algorithm for combinatorial auctions (2001) (166)
On rank vs. communication complexity (1994) (153)
The menu-size complexity of auctions (2013) (146)
The communication complexity of threshold gates (1993) (136)
Concurrent auctions across the supply chain (2001) (135)
Approximate Inclusion-Exclusion (1990) (135)
Elections Can be Manipulated Often (2008) (125)
Auctions with severely bounded communication (2002) (123)
Multiparty protocols and logspace-hard pseudorandom sequences (1989) (123)
Amortized communication complexity (1991) (120)
Algorithms for Selfish Agents (1999) (111)
Fair allocation without trade (2012) (110)
The POPCORN market. Online markets for computational resources (2000) (110)
Extracting randomness: how and why. A survey (1996) (109)
Mechanisms for multi-unit auctions (2007) (108)
Compact name-independent routing with minimum stretch (2004) (103)
Non-price equilibria in markets of discrete goods (2011) (102)
Online ascending auctions for gradually expiring items (2005) (101)
Lower Bounds for Non-Commutative Computation (Extended Abstract) (1991) (100)
Algorithms for selfish agents mechanism design for distributed computation (1999) (99)
Combinatorial agency (2006) (96)
Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract (2002) (95)
Fractional covers and communication complexity (1992) (88)
More deterministic simulation in logspace (1993) (86)
Approximations of general independent distributions (1992) (85)
Symmetric logspace is closed under complement (1994) (81)
Bidding Languages for Combinatorial Auctions (2005) (80)
The Communication Complexity of Approximate Set Packing and Covering (2002) (74)
Sketching valuation functions (2012) (72)
On the cover time of random walks on graphs (1989) (72)
Limitations of Noisy Reversible Computation (1996) (71)
Limitations of VCG-based mechanisms (2007) (71)
Algorithmic Game Theory: Combinatorial Auctions (2007) (69)
Efficient empirical revenue maximization in single-parameter auction environments (2016) (65)
Fast connected components algorithms for the EREW PRAM (1992) (65)
Efficient approximation of product distributions (1998) (64)
RL⊆SC (1992) (63)
Undirected Connectivity in O(log ^1.5 n) Space (1992) (62)
The Elements of Computing Systems - Building a Modern Computer from First Principles (2008) (61)
The Effect of Random Restrictions on Formula Size (1993) (61)
The Communication Complexity of Efficient Allocation Problems (2002) (61)
Economic efficiency requires interaction (2013) (60)
Undirected connectivity in O(log/sup 1.5/n) space (1992) (60)
On the Computational Power of Demand Queries (2009) (58)
Google's auction for TV ads (2009) (58)
The menu-size complexity of revenue approximation (2016) (56)
Sampling and Representation Complexity of Revenue Maximization (2014) (55)
On read-once vs. multiple access to randomness in logspace (1990) (53)
On the computational power of iterative auctions (2005) (52)
On the efficiency of the walrasian mechanism (2013) (51)
Undirected Connectivity in O(l~gl*~ n) Space* (1992) (50)
Incentive Compatible Two Player Cake Cutting (2012) (49)
A Stable Marriage Requires Communication (2014) (48)
Multi-unit auctions: beyond roberts (2010) (48)
The popcorn project: distributed computation over the internet in java (1997) (46)
Best-Response Mechanisms (2011) (46)
Doubleclick Ad Exchange Auction (2012) (44)
Two simplified proofs for Roberts’ theorem (2009) (44)
Competitive Equilibria with Indivisible Goods and Generic Budgets (2017) (43)
Mechanisms for a spatially distributed market (2004) (42)
Computationally feasible vcg-based mechanisms (2000) (42)
Products and help bits in decision trees (1994) (41)
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives (2011) (40)
ERA: A Framework for Economic Resource Allocation for the Cloud (2017) (35)
Proceedings of the 4th ACM conference on Electronic commerce (2003) (34)
Trade-offs between communication throughput and parallel time (1993) (33)
Welfare Maximization with Limited Interaction (2015) (33)
Best-response auctions (2011) (33)
Compact name-independent routing with minimum stretch (2008) (33)
Mixed Strategies in Combinatorial Agency (2006) (32)
Selling multiple correlated goods: Revenue maximization and menu-size complexity (2013) (31)
Lower bounds on random-self-reducibility (1990) (31)
The Query Complexity of Correlated Equilibria (2013) (29)
On the Computational Power of Iterative Auctions I: Demand Queries (2005) (28)
Extracting randomness: how and why (1996) (28)
On Constructing 1-1 One-Way Functions (1995) (27)
Multi-player and Multi-round Auctions with Severely Bounded Communication (2003) (26)
Free-Riding and Free-Labor in Combinatorial Agency (2009) (26)
Neighborhood preserving hashing and approximate queries (1994) (26)
Chapter 9 - Algorithmic Mechanism Design: Through the lens of Multiunit auctions (2015) (26)
Fair Allocation through Competitive Equilibrium from Generic Incomes (2019) (26)
Velickovic approximations of general independent distributions (1992) (25)
Public Projects, Boolean Functions, and the Borders of Border's Theorem (2015) (25)
Using hard problems to create pseudorandom generators (1992) (23)
Asynchronous Best-Reply Dynamics (2008) (22)
Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version) (1995) (21)
The Query Complexity of Cake Cutting (2017) (21)
Price competition in online combinatorial markets (2014) (21)
Informational limitations of ascending combinatorial auctions (2010) (20)
A Note on the computational hardness of evolutionary stable strategies (2006) (19)
Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions (2015) (19)
An experimental evaluation of bidders' behavior in ad auctions (2014) (19)
Rl <= Sc (1994) (17)
Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements (2019) (17)
On Dice and Coins: Models of Computation for Random Generation (1989) (17)
Exponential communication inefficiency of demand queries (2005) (17)
Bertrand networks (2013) (16)
Competitive analysis of online auctions (2000) (15)
Combinatorial Auctions (2007) (15)
A Modular Approach to Roberts' Theorem (2009) (14)
How Good Are Simple Mechanisms for Selling Multiple Goods (2014) (14)
Optimal Deterministic Mechanisms for an Additive Buyer (2018) (14)
The Demand Query Model for Bipartite Matching (2019) (14)
Undirected connectivity in o(\log1 (1989) (13)
Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract) (1989) (12)
An Experimental Evaluation of Regret-Based Econometrics (2016) (11)
Correlated and Coarse Equilibria of Single-Item Auctions (2016) (11)
Probabilistic Analysis of Network Flow Algorithms (1993) (11)
On the Complexity of Bilinear Forms (2002) (11)
On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern (1995) (11)
On the Computational Power of Iterative Auctions II: Ascending Auctions (2005) (11)
On rank versus communication complexity (1995) (10)
Agents' Privacy in Distributed Algorithmic Mechanisms (2002) (10)
Theory research at Google (2008) (10)
Communication Complexity of Cake Cutting (2017) (10)
Matching for the Israeli “ Mechinot ” Gap Year : Handling Rich Diversity Requirements (2018) (10)
On-Line Markets for Distributed Object Services: The MAJIC System (2001) (9)
Universal Growth in Production Economies (2018) (9)
The communication complexity of local search (2018) (9)
A synthesis course in hardware architecture, compilers, and software engineering (2009) (9)
Hardness vs. Randomness (Extended Abstract) (1988) (8)
Pseudorandom bits for space-bounded computation (1992) (7)
The Elements of Computing Systems (2005) (7)
Auctions between Regret-Minimizing Agents (2021) (7)
Algorithmic Game Theory: Preface (2007) (7)
Bipartite perfect matching as a real polynomial (2020) (7)
A "Quantal Regret" Method for Structural Econometrics in Repeated Games (2017) (7)
Approximation algorithms for cas with complement - free bidders (2005) (7)
The computational complexity of universal hash functions (1993) (6)
Errata for: "On randomized one-round communication complexity" (2002) (6)
The Communication Complexity of E ffi cient Allocation Problems ∗ (2001) (6)
Competitive Equilibrium with Generic Budgets: Beyond Additive (2019) (6)
Pseudo-random sequences for space bounded computation (1992) (5)
Approximations by Computationally-Efficient VCG-Based Mechanisms (2006) (5)
Pointer jumping requires concurrent read (1997) (4)
Parallel Algorithms for Zero-One Supply-Demand Problems (1989) (4)
On the effectiveness of tracking and testing in SEIR models for improving health vs. economy trade-offs (2020) (4)
Selling Complementary Goods: Dynamics, Efficiency and Revenue (2017) (3)
How and Why to Manipulate Your Own Agent (2021) (3)
Algorithmic Mechanism Design Algorithmic Mechanism Design Contact (1999) (3)
Online Markets for Distributed Market Services: the MAJIC system (2001) (3)
Google’s Auction for Radio and TV Ads (2009) (3)
The Menu-Size Complexity of Auctions (Working Paper) (2013) (3)
Mathematical Logic through Python (2022) (3)
Complexity of Public Goods Games on Graphs (2022) (2)
The AND-OR Game: Equilibrium Characterization - (Working Paper) (2012) (2)
Competitive Analysis of In entive Compatible On-Line Au tions (2000) (2)
Designing Committees for Mitigating Biases (2020) (2)
An Impossibility Result for Ex-Post Implementable Multi-Item Auctions with Private Values (2007) (2)
Networks of Complements (2016) (2)
When is it best to best-respond? (2011) (2)
Complexity and Simplicity in Economic Design (2019) (2)
Introduction to the Special Issue on Algorithmic Game Theory (2013) (1)
Brief Announcement: Incentive-Compatible Distributed Greedy Protocols (2011) (1)
Au tions with Severely Bounded Communi (2002) (1)
Ascending Auctions for Gradually Expiring Items ∗ (2004) (1)
Google ’ s Auction for TV Ads Preliminary version (2009) (1)
Communication requirements of e ciency and supporting lindahl prices (2003) (1)
Incentive-compatible distributed greedy protocols (2011) (1)
Agents ’ Privacy in Distributed Algorithmic Mechanisms ( Position Paper ) (2002) (1)
Exponential Communication Ine ¢ ciency of Demand Queries (2004) (1)
Elections Can be Manipulated Often Extended Abstract (2008) (1)
Test Scripting Language (2008) (1)
E cient Approximation of Product Distributions (1998) (1)
RL $$ \subseteq $$ SC (2005) (1)
Matching for the Israeli: Handling Rich Diversity Requirements (2019) (1)
Hardware Description Language (HDL) (2008) (1)
Public Projects, Boolean Functions, and the Borders of Border’s Theorem (2018) (1)
Bidding and Allocation in Combinatorial Auctions Preliminary Version (1999) (1)
Communication Complexity: The Communication Complexity of Relations (1996) (0)
Variable Partition Models (1996) (0)
Postscript: More Fun to Go (2008) (0)
Networks, Communication, and VLSI (1996) (0)
Multiparty Protocols and Pseudorandom Generators for Logspace (2003) (0)
D ec 2 01 7 Approximate Revenue Maximization with Multiple Items ∗ (2018) (0)
Sneak Peek at Mathematical Logic II: G¨odel’s Incompleteness Theorem (2021) (0)
2 More about the single minded bidders case (2007) (0)
Hardness vs. Randomness - A Survey (abstract). (1989) (0)
Threshold Deontology : The case of ex-post regulatory changes (2021) (0)
Knuth Prize Lecture: Complexity of Communication in Markets (2016) (0)
Limitations of Noisy Reversible (1996) (0)
Communication Complexity: Advanced Topics (1996) (0)
Hardness vs. randomness-a survey (1989) (0)
Fair Allocation Without Trade Draft - Comment are welcome (2013) (0)
Quantum Circuitswith M ixed States (2021) (0)
Time and Space (1996) (0)
Towards a Chara terization of Truthful Combinatorial Au tionsPreliminary version (2003) (0)
Timed Modal Specifications........ 8 (0)
Virtual Machine I: Stack Arithmetic (2008) (0)
THE HEBREW UNIVERSITY OF JERUSALEM TRUTHFUL RANDOMIZED MECHANISMS FOR COMBINATORIAL AUCTIONS (2005) (0)
Beyond Pigouvian Taxes: A Worst Case Analysis (2021) (0)
Best-Reply Mechanisms ( extended abstract ) (2008) (0)
Compiler I: Syntax Analysis (2008) (0)
High-Level Language (2008) (0)
Best-Reply Mechanisms draft – comments are welcome (2007) (0)
Algorithmic Mechanism Design contact � (2003) (0)
Complexity of Boolean Functions (Dagstuhl Seminar 02121) (2021) (0)
Free-Riding and Free-Labor in Combinatorial (2009) (0)
Communication Complexity: Further Topics (1996) (0)
Communication Complexity: Answers to Selected Problems (1996) (0)
Publications in Communication Complexity Theory (2013) (0)
Communication Complexity: Decision Trees and Data Structures (1996) (0)
Communication Complexity: Multiparty Communication Complexity (1996) (0)
Chapter 1 Bidding Languages (2009) (0)
Approximations of General Independent Distributions 1 (2014) (0)
Communication Complexity: Boolean Circuit Depth (1996) (0)
Towards a Chara terization of Truthful Combinatorial (2003) (0)
Monotonic Mechanisms for Selling Multiple Goods (2022) (0)
More Boolean Circuit Lower Bounds (1996) (0)
Complexity of Cake Cutting ∗ (2018) (0)
DOMINANT-STRATEGY IMPLEMENTATION 1111 of its computational complexity , the Vickrey – (2006) (0)
From NAND to tetris in 12 easy steps (2004) (0)
The AND-OR Game (2016) (0)
1 Introduction 1 . 1 Motivation : When is it Best to Best-Respond ? (2010) (0)
Finding a Hidden Edge (2022) (0)
Quantum Communication (1995) (0)
G T ] 1 8 A pr 2 01 8 Optimal Deterministic Mechanisms for an Additive Buyer (2018) (0)
Themes Complexity Theory ’ 94 In the months of August and September , 1994 (0)
Communication Complexity: Preface (1996) (0)
Topics on the Border of Economics and Computation December 25 , 2005 Lecture 9 ( Social Choice Cont (2005) (0)
Virtual Machine II: Program Control (2008) (0)
Electronic Colloquium on Computational Complexity on Rank vs. Communication Complexity (1994) (0)
Compiler II: Code Generation (2008) (0)
Communication Complexity: More on Covers (1996) (0)
Electronic Markets and Auctions (Dagstuhl Seminar 13461) (2013) (0)
Elections Can be Manipulated Often Draft – Comments Welcome (2007) (0)
2 5 D ec 2 01 7 The Query Complexity of Correlated Equilibria ∗ † (2018) (0)
E cient Approximation of General Product Distributions (1997) (0)

This paper list is powered by the following services:

Other Resources About Noam Nisan

en.wikipedia.org

What Schools Are Affiliated With Noam Nisan?

Noam Nisan is affiliated with the following schools:

Noam Nisan's Academic­Influence.com Rankings