14 citations · 32 across the 19 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 2 cited
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
Andreas Björklund, Petteri Kaski, Ioannis Koutis
We are motivated by a tantalizing open question in exact algorithms: can we detect whether an -vertex directed graph has a Hamiltonian cycle in time significantly less than…
cs.DS2016★ 1 cited
How proofs are prepared at Camelot
Andreas Björklund, Petteri Kaski
We study a design framework for robust, independently verifiable, and workload-balanced distributed algorithms working on a common input. An algorithm based on the framework is ess…