5 citations · 16 across the 17 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CC2015
Recognizing Union-Find trees is NP-complete
Kitti Gelle, Szabolcs Ivan
Disjoint-Set forests, consisting of Union-Find trees are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact…
cs.CC2015★ 1 cited
Fractional coverings, greedy coverings, and rectifier networks
Dmitry Chistikov, Szabolcs Iván, Anna Lubiw +1
A rectifier network is a directed acyclic graph with distinguished sources and sinks; it is said to compute a Boolean matrix that has a in the entry iff there is a…
cs.FL2015
Algebraic Characterization of Forest Logics
Kitti Gelle, Szabolcs Ivan
In this paper we define future-time branching temporal logics evaluated over forests, that is, ordered tuples of ordered, but unranked, finite trees. We associate a rich class FL[$…