The following pages link to Richard E. Ladner (Q930896):
Displayed 50 items.
- Item:Q930896 (redirect page) (← links)
- Signsolvability revisited (Q795898) (← links)
- Safety and liveness of \(\omega\)-context-free languages (Q811129) (← links)
- Optimal delay for media-on-demand with pre-loading and pre-buffering (Q930897) (← links)
- Scheduling techniques for media-on-demand (Q1018046) (← links)
- Solitaire automata (Q1058475) (← links)
- Testing the universal instance assumption (Q1133903) (← links)
- The complexity of problems in systems of communicating sequential processes (Q1146980) (← links)
- Efficient parallel algorithms for linear recurrence computation (Q1165573) (← links)
- The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
- Space bounds for processing contentless inputs (Q1218269) (← links)
- Item:Q930896 (redirect page) (← links)
- A comparison of polynomial time reducibilities (Q1223166) (← links)
- Propositional dynamic logic of regular programs (Q1258296) (← links)
- Counting protocols for reliable end-to-end transmission (Q1267718) (← links)
- Multiresolution banded refinement to accelerate surface reconstruction from polygons (Q1305864) (← links)
- Probabilistic game automata (Q1824400) (← links)
- Interactive proof systems with polynomially bounded strategies (Q1894457) (← links)
- Windows scheduling of arbitrary-length jobs on multiple machines (Q2434274) (← links)
- Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging (Q2465999) (← links)
- Fast nearest neighbor search of entropy-constrained vector quantization (Q2714110) (← links)
- (Q2768321) (← links)
- Algorithms for dynamic multicast key distribution trees (Q2943761) (← links)
- Polynomial Space Counting Problems (Q3034822) (← links)
- Binary Search in a Multiprocessing Environment (Q3038635) (← links)
- Alternating Pushdown and Stack Automata (Q3325044) (← links)
- (Q3327726) (← links)
- Algorithms for dynamic multicast key distribution (Q3507764) (← links)
- Windows scheduling as a restricted version of bin packing (Q3580939) (← links)
- Alternation bounded auxiliary pushdown automata (Q3718176) (← links)
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channels (Q3773810) (← links)
- (Q3887443) (← links)
- Parallel Prefix Computation (Q3890136) (← links)
- (Q3904052) (← links)
- (Q4061961) (← links)
- A Completely Mitotic Nonrecursive R.E. Degree (Q4067084) (← links)
- On the Structure of Polynomial Time Reducibility (Q4085242) (← links)
- The weak truth table degrees of recursively enumerable sets (Q4087157) (← links)
- Relativization of questions about log space computability (Q4109299) (← links)
- The Computational Complexity of Provability in Systems of Modal Propositional Logic (Q4149442) (← links)
- (Q4162480) (← links)
- Application of model theoretic games to discrete linear orders and finite automata (Q4168070) (← links)
- (Q4197339) (← links)
- The Influence of Caches on the Performance of Sorting (Q4240128) (← links)
- (Q4252340) (← links)
- Recoverable sequence transmission protocols (Q4369890) (← links)
- (Q4417673) (← links)
- Windows Scheduling Problems for Broadcast Systems (Q4429676) (← links)
- Competitive on-line stream merging algorithms for media-on-demand (Q4458872) (← links)
- (Q4460268) (← links)
