activity
20122026
most citedDeciding Probabilistic Automata Weak Bisimulation in Polynomial Time

6 citations · 17 across the 16 of their papers we have counts for

collaborators
Showing cs.CRShow all

1 paper · 1 filter

cs.CR2026

Synthesizing Probabilistic Saturating Counters with Differentially Private Formal Guarantees

Zhiming Chi, Lutan Zhao, Depeng Liu +8

Branch predictors improve instruction-level parallelism in modern processors and are commonly modeled using saturating counters. However, classical saturating counters are determin…