The following pages link to Noam Nisan (Q192132):
Displaying 50 items.
- Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders (Q3169079) (← links)
- Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation (Q3418482) (← links)
- (Q3524718) (← links)
- (Q3524720) (← links)
- (Q3549630) (← links)
- Mixed Strategies in Combinatorial Agency (Q3579358) (← links)
- Approximation algorithms for combinatorial auctions with complement-free bidders (Q3581408) (← links)
- On the Computational Power of Demand Queries (Q3586184) (← links)
- (Q3624052) (← links)
- (Q3624066) (← links)
- A Modular Approach to Roberts’ Theorem (Q3648839) (← links)
- Free-Riding and Free-Labor in Combinatorial Agency (Q3648847) (← links)
- Parallel Algorithms for Zero-One Supply-Demand Problems (Q3833620) (← links)
- CREW PRAM<scp>s</scp> and Decision Trees (Q3985804) (← links)
- Rounds in Communication Complexity Revisited (Q4037694) (← links)
- Fast Connected Components Algorithms for the EREW PRAM (Q4229421) (← links)
- Products and Help Bits in Decision Trees (Q4229422) (← links)
- (Q4230323) (← links)
- (Q4231906) (← links)
- (Q4234056) (← links)
- (Q4234059) (← links)
- (Q4234109) (← links)
- (Q4234123) (← links)
- (Q4259976) (← links)
- (Q4284623) (← links)
- Algebraic methods for interactive proof systems (Q4302792) (← links)
- (Q4527022) (← links)
- (Q4542516) (← links)
- (Q4598283) (← links)
- The effect of random restrictions on formula size (Q4696224) (← links)
- Probabilistic Analysis of Network Flow Algorithms (Q4697084) (← links)
- Efficient approximation of product distributions (Q4705321) (← links)
- (Q4732126) (← links)
- (Q4737215) (← links)
- Fractional Covers and Communication Complexity (Q4764345) (← links)
- Amortized Communication Complexity (Q4852622) (← links)
- Communication Complexity (Q4875692) (← links)
- Compact name-independent routing with minimum stretch (Q4962742) (← links)
- Efficient empirical revenue maximization in single-parameter auction environments (Q4978029) (← links)
- Competitive Equilibrium with Indivisible Goods and Generic Budgets (Q4991681) (← links)
- Mathematical Logic through Python (Q5086249) (← links)
- (Q5111466) (← links)
- Mechanisms for Multi-Unit Auctions (Q5190267) (← links)
- The communication complexity of local search (Q5212806) (← links)
- More deterministic simulation in logspace (Q5248491) (← links)
- A parallel approximation algorithm for positive linear programming (Q5248514) (← links)
- Economic efficiency requires interaction (Q5259557) (← links)
- A Stable Marriage Requires Communication (Q5363098) (← links)
- (Q5417663) (← links)
- (Q5715672) (← links)
