• Publications
  • Influence
Propositional Dynamic Logic of Regular Programs
TLDR
A formal syntax and semantics for the propositional dynamic logic of regular programs is defined and principal conclusions are that deciding satisfiability of length n formulas requires time d n /log n for some d > 1, and that satisfiability can be decided in nondeterministic time cn for some c. Expand
Improving generalization with active learning
TLDR
A formalism for active concept learning called selective sampling is described and it is shown how it may be approximately implemented by a neural network. Expand
The Computational Complexity of Provability in Systems of Modal Propositional Logic
  • R. Ladner
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 September 1977
The computational complexity of the provability problem in systems of modal propositional logic is investigated. Every problem computable in polynomial space is $\log $ space reducible to theExpand
Parallel Prefix Computation
TLDR
A recurstve construction is used to obtain a product circuit for solving the prefix problem and a Boolean clrcmt which has depth 2[Iog2n] + 2 and size bounded by 14n is obtained for n-bit binary addmon. Expand
On the Structure of Polynomial Time Reducibility
  • R. Ladner
  • Mathematics, Computer Science
  • JACM
  • 1975
TLDR
The method of showing density ymlds the result that if P ~ NP then there are members of NP -P that are not polynomml complete is shown, which means there is a strictly ascending sequence with a minimal pair of upper bounds to the sequence. Expand
Unequal loss protection: graceful degradation of image quality over packet erasure channels through forward error correction
TLDR
It is found that when optimizing for an exponential packet loss model with a mean loss rate of 20% and using a total rate of 0.2 bits per pixel on the Lenna image, good image quality can be obtained even when 40% of transmitted packets are lost. Expand
The influence of caches on the performance of sorting
TLDR
This work restructure mergesort, quicksort, and heapsort in order to improve their cache locality and investigates the effect that caches have on the performance of sorting algorithms both experimentally and analytically. Expand
The circuit value problem is log space complete for P
  • R. Ladner
  • Computer Science, Mathematics
  • SIGA
  • 1975
TLDR
The set P is the set of problems computable in polynomial_ time and the circuit value problem is CV, which is well known that a T(n) time bounded Turing machine can be simulate on n bits by a combinational circuit with 0(T-(n) gates. Expand
Freedom to roam: a study of mobile device adoption and accessibility for people with visual and motor disabilities
TLDR
This formative study examines how people with visual and motor disabilities select, adapt, and use mobile devices in their daily lives, and provides guidelines for more accessible and empowering mobile device design. Expand
Usable gestures for blind people: understanding preference and performance
TLDR
It is found that blind people have different gesture preferences than sighted people, including preferences for edge-based gestures and gestures that involve tapping virtual keys on a keyboard. Expand
...
1
2
3
4
5
...