| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Better Complexity Bounds for Cost Register Automata | Allender, Eric et al. | 2017 |
| 2 | Does Looking Inside a Circuit Help? | Impagliazzo, Russell et al. | 2017 |
| 3 | The Power of Programs over Monoids in DA | Grosshans, Nathan et al. | 2017 |
| 4 | Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141) | Esparza, Javier et al. | 2014 |
| 5 | Fractional Pebbling and Thrifty Branching Programs | Braverman, Mark et al. | 2009 |
| 6 | Incremental branching programs | Gál, Anna et al. | 2006 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |