Multiparty communication complexity

Results: 14



#Item
1

The multiparty communication complexity of interleaved group products W. T. Gowers∗ Emanuele Viola†

Add to Reading List

Source URL: www.ccs.neu.edu

Language: English - Date: 2016-08-10 10:37:12
    2

    The multiparty communication complexity of interleaved group products October 2016 Emanuele Viola NEU Joint work with Timothy Gowers

    Add to Reading List

    Source URL: www.ccs.neu.edu

    Language: English - Date: 2016-10-07 10:40:40
      3Cryptography / Mathematical analysis / Quantum complexity theory / Computational complexity theory / Functions and mappings / Secure multi-party computation / Communication complexity / Secure two-party computation / Limit of a function / Cryptographic protocol / Pi / PP

      Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

      Add to Reading List

      Source URL: cs-www.cs.yale.edu

      Language: English - Date: 2006-09-25 10:55:42
      4Communication / Communication complexity / Computational complexity theory / Quantum complexity theory / Quantum information science

      Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11.

      Add to Reading List

      Source URL: people.cs.uchicago.edu

      Language: English - Date: 2014-04-12 03:40:34
      5Quantum complexity theory / Computational complexity theory / Cryptography / Functions and mappings / Secure multi-party computation / Secure two-party computation / Communication complexity / Limit of a function / Pi / Cryptographic protocol / PP / Approximation algorithm

      Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

      Add to Reading List

      Source URL: www.cs.yale.edu

      Language: English - Date: 2006-09-25 10:55:42
      6

      The NOF Multiparty Communication Complexity of Composed Functions? Anil Ada1 , Arkadev Chattopadhyay2 , Omar Fawzi1 , and Phuong Nguyen2 1 2

      Add to Reading List

      Source URL: www.cs.toronto.edu

      Language: English - Date: 2012-04-17 14:43:13
        7

        Languages with Bounded Multiparty Communication Complexity ∗ Arkadev Chattopadhyay Andreas Krebs

        Add to Reading List

        Source URL: www2.ift.ulaval.ca

        Language: English - Date: 2014-01-17 10:59:55
          8

          Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness Anup Rao∗1 and Amir Yehudayoff†2 1 Department of Computer Science and Engineering

          Add to Reading List

          Source URL: drops.dagstuhl.de

          Language: English - Date: 2015-05-27 10:18:38
            9

            Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy∗ Jeff M. Phillips School of Computing University of Utah

            Add to Reading List

            Source URL: www.cs.utah.edu

            Language: English - Date: 2011-10-06 13:16:06
              10Computational complexity theory / PP / Communication complexity / Pseudorandom generator / Multiparty communication complexity / Vitali covering lemma / Theoretical computer science / Applied mathematics / Quantum complexity theory

              Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness Anup Rao∗1 and Amir Yehudayoff†2 1 Department of Computer Science and Engineering

              Add to Reading List

              Source URL: homes.cs.washington.edu

              Language: English - Date: 2015-04-07 12:10:30
              UPDATE