pith. sign in

Distributed Approximation of Maximum Independent Set and Maximum Matching , booktitle =

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

2 Pith papers citing it

fields

cs.CR 1 cs.DS 1

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

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.

citing papers explorer

Showing 2 of 2 citing papers.

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

    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.

  • Inertial Mining: Equilibrium Implementation of the Bitcoin Protocol cs.CR · 2026-04-07 · unverdicted · none · ref 18

    Inertial mining is a new protocol that turns Bitcoin's intended longest-chain behavior into a Nash equilibrium by altering miner actions only during off-path forks.