2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2008
Improved Monotone Circuit Depth Upper Bound for Directed Graph Reachability
Sergey Volkov
We prove that the directed graph reachability problem (transitive closure) can be solved by monotone fan-in 2 boolean circuits of depth (1/2+o(1))(log n)^2, where n is the number o…
cs.DS2007★ 2 cited
P-adic arithmetic coding
Anatoly Rodionov, Sergey Volkov
A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding pro…