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