19 citations · 19 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013
On the Complexity of Temporal-Logic Path Checking
Daniel Bundala, Joël Ouaknine
Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this ta…
cs.DM2013
Optimal Sorting Networks
Daniel Bundala, Jakub Závodný
This paper settles the optimality of sorting networks given in The Art of Computer Programming vol. 3 more than 40 years ago. The book lists efficient sorting networks with n <= 16…