Automata-based representations and related algorithms have been applied to address
several problems in information security, and often the automata had to be augmented with …

We prove the first time-space lower bound trade-offs for randomized computation of decision
problems. The bounds hold even in the case that the computation is allowed to have …

We obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1} n→{0, 1}
on general branching programs by exhibiting a Boolean function f that requires exponential …

We establish more efficient methods for solving interesting classes of NP-hard problems
exactly, as well as methods for proving limitations on how quickly those and other problems …

We prove the first time-space tradeoffs for counting the number of solutions to an NP
problem modulo small integers, and also improve upon known time-space tradeoffs for S at …

We obtain the first non-trivial time-space tradeoff lower bound for functions f:{0, 1}/sup n//spl
rarr/{0, 1} on general branching programs by exhibiting a Boolean function f that requires …

WC obtain an exponential separation between consecutive levels in the hierarchy of classes
of functions computable by syntactic read-k-times branching programs of polynomial size, for …

Abstract Automata-based representations and related algorithms have been applied to
address several problems in information security, and often the automata had to be …

Gait analysis has applications not only in medical, rehabilitation and sports, but it can also
play a decisive role in security and surveillance as a behavioral biometric factor. This paper …

We prove the first time-space lower bound tradeoffs for randomized computation of decision
problems. The bounds hold even in the case that the computation is allowed to have …