Q5090444 (Q5090444): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ITCS.2019.64 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full proof of the BGW protocol for perfectly secure multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy, additional information and communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information statistics approach to data stream and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to compress interactive communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness complexity of private computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Information Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: From information to exact communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Range of Topological Effects on Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal model for secure computation (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity of approximate matching in distributed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Party Protocols, Information Complexity and Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness in Private Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing linear size circuits in terms of privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On data structures and asymmetric communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed verification and hardness of distributed approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Lower Bound for Distinct Elements in the Message Passing Model / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ITCS.2019.64 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7559107
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7559107

    Statements

    0 references
    0 references
    18 July 2022
    0 references
    communication complexity
    0 references
    multi-party communication complexity
    0 references
    peer-to-peer communication complexity
    0 references
    information complexity
    0 references
    private computation
    0 references
    0 references
    0 references

    Identifiers