The following pages link to Noam Nisan (Q192132):
Displaying 50 items.
- Combinatorial agency (Q417616) (← links)
- Two simplified proofs for Roberts' theorem (Q733788) (← links)
- Multi-unit auctions with budget limits (Q765207) (← links)
- Pseudorandom bits for constant depth circuits (Q808707) (← links)
- Informational limitations of ascending combinatorial auctions (Q972880) (← links)
- Approximate inclusion-exclusion (Q1174115) (← links)
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152) (← links)
- Pseudorandom generators for space-bounded computation (Q1204523) (← links)
- The computational complexity of universal hashing (Q1208411) (← links)
- On read-once vs. multiple access to randomness in logspace (Q1208412) (← links)
- On data structures and asymmetric communication complexity (Q1273860) (← links)
- On randomized one-round communication complexity (Q1300607) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- \(\text{RL}\subseteq \text{SC}\) (Q1327590) (← links)
- Hardness vs randomness (Q1337458) (← links)
- On the degree of Boolean functions as real polynomials (Q1346612) (← links)
- Lower bounds on arithmetic circuits via partial derivatives (Q1377574) (← links)
- Errata for: ``On randomized one-round communication complexity'' (Q1405739) (← links)
- The query complexity of correlated equilibria (Q1651292) (← links)
- Approximate revenue maximization with multiple items (Q1676468) (← links)
- On the cover time of random walks on graphs (Q1823548) (← links)
- Competitive analysis of incentive compatible on-line auctions (Q1884971) (← links)
- On rank vs. communication complexity (Q1906852) (← links)
- Randomness is linear in space (Q1915503) (← links)
- Beyond Pigouvian taxes: a worst case analysis (Q2152117) (← links)
- The menu-size complexity of revenue approximation (Q2155903) (← links)
- Multi-unit auctions: beyond Roberts (Q2253831) (← links)
- Online ascending auctions for gradually expiring items (Q2253832) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- A stable marriage requires communication (Q2278950) (← links)
- Selling multiple correlated goods: revenue maximization and menu-size complexity (Q2324834) (← links)
- On dice and coins: Models of computation for random generation (Q2366558) (← links)
- Mechanisms for a spatially distributed market (Q2389294) (← links)
- Limitations of VCG-based mechanisms (Q2454572) (← links)
- The communication requirements of efficient allocations and supporting prices (Q2496786) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Neighborhood Preserving Hashing and Approximate Queries (Q2784503) (← links)
- Smooth Boolean Functions are Easy (Q2800553) (← links)
- Pseudorandomness for network algorithms (Q2817628) (← links)
- Algorithmic mechanism design (extended abstract) (Q2819541) (← links)
- (Q2921788) (← links)
- Sampling and Representation Complexity of Revenue Maximization (Q2936993) (← links)
- Correlated and Coarse Equilibria of Single-Item Auctions (Q2959824) (← links)
- On Constructing 1-1 One-Way Functions (Q3088171) (← links)
- On Yao’s XOR-Lemma (Q3088189) (← links)
- A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives (Q3093629) (← links)
- (Q3128884) (← links)
- Constant depth circuits, Fourier transform, and learnability (Q3140018) (← links)
