Searching for authors named "Noam Nisan" – sorted by Relevance.
-
RL ⊆ SC
- RL ` SC Noam Nisan March 1, 1995 Abstract We show that any randomized Logspace algorithm
- Add To MetaCart
-
Lower Bounds for Non-Commutative Computation (Extended Abstract)
- Lower Bounds for Non-Commutative Computation Extended Abstract Noam Nisan Abstract We consider
- Cited by 1 (0 self) – Add To MetaCart
-
Algorithms for sel sh agents - mechanism design for distributed computation
- Algorithms for Sel sh Agents Mechanism Design for Distributed Computation Noam Nisan Abstract
- Cited by 1 (0 self) – Add To MetaCart
-
The communication complexity of combinatorial auctions
- The Communication Complexity of Combinatorial Auctions Draft { Comments welcome Noam Nisan
- Cited by 13 (3 self) – Add To MetaCart
-
Algorithms for selfish agents: Mechanism design for distributed computation
- Algorithms for Selfish Agents Mechanism Design for Distributed Computation Noam Nisan \Lambda
- Cited by 31 (1 self) – Add To MetaCart
-
Rounds in communication complexity revisited
- Rounds in Communication Complexity Revisited Noam Nisan* Hebrew University Avi Widgerson
- Cited by 53 (8 self) – Add To MetaCart
-
Hardness vs. randomness
- Hardness vs. Randomness Noam Nisan 1 Institute of Computer Science Hebrew University of Jerusalem
- Cited by 221 (23 self) – Add To MetaCart
-
The Communication Complexity of Threshold Gates
- The communication complexity of threshold gates Noam Nisan November 2, 1994 Abstract We prove
- Cited by 13 (1 self) – Add To MetaCart
-
Truthful approximation mechanisms for restricted combinatorial auctions
- Truthful Approximation Mechanisms for Restricted Combinatorial Auctions Ahuva Mu’alem ∗ Noam Nisan
- Cited by 62 (3 self) – Add To MetaCart
-
Bidding and Allocation in Combinatorial Auctions
- Bidding and Allocation in Combinatorial Auctions Noam Nisan April 17, 2000 Abstract When
- Cited by 183 (12 self) – Add To MetaCart

