The following pages link to Ronald L. Rivest (Q198993):
Displaying 49 items.
- (Q4048576) (← links)
- Expected time bounds for selection (Q4050138) (← links)
- On self-organizing sequential search heuristics (Q4079040) (← links)
- Partial-Match Retrieval Algorithms (Q4096474) (← links)
- (Q4125778) (← links)
- (Q4131017) (← links)
- (Q4133137) (← links)
- On the Worst-Case Behavior of String-Searching Algorithms (Q4142690) (← links)
- A method for obtaining digital signatures and public-key cryptosystems (Q4145254) (← links)
- Optimal Arrangement of Keys in a Hash Table (Q4148945) (← links)
- <i>k</i> + 1 Heads Are Better than <i>k</i> (Q4148951) (← links)
- (Q4249327) (← links)
- (Q4279583) (← links)
- (Q4279609) (← links)
- Diversity-based inference of finite automata (Q4305673) (← links)
- (Q4314049) (← links)
- (Q4314055) (← links)
- (Q4385518) (← links)
- (Q4409107) (← links)
- (Q4472072) (← links)
- (Q4472077) (← links)
- (Q4474199) (← links)
- (Q4484898) (← links)
- Time-Space Trade-offs in Population Protocols (Q4575918) (← links)
- RSA Chips (Past/Present/Future) (Extended abstract) (Q4576808) (← links)
- (Q4608043) (← links)
- All-or-nothing encryption and the package transform (Q4639342) (← links)
- On the Design and Security of RC2 (Q4639450) (← links)
- (Q4706390) (← links)
- Estimating a probability using finite memory (Q4725462) (← links)
- (Q4739521) (← links)
- On breaking a Huffman code (Q4887072) (← links)
- Defending against the Unknown Enemy: Applying FlipIt to System Security (Q4909442) (← links)
- (Q4941798) (← links)
- (Q4949336) (← links)
- (Q5075309) (← links)
- Optimality of Correlated Sampling Strategies (Q5140847) (← links)
- (Q5203708) (← links)
- The invertibility of the XOR of rotations of a binary word (Q5391484) (← links)
- The subgraph homeomorphism problem (Q5402539) (← links)
- Coping with errors in binary search procedures (Preliminary Report) (Q5402561) (← links)
- On the notion of ‘software independence’ in voting systems (Q5504041) (← links)
- A Procedure for Improving the Upper Bound for the Number of <i>n</i>-Ominoes (Q5676239) (← links)
- (Q5753361) (← links)
- (Q5871911) (← links)
- Theory of Cryptography (Q5901789) (← links)
- Permutation polynomials modulo \(2^w\) (Q5941620) (← links)
- Bernoulli Ballot Polling: A Manifest Improvement for Risk-Limiting Audits (Q6166537) (← links)
- k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-election Audits (Q6166539) (← links)
