Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| On the complexity of detecting hazards | 0 | 0.34 | 2020 |
| On the Complexity of Hazard-free Circuits | 0 | 0.34 | 2019 |
| Graph Pattern Polynomials. | 0 | 0.34 | 2018 |
| Pebbling Meets Coloring: Reversible Pebble Game On Trees. | 1 | 0.37 | 2016 |
| Comparator Circuits over Finite Bounded Posets. | 0 | 0.34 | 2015 |
| Comparator Circuits over Finite Bounded Posets. | 0 | 0.34 | 2015 |
| Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. | 1 | 0.35 | 2014 |
| On the Complexity of L-reachability. | 1 | 0.36 | 2014 |
| Pebbling, Entropy, and Branching Program Size Lower Bounds | 1 | 0.39 | 2013 |