Rivest, Ronald L.
Overview
Works:  113 works in 407 publications in 8 languages and 3,574 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Editor, Author, Other 
Classifications:  QA76.6, 005.1 
Publication Timeline
.
Most widely held works about
Ronald L Rivest
 Classifying the complexity of the RSA algorithm : the state of the art by Leonor Charmaine Bosman( )
Most widely held works by
Ronald L Rivest
Introduction to algorithms by
Thomas H Cormen(
Book
)
110 editions published between 1989 and 2017 in 6 languages and held by 1,260 WorldCat member libraries worldwide
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.  The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "DivideandConquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edgebased flow in the material on flow networks. Many new exercises and problems have been added for this edition
110 editions published between 1989 and 2017 in 6 languages and held by 1,260 WorldCat member libraries worldwide
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.  The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "DivideandConquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edgebased flow in the material on flow networks. Many new exercises and problems have been added for this edition
Machine learning : from theory to applications : cooperative research at Siemens and MIT by
Stephen José Hanson(
Book
)
14 editions published in 1993 in English and held by 338 WorldCat member libraries worldwide
"This volume includes some of the key research papers in the area of machine learning produced at MIT and Siemens during a threeyear joint research effort. It includes papers on many different styles of machine learning, organized into three parts. Part I, theory, includes three papers on theoretical aspects of machine learning. The first two use the theory of computational complexity to derive some fundamental limits on what isefficiently learnable. The third provides an efficient algorithm for identifying finite automata. Part II, artificial intelligence and symbolic learning methods, includes five papers giving an overview of the state of the art and future developments in the field of machine learning, a subfield of artificial intelligence dealing with automated knowledge acquisition and knowledge revision. Part III, neural and collective computation, includes five papers sampling the theoretical diversity and trends in the vigorous new research field of neural networks: massively parallel symbolic induction, task decomposition through competition, phoneme discrimination, behaviorbased learning, and selfrepairing neural networks."PUBLISHER'S WEBSITE
14 editions published in 1993 in English and held by 338 WorldCat member libraries worldwide
"This volume includes some of the key research papers in the area of machine learning produced at MIT and Siemens during a threeyear joint research effort. It includes papers on many different styles of machine learning, organized into three parts. Part I, theory, includes three papers on theoretical aspects of machine learning. The first two use the theory of computational complexity to derive some fundamental limits on what isefficiently learnable. The third provides an efficient algorithm for identifying finite automata. Part II, artificial intelligence and symbolic learning methods, includes five papers giving an overview of the state of the art and future developments in the field of machine learning, a subfield of artificial intelligence dealing with automated knowledge acquisition and knowledge revision. Part III, neural and collective computation, includes five papers sampling the theoretical diversity and trends in the vigorous new research field of neural networks: massively parallel symbolic induction, task decomposition through competition, phoneme discrimination, behaviorbased learning, and selfrepairing neural networks."PUBLISHER'S WEBSITE
Computational learning theory and natural learning systems by
Stephen José Hanson(
Book
)
19 editions published between 1994 and 1997 in English and Undetermined and held by 315 WorldCat member libraries worldwide
As with Volume I, this second volume represents a synthesis of issues in three historically distinct areas of learning research: computational learning theory, neural network research, and symbolic machine learning. While the first volume provided a forum for building a science of computational learning across fields, this volume attempts to define plausible areas of joint research: the contributions are concerned with finding constraints for theory while at the same time interpreting theoretic results in the context of experiments with actual learning systems. Subsequent volumes will focus on areas identified as research opportunities. Computational learning theory, neural networks, and AI machine learning appear to be disparate fields; in fact they have the same goal: to build a machine or program that can learn from its environment. Accordingly, many of the papers in this volume deal with the problem of learning from examples. In particular, they are intended to encourage discussion between those trying to build learning algorithms (for instance, algorithms addressed by learning theoretic analyses are quite different from those used by neural network or machinelearning researchers) and those trying to analyze them. The first section provides theoretical explanations for the learning systems addressed, the second section focuses on issues in model selection and inductive bias, the third section presents new learning algorithms, the fourth section explores the dynamics of learning in feedforward neural networks, and the final section focuses on the application of learning algorithms. A Bradford Book
19 editions published between 1994 and 1997 in English and Undetermined and held by 315 WorldCat member libraries worldwide
As with Volume I, this second volume represents a synthesis of issues in three historically distinct areas of learning research: computational learning theory, neural network research, and symbolic machine learning. While the first volume provided a forum for building a science of computational learning across fields, this volume attempts to define plausible areas of joint research: the contributions are concerned with finding constraints for theory while at the same time interpreting theoretic results in the context of experiments with actual learning systems. Subsequent volumes will focus on areas identified as research opportunities. Computational learning theory, neural networks, and AI machine learning appear to be disparate fields; in fact they have the same goal: to build a machine or program that can learn from its environment. Accordingly, many of the papers in this volume deal with the problem of learning from examples. In particular, they are intended to encourage discussion between those trying to build learning algorithms (for instance, algorithms addressed by learning theoretic analyses are quite different from those used by neural network or machinelearning researchers) and those trying to analyze them. The first section provides theoretical explanations for the learning systems addressed, the second section focuses on issues in model selection and inductive bias, the third section presents new learning algorithms, the fourth section explores the dynamics of learning in feedforward neural networks, and the final section focuses on the application of learning algorithms. A Bradford Book
Advances in cryptology, ASIACRYPT '91 : International Conference on the Theory and Application of Cryptology, Fujiyoshida,
Japan, November 1114, 1991 : proceedings by
Hideki Imai(
Book
)
13 editions published in 1993 in English and held by 212 WorldCat member libraries worldwide
This volume contains the proceedings of ASIACRYPT '91, the first international conference on the theory and application of cryptology to be held in the Asian area. It was held at Fujiyoshida, near Mount Fuji in Japan, in November 1991. The conference was modeled after the very successful CRYTO and EUROCRYPT series of conferences sponsored by the International Association for Cryptologic Research (IACR). The IACR and the Institute of Electronics, Information and Communication Engineers were sponsors for ASIACRYPT '91. The papers from the conference were improved and corrected for inclusion in this volume. The papers are grouped into parts on: differential cryptanalysis and DESlike cryptosystems; hashing and signature schemes; secret sharing, threshold, and authenticationcodes; block ciphers  foundations and analysis; cryptanalysis and new ciphers; proof systems and interactive protocols; public key ciphers  foundations and analysis. Also included are four invited lectures and impromptu talks from the rump session
13 editions published in 1993 in English and held by 212 WorldCat member libraries worldwide
This volume contains the proceedings of ASIACRYPT '91, the first international conference on the theory and application of cryptology to be held in the Asian area. It was held at Fujiyoshida, near Mount Fuji in Japan, in November 1991. The conference was modeled after the very successful CRYTO and EUROCRYPT series of conferences sponsored by the International Association for Cryptologic Research (IACR). The IACR and the Institute of Electronics, Information and Communication Engineers were sponsors for ASIACRYPT '91. The papers from the conference were improved and corrected for inclusion in this volume. The papers are grouped into parts on: differential cryptanalysis and DESlike cryptosystems; hashing and signature schemes; secret sharing, threshold, and authenticationcodes; block ciphers  foundations and analysis; cryptanalysis and new ciphers; proof systems and interactive protocols; public key ciphers  foundations and analysis. Also included are four invited lectures and impromptu talks from the rump session
Advances in cryptology : proceedings of CRYPTO 84 by
G. R Blakley(
Book
)
10 editions published between 1982 and 1983 in English and held by 187 WorldCat member libraries worldwide
Recently, there has been a lot of interest in provably "good" pseudorandom number generators [lo, 4, 14, 31. These cryptographically secure generators are "good" in the sense that they pass all probabilistic polynomial time statistical tests. However, despite these nice properties, the secure generators known so far suffer from the han cap of being inefiicient; the most efiicient of these take n2 steps (one modular multip cation, n being the length of the seed) to generate one bit. Pseudcrandom number g erators that are currently used in practice output n bits per multiplication (n2 steps). An important open problem was to output even two bits on each multiplication in a cryptographically secure way. This problem was stated by Blum, Blum & Shub [3] in the context of their z2 mod N generator. They further ask: how many bits can be o put per multiplication, maintaining cryptographic security? In this paper we state a simple condition, the XORCondition and show that any generator satisfying this condition can output logn bits on each multiplication. We show that the XORCondition is satisfied by the lop least significant bits of the z2mod N generator. The security of the z2 mod N generator was based on Quadratic Residu ity [3]. This generator is an example of a Trapdoor Generator [13], and its trapdoor properties have been used in protocol design. We strengthen the security of this gene tor by proving it as hard as factoring
10 editions published between 1982 and 1983 in English and held by 187 WorldCat member libraries worldwide
Recently, there has been a lot of interest in provably "good" pseudorandom number generators [lo, 4, 14, 31. These cryptographically secure generators are "good" in the sense that they pass all probabilistic polynomial time statistical tests. However, despite these nice properties, the secure generators known so far suffer from the han cap of being inefiicient; the most efiicient of these take n2 steps (one modular multip cation, n being the length of the seed) to generate one bit. Pseudcrandom number g erators that are currently used in practice output n bits per multiplication (n2 steps). An important open problem was to output even two bits on each multiplication in a cryptographically secure way. This problem was stated by Blum, Blum & Shub [3] in the context of their z2 mod N generator. They further ask: how many bits can be o put per multiplication, maintaining cryptographic security? In this paper we state a simple condition, the XORCondition and show that any generator satisfying this condition can output logn bits on each multiplication. We show that the XORCondition is satisfied by the lop least significant bits of the z2mod N generator. The security of the z2 mod N generator was based on Quadratic Residu ity [3]. This generator is an example of a Trapdoor Generator [13], and its trapdoor properties have been used in protocol design. We strengthen the security of this gene tor by proving it as hard as factoring
Introduction à l'algorithmique by
Thomas H Cormen(
Book
)
7 editions published between 1994 and 2000 in French and held by 154 WorldCat member libraries worldwide
7 editions published between 1994 and 2000 in French and held by 154 WorldCat member libraries worldwide
Proceedings of the Second Workshop on Computational Learning Theory by Workshop on Computational Learning Theory(
Book
)
4 editions published in 1989 in English and held by 123 WorldCat member libraries worldwide
4 editions published in 1989 in English and held by 123 WorldCat member libraries worldwide
Advances in Cryptology  ASIACRYPT '91 International Conference on the Theory and Application of Cryptology Fujiyosida, Japan,
November 1991 Proceedings by
Hideki Imai(
)
1 edition published in 1993 in English and held by 29 WorldCat member libraries worldwide
1 edition published in 1993 in English and held by 29 WorldCat member libraries worldwide
Introduzione agli algoritmi by
Thomas H Cormen(
Book
)
6 editions published between 1994 and 2003 in Italian and English and held by 27 WorldCat member libraries worldwide
6 editions published between 1994 and 2003 in Italian and English and held by 27 WorldCat member libraries worldwide
Towards Trustworthy Elections New Directions in Electronic Voting by
David Chaum(
)
2 editions published in 2010 in English and held by 27 WorldCat member libraries worldwide
2 editions published in 2010 in English and held by 27 WorldCat member libraries worldwide
Proceedings of the Second Annual Workshop on Computational Learning Theory : University of California, Santa Cruz, July 31August
2, 1989 by
Ronald L Rivest(
Book
)
14 editions published in 1989 in English and held by 21 WorldCat member libraries worldwide
14 editions published in 1989 in English and held by 21 WorldCat member libraries worldwide
Analysis of associative retrieval algorithms by
Ronald L Rivest(
Book
)
13 editions published between 1974 and 1981 in English and held by 19 WorldCat member libraries worldwide
13 editions published between 1974 and 1981 in English and held by 19 WorldCat member libraries worldwide
Frontiers of electronic voting Dagstuhl seminar 07311 ; executive summary(
)
1 edition published in 2008 in English and held by 16 WorldCat member libraries worldwide
1 edition published in 2008 in English and held by 16 WorldCat member libraries worldwide
Frontiers of electronic voting 07311 abstracts collection ; Dagstuhl seminar(
)
1 edition published in 2008 in English and held by 16 WorldCat member libraries worldwide
1 edition published in 2008 in English and held by 16 WorldCat member libraries worldwide
Wprowadzenie do algorytmów by
Thomas H Cormen(
Book
)
9 editions published between 1997 and 2017 in Polish and held by 12 WorldCat member libraries worldwide
9 editions published between 1997 and 2017 in Polish and held by 12 WorldCat member libraries worldwide
Introduzione agli algoritmi e strutture dati(
Book
)
1 edition published in 2010 in Italian and held by 12 WorldCat member libraries worldwide
1 edition published in 2010 in Italian and held by 12 WorldCat member libraries worldwide
On digital signatures and publickey cryptosystems by
Ronald L Rivest(
Book
)
4 editions published in 1977 in English and held by 9 WorldCat member libraries worldwide
It is shown that the single operation of raising a number to a fixed power modulo a composite modulus is sufficient to implement digital signatures: a way of creating for a (digitized) document a recognizable, unforgeable, documentdependent digitized signature whose authenticity the signer can not later deny. An electronic funds transfer system or electronic mail system clearly could use such a scheme, since the messages must be digitized in order to be transmitted
4 editions published in 1977 in English and held by 9 WorldCat member libraries worldwide
It is shown that the single operation of raising a number to a fixed power modulo a composite modulus is sufficient to implement digital signatures: a way of creating for a (digitized) document a recognizable, unforgeable, documentdependent digitized signature whose authenticity the signer can not later deny. An electronic funds transfer system or electronic mail system clearly could use such a scheme, since the messages must be digitized in order to be transmitted
Research directions in computer science : an MIT perspective by Symposium on Research Direction in Computer Science(
Book
)
3 editions published in 1991 in English and held by 9 WorldCat member libraries worldwide
3 editions published in 1991 in English and held by 9 WorldCat member libraries worldwide
Learning binary relations and total orders by
Sally A Goldman(
Book
)
4 editions published in 1990 in English and held by 8 WorldCat member libraries worldwide
Learning a binary relation between two sets of objects or between a set and itself represents a binary relation between a set of size n and a set of size m as an n x m matrix of bits, whose (i, j) entry is 1 if and only if the relation holds between the corresponding elements of the two sets. Polynomial prediction algorithms for learning binary relations are present in an extended online learning model, where the examples are drawn by the learner, by a helpful teacher, by an adversary, or according to a uniform probability distribution on the instance space. Results are presented for the case that the matrix of the relation has at most k row types with upper and lower bounds on the number of prediction mistakes any prediction algorithm makes when learning such a matrix under the extended online learning model. A technique is described that simplifies the proof of expected mistake bounds against a randomly chosen query sequence. Keywords: Binary relations, Total orders, Computational learning theory, Machine learning, Mistake bounded learning, Online learning, Polynomial randomized approximation schemes. (JHD)
4 editions published in 1990 in English and held by 8 WorldCat member libraries worldwide
Learning a binary relation between two sets of objects or between a set and itself represents a binary relation between a set of size n and a set of size m as an n x m matrix of bits, whose (i, j) entry is 1 if and only if the relation holds between the corresponding elements of the two sets. Polynomial prediction algorithms for learning binary relations are present in an extended online learning model, where the examples are drawn by the learner, by a helpful teacher, by an adversary, or according to a uniform probability distribution on the instance space. Results are presented for the case that the matrix of the relation has at most k row types with upper and lower bounds on the number of prediction mistakes any prediction algorithm makes when learning such a matrix under the extended online learning model. A technique is described that simplifies the proof of expected mistake bounds against a randomly chosen query sequence. Keywords: Binary relations, Total orders, Computational learning theory, Machine learning, Mistake bounded learning, Online learning, Polynomial randomized approximation schemes. (JHD)
Mental poker by
Adi Shamir(
Book
)
5 editions published in 1979 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Is it possible to play a fair game of 'Mental Poker'. We will give a complete (but paradoxical) answer to this question. We will first prove that the problem is intrinsically insoluble, and then describe a fair method of playing 'Mental Poker'. (Author)
5 editions published in 1979 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Is it possible to play a fair game of 'Mental Poker'. We will give a complete (but paradoxical) answer to this question. We will first prove that the problem is intrinsically insoluble, and then describe a fair method of playing 'Mental Poker'. (Author)
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Leiserson, Charles Eric Other
 Cormen, Thomas H. Author
 Hanson, Stephen José Other Author Editor
 Remmele, Werner Other Editor
 Drastal, George A. Author Editor
 Imai, Hideki 1943 Author Editor
 Matsumoto, Tsutomu Editor
 Chaum, David Other Author Editor
 Warmuth, Manfred Editor
 Haussler, David Editor
Useful Links
Associated Subjects
Adleman, Leonard M Algorithms Approximation theory Artificial intelligence Binary principle (Linguistics) Chemistry Coding theory Combinatorial analysis Computational learning theory Computer algorithms Computer programming ComputersAccess control Computer science Computer scienceResearch Computer security Computer software Cryptography Data encryption (Computer science) Data structures (Computer science) Electronic funds transfers File organization (Computer science) Hashing (Computer science) Information organization Information storage and retrieval systems Machine learning Massachusetts Massachusetts Institute of Technology Neural networks (Computer science) Operating systems (Computers) Physical organic chemistry Poker Privacy, Right of Rivest, Ronald L Shamir, Adi
Alternative Names
Rivest, R. 1947
Rivest, R. L.
Rivest, R. L. 1947
Rivest, R. L. (Ronald L.)
Rivest, Ronald 1947
Rivest, Ronald L.
Rivest, Ronald L. 1947
Ron Rivest Amerikaans wiskundige
Ronald L. Rivest
Ronald L. Rivest amerikanischer Mathematiker und Kryptologe
Ronald RIVEST
Ronald Rivest crittografo statunitense
Ronald Rivest cryptologue américain d'origine canadiennefrançaise
Ronald Rivest usona matematikisto
Ривест, Р.
Ривест, Рональд Линн
Роналд Лин Ривест
Рональд Рівест
רונלד ריבסט
ריבסט, רונלד ל.
رونالد ريفست
رونالد ریوست
রন রিভেস্ট
로널드 라이베스트
リベスト, R. L.
ロナルド・リベスト
罗纳德·李维斯特 Cryptographer
罗纳德·李维斯特 美国密码学家
Languages
Covers