Search the dblp DataBase
Noam Nisan :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Ahuva Mu'alem , Noam Nisan Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 2002, pp:379-384 [Conf ] László Babai , Noam Nisan BPP has Subexponential Time Simulation unless EXPTIME has Pubishable Proofs. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1991, pp:213-219 [Conf ] Joan Feigenbaum , Sampath Kannan , Noam Nisan Lower Bounds on Random-Self-Reducibility. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1990, pp:100-109 [Conf ] Mauricio Karchmer , Eyal Kushilevitz , Noam Nisan Fractional Covers and Communication Complexity. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1992, pp:262-274 [Conf ] Yishay Mansour , Noam Nisan , Prasoon Tiwari The Computational Complexity of Universal Hashing. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1990, pp:90- [Conf ] Noam Nisan Hardness vs. Randomness - A Survey (abstract). [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1989, pp:54- [Conf ] Noam Nisan On Read-Once vs. Multiple Access to Randomness in Logspace. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1990, pp:179-184 [Conf ] Noam Nisan Extracting Randomness: How and Why A survey. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1996, pp:44-58 [Conf ] Liad Blumrosen , Noam Nisan , Ilya Segal Multi-player and Multi-round Auctions with Severely Bounded Communication. [Citation Graph (0, 0)][DBLP ] ESA, 2003, pp:102-113 [Conf ] Liad Blumrosen , Noam Nisan Auctions with Severely Bounded Communication. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:406-415 [Conf ] Ron Lavi , Ahuva Mu'alem , Noam Nisan Towards a Characterization of Truthful Combinatorial Auctions. [Citation Graph (0, 0)][DBLP ] FOCS, 2003, pp:574-583 [Conf ] Nathan Linial , Yishay Mansour , Noam Nisan Constant Depth Circuits, Fourier Transform, and Learnability [Citation Graph (0, 0)][DBLP ] FOCS, 1989, pp:574-579 [Conf ] Carsten Lund , Lance Fortnow , Howard J. Karloff , Noam Nisan Algebraic Methods for Interactive Proof Systems [Citation Graph (0, 0)][DBLP ] FOCS, 1990, pp:2-10 [Conf ] Noam Nisan , Endre Szemerédi , Avi Wigderson Undirected Connectivity in O(log ^1.5 n) Space [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:24-29 [Conf ] Noam Nisan , Avi Wigderson Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). [Citation Graph (0, 0)][DBLP ] FOCS, 1995, pp:16-25 [Conf ] Noam Nisan , Avi Wigderson Hardness vs. Randomness (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1988, pp:2-11 [Conf ] Noam Nisan , Avi Wigderson On Rank vs. Communication Complexity [Citation Graph (0, 0)][DBLP ] FOCS, 1994, pp:831-836 [Conf ] Noam Nisan , Steven Rudich , Michael E. Saks Products and Help Bits in Decision Trees [Citation Graph (0, 0)][DBLP ] FOCS, 1994, pp:318-329 [Conf ] David Feldman , Russell Impagliazzo , Moni Naor , Noam Nisan , Steven Rudich , Adi Shamir On Dice and Coins: Models of Computation for Random Generation. [Citation Graph (0, 0)][DBLP ] ICALP, 1989, pp:319-340 [Conf ] Noam Nisan The Communication Complexity of Approximate Set Packing and Covering. [Citation Graph (0, 0)][DBLP ] ICALP, 2002, pp:868-875 [Conf ] Noam Nisan , Shmulik London , Oded Regev , Noam Camiel Globally Distributed Computation over the Internet - The POPCORN Project. [Citation Graph (0, 0)][DBLP ] ICDCS, 1998, pp:592-601 [Conf ] Moshe Babaioff , Michal Feldman , Noam Nisan Combinatorial agency. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2006, pp:18-28 [Conf ] Moshe Babaioff , Noam Nisan Concurrent auctions across the supply chain. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2001, pp:1-10 [Conf ] Moshe Babaioff , Noam Nisan , Elan Pavlov Mechanisms for a spatially distributed market. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2004, pp:9-20 [Conf ] Liad Blumrosen , Noam Nisan On the computational power of iterative auctions. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2005, pp:29-43 [Conf ] Ron Lavi , Noam Nisan Competitive analysis of incentive compatible on-line auctions. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2000, pp:233-241 [Conf ] Benny Lehmann , Daniel J. Lehmann , Noam Nisan Combinatorial auctions with decreasing marginal utilities. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2001, pp:18-28 [Conf ] Edo Zurel , Noam Nisan An efficient approximate allocation algorithm for combinatorial auctions. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2001, pp:125-136 [Conf ] Noam Nisan Bidding and allocation in combinatorial auctions. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2000, pp:1-12 [Conf ] Noam Nisan , Amir Ronen Computationally feasible VCG mechanisms. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2000, pp:242-252 [Conf ] Danny Dolev , Yuval Harari , Nathan Linial , Noam Nisan , Michal Parnas Neighborhood Preserving Hashing and Approximate Queries. [Citation Graph (0, 0)][DBLP ] SODA, 1994, pp:251-259 [Conf ] Ron Lavi , Noam Nisan Online ascending auctions for gradually expiring items. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:1146-1155 [Conf ] Ittai Abraham , Cyril Gavoille , Dahlia Malkhi , Noam Nisan , Mikkel Thorup Compact name-independent routing with minimum stretch. [Citation Graph (0, 0)][DBLP ] SPAA, 2004, pp:20-24 [Conf ] David R. Karger , Noam Nisan , Michal Parnas Fast Connected Components Algorithms for the EREW PRAM. [Citation Graph (0, 0)][DBLP ] SPAA, 1992, pp:373-381 [Conf ] Noam Nisan Algorithms for Selfish Agents. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:1-15 [Conf ] Dorit Aharonov , Alexei Kitaev , Noam Nisan Quantum Circuits with Mixed States. [Citation Graph (0, 0)][DBLP ] STOC, 1998, pp:20-30 [Conf ] László Babai , Noam Nisan , Mario Szegedy Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1989, pp:1-11 [Conf ] Shahar Dobzinski , Noam Nisan , Michael Schapira Approximation algorithms for combinatorial auctions with complement-free bidders. [Citation Graph (0, 0)][DBLP ] STOC, 2005, pp:610-618 [Conf ] Shahar Dobzinski , Noam Nisan , Michael Schapira Truthful randomized mechanisms for combinatorial auctions. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:644-652 [Conf ] Guy Even , Oded Goldreich , Michael Luby , Noam Nisan , Boban Velickovic Approximations of General Independent Distributions [Citation Graph (0, 0)][DBLP ] STOC, 1992, pp:10-16 [Conf ] Russell Impagliazzo , Noam Nisan , Avi Wigderson Pseudorandomness for network algorithms. [Citation Graph (0, 0)][DBLP ] STOC, 1994, pp:356-364 [Conf ] Ilan Kremer , Noam Nisan , Dana Ron On randomized one-round communication complexity. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:596-605 [Conf ] Nathan Linial , Noam Nisan Approximate Inclusion-Exclusion [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:260-270 [Conf ] Michael Luby , Noam Nisan A parallel approximation algorithm for positive linear programming. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:448-457 [Conf ] Yishay Mansour , Noam Nisan , Prasoon Tiwari The Computational Complexity of Universal Hashing [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:235-243 [Conf ] Yishay Mansour , Noam Nisan , Uzi Vishkin Trade-offs between communication throughput and parallel time. [Citation Graph (0, 0)][DBLP ] STOC, 1994, pp:372-381 [Conf ] Peter Bro Miltersen , Noam Nisan , Shmuel Safra , Avi Wigderson On data structures and asymmetric communication complexity. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:103-111 [Conf ] Noam Nisan CREW PRAMs and Decision Trees [Citation Graph (0, 0)][DBLP ] STOC, 1989, pp:327-335 [Conf ] Noam Nisan Psuedorandom Generators for Space-Bounded Computation [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:204-212 [Conf ] Noam Nisan Lower Bounds for Non-Commutative Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1991, pp:410-418 [Conf ] Noam Nisan RL\subseteqSC [Citation Graph (0, 0)][DBLP ] STOC, 1992, pp:619-623 [Conf ] Noam Nisan , Ziv Bar-Yossef Pointer Jumping Requires Concurrent Read. [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:549-558 [Conf ] Noam Nisan , Amir Ronen Algorithmic Mechanism Design (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STOC, 1999, pp:129-140 [Conf ] Noam Nisan , Mario Szegedy On the Degree of Boolean Functions as Real Polynomials [Citation Graph (0, 0)][DBLP ] STOC, 1992, pp:462-467 [Conf ] Noam Nisan , Amnon Ta-Shma Symmetric logspace is closed under complement. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:140-146 [Conf ] Noam Nisan , Avi Wigderson Rounds in Communication Complexity Revisited [Citation Graph (0, 0)][DBLP ] STOC, 1991, pp:419-429 [Conf ] Noam Nisan , Avi Wigderson On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:723-732 [Conf ] Noam Nisan , David Zuckerman More deterministic simulation in logspace. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:235-244 [Conf ] Yair Bartal , Rica Gonen , Noam Nisan Incentive compatible multi unit combinatorial auctions. [Citation Graph (0, 0)][DBLP ] TARK, 2003, pp:72-87 [Conf ] Noam Nisan , Ilya Segal Exponential communication inefficiency of demand queries. [Citation Graph (0, 0)][DBLP ] TARK, 2005, pp:158-164 [Conf ] Lior Levy , Liad Blumrosen , Noam Nisan On-Line Markets for Distributed Object Services: The MAJIC System. [Citation Graph (0, 0)][DBLP ] USITS, 2001, pp:85-96 [Conf ] Dahlia Malkhi , Noam Nisan , Benny Pinkas , Yaron Sella Fairplay - Secure Two-Party Computation System. [Citation Graph (0, 0)][DBLP ] USENIX Security Symposium, 2004, pp:287-302 [Conf ] Moshe Babaioff , Michal Feldman , Noam Nisan Mixed Strategies in Combinatorial Agency. [Citation Graph (0, 0)][DBLP ] WINE, 2006, pp:353-364 [Conf ] László Babai , Lance Fortnow , Noam Nisan , Avi Wigderson BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:307-318 [Journal ] Ilan Kremer , Noam Nisan , Dana Ron Errata for: "On randomized one-round communication complexity". [Citation Graph (0, 0)][DBLP ] Computational Complexity, 2001, v:10, n:4, pp:314-315 [Journal ] Ilan Kremer , Noam Nisan , Dana Ron On Randomized One-Round Communication Complexity. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1999, v:8, n:1, pp:21-49 [Journal ] Noam Nisan RL <= SC. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1994, v:4, n:, pp:1-11 [Journal ] Noam Nisan , Mario Szegedy On the Degree of Boolean Functions as Real Polynomials. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1994, v:4, n:, pp:301-313 [Journal ] Noam Nisan , Avi Wigderson Lower Bounds on Arithmetic Circuits Via Partial Derivatives. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1997, v:6, n:3, pp:217-234 [Journal ] Noam Nisan , Amnon Ta-Shma Symmetric Logspace is Closed Under Complement. [Citation Graph (0, 0)][DBLP ] Chicago J. Theor. Comput. Sci., 1995, v:1995, n:, pp:- [Journal ] Nathan Linial , Noam Nisan Approximate inclusion-exclusion. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1990, v:10, n:4, pp:349-365 [Journal ] Noam Nisan Pseudorandom bits for constant depth circuits. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:1, pp:63-70 [Journal ] Noam Nisan Pseudorandom generators for space-bounded computation. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1992, v:12, n:4, pp:449-461 [Journal ] Noam Nisan , Avi Wigderson On Rank vs. Communication Complexity. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1995, v:15, n:4, pp:557-565 [Journal ] Benny Lehmann , Daniel J. Lehmann , Noam Nisan Combinatorial Auctions with Decreasing Marginal Utilities [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Noam Nisan , Avi Wigderson On Rank vs. Communication Complexity [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:1, pp:- [Journal ] Oded Goldreich , Leonid A. Levin , Noam Nisan On Constructing 1-1 One-Way Functions [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:29, pp:- [Journal ] Oded Goldreich , Noam Nisan , Avi Wigderson On Yao's XOR-Lemma [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:50, pp:- [Journal ] Noam Nisan , Ziv Bar-Yossef Pointer Jumping Requires Concurrent Read [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:8, pp:- [Journal ] David Feldman , Russell Impagliazzo , Moni Naor , Noam Nisan , Steven Rudich , Adi Shamir On Dice and Coins: Models of Computation for Random Generation [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1993, v:104, n:2, pp:159-174 [Journal ] Nathan Linial , Yishay Mansour , Noam Nisan Constant Depth Circuits, Fourier Transform, and Learnability. [Citation Graph (0, 0)][DBLP ] J. ACM, 1993, v:40, n:3, pp:607-620 [Journal ] Carsten Lund , Lance Fortnow , Howard J. Karloff , Noam Nisan Algebraic Methods for Interactive Proof Systems. [Citation Graph (0, 0)][DBLP ] J. ACM, 1992, v:39, n:4, pp:859-868 [Journal ] Moshe Babaioff , Noam Nisan Concurrent Auctions Across The Supply Chain. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 2004, v:21, n:, pp:595-629 [Journal ] Yishay Mansour , Noam Nisan , Uzi Vishkin Trade-offs between Communication Throughput and Parallel Time. [Citation Graph (0, 0)][DBLP ] J. Complexity, 1999, v:15, n:1, pp:148-166 [Journal ] László Babai , Noam Nisan , Mario Szegedy Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1992, v:45, n:2, pp:204-232 [Journal ] Peter Bro Miltersen , Noam Nisan , Shmuel Safra , Avi Wigderson On Data Structures and Asymmetric Communication Complexity. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1998, v:57, n:1, pp:37-49 [Journal ] Noam Nisan , Amnon Ta-Shma Extracting Randomness: A Survey and New Constructions. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1999, v:58, n:1, pp:148-173 [Journal ] Noam Nisan , Avi Wigderson Hardness vs Randomness. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1994, v:49, n:2, pp:149-167 [Journal ] Noam Nisan , David Zuckerman Randomness is Linear in Space. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1996, v:52, n:1, pp:43-52 [Journal ] Guy Even , Oded Goldreich , Michael Luby , Noam Nisan , Boban Velickovic Efficient approximation of product distributions. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1998, v:13, n:1, pp:1-16 [Journal ] Russell Impagliazzo , Noam Nisan The Effect of Random Restrictions on Formula Size. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1993, v:4, n:2, pp:121-134 [Journal ] Tomás Feder , Eyal Kushilevitz , Moni Naor , Noam Nisan Amortized Communication Complexity. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:4, pp:736-750 [Journal ] David R. Karger , Noam Nisan , Michal Parnas Fast Connected Components Algorithms for the EREW PRAM. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:28, n:3, pp:1021-1034 [Journal ] Noam Nisan CREW PRAMs and Decision Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1991, v:20, n:6, pp:999-1007 [Journal ] Noam Nisan , Steven Rudich , Michael E. Saks Products and Help Bits in Decision Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:28, n:3, pp:1035-1050 [Journal ] Noam Nisan , Avi Wigderson Rounds in Communication Complexity Revisited. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1993, v:22, n:1, pp:211-219 [Journal ] Danny Dolev , Yuval Harari , Nathan Linial , Noam Nisan , Michal Parnas Neighborhood Preserving Hashing and Approximate Queries. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:15, n:1, pp:73-85 [Journal ] Mauricio Karchmer , Eyal Kushilevitz , Noam Nisan Fractional Covers and Communication Complexity. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1995, v:8, n:1, pp:76-92 [Journal ] Noam Nisan , Danny Soroker Parallel Algorithms for Zero-One Supply-Demand Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1989, v:2, n:1, pp:108-125 [Journal ] Ron Lavi , Noam Nisan Competitive analysis of incentive compatible on-line auctions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:310, n:1-3, pp:159-180 [Journal ] Yishay Mansour , Noam Nisan , Prasoon Tiwari The Computational Complexity of Universal Hashing. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:107, n:1, pp:121-133 [Journal ] Noam Nisan On Read-Once vs. Multiple Access to Randomness in Logspace. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:107, n:1, pp:135-144 [Journal ] Shahar Dobzinski , Noam Nisan Mechanisms for multi-unit auctions. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2007, pp:346-351 [Conf ] Shahar Dobzinski , Noam Nisan Limitations of VCG-based mechanisms. [Citation Graph (0, 0)][DBLP ] STOC, 2007, pp:338-344 [Conf ] Ori Regev , Noam Nisan The POPCORN market. Online markets for computational resources. [Citation Graph (0, 0)][DBLP ] Decision Support Systems, 2000, v:28, n:1-2, pp:177-189 [Journal ] Liad Blumrosen , Noam Nisan , Ilya Segal Auctions with Severely Bounded Communication. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 2007, v:28, n:, pp:233-266 [Journal ] Noam Nisan , Amir Ronen Computationally Feasible VCG Mechanisms. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 2007, v:29, n:, pp:19-47 [Journal ] FairplayMP: a system for secure multi-party computation. [Citation Graph (, )][DBLP ] Google's Auction for TV Ads. [Citation Graph (, )][DBLP ] Multi-unit Auctions with Budget Limits. [Citation Graph (, )][DBLP ] Elections Can be Manipulated Often. [Citation Graph (, )][DBLP ] Google's Auction for TV Ads. [Citation Graph (, )][DBLP ] A synthesis course in hardware architecture, compilers, and software engineering. [Citation Graph (, )][DBLP ] Google's Auction for TV Ads. [Citation Graph (, )][DBLP ] Asynchronous Best-Reply Dynamics. [Citation Graph (, )][DBLP ] Free-Riding and Free-Labor in Combinatorial Agency. [Citation Graph (, )][DBLP ] A Modular Approach to Roberts' Theorem. [Citation Graph (, )][DBLP ] Multi-Unit Auctions: Beyond Roberts [Citation Graph (, )][DBLP ] A Note on the computational hardness of evolutionary stable strategies. [Citation Graph (, )][DBLP ] Approximations by Computationally-Efficient VCG-Based Mechanisms. [Citation Graph (, )][DBLP ] Search in 0.039secs, Finished in 0.045secs