pith. sign in

Reiter, Guy Golan-Gueta, and Ittai Abraham

5 Pith papers cite this work. Polarity classification is still indexing.

5 Pith papers citing it

representative citing papers

Herring: Parallel Batch-Order-Fairness on DAG-based Blockchain Consensus

cs.DC · 2026-05-22 · conditional · novelty 8.0

Herring is the first parallel γ-batch-order-fairness DAG BFT protocol that achieves higher saturation throughput than FairDAG-RL and DoD-W by parallelizing graph construction and piggybacking missing edge resolution on reliable broadcast.

Distributed Stochastic Graph Algorithms

cs.DS · 2026-05-20 · unverdicted · novelty 7.0

Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.

A Composable Game-Theoretic Framework for Blockchains

cs.GT · 2025-04-25 · unverdicted · novelty 7.0

Introduces the first compositional game-theoretic framework for blockchains using cross-layer games and cross-application composition to analyze incentive compatibility and reveal vulnerabilities in composed systems.

Fast Byzantine Total Order Broadcast

cs.DC · 2024-12-18 · unverdicted · novelty 7.0

Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.

citing papers explorer

Showing 5 of 5 citing papers.

  • Herring: Parallel Batch-Order-Fairness on DAG-based Blockchain Consensus cs.DC · 2026-05-22 · conditional · none · ref 42

    Herring is the first parallel γ-batch-order-fairness DAG BFT protocol that achieves higher saturation throughput than FairDAG-RL and DoD-W by parallelizing graph construction and piggybacking missing edge resolution on reliable broadcast.

  • Distributed Stochastic Graph Algorithms cs.DS · 2026-05-20 · unverdicted · none · ref 60

    Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.

  • A Composable Game-Theoretic Framework for Blockchains cs.GT · 2025-04-25 · unverdicted · none · ref 47

    Introduces the first compositional game-theoretic framework for blockchains using cross-layer games and cross-application composition to analyze incentive compatibility and reveal vulnerabilities in composed systems.

  • Fast Byzantine Total Order Broadcast cs.DC · 2024-12-18 · unverdicted · none · ref 102

    Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.

  • Secure, Verifiable, and Scalable Multi-Client Data Sharing via Consensus-Based Privacy-Preserving Data Distribution cs.CR · 2026-01-01 · unverdicted · none · ref 25

    CPPDD is a new consensus-based protocol for privacy-preserving multi-client data sharing that achieves unanimous-release confidentiality, linear scalability, and high-probability malicious deviation detection.