• Publications
  • Influence
Propositional Dynamic Logic of Regular Programs
TLDR
We introduce a fundamental propositional logical system based on modal logic for describing correctness, termination and equivalence of programs and give several consequences of the definition. Expand
  • 1,272
  • 133
  • PDF
Improving generalization with active learning
TLDR
Active learning differs from “learning from examples” in that the learning algorithm assumes at least some control over what part of the input domain it receives information about. Expand
  • 1,390
  • 84
  • PDF
The Computational Complexity of Provability in Systems of Modal Propositional Logic
  • R. Ladner
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 September 1977
TLDR
The computational complexity of the provability problem in systems of modal propositional logic is investigated. Expand
  • 540
  • 78
  • PDF
Parallel Prefix Computation
TLDR
A recurstve construction IS used to obtain a product circuit for solving the prefix problem which has depth exactly [log:n] and size bounded by 4n An application yields fast Boolean ctrcmts to simulate fimte-state transducers. Expand
  • 975
  • 63
  • PDF
On the Structure of Polynomial Time Reducibility
TLDR
Two notions of polynomml time reduclbihty, denoted here by ~ T e and <.~P, were defined by Cook and Karp, respectively . Expand
  • 717
  • 52
Unequal loss protection: graceful degradation of image quality over packet erasure channels through forward error correction
TLDR
We present the unequal loss protection (ULP) framework in which unequal amounts of forward error correction are applied to progressive data to provide graceful degradation of image quality as packet losses increase. Expand
  • 495
  • 34
  • PDF
The influence of caches on the performance of sorting
TLDR
We investigate the effect that caches have on the performance of sorting algorithms both experimentally and analytically. Expand
  • 229
  • 25
  • PDF
The circuit value problem is log space complete for P
TLDR
A set C is log space complete for P if C e P and for all A e P, A <_log C. The set P is the set of problems computable in polynomial_ time. Expand
  • 320
  • 23
Freedom to roam: a study of mobile device adoption and accessibility for people with visual and motor disabilities
TLDR
We present a formative study that examines how people with visual and motor disabilities select, adapt, and use mobile devices in their daily lives. Expand
  • 310
  • 20
  • PDF
Usable gestures for blind people: understanding preference and performance
TLDR
We found that blind people have different gesture preferences than sighted people, including preferences for edge-based gestures and gestures that involve tapping virtual keys. Expand
  • 261
  • 20
  • PDF