dblp.uni-trier.dewww.uni-trier.de

Noam Nisan Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
121EENoam Nisan: Google's Auction for TV Ads. ESA 2009: 553
120EENoam 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
119EEMoshe Babaioff, Michal Feldman, Noam Nisan: Free-Riding and Free-Labor in Combinatorial Agency. SAGT 2009: 109-121
118EEShahar Dobzinski, Noam Nisan: A Modular Approach to Roberts' Theorem. SAGT 2009: 14-23
117EEShimon Schocken, Noam Nisan, Michal Armoni: A synthesis course in hardware architecture, compilers, and software engineering. SIGCSE 2009: 443-447
2008
116EEAssaf Ben-David, Noam Nisan, Benny Pinkas: FairplayMP: a system for secure multi-party computation. ACM Conference on Computer and Communications Security 2008: 257-266
115EEEhud Friedgut, Gil Kalai, Noam Nisan: Elections Can be Manipulated Often. FOCS 2008: 243-249
114EEShahar Dobzinski, Ron Lavi, Noam Nisan: Multi-unit Auctions with Budget Limits. FOCS 2008: 260-269
113EENoam Nisan, Michael Schapira, Aviv Zohar: Asynchronous Best-Reply Dynamics. WINE 2008: 531-538
112EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms 4(3): (2008)
111EEGagan 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
110EEShahar Dobzinski, Noam Nisan: Mechanisms for multi-unit auctions. ACM Conference on Electronic Commerce 2007: 346-351
109EEShahar Dobzinski, Noam Nisan: Limitations of VCG-based mechanisms. STOC 2007: 338-344
108EELiad Blumrosen, Noam Nisan, Ilya Segal: Auctions with Severely Bounded Communication. J. Artif. Intell. Res. (JAIR) 28: 233-266 (2007)
107EENoam Nisan, Amir Ronen: Computationally Feasible VCG Mechanisms. J. Artif. Intell. Res. (JAIR) 29: 19-47 (2007)
2006
106EEMoshe Babaioff, Michal Feldman, Noam Nisan: Combinatorial agency. ACM Conference on Electronic Commerce 2006: 18-28
105EEShahar Dobzinski, Noam Nisan, Michael Schapira: Truthful randomized mechanisms for combinatorial auctions. STOC 2006: 644-652
104EEMoshe Babaioff, Michal Feldman, Noam Nisan: Mixed Strategies in Combinatorial Agency. WINE 2006: 353-364
103EEShahar Dobzinski, Noam Nisan: Approximations by Computationally-Efficient VCG-Based Mechanisms. Electronic Colloquium on Computational Complexity (ECCC) 13(074): (2006)
102EENoam Nisan: A Note on the computational hardness of evolutionary stable strategies. Electronic Colloquium on Computational Complexity (ECCC) 13(076): (2006)
2005
101EELiad Blumrosen, Noam Nisan: On the computational power of iterative auctions. ACM Conference on Electronic Commerce 2005: 29-43
100EERon Lavi, Noam Nisan: Online ascending auctions for gradually expiring items. SODA 2005: 1146-1155
99EEShahar Dobzinski, Noam Nisan, Michael Schapira: Approximation algorithms for combinatorial auctions with complement-free bidders. STOC 2005: 610-618
98EENoam Nisan, Ilya Segal: Exponential communication inefficiency of demand queries. TARK 2005: 158-164
2004
97EEMoshe Babaioff, Noam Nisan, Elan Pavlov: Mechanisms for a spatially distributed market. ACM Conference on Electronic Commerce 2004: 9-20
96EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. SPAA 2004: 20-24
95EEDahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella: Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!). USENIX Security Symposium 2004: 287-302
94EEMoshe Babaioff, Noam Nisan: Concurrent Auctions Across The Supply Chain. J. Artif. Intell. Res. (JAIR) 21: 595-629 (2004)
93EERon Lavi, Noam Nisan: Competitive analysis of incentive compatible on-line auctions. Theor. Comput. Sci. 310(1-3): 159-180 (2004)
2003
92EELiad Blumrosen, Noam Nisan, Ilya Segal: Multi-player and Multi-round Auctions with Severely Bounded Communication. ESA 2003: 102-113
91EERon Lavi, Ahuva Mu'alem, Noam Nisan: Towards a Characterization of Truthful Combinatorial Auctions. FOCS 2003: 574-583
90EEYair 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
88EELiad Blumrosen, Noam Nisan: Auctions with Severely Bounded Communication. FOCS 2002: 406-415
87EENoam Nisan: The Communication Complexity of Approximate Set Packing and Covering. ICALP 2002: 868-875
86EEBenny Lehmann, Daniel J. Lehmann, Noam Nisan: Combinatorial Auctions with Decreasing Marginal Utilities CoRR cs.GT/0202015: (2002)
2001
85EEMoshe Babaioff, Noam Nisan: Concurrent auctions across the supply chain. ACM Conference on Electronic Commerce 2001: 1-10
84EEEdo Zurel, Noam Nisan: An efficient approximate allocation algorithm for combinatorial auctions. ACM Conference on Electronic Commerce 2001: 125-136
83EEBenny Lehmann, Daniel J. Lehmann, Noam Nisan: Combinatorial auctions with decreasing marginal utilities. ACM Conference on Electronic Commerce 2001: 18-28
82EELior Levy, Liad Blumrosen, Noam Nisan: On-Line Markets for Distributed Object Services: The MAJIC System. USITS 2001: 85-96
81EEIlan Kremer, Noam Nisan, Dana Ron: Errata for: "On randomized one-round communication complexity". Computational Complexity 10(4): 314-315 (2001)
80EEDanny 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
79EENoam Nisan: Bidding and allocation in combinatorial auctions. ACM Conference on Electronic Commerce 2000: 1-12
78EERon Lavi, Noam Nisan: Competitive analysis of incentive compatible on-line auctions. ACM Conference on Electronic Commerce 2000: 233-241
77EENoam Nisan, Amir Ronen: Computationally feasible VCG mechanisms. ACM Conference on Electronic Commerce 2000: 242-252
76EEOri Regev, Noam Nisan: The POPCORN market. Online markets for computational resources. Decision Support Systems 28(1-2): 177-189 (2000)
1999
75EENoam Nisan: Algorithms for Selfish Agents. STACS 1999: 1-15
74EENoam Nisan, Amir Ronen: Algorithmic Mechanism Design (Extended Abstract). STOC 1999: 129-140
73EEIlan Kremer, Noam Nisan, Dana Ron: On Randomized One-Round Communication Complexity. Computational Complexity 8(1): 21-49 (1999)
72EEYishay 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
68EENoam Nisan, Shmulik London, Oded Regev, Noam Camiel: Globally Distributed Computation over the Internet - The POPCORN Project. ICDCS 1998: 592-601
67EEDorit 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
64EENoam 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)
62EENoam Nisan, Ziv Bar-Yossef: Pointer Jumping Requires Concurrent Read Electronic Colloquium on Computational Complexity (ECCC) 4(8): (1997)
1996
61EENoam 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
58EEPeter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson: On data structures and asymmetric communication complexity. STOC 1995: 103-111
57EENoam Nisan, Amnon Ta-Shma: Symmetric logspace is closed under complement. STOC 1995: 140-146
56EEIlan Kremer, Noam Nisan, Dana Ron: On randomized one-round communication complexity. STOC 1995: 596-605
55EENoam Nisan, Avi Wigderson: On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. STOC 1995: 723-732
54EENoam 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)
52EEOded Goldreich, Leonid A. Levin, Noam Nisan: On Constructing 1-1 One-Way Functions Electronic Colloquium on Computational Complexity (ECCC) 2(29): (1995)
51EEOded 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)
49EEMauricio 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
45EERussell Impagliazzo, Noam Nisan, Avi Wigderson: Pseudorandomness for network algorithms. STOC 1994: 356-364
44EEYishay 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)
41EENoam Nisan, Avi Wigderson: On Rank vs. Communication Complexity Electronic Colloquium on Computational Complexity (ECCC) 1(1): (1994)
40EENoam 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
38EENoam Nisan, David Zuckerman: More deterministic simulation in logspace. STOC 1993: 235-244
37EEMichael 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)
34EENathan 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
28EEDavid 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)
22EECarsten 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
6EEDavid 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

Coauthor Index

1Ittai Abraham [96] [112]
2Gagan Aggarwal [111]
3Dorit Aharonov [67]
4Nir Ailon [111]
5Michal Armoni [117]
6László Babai [5] [18] [21] [36]
7Moshe Babaioff [85] [94] [97] [104] [106] [119]
8Ziv Bar-Yossef [62] [64]
9Yair Bartal [90]
10Jason Bayer [120]
11Assaf Ben-David [116]
12Liad Blumrosen [82] [88] [92] [101] [108]
13Noam Camiel [68]
14Deepak Chandra [120]
15Florin Constantin [111]
16Shahar Dobzinski [99] [103] [105] [109] [110] [114] [118]
17Danny Dolev [46] [80]
18Guy Even [27] [65]
19Eyal Even-Dar [111]
20Tomás Feder [50]
21Joan Feigenbaum [11]
22David Feldman [6] [35]
23Jon Feldman [111]
24Michal Feldman [104] [106] [119]
25Lance Fortnow [15] [22] [36]
26Gereon Frahling [111]
27Tal Franji [120]
28Ehud Friedgut [115]
29Robert Gardner [120]
30Cyril Gavoille [96] [112]
31Oded Goldreich [27] [51] [52] [65]
32Rica Gonen [90]
33Yuval Harari [46] [80]
34Monika Rauch Henzinger (Monika Rauch) [111]
35Russell Impagliazzo [6] [33] [35] [45]
36Gil Kalai [115]
37Sampath Kannan [11]
38Mauricio Karchmer [24] [49]
39David R. Karger [28] [70]
40Howard J. Karloff [15] [22]
41Alexei Kitaev [67]
42Ilan Kremer [56] [73] [81]
43Eyal Kushilevitz [24] [49] [50]
44Ron Lavi [78] [91] [93] [100] [114]
45Benny Lehmann [83] [86]
46Daniel J. Lehmann [83] [86]
47Leonid A. Levin [52]
48Lior Levy [82]
49Nathan Linial (Nati Linial) [7] [8] [12] [34] [46] [80]
50Shmulik London [68]
51Michael Luby [27] [37] [65]
52Carsten Lund [15] [22]
53Dahlia Malkhi (Dalia Malki) [95] [96] [112]
54Yishay Mansour [7] [9] [13] [31] [34] [44] [72]
55Yossi Matias [120]
56Peter Bro Miltersen [58] [66]
57Ahuva Mu'alem (Ahuva Mu'alem Weil) [89] [91]
58S. Muthukrishnan (S. Muthu Muthukrishnan) [111]
59Moni Naor [6] [35] [50]
60Martin Pál (Martin Pal) [111]
61Michal Parnas [28] [46] [70] [80]
62Elan Pavlov [97]
63Benny Pinkas [95] [116]
64Oded Regev [68]
65Ori Regev [76]
66Neil Rhodes [120]
67Dana Ron [56] [73] [81]
68Amir Ronen [74] [77] [107]
69Steven Rudich [6] [35] [48] [69]
70Shmuel Safra [58] [66]
71Michael E. Saks [48] [69]
72Mark Sandler [111]
73Michael Schapira [99] [105] [113]
74Shimon Schocken [117]
75Ilya Segal [92] [98] [108]
76Yaron Sella [95]
77Misha Seltzer [120]
78Adi Shamir [6] [35]
79Anastasios Sidiropoulos [111]
80Danny Soroker [2]
81Mario Szegedy [5] [21] [26] [42]
82Endre Szemerédi [29]
83Amnon Ta-Shma [40] [54] [57] [71]
84Mikkel Thorup [96] [112]
85Prasoon Tiwari [9] [13] [31]
86Danny Tom [120]
87Hal R. Varian [120]
88Boban Velickovic [27] [65]
89Uzi Vishkin [44] [72]
90Avi Wigderson [1] [19] [29] [32] [36] [39] [41] [45] [47] [51] [53] [55] [58] [59] [63] [66]
91Dan Zigmond [120]
92Aviv Zohar [113]
93David Zuckerman [38] [60]
94Edo Zurel [84]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)