Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Noam Nisan
Approximation Algorithms for Combinatorial Auctions With Complement-Free Bidders
Mathematics of Operations Research
Management Science
Computer Science Applications
Operations Research
Mathematics
Using Hard Problems to Create Pseudorandom Generators.
Mathematics of Computation
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
On Rank vs. Communication Complexity
Combinatorica
Combinatorics
Computational Mathematics
Discrete Mathematics
Parallel Algorithms for Zero-One Supply-Demand Problems
SIAM Journal on Discrete Mathematics
Mathematics
On Data Structures and Asymmetric Communication Complexity
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
Errata For: "On Randomized One-Round Communication Complexity"
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Theory Research at Google
ACM SIGACT News
Using Hard Problems to Create Pseudorandom Generators
