The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Noam Nisan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ahuva Mu'alem, Noam Nisan
    Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:379-384 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. Noam Nisan
    Hardness vs. Randomness - A Survey (abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:54- [Conf]
  7. 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]
  8. Noam Nisan
    Extracting Randomness: How and Why A survey. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:44-58 [Conf]
  9. 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]
  10. Liad Blumrosen, Noam Nisan
    Auctions with Severely Bounded Communication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:406-415 [Conf]
  11. 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]
  12. Nathan Linial, Yishay Mansour, Noam Nisan
    Constant Depth Circuits, Fourier Transform, and Learnability [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:574-579 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. Noam Nisan, Avi Wigderson
    Hardness vs. Randomness (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:2-11 [Conf]
  17. Noam Nisan, Avi Wigderson
    On Rank vs. Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:831-836 [Conf]
  18. 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]
  19. 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]
  20. Noam Nisan
    The Communication Complexity of Approximate Set Packing and Covering. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:868-875 [Conf]
  21. 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]
  22. Moshe Babaioff, Michal Feldman, Noam Nisan
    Combinatorial agency. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:18-28 [Conf]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. Noam Nisan
    Bidding and allocation in combinatorial auctions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2000, pp:1-12 [Conf]
  30. Noam Nisan, Amir Ronen
    Computationally feasible VCG mechanisms. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2000, pp:242-252 [Conf]
  31. 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]
  32. Ron Lavi, Noam Nisan
    Online ascending auctions for gradually expiring items. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1146-1155 [Conf]
  33. 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]
  34. 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]
  35. Noam Nisan
    Algorithms for Selfish Agents. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:1-15 [Conf]
  36. Dorit Aharonov, Alexei Kitaev, Noam Nisan
    Quantum Circuits with Mixed States. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:20-30 [Conf]
  37. 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]
  38. 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]
  39. Shahar Dobzinski, Noam Nisan, Michael Schapira
    Truthful randomized mechanisms for combinatorial auctions. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:644-652 [Conf]
  40. 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]
  41. Russell Impagliazzo, Noam Nisan, Avi Wigderson
    Pseudorandomness for network algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:356-364 [Conf]
  42. Ilan Kremer, Noam Nisan, Dana Ron
    On randomized one-round communication complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:596-605 [Conf]
  43. Nathan Linial, Noam Nisan
    Approximate Inclusion-Exclusion [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:260-270 [Conf]
  44. Michael Luby, Noam Nisan
    A parallel approximation algorithm for positive linear programming. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:448-457 [Conf]
  45. Yishay Mansour, Noam Nisan, Prasoon Tiwari
    The Computational Complexity of Universal Hashing [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:235-243 [Conf]
  46. 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]
  47. 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]
  48. Noam Nisan
    CREW PRAMs and Decision Trees [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:327-335 [Conf]
  49. Noam Nisan
    Psuedorandom Generators for Space-Bounded Computation [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:204-212 [Conf]
  50. Noam Nisan
    Lower Bounds for Non-Commutative Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:410-418 [Conf]
  51. Noam Nisan
    RL\subseteqSC [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:619-623 [Conf]
  52. Noam Nisan, Ziv Bar-Yossef
    Pointer Jumping Requires Concurrent Read. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:549-558 [Conf]
  53. Noam Nisan, Amir Ronen
    Algorithmic Mechanism Design (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:129-140 [Conf]
  54. Noam Nisan, Mario Szegedy
    On the Degree of Boolean Functions as Real Polynomials [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:462-467 [Conf]
  55. Noam Nisan, Amnon Ta-Shma
    Symmetric logspace is closed under complement. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:140-146 [Conf]
  56. Noam Nisan, Avi Wigderson
    Rounds in Communication Complexity Revisited [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:419-429 [Conf]
  57. 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]
  58. Noam Nisan, David Zuckerman
    More deterministic simulation in logspace. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:235-244 [Conf]
  59. Yair Bartal, Rica Gonen, Noam Nisan
    Incentive compatible multi unit combinatorial auctions. [Citation Graph (0, 0)][DBLP]
    TARK, 2003, pp:72-87 [Conf]
  60. Noam Nisan, Ilya Segal
    Exponential communication inefficiency of demand queries. [Citation Graph (0, 0)][DBLP]
    TARK, 2005, pp:158-164 [Conf]
  61. 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]
  62. 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]
  63. Moshe Babaioff, Michal Feldman, Noam Nisan
    Mixed Strategies in Combinatorial Agency. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:353-364 [Conf]
  64. 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]
  65. 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]
  66. 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]
  67. Noam Nisan
    RL <= SC. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:1-11 [Journal]
  68. 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]
  69. 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]
  70. 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]
  71. Nathan Linial, Noam Nisan
    Approximate inclusion-exclusion. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:4, pp:349-365 [Journal]
  72. Noam Nisan
    Pseudorandom bits for constant depth circuits. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:1, pp:63-70 [Journal]
  73. Noam Nisan
    Pseudorandom generators for space-bounded computation. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:4, pp:449-461 [Journal]
  74. Noam Nisan, Avi Wigderson
    On Rank vs. Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:557-565 [Journal]
  75. 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]
  76. 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]
  77. 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]
  78. 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]
  79. 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]
  80. 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]
  81. 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]
  82. 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]
  83. 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]
  84. 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]
  85. 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]
  86. 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]
  87. 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]
  88. 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]
  89. 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]
  90. 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]
  91. 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]
  92. 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]
  93. 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]
  94. Noam Nisan
    CREW PRAMs and Decision Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:6, pp:999-1007 [Journal]
  95. 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]
  96. 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]
  97. 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]
  98. 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]
  99. 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]
  100. 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]
  101. 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]
  102. 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]
  103. Shahar Dobzinski, Noam Nisan
    Mechanisms for multi-unit auctions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:346-351 [Conf]
  104. Shahar Dobzinski, Noam Nisan
    Limitations of VCG-based mechanisms. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:338-344 [Conf]
  105. 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]
  106. 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]
  107. 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]

  108. FairplayMP: a system for secure multi-party computation. [Citation Graph (, )][DBLP]


  109. Google's Auction for TV Ads. [Citation Graph (, )][DBLP]


  110. Multi-unit Auctions with Budget Limits. [Citation Graph (, )][DBLP]


  111. Elections Can be Manipulated Often. [Citation Graph (, )][DBLP]


  112. Google's Auction for TV Ads. [Citation Graph (, )][DBLP]


  113. A synthesis course in hardware architecture, compilers, and software engineering. [Citation Graph (, )][DBLP]


  114. Google's Auction for TV Ads. [Citation Graph (, )][DBLP]


  115. Asynchronous Best-Reply Dynamics. [Citation Graph (, )][DBLP]


  116. Free-Riding and Free-Labor in Combinatorial Agency. [Citation Graph (, )][DBLP]


  117. A Modular Approach to Roberts' Theorem. [Citation Graph (, )][DBLP]


  118. Multi-Unit Auctions: Beyond Roberts [Citation Graph (, )][DBLP]


  119. A Note on the computational hardness of evolutionary stable strategies. [Citation Graph (, )][DBLP]


  120. Approximations by Computationally-Efficient VCG-Based Mechanisms. [Citation Graph (, )][DBLP]


Search in 0.679secs, Finished in 0.682secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002