The following pages link to Ronald L. Rivest (Q198993):
Displaying 50 items.
- \texttt{FlipIt}: the game of ``stealthy takeover'' (Q380966) (← links)
- Tweakable block ciphers (Q451118) (← links)
- Picture-hanging puzzles (Q489745) (← links)
- Results on learnability and the Vapnik-Chervonenkis dimension (Q751859) (← links)
- Game tree searching by min/max approximation (Q1096402) (← links)
- Global wire routing in two-dimensional arrays (Q1097238) (← links)
- Is the data encryption standard a group? (Results of cycling experiments on DES) (Q1112006) (← links)
- Inferring decision trees using the minimum description length principle (Q1115845) (← links)
- The subgraph homeomorphism problem (Q1137871) (← links)
- Coping with errors in binary search procedures (Q1144379) (← links)
- Constructing optimal binary decision trees is NP-complete (Q1228355) (← links)
- Linear expected time of a simple union-find algorithm (Q1233316) (← links)
- On recognizing graph properties from adjacency matrices (Q1238421) (← links)
- The game of ''\(N\) questions'' of a tree (Q1243263) (← links)
- An \(\Omega((n/lg\,n)^{1/2})\) lower bound on the number of additions necessary to compute 0-1 polynomials over the ring of integer polynomials (Q1254853) (← links)
- Translucent cryptography -- an alternative to key escrow, and its implementation via fractional oblivious transfer (Q1291806) (← links)
- On choosing between experimenting and thinking when learning (Q1308981) (← links)
- A formal model of hierarchical concept learning (Q1336049) (← links)
- Complete variable-length ``fix-free'' codes (Q1345134) (← links)
- Time bounds for selection (Q1394121) (← links)
- Leading the field: fortune favors the bold in Thurstonian choice models (Q1715518) (← links)
- Piecemeal graph exploration by a mobile robot. (Q1854296) (← links)
- Asymptotic bounds for the number of convex \(n\)-ominoes (Q2264682) (← links)
- Inference of finite automata using homing sequences (Q2365762) (← links)
- Introduction to algorithms (Q2747613) (← links)
- Introduction to algorithms. (Q2865939) (← links)
- A “Paradoxical” Solution to The Signature Problem (Q2974497) (← links)
- (Q3066732) (← links)
- (Q3140418) (← links)
- Learning Binary Relations and Total Orders (Q3142590) (← links)
- (Q3322997) (← links)
- How to reuse a “write-once≓ memory (Q3340152) (← links)
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6 (Q3391566) (← links)
- Lightweight Email Signatures (Extended Abstract) (Q3541895) (← links)
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment (Q3612554) (← links)
- (Q3619797) (← links)
- (Q3619798) (← links)
- (Q3619846) (← links)
- (Q3651735) (← links)
- (Q3671039) (← links)
- A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft) (Q3689091) (← links)
- Efficient Factoring Based on Partial Information (Q3718616) (← links)
- Is the Data Encryption Standard a Group? (Preliminary Abstract) (Q3731513) (← links)
- Network control by Bayesian broadcast (Q3767245) (← links)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (Q3787914) (← links)
- A knapsack-type public key cryptosystem based on arithmetic in finite fields (Q3816016) (← links)
- Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam (Q3867723) (← links)
- On the Polyhedral Decision Problem (Q3893331) (← links)
- Orthogonal Packings in Two Dimensions (Q3893334) (← links)
- (Q4013558) (← links)
