#### Filter Results:

- Full text PDF available (59)

#### Publication Year

1973

2018

- This year (11)
- Last 5 years (50)
- Last 10 years (99)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michael J. Fischer, Richard E. Ladner
- J. Comput. Syst. Sci.
- 1979

We introduce a fundamental propositional logical system based on modal logic for describing correctness, termination and equivalence of programs. We define a formal syntax and semantics for the… (More)

- David A. Cohn, Les E. Atlas, Richard E. Ladner
- Machine Learning
- 1994

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. In some… (More)

- Richard E. Ladner, Michael J. Fischer
- J. ACM
- 1980

The prefix problem is to compute all the products x t o x2 . . . . o xk for i ~ k .~ n, where o is an associative operation A recurstve construction IS used to obtain a product circuit for solving… (More)

- Richard E. Ladner
- SIAM J. Comput.
- 1977

The computational complexity of the provability problem in systems of modal proposi-tional logic is investigated. Every problem computable in polynomial space is log space reducible to the… (More)

- Richard E. Ladner
- J. ACM
- 1975

Two notions of polynomml time reduclbihty, denoted here by ~ T e and <.~P, were defined by Cook and Karp, respectively The abstract propertms of these two relatmns on the domain of computable sets… (More)

- Alexander E. Mohr, Eve A. Riskin, Richard E. Ladner
- IEEE Journal on Selected Areas in Communications
- 2000

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… (More)

- Richard E. Ladner
- SIGA
- 1975

Cook [1], Jones and Laaser [4] have discovered several interesting problem s that are log space complete for P. We add another to the list and use it t o obtain a result of Galil [3]. The set P is… (More)

- Richard E. Ladner, Nancy A. Lynch, Alan L. Selman
- Theor. Comput. Sci.
- 1975

&tract. Various forms of polynomial time reducibilig:y zwe compared. Among the forms examined we many-one, bounded truth table, truth 1:able and Turing reducibi!&y. The effect of introducing… (More)

- Anthony LaMarca, Richard E. Ladner
- J. Algorithms
- 1997

We investigate the e ect that caches have on the performance of sorting algorithms both experimentally and analytically. To address the performance problems that high cache miss penalties introduce… (More)

- Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
- J. Algorithms
- 2006