On the public citation graph
The Cost of Fault Tolerance in Multi-Party Communication Complexity
0 signed · 73 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11681878_16openalex-snapshot
Efficient Multi-party Computation with Dispute Control
inferredcites →https://doi.org/10.1007/11818175_28openalex-snapshot
Robust Multiparty Computation with Linear Communication Complexity
inferredcites →https://doi.org/10.1007/3-540-44448-3_12openalex-snapshot
Efficient Secure Multi-party Computation
inferredcites →https://doi.org/10.1007/3-540-48184-2_7openalex-snapshot
Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result
inferredcites →https://doi.org/10.1007/978-3-540-78524-8_13openalex-snapshot
Perfectly-Secure MPC with Linear Communication Complexity
inferredcites →https://doi.org/10.1007/978-3-642-02164-0_6openalex-snapshot
Fault-Tolerant Aggregation by Flow Updating
inferredcites →https://doi.org/10.1007/978-3-642-04355-0_47openalex-snapshot
From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
inferredcites →https://doi.org/10.1007/978-3-642-17679-1_18openalex-snapshot
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
inferredcites →https://doi.org/10.1007/978-3-642-28209-6_7openalex-snapshot
LiMoSense – Live Monitoring in Dynamic Sensor Networks
inferredcites →https://doi.org/10.1007/bf00196771openalex-snapshot
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
inferredcites →https://doi.org/10.1007/bf02280836openalex-snapshot
Fast consensus in networks of bounded degree
inferredcites →https://doi.org/10.1007/s00446-011-0130-zopenalex-snapshot
Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
inferredcites →https://doi.org/10.1016/0020-0190(91)90157-dopenalex-snapshot
Private vs. common random bits in communication complexity
inferredcites →https://doi.org/10.1016/0022-0000(85)90041-8openalex-snapshot
Probabilistic counting algorithms for data base applications
inferredcites →https://doi.org/10.1016/j.jcss.2003.11.006openalex-snapshot
An information statistics approach to data stream and communication complexity
inferredcites →https://doi.org/10.1016/j.jcss.2006.10.007openalex-snapshot
The price of validity in dynamic networks
inferredcites →https://doi.org/10.1023/a:1009726021843openalex-snapshot
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
inferredcites →https://doi.org/10.1023/a:1022455407000openalex-snapshot
On the Sperner Capacity of the Cyclic Triangle
inferredcites →https://doi.org/10.1109/18.556671openalex-snapshot
Coding for interactive communication
inferredcites →https://doi.org/10.1109/ccc.2010.32openalex-snapshot
Communication Complexity with Synchronized Clocks
inferredcites →https://doi.org/10.1109/focs.2006.77openalex-snapshot
Towards Secure and Scalable Computation in Peer-to-Peer Networks
inferredcites →https://doi.org/10.1109/icde.2004.1320018openalex-snapshot
Approximate aggregation techniques for sensor databases
inferredcites →https://doi.org/10.1109/mcom.2006.1632656openalex-snapshot
Toward a theory of in-network computation in wireless sensor networks
inferredcites →https://doi.org/10.1109/sfcs.1982.88openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1109/sfcs.2003.1238221openalex-snapshot
Gossip-based computation of aggregate information
inferredcites →https://doi.org/10.1109/spdp.1993.395484openalex-snapshot
Communication complexity of fault-tolerant information diffusion
inferredcites →https://doi.org/10.1109/tit.2010.2080850openalex-snapshot
Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels
inferredcites →https://doi.org/10.1109/tsp.2009.2016247openalex-snapshot
Broadcast Gossip Algorithms for Consensus
inferredcites →https://doi.org/10.1145/1082469.1082470openalex-snapshot
Gossip-based aggregation in large dynamic networks
inferredcites →https://doi.org/10.1145/1142351.1142395openalex-snapshot
Efficient gossip-based aggregate computation
inferredcites →https://doi.org/10.1145/1146381.1146401openalex-snapshot
Computing separable functions via gossip
inferredcites →https://doi.org/10.1145/129712.129780openalex-snapshot
Communication complexity of secure computation (extended abstract)
inferredcites →https://doi.org/10.1145/1340771.1340773openalex-snapshot
Synopsis diffusion for robust aggregation in sensor networks
inferredcites →https://doi.org/10.1145/1400751.1400837openalex-snapshot
Gossip-based aggregate computation
inferredcites →https://doi.org/10.1145/1582716.1582738openalex-snapshot
Fast scalable deterministic consensus for crash failures
inferredcites →https://doi.org/10.1145/167088.167109openalex-snapshot
Asynchronous secure computation
inferredcites →https://doi.org/10.1145/1810479.1810504openalex-snapshot
Optimal gossip-based aggregate computation
inferredcites →https://doi.org/10.1145/1835698.1835798openalex-snapshot
Breaking the O ( n 2 ) bit barrier
inferredcites →https://doi.org/10.1145/195058.195462openalex-snapshot
A coding theorem for distributed computation
inferredcites →https://doi.org/10.1145/1993636.1993644openalex-snapshot
An optimal lower bound on the communication complexity of gap-hamming-distance
inferredcites →https://doi.org/10.1145/1993636.1993659openalex-snapshot
Towards coding for maximum errors in interactive communication
inferredcites →https://doi.org/10.1145/1993636.1993686openalex-snapshot
Distributed verification and hardness of distributed approximation
inferredcites →https://doi.org/10.1145/2332432.2332442openalex-snapshot
The cost of fault tolerance in multi-party communication complexity
inferredcites →https://doi.org/10.1145/237814.237823openalex-snapshot
The space complexity of approximating the frequency moments
inferredcites →https://doi.org/10.1145/501431.501435openalex-snapshot
Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/62212.62214openalex-snapshot
Multiparty unconditionally secure protocols
inferredcites →https://doi.org/10.1145/73007.73014openalex-snapshot
Verifiable secret sharing and multiparty protocols with honest majority
inferredcites →https://doi.org/10.48550/arxiv.1002.4561openalex-snapshot
Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary
inferredcites →https://doi.org/10.5555/1147685.1147741openalex-snapshot
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00446-015-0254-7openalex-snapshot
Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions
inferred← citeshttps://doi.org/10.1007/s00446-019-00360-4openalex-snapshot
Some lower bounds in dynamic networks with oblivious adversaries
inferred← citeshttps://doi.org/10.1007/s00453-024-01250-3openalex-snapshot
Sublinear Algorithms in T-Interval Dynamic Networks
inferred← citeshttps://doi.org/10.1007/s11856-017-1621-9openalex-snapshot
The wonderland of reflections
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.10.001openalex-snapshot
On the complexity of H -coloring for special oriented trees
inferred← citeshttps://doi.org/10.1145/2611462.2611475openalex-snapshot
Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions
inferred← citeshttps://doi.org/10.1145/2935764.2935781openalex-snapshot
The Cost of Unknown Diameter in Dynamic Networks
inferred← citeshttps://doi.org/10.1145/3209665openalex-snapshot
The Cost of Unknown Diameter in Dynamic Networks
inferred← citeshttps://doi.org/10.1145/3350755.3400228openalex-snapshot
Sublinear Algorithms in T-interval Dynamic Networks
inferred← citeshttps://doi.org/10.1145/3662158.3662778openalex-snapshot
On Self-stabilizing Leader Election in Directed Networks
inferred← citeshttps://doi.org/10.1145/3662158.3662803openalex-snapshot
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient
inferred← citeshttps://doi.org/10.1145/3725985openalex-snapshot
Efficient Fault Tolerance for Stateful Serverless Computing with Asymmetric Logging
inferred← citeshttps://doi.org/10.9770/jesi.2020.7.3(35)openalex-snapshot
Knowledge management significance and communication complexity in the context of innovative enterprises: case of Polish NewConnect market
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.