2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.CC2005
The Complexity of Kings
Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe
A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely orient…
cs.CC2004★ 2 cited
Overhead-Free Computation, DCFLs, and CFLs
Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
We study Turing machines that are allowed absolutely no space overhead. The only work space the machines have, beyond the fixed amount of memory implicit in their finite-state cont…