The quasilinear isomorphism challenge
ACM SIGACT News
Nonerasing, counting, and majority over the linear time hierarchy
Information and Computation
Linear time and the power of one first-order universal quantifier
Information and Computation
MonadicNLIN and Quantifier-Free Reductions
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Local Problems, Planar Local Problems and Linear Time
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Graph properties checkable in linear time in the number of vertices
Journal of Computer and System Sciences
On the expressive power of monadic least fixed point logic
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
A logical characterisation of linear time on nondeterministic turing machines
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
A new parallel algorithm for the prefix minima problem is presented for inputs drawn from the range of integers $[1..s]$. For an input of size $n$, it runs in $O(\log\log\log s)$ time and $O(n)$ work (which is optimal). A faster algorithm is presented ...