1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2021
Hard satisfiable formulas for DPLL algorithms using heuristics with small memory
Nikita Gaevoy
DPLL algorithm for solving the Boolean satisfiability problem (SAT) can be represented in the form of a procedure that, using heuristics and , select the variable from t…
cs.NI2019★ 1 cited
New Competitiveness Bounds for the Shared Memory Switch
Ivan Bochkov, Alex Davydow, Nikita Gaevoy +1
We consider one of the simplest and best known buffer management architectures: the shared memory switch with multiple output queues and uniform packets. It was one of the first mo…