Noam Nisan

Sergiu Hart, Noam Nisan: The Menu-Size Complexity of Auctions. CoRR abs/1304.6116 (2013)

Moshe Babaioff, Brendan Lucier, Noam Nisan: Bertrand Networks. CoRR abs/1304.6806 (2013)

Shahar Dobzinski, Ron Lavi, Noam Nisan: Multi-unit auctions with budget limits. Games and Economic Behavior 74(2): 486-503 (2012)

Shahar Dobzinski, Noam Nisan, Michael Schapira: Truthful randomized mechanisms for combinatorial auctions. J. Comput. Syst. Sci. 78(1): 15-25 (2012)

Moshe Babaioff, Michal Feldman, Noam Nisan, Eyal Winter: Combinatorial agency. J. Economic Theory 147(3): 999-1034 (2012)

Avital Gutman, Noam Nisan: Fair allocation without trade. AAMAS 2012: 719-728

Sergiu Hart, Noam Nisan: Approximate revenue maximization with multiple items. ACM Conference on Electronic Commerce 2012: 656

Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden: Sketching valuation functions. SODA 2012: 1025-1035

Avishay Maya, Noam Nisan: Incentive Compatible Two Player Cake Cutting. WINE 2012: 170-183

Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan: The AND-OR Game: Equilibrium Characterization - (Working Paper). WINE 2012: 561

Yishay Mansour, S. Muthukrishnan, Noam Nisan: Doubleclick Ad Exchange Auction. CoRR abs/1204.0535 (2012)

Sergiu Hart, Noam Nisan: Approximate Revenue Maximization with Multiple Items. CoRR abs/1204.1846 (2012)

Avital Gutman, Noam Nisan: Fair Allocation Without Trade. CoRR abs/1204.4286 (2012)

Avishay Maya, Noam Nisan: Incentive Compatible Two Player Cake Cutting. CoRR abs/1210.0155 (2012)

Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan: The AND-OR game: Equilibrium Characterization (Working Paper). CoRR abs/1210.1757 (2012)

Shahar Dobzinski, Noam Nisan: Limitations of VCG-based mechanisms. Combinatorica 31(4): 379-396 (2011)

Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan: A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. SIAM J. Comput. 40(3): 934-952 (2011)

Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar: When is it best to best-respond? SIGecom Exchanges 10(2): 16-18 (2011)

Oded Goldreich, Leonid A. Levin, Noam Nisan: On Constructing 1-1 One-Way Functions. Studies in Complexity and Cryptography 2011: 13-25

Oded Goldreich, Noam Nisan, Avi Wigderson: On Yao's XOR-Lemma. Studies in Complexity and Cryptography 2011: 273-301

Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar: Best-Response Mechanisms. ICS 2011: 155-165

Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar: Incentive-compatible distributed greedy protocols. PODC 2011: 335-336

Shahar Dobzinski, Noam Nisan: Multi-unit auctions: beyond roberts. ACM Conference on Electronic Commerce 2011: 233-242

Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan: Non-price equilibria in markets of discrete goods. ACM Conference on Electronic Commerce 2011: 295-296

Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar: Best-response auctions. ACM Conference on Electronic Commerce 2011: 351-360

Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan: Non-Price Equilibria in Markets of Discrete Goods. CoRR abs/1103.3950 (2011)

Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan: A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. CoRR abs/1105.5129 (2011)

Moshe Babaioff, Noam Nisan: Concurrent Auctions Across The Supply Chain. CoRR abs/1107.0028 (2011)

Noam Nisan, Amir Ronen: Computationally Feasible VCG Mechanisms. CoRR abs/1110.0025 (2011)

Liad Blumrosen, Noam Nisan, Ilya Segal: Auctions with Severely Bounded Communication. CoRR abs/1110.2733 (2011)

Shahar Dobzinski, Noam Nisan: Mechanisms for Multi-Unit Auctions. J. Artif. Intell. Res. (JAIR) 37: 85-98 (2010)

Moshe Babaioff, Michal Feldman, Noam Nisan: Mixed Strategies in Combinatorial Agency. J. Artif. Intell. Res. (JAIR) 38: 339-369 (2010)

Liad Blumrosen, Noam Nisan: Informational limitations of ascending combinatorial auctions. J. Economic Theory 145(3): 1203-1223 (2010)

Shahar Dobzinski, Noam Nisan, Michael Schapira: Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. Math. Oper. Res. 35(1): 1-13 (2010)

Noam Nisan: Google's Auction for TV Ads. SODA 2010: 741

Shahar Dobzinski, Noam Nisan: Multi-Unit Auctions: Beyond Roberts. CoRR abs/1004.1449 (2010)

Moshe Babaioff, Noam Nisan, Elan Pavlov: Mechanisms for a spatially distributed market. Games and Economic Behavior 66(2): 660-684 (2009)

Ron Lavi, Ahuva Mu'alem, Noam Nisan: Two simplified proofs for Roberts' theorem. Social Choice and Welfare 32(3): 407-423 (2009)

Liad Blumrosen, Noam Nisan: On the Computational Power of Demand Queries. SIAM J. Comput. 39(4): 1372-1391 (2009)

Noam Nisan: Google's Auction for TV Ads. ESA 2009: 553

Noam Nisan, Jason Bayer, Deepak Chandra, Tal Franji, Robert Gardner, Yossi Matias, Neil Rhodes, Misha Seltzer, Danny Tom, Hal R. Varian, Dan Zigmond: Google's Auction for TV Ads. ICALP (2) 2009: 309-327

Shahar Dobzinski, Noam Nisan: A Modular Approach to Roberts' Theorem. SAGT 2009: 14-23

Moshe Babaioff, Michal Feldman, Noam Nisan: Free-Riding and Free-Labor in Combinatorial Agency. SAGT 2009: 109-121

Shimon Schocken, Noam Nisan, Michal Armoni: A synthesis course in hardware architecture, compilers, and software engineering. SIGCSE 2009: 443-447

Noam Nisan, Shimon Schocken: The Elements of Computing Systems - Building a Modern Computer from First Principles. MIT Press 2008, isbn 978-0-262-64068-8, pp. I-XIV, 1-324

Ahuva Mu'alem, Noam Nisan: Truthful approximation mechanisms for restricted combinatorial auctions. Games and Economic Behavior 64(2): 612-631 (2008)

Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos: Theory research at Google. SIGACT News 39(2): 10-28 (2008)

Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms 4(3) (2008)

Assaf Ben-David, Noam Nisan, Benny Pinkas: FairplayMP: a system for secure multi-party computation. ACM Conference on Computer and Communications Security 2008: 257-266

Ehud Friedgut, Gil Kalai, Noam Nisan: Elections Can be Manipulated Often. FOCS 2008: 243-249

Shahar Dobzinski, Ron Lavi, Noam Nisan: Multi-unit Auctions with Budget Limits. FOCS 2008: 260-269

Noam Nisan, Michael Schapira, Aviv Zohar: Asynchronous Best-Reply Dynamics. WINE 2008: 531-538

Liad Blumrosen, Noam Nisan, Ilya Segal: Auctions with Severely Bounded Communication. J. Artif. Intell. Res. (JAIR) 28: 233-266 (2007)

Noam Nisan, Amir Ronen: Computationally Feasible VCG Mechanisms. J. Artif. Intell. Res. (JAIR) 29: 19-47 (2007)

Shahar Dobzinski, Noam Nisan: Mechanisms for multi-unit auctions. ACM Conference on Electronic Commerce 2007: 346-351

Shahar Dobzinski, Noam Nisan: Limitations of VCG-based mechanisms. STOC 2007: 338-344

Benny Lehmann, Daniel J. Lehmann, Noam Nisan: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior 55(2): 270-296 (2006)

Noam Nisan, Ilya Segal: The communication requirements of efficient allocations and supporting prices. J. Economic Theory 129(1): 192-224 (2006)

Moshe Babaioff, Michal Feldman, Noam Nisan: Combinatorial agency. ACM Conference on Electronic Commerce 2006: 18-28

Shahar Dobzinski, Noam Nisan, Michael Schapira: Truthful randomized mechanisms for combinatorial auctions. STOC 2006: 644-652

Moshe Babaioff, Michal Feldman, Noam Nisan: Mixed Strategies in Combinatorial Agency. WINE 2006: 353-364

Shahar Dobzinski, Noam Nisan: Approximations by Computationally-Efficient VCG-Based Mechanisms. Electronic Colloquium on Computational Complexity (ECCC) 13(074) (2006)

Noam Nisan: A Note on the computational hardness of evolutionary stable strategies. Electronic Colloquium on Computational Complexity (ECCC) 13(076) (2006)

Noam Nisan, Shimon Schocken: The Elements of Computing Systems - Building a Modern Computer from First Principles. MIT Press 2005, isbn 978-0-262-14087-4, pp. I-XIV, 1-324

Liad Blumrosen, Noam Nisan: On the computational power of iterative auctions. ACM Conference on Electronic Commerce 2005: 29-43

Ron Lavi, Noam Nisan: Online ascending auctions for gradually expiring items. SODA 2005: 1146-1155

Shahar Dobzinski, Noam Nisan, Michael Schapira: Approximation algorithms for combinatorial auctions with complement-free bidders. STOC 2005: 610-618

Noam Nisan, Ilya Segal: Exponential communication inefficiency of demand queries. TARK 2005: 158-164

Moshe Babaioff, Noam Nisan: Concurrent Auctions Across The Supply Chain. J. Artif. Intell. Res. (JAIR) 21: 595-629 (2004)

Ron Lavi, Noam Nisan: Competitive analysis of incentive compatible on-line auctions. Theor. Comput. Sci. 310(1-3): 159-180 (2004)

Moshe Babaioff, Noam Nisan, Elan Pavlov: Mechanisms for a spatially distributed market. ACM Conference on Electronic Commerce 2004: 9-20

Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. SPAA 2004: 20-24

Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella: Fairplay - Secure Two-Party Computation System. USENIX Security Symposium 2004: 287-302

Liad Blumrosen, Noam Nisan, Ilya Segal: Multi-player and Multi-round Auctions with Severely Bounded Communication. ESA 2003: 102-113

Ron Lavi, Ahuva Mu'alem, Noam Nisan: Towards a Characterization of Truthful Combinatorial Auctions. FOCS 2003: 574-583

Yair Bartal, Rica Gonen, Noam Nisan: Incentive compatible multi unit combinatorial auctions. TARK 2003: 72-87

Ahuva Mu'alem, Noam Nisan: Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. AAAI/IAAI 2002: 379-384

Liad Blumrosen, Noam Nisan: Auctions with Severely Bounded Communication. FOCS 2002: 406-415

Noam Nisan: The Communication Complexity of Approximate Set Packing and Covering. ICALP 2002: 868-875

Benny Lehmann, Daniel J. Lehmann, Noam Nisan: Combinatorial Auctions with Decreasing Marginal Utilities. CoRR cs.GT/0202015 (2002)

Ilan Kremer, Noam Nisan, Dana Ron: Errata for: "On randomized one-round communication complexity". Computational Complexity 10(4): 314-315 (2001)

Noam Nisan, Amir Ronen: Algorithmic Mechanism Design. Games and Economic Behavior 35(1-2): 166-196 (2001)

Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas: Neighborhood Preserving Hashing and Approximate Queries. SIAM J. Discrete Math. 15(1): 73-85 (2001)

Moshe Babaioff, Noam Nisan: Concurrent auctions across the supply chain. ACM Conference on Electronic Commerce 2001: 1-10

Benny Lehmann, Daniel J. Lehmann, Noam Nisan: Combinatorial auctions with decreasing marginal utilities. ACM Conference on Electronic Commerce 2001: 18-28

Edo Zurel, Noam Nisan: An efficient approximate allocation algorithm for combinatorial auctions. ACM Conference on Electronic Commerce 2001: 125-136

Lior Levy, Liad Blumrosen, Noam Nisan: On-Line Markets for Distributed Object Services: The MAJIC System. USITS 2001: 85-96

Ori Regev, Noam Nisan: The POPCORN market. Online markets for computational resources. Decision Support Systems 28(1-2): 177-189 (2000)

Noam Nisan: Bidding and allocation in combinatorial auctions. ACM Conference on Electronic Commerce 2000: 1-12

Ron Lavi, Noam Nisan: Competitive analysis of incentive compatible on-line auctions. ACM Conference on Electronic Commerce 2000: 233-241

Noam Nisan, Amir Ronen: Computationally feasible VCG mechanisms. ACM Conference on Electronic Commerce 2000: 242-252

Ilan Kremer, Noam Nisan, Dana Ron: On Randomized One-Round Communication Complexity. Computational Complexity 8(1): 21-49 (1999)

Yishay Mansour, Noam Nisan, Uzi Vishkin: Trade-offs between Communication Throughput and Parallel Time. J. Complexity 15(1): 148-166 (1999)

Noam Nisan, Amnon Ta-Shma: Extracting Randomness: A Survey and New Constructions. J. Comput. Syst. Sci. 58(1): 148-173 (1999)

David R. Karger, Noam Nisan, Michal Parnas: Fast Connected Components Algorithms for the EREW PRAM. SIAM J. Comput. 28(3): 1021-1034 (1999)

Noam Nisan, Steven Rudich, Michael E. Saks: Products and Help Bits in Decision Trees. SIAM J. Comput. 28(3): 1035-1050 (1999)

Noam Nisan: Algorithms for Selfish Agents. STACS 1999: 1-15

Noam Nisan, Amir Ronen: Algorithmic Mechanism Design (Extended Abstract). STOC 1999: 129-140

Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson: On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci. 57(1): 37-49 (1998)

Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic: Efficient approximation of product distributions. Random Struct. Algorithms 13(1): 1-16 (1998)

Noam Nisan, Shmulik London, Oded Regev, Noam Camiel: Globally Distributed Computation over the Internet - The POPCORN Project. ICDCS 1998: 592-601

Dorit Aharonov, Alexei Kitaev, Noam Nisan: Quantum Circuits with Mixed States. STOC 1998: 20-30

Eyal Kushilevitz, Noam Nisan: Communication complexity. Cambridge University Press 1997, isbn 978-0-521-56067-2, pp. I-XIII, 1-189

Noam Nisan, Avi Wigderson: Lower Bounds on Arithmetic Circuits Via Partial Derivatives. Computational Complexity 6(3): 217-234 (1997)

Noam Nisan, Ziv Bar-Yossef: Pointer Jumping Requires Concurrent Read. STOC 1997: 549-558

Noam Nisan, Ziv Bar-Yossef: Pointer Jumping Requires Concurrent Read. Electronic Colloquium on Computational Complexity (ECCC) 4(8) (1997)

Noam Nisan, David Zuckerman: Randomness is Linear in Space. J. Comput. Syst. Sci. 52(1): 43-52 (1996)

Noam Nisan: Extracting Randomness: How and Why A survey. IEEE Conference on Computational Complexity 1996: 44-58

Noam Nisan, Amnon Ta-Shma: Symmetric Logspace is Closed Under Complement. Chicago J. Theor. Comput. Sci. 1995 (1995)

Noam Nisan, Avi Wigderson: On Rank vs. Communication Complexity. Combinatorica 15(4): 557-565 (1995)

Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan: Amortized Communication Complexity. SIAM J. Comput. 24(4): 736-750 (1995)

Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. SIAM J. Discrete Math. 8(1): 76-92 (1995)

Noam Nisan, Avi Wigderson: Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). FOCS 1995: 16-25

Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson: On data structures and asymmetric communication complexity. STOC 1995: 103-111

Noam Nisan, Amnon Ta-Shma: Symmetric logspace is closed under complement. STOC 1995: 140-146

Ilan Kremer, Noam Nisan, Dana Ron: On randomized one-round communication complexity. STOC 1995: 596-605

Noam Nisan, Avi Wigderson: On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. STOC 1995: 723-732

Oded Goldreich, Leonid A. Levin, Noam Nisan: On Constructing 1-1 One-Way Functions. Electronic Colloquium on Computational Complexity (ECCC) 2(29) (1995)

Oded Goldreich, Noam Nisan, Avi Wigderson: On Yao's XOR-Lemma. Electronic Colloquium on Computational Complexity (ECCC) 2(50) (1995)

Noam Nisan: RL <= SC. Computational Complexity 4: 1-11 (1994)

Noam Nisan, Mario Szegedy: On the Degree of Boolean Functions as Real Polynomials. Computational Complexity 4: 301-313 (1994)

Noam Nisan, Avi Wigderson: Hardness vs Randomness. J. Comput. Syst. Sci. 49(2): 149-167 (1994)

Noam Nisan, Steven Rudich, Michael E. Saks: Products and Help Bits in Decision Trees. FOCS 1994: 318-329

Noam Nisan, Avi Wigderson: On Rank vs. Communication Complexity. FOCS 1994: 831-836

Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas: Neighborhood Preserving Hashing and Approximate Queries. SODA 1994: 251-259

Russell Impagliazzo, Noam Nisan, Avi Wigderson: Pseudorandomness for network algorithms. STOC 1994: 356-364

Yishay Mansour, Noam Nisan, Uzi Vishkin: Trade-offs between communication throughput and parallel time. STOC 1994: 372-381

Noam Nisan, Avi Wigderson: On Rank vs. Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 1(1) (1994)

Noam Nisan, Amnon Ta-Shma: Symmetric Logspace is Closed Under Complement. Electronic Colloquium on Computational Complexity (ECCC) 1(3) (1994)

László Babai, Lance Fortnow, Noam Nisan, Avi Wigderson: BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. Computational Complexity 3: 307-318 (1993)

David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir: On Dice and Coins: Models of Computation for Random Generation. Inf. Comput. 104(2): 159-174 (1993)

Nathan Linial, Yishay Mansour, Noam Nisan: Constant Depth Circuits, Fourier Transform, and Learnability. J. ACM 40(3): 607-620 (1993)

Russell Impagliazzo, Noam Nisan: The Effect of Random Restrictions on Formula Size. Random Struct. Algorithms 4(2): 121-134 (1993)

Noam Nisan, Avi Wigderson: Rounds in Communication Complexity Revisited. SIAM J. Comput. 22(1): 211-219 (1993)

Yishay Mansour, Noam Nisan, Prasoon Tiwari: The Computational Complexity of Universal Hashing. Theor. Comput. Sci. 107(1): 121-133 (1993)

Noam Nisan: On Read-Once vs. Multiple Access to Randomness in Logspace. Theor. Comput. Sci. 107(1): 135-144 (1993)

Noam Nisan, David Zuckerman: More deterministic simulation in logspace. STOC 1993: 235-244

Michael Luby, Noam Nisan: A parallel approximation algorithm for positive linear programming. STOC 1993: 448-457

Noam Nisan: Using hard problems to create pseudorandom generators. ACM Distinguished Dissertations, MIT Press 1992, isbn 978-0-262-14051-5, pp. I-VI, 1-43

Noam Nisan: Pseudorandom generators for space-bounded computation. Combinatorica 12(4): 449-461 (1992)

Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan: Algebraic Methods for Interactive Proof Systems. J. ACM 39(4): 859-868 (1992)

László Babai, Noam Nisan, Mario Szegedy: Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs. J. Comput. Syst. Sci. 45(2): 204-232 (1992)

Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. Structure in Complexity Theory Conference 1992: 262-274

Noam Nisan, Endre Szemerédi, Avi Wigderson: Undirected Connectivity in O(log ^1.5 n) Space. FOCS 1992: 24-29

David R. Karger, Noam Nisan, Michal Parnas: Fast Connected Components Algorithms for the EREW PRAM. SPAA 1992: 373-381

Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic: Approximations of General Independent Distributions. STOC 1992: 10-16

Noam Nisan, Mario Szegedy: On the Degree of Boolean Functions as Real Polynomials. STOC 1992: 462-467

Noam Nisan: RL ⊆ SC. STOC 1992: 619-623

Noam Nisan: Pseudorandom bits for constant depth circuits. Combinatorica 11(1): 63-70 (1991)

Noam Nisan: CREW PRAMs and Decision Trees. SIAM J. Comput. 20(6): 999-1007 (1991)

László Babai, Noam Nisan: BPP has Subexponential Time Simulation unless EXPTIME has Pubishable Proofs. Structure in Complexity Theory Conference 1991: 213-219

Noam Nisan: Lower Bounds for Non-Commutative Computation (Extended Abstract). STOC 1991: 410-418

Noam Nisan, Avi Wigderson: Rounds in Communication Complexity Revisited. STOC 1991: 419-429

Nathan Linial, Noam Nisan: Approximate inclusion-exclusion. Combinatorica 10(4): 349-365 (1990)

Yishay Mansour, Noam Nisan, Prasoon Tiwari: The Computational Complexity of Universal Hashing. Structure in Complexity Theory Conference 1990: 90

Joan Feigenbaum, Sampath Kannan, Noam Nisan: Lower Bounds on Random-Self-Reducibility. Structure in Complexity Theory Conference 1990: 100-109

Noam Nisan: On Read-Once vs. Multiple Access to Randomness in Logspace. Structure in Complexity Theory Conference 1990: 179-184

Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan: Algebraic Methods for Interactive Proof Systems. FOCS 1990: 2-10

Noam Nisan: Psuedorandom Generators for Space-Bounded Computation. STOC 1990: 204-212

Yishay Mansour, Noam Nisan, Prasoon Tiwari: The Computational Complexity of Universal Hashing. STOC 1990: 235-243

Nathan Linial, Noam Nisan: Approximate Inclusion-Exclusion. STOC 1990: 260-270

Noam Nisan, Danny Soroker: Parallel Algorithms for Zero-One Supply-Demand Problems. SIAM J. Discrete Math. 2(1): 108-125 (1989)

Noam Nisan, Avi Wigderson: Hardness vs. Randomness - A Survey (abstract). Structure in Complexity Theory Conference 1989: 54

Nathan Linial, Yishay Mansour, Noam Nisan: Constant Depth Circuits, Fourier Transform, and Learnability. FOCS 1989: 574-579

David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir: On Dice and Coins: Models of Computation for Random Generation. ICALP 1989: 319-340

László Babai, Noam Nisan, Mario Szegedy: Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract). STOC 1989: 1-11

Noam Nisan: CREW PRAMs and Decision Trees. STOC 1989: 327-335

Noam Nisan, Avi Wigderson: Hardness vs. Randomness (Extended Abstract). FOCS 1988: 2-11