Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ronald L. Rivest
2010 – today
- 2013
[j54]Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest: FlipIt: The Game of "Stealthy Takeover". J. Cryptology 26(4): 655-713 (2013)- [c102]Kevin D. Bowers, Ari Juels, Ronald L. Rivest, Emily Shen: Drifting Keys: Impersonation detection for constrained devices. INFOCOM 2013: 1025-1033
- 2012
- [c101]Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest, Emil Stefanov, Nikos Triandopoulos: Hourglass schemes: how to prove that cloud files are encrypted. ACM Conference on Computer and Communications Security 2012: 265-280
- [c100]Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu: Picture-Hanging Puzzles. FUN 2012: 81-93
- [c99]Kevin D. Bowers, Marten van Dijk, Robert Griffin, Ari Juels, Alina Oprea, Ronald L. Rivest, Nikos Triandopoulos: Defending against the Unknown Enemy: Applying FlipIt to System Security. GameSec 2012: 248-263
- [i6]Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu: Picture-Hanging Puzzles. CoRR abs/1203.3602 (2012)
- [i5]Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest: FlipIt: The Game of "Stealthy Takeover". IACR Cryptology ePrint Archive 2012: 103 (2012)
- [i4]Kevin D. Bowers, Marten van Dijk, Robert Griffin, Ari Juels, Alina Oprea, Ronald L. Rivest, Nikos Triandopoulos: Defending Against the Unknown Enemy: Applying FlipIt to System Security. IACR Cryptology ePrint Archive 2012: 579 (2012)
- 2011
- [j53]Ronald L. Rivest: The invertibility of the XOR of rotations of a binary word. Int. J. Comput. Math. 88(2): 281-284 (2011)
- [j52]Moses Liskov, Ronald L. Rivest, David Wagner: Tweakable Block Ciphers. J. Cryptology 24(3): 588-613 (2011)
- [c98]Kevin D. Bowers, Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest: How to tell if your cloud files are vulnerable to drive crashes. ACM Conference on Computer and Communications Security 2011: 501-514
- [r2]Ronald L. Rivest, Burt Kaliski: RSA Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1065-1069
- 2010
- [j51]David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora: Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. IEEE Transactions on Information Forensics and Security 5(1): 194 (2010)
- [c97]Alan T. Sherman, Richard Carback, David Chaum, Jeremy Clark, Aleksander Essex, Paul S. Herrnson, Travis Mayberry, Stefan Popoveniuc, Ronald L. Rivest, Emily Shen, Bimal Sinha, Poorvi L. Vora: Scantegrity Mock Election at Takoma Park. Electronic Voting 2010: 45-61
- [c96]Richard Carback, David Chaum, Jeremy Clark, John Conway, Aleksander Essex, Paul S. Herrnson, Travis Mayberry, Stefan Popoveniuc, Ronald L. Rivest, Emily Shen, Alan T. Sherman, Poorvi L. Vora: Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy. USENIX Security Symposium 2010: 291-306
- [c95]Shuki Bruck, David Jefferson, Ronald L. Rivest: A Modular Voting Architecture ("Frog Voting"). Towards Trustworthy Elections 2010: 97-106
- [e7]David Chaum, Markus Jakobsson, Ronald L. Rivest, Peter Y. A. Ryan, Josh Benaloh, Miroslaw Kutylowski, Ben Adida (Eds.): Towards Trustworthy Elections, New Directions in Electronic Voting. Lecture Notes in Computer Science 6000, Springer 2010, ISBN 978-3-642-12979-7
- [i3]Kevin D. Bowers, Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest: How to Tell if Your Cloud Files Are Vulnerable to Drive Crashes. IACR Cryptology ePrint Archive 2010: 214 (2010)
2000 – 2009
- 2009
- [b3]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms (3. ed.). MIT Press 2009, ISBN 978-0-262-03384-8, pp. I-XIX, 1-1292
- [j50]Ronald L. Rivest, David Chaum, Bart Preneel, Aviel D. Rubin, Donald G. Saari, Poorvi L. Vora: Guest editorial: special issue on electronic voting. IEEE Transactions on Information Forensics and Security 4(4): 593-596 (2009)
- [j49]David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora: Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. IEEE Transactions on Information Forensics and Security 4(4): 611-627 (2009)
- [c94]Yevgeniy Dodis, Leonid Reyzin, Ronald L. Rivest, Emily Shen: Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6. FSE 2009: 104-121
- 2008
- [c93]Javed A. Aslam, Raluca A. Popa, Ronald L. Rivest: On Auditing Elections When Precincts Have Different Sizes. EVT 2008
- [c92]David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman: Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes. EVT 2008
- [e6]David Chaum, Miroslaw Kutylowski, Ronald L. Rivest, Peter Y. A. Ryan (Eds.): Frontiers of Electronic Voting, 29.07. - 03.08.2007. Dagstuhl Seminar Proceedings 07311, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- 2007
- [c91]Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee: Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO 2007: 264-283
- [c90]David Chaum, Miroslaw Kutylowski, Ronald L. Rivest, Peter Y. A. Ryan: 07311 Executive Summary -- Frontiers of Electronic Voting. Frontiers of Electronic Voting 2007
- [c89]David Chaum, Miroslaw Kutylowski, Ronald L. Rivest, Peter Y. A. Ryan: 07311 Abstracts Collection -- Frontiers of Electronic Voting. Frontiers of Electronic Voting 2007
- [c88]
- [c87]Ben Adida, Mike Bond, Jolyon Clulow, Amerson Lin, Ross J. Anderson, Ronald L. Rivest: On the Security of the EMV Secure Messaging API (Extended Abstract). Security Protocols Workshop 2007: 147-149
- [c86]Paul Youn, Ben Adida, Mike Bond, Jolyon Clulow, Jonathan Herzog, Amerson Lin, Ronald L. Rivest, Ross J. Anderson: Robbing the Bank with a Theorem Prover - (Abstract). Security Protocols Workshop 2007: 171
- 2006
- [c85]Ronald L. Rivest, Adi Shamir, Yael Tauman: How to Leak a Secret: Theory and Applications of Ring Signatures. Essays in Memory of Shimon Even 2006: 164-186
- [c84]John G. Brainard, Ari Juels, Ronald L. Rivest, Michael Szydlo, Moti Yung: Fourth-factor authentication: somebody you know. ACM Conference on Computer and Communications Security 2006: 168-178
- [c83]Ben Adida, David Chau, Susan Hohenberger, Ronald L. Rivest: Lightweight Email Signatures (Extended Abstract). SCN 2006: 288-302
- [c82]Ben Adida, Mike Bond, Jolyon Clulow, Amerson Lin, Steven J. Murdoch, Ross J. Anderson, Ronald L. Rivest: Phish and Chips. Security Protocols Workshop 2006: 40-48
- [c81]
- 2005
- [r1]Ronald L. Rivest, Burton S. Kaliski Jr.: RSA Problem. Encyclopedia of Cryptography and Security 2005
- 2004
- [j48]Sanjay Raman, Dwaine E. Clarke, Matt Burnside, Srinivas Devadas, Ronald L. Rivest: Access-controlled resource discovery in pervasive networks. Concurrency - Practice and Experience 16(11): 1099-1120 (2004)
- [c80]
- [c79]Ruby B. Lee, Zhijie Shi, Yiqun Lisa Yin, Ronald L. Rivest, Matthew J. B. Robshaw: On Permutation Operations in Cipher Design. ITCC (2) 2004: 569-577
- [c78]
- 2003
- [c77]Ari Juels, Ronald L. Rivest, Michael Szydlo: The blocker tag: selective blocking of RFID tags for consumer privacy. ACM Conference on Computer and Communications Security 2003: 103-111
- [c76]Nicko van Someren, Andrew M. Odlyzko, Ronald L. Rivest, Tim Jones, Duncan Goldie-Scot: Does Anyone Really Need MicroPayments? Financial Cryptography 2003: 69-76
- [c75]Sanjay Raman, Dwaine E. Clarke, Matt Burnside, Srinivas Devadas, Ronald L. Rivest: Access-Controlled Resource Discovery for Pervasive Networks. SAC 2003: 338-345
- [c74]Stephen A. Weis, Sanjay E. Sarma, Ronald L. Rivest, Daniel W. Engels: Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems. SPC 2003: 201-212
- 2002
- [c73]
- [c72]
- [c71]
- [c70]Rebecca N. Wright, L. Jean Camp, Ian Goldberg, Ronald L. Rivest, Graham Wood: Privacy Tradeoffs: Myth or Reality? Panel. Financial Cryptography 2002: 147-151
- [c69]Dwaine E. Clarke, Blaise Gassend, Thomas Kotwal, Matt Burnside, Marten van Dijk, Srinivas Devadas, Ronald L. Rivest: The Untrusted Computer Problem and Camera-Based Authentication. Pervasive 2002: 114-124
- [c68]Matt Burnside, Dwaine E. Clarke, Todd Mills, Andrew Maywah, Srinivas Devadas, Ronald L. Rivest: Proxy-based security protocols in networked mobile devices. SAC 2002: 265-272
- [c67]Markus Jakobsson, Ari Juels, Ronald L. Rivest: Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking. USENIX Security Symposium 2002: 339-353
- [i2]Markus Jakobsson, Ari Juels, Ronald L. Rivest: Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking. IACR Cryptology ePrint Archive 2002: 25 (2002)
- 2001
- [b2]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company 2001, ISBN 0-262-03293-7
- [j47]Dwaine E. Clarke, Jean-Emile Elien, Carl M. Ellison, Matt Fredette, Alexander Morcos, Ronald L. Rivest: Certificate Chain Discovery in SPKI/SDSI. Journal of Computer Security 9(4): 285-322 (2001)
- [c66]
- [c65]Ed Gerck, C. Andrew Neff, Ronald L. Rivest, Aviel D. Rubin, Moti Yung: The Business of Electronic Voting. Financial Cryptography 2001: 234-259
- [i1]Ronald L. Rivest, Robert Silverman: Are 'Strong' Primes Needed for RSA. IACR Cryptology ePrint Archive 2001: 7 (2001)
- 2000
- [c64]Ronald L. Rivest, Matthew J. B. Robshaw, Yiqun Lisa Yin: RC6 as the AES. AES Candidate Conference 2000: 337-342
1990 – 1999
- 1999
- [j46]Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh: Piecemeal Graph Exploration by a Mobile Robot. Inf. Comput. 152(2): 155-172 (1999)
- [j45]Mihir Bellare, Ronald L. Rivest: Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer. J. Cryptology 12(2): 117-139 (1999)
- [c63]Scott Contini, Ronald L. Rivest, Matthew J. B. Robshaw, Yiqun Lisa Yin: Improved Analysis of Some Simplified Variants of RC6. FSE 1999: 1-15
- [c62]Anna Lysyanskaya, Ronald L. Rivest, Amit Sahai, Stefan Wolf: Pseudonym Systems. Selected Areas in Cryptography 1999: 184-199
- 1998
- [c61]Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest: Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop. CRYPTO 1998: 153-168
- [c60]Ronald L. Rivest: Can We Eliminate Certificate Revocations Lists? Financial Cryptography 1998: 178-183
- [c59]Lars R. Knudsen, Vincent Rijmen, Ronald L. Rivest, Matthew J. B. Robshaw: On the Design and Security of RC2. FSE 1998: 206-221
- 1997
- [c58]
- [c57]
- [c56]
- 1996
- [j44]D. W. Gillman, M. Mohtashemi, Ronald L. Rivest: On breaking a Huffman code. IEEE Transactions on Information Theory 42(3): 972-976 (1996)
- [c55]Ronald L. Rivest, Adi Shamir: PayWord and MicroMint: Two Simple Micropayment Schemes. Security Protocols Workshop 1996: 69-87
- 1995
- [j43]David Gillman, Ronald L. Rivest: Complete Variable-Length "Fix-Free" Codes. Des. Codes Cryptography 5(2): 109-114 (1995)
- [j42]Margrit Betke, Ronald L. Rivest, Mona Singh: Piecemeal Learning of an Unknown Environment. Machine Learning 18(2-3): 231-254 (1995)
- [c54]Ronald L. Rivest, Yiqun Lisa Yin: Being Taught can be Faster than Asking Questions. COLT 1995: 144-151
- [c53]Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh: Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract). COLT 1995: 321-328
- 1994
- [j41]Ronald L. Rivest, Robert H. Sloan: A Formal Model of Hierarchical Concept Learning. Inf. Comput. 114(1): 88-114 (1994)
- [j40]Ronald L. Rivest, Robert E. Schapire: Diversity-Based Inference of Finite Automata. J. ACM 41(3): 555-589 (1994)
- [c52]
- 1993
- [j39]Dorothy E. Denning, Mike Godwin, William A. Bayse, Marc Rotenberg, Lewis M. Branscomb, Anne M. Branscomb, Ronald L. Rivest, Andrew Grosso, Gary T. Marx: To Tap or not to Tap. Commun. ACM 36(3): 24-44 (1993)
- [j38]Ronald L. Rivest, Robert E. Schapire: Inference of Finite Automata Using Homing Sequences. Inf. Comput. 103(2): 299-347 (1993)
- [j37]Ronald L. Rivest, Robert H. Sloan: On Choosing between Experimenting and Thinking when Learning. Inf. Comput. 106(1): 1-25 (1993)
- [j36]Sally A. Goldman, Ronald L. Rivest, Robert E. Schapire: Learning Binary Relations and Total Orders. SIAM J. Comput. 22(5): 1006-1034 (1993)
- [c51]Margrit Betke, Ronald L. Rivest, Mona Singh: Piecemeal Learning of an Unknown Environment. COLT 1993: 277-286
- [c50]Stephen Jose Hanson, Werner Remmele, Ronald L. Rivest: Strategic Directions in Machine Learning. Machine Learning: From Theory to Applications 1993: 1-4
- [c49]
- [c48]Avrim Blum, Ronald L. Rivest: Training a 3-Node Neural Network is NP-Complete. Machine Learning: From Theory to Applications 1993: 9-28
- [c47]Ronald L. Rivest, Robert E. Schapire: Inference of Finite Automata Using Homing Sequences. Machine Learning: From Theory to Applications 1993: 51-73
- [c46]
- [e5]Hideki Imai, Ronald L. Rivest, Tsutomu Matsumoto (Eds.): Advances in Cryptology - ASIACRYPT '91, International Conference on the Theory and Applications of Cryptology, Fujiyoshida, Japan, November 11-14, 1991, Proceedings. Lecture Notes in Computer Science 739, Springer 1993, ISBN 3-540-57332-1
- [e4]Stephen Jose Hanson, Werner Remmele, Ronald L. Rivest (Eds.): Machine Learning: From Theory to Applications - Cooperative Research at Siemens and MIT. Lecture Notes in Computer Science 661, Springer 1993, ISBN 3-540-56483-7
- 1992
- [j35]Ronald L. Rivest, Martin E. Hellman, John C. Anderson, John W. Lyons: Responses to NIST's Proposal. Commun. ACM 35(7): 41-54 (1992)
- [j34]Avrim Blum, Ronald L. Rivest: Training a 3-node neural network is NP-complete. Neural Networks 5(1): 117-127 (1992)
- 1991
- [j33]Nathan Linial, Yishay Mansour, Ronald L. Rivest: Results on Learnability and the Vapnik-Chervonenkis Dimension. Inf. Comput. 90(1): 33-49 (1991)
- [c45]
- [c44]
- [c43]Anthony Kuh, Thomas Petsche, Ronald L. Rivest: Incrementally Learning Time-Varying Half Planes. NIPS 1991: 920-927
- 1990
- [j32]Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest: A fair protocol for signing contracts. IEEE Transactions on Information Theory 36(1): 40-46 (1990)
- [c42]Bonnie Eisenberg, Ronald L. Rivest: On the Sample Complexity of PAC-Learning Using Random and Chosen Examples. COLT 1990: 154-162
- [c41]
- [c40]
- [c39]
- [c38]
- [p1]Ronald L. Rivest: Cryptography. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 717-755
1980 – 1989
- 1989
- [b1]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest: Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8
- [j31]J. Ross Quinlan, Ronald L. Rivest: Inferring Decision Trees Using the Minimum Description Length Principle. Inf. Comput. 80(3): 227-248 (1989)
- [c37]Sally A. Goldman, Ronald L. Rivest, Robert E. Schapire: Learning Binary Relations and Total Orders (Extended Abstract). FOCS 1989: 46-51
- [c36]Ronald L. Rivest, Robert E. Schapire: Inference of Finite Automata Using Homing Sequences (Extended Abstract). STOC 1989: 411-420
- [e3]Ronald L. Rivest, David Haussler, Manfred K. Warmuth (Eds.): Proceedings of the Second Annual Workshop on Computational Learning Theory, COLT 1989, Santa Cruz, CA, USA, July 31 - August 2, 1989. Morgan Kaufmann 1989, ISBN 1-55860-086-8
- 1988
- [j30]Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman: Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES). J. Cryptology 1(1): 3-36 (1988)
- [j29]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2): 281-308 (1988)
- [j28]Benny Chor, Ronald L. Rivest: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Transactions on Information Theory 34(5): 901-909 (1988)
- [c35]Ronald L. Rivest, Robert H. Sloan: Learning Complicated Concepts Reliably and Usefully. AAAI 1988: 635-640
- [c34]
- [c33]Nathan Linial, Yishay Mansour, Ronald L. Rivest: Results on Learnability and the Vapnick-Chervonenkis Dimension. COLT 1988: 56-68
- [c32]Ronald L. Rivest, Robert H. Sloan: Learning Complicated Concepts Reliably and Usefully. COLT 1988: 69-79
- [c31]Nathan Linial, Yishay Mansour, Ronald L. Rivest: Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract). FOCS 1988: 120-129
- [c30]
- [c29]
- 1987
- [j27]
- [j26]Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani: Global Wire Routing in Two-Dimensional Arrays. Algorithmica 2: 113-129 (1987)
- [j25]
- [j24]Ronald L. Rivest: Network control by Bayesian broadcast. IEEE Transactions on Information Theory 33(3): 323-328 (1987)
- [c28]Ronald L. Rivest, Robert E. Schapire: Diversity-Based Inference of Finite Automata (Extended Abstract). FOCS 1987: 78-87
- 1986
- [j23]Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer: An application of number theory to the organization of raster-graphics memory. J. ACM 33(1): 86-104 (1986)
- [j22]Frank Thomson Leighton, Ronald L. Rivest: Estimating a probability using finite memory. IEEE Transactions on Information Theory 32(6): 733-742 (1986)
- [c27]
- 1985
- [c26]Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman: Is DES a Pure Cipher? (Results of More Cycling Experiments on DES). CRYPTO 1985: 212-226
- [c25]Ronald L. Rivest, Adi Shamir: Efficient Factoring Based on Partial Information. EUROCRYPT 1985: 31-34
- [c24]Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman: Is the Data Encryption Standard a Group? (Preliminary Abstract). EUROCRYPT 1985: 81-95
- [c23]Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest: A Fair Protocol for Signing Contracts (Extended Abstract). ICALP 1985: 43-52
- 1984
- [j21]
- [c22]Benny Chor, Ronald L. Rivest: A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. CRYPTO 1984: 54-65
- [c21]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A "Paradoxical'"Solution to the Signature Problem (Abstract). CRYPTO 1984: 467
- [c20]
- [c19]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A ``Paradoxical'' Solution to the Signature Problem (Extended Abstract). FOCS 1984: 441-448
- 1983
- [j20]Ronald L. Rivest, Adi Shamir, Leonard M. Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint). Commun. ACM 26(1): 96-99 (1983)
- [c18]Frank Thomson Leighton, Ronald L. Rivest: Estimating a Probability Using Finite Memory (Extended Abstract). FCT 1983: 255-269
- [c17]Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani: Global Wire Routing in Two-Dimensional Arrays (Extended Abstract). FOCS 1983: 453-459
- [e2]David Chaum, Ronald L. Rivest, Alan T. Sherman (Eds.): Advances in Cryptology: Proceedings of CRYPTO '82, Santa Barbara, California, USA, August 23-25, 1982. Plenum Press, New York 1983
- [e1]David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas (Eds.): Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983
- 1982
- [j19]Ronald L. Rivest, Adi Shamir: How to Reuse a ``Write-Once'' Memory. Information and Control 55(1-3): 1-19 (1982)
- [c16]
- [c15]
- [c14]
- [c13]
- [c12]Benny Chor, Charles E. Leiserson, Ronald L. Rivest: An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract). FOCS 1982: 92-99
- [c11]Ronald L. Rivest, Adi Shamir: How to Reuse a "Write-Once" Memory (Preliminary Version). STOC 1982: 105-113
- 1980
- [j18]Andrea S. LaPaugh, Ronald L. Rivest: The Subgraph Homeomorphism Problem. J. Comput. Syst. Sci. 20(2): 133-149 (1980)
- [j17]Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer: Coping with Errors in Binary Search Procedures. J. Comput. Syst. Sci. 20(3): 396-404 (1980)
- [j16]Andrew Chi-Chih Yao, Ronald L. Rivest: On the Polyhedral Decision Problem. SIAM J. Comput. 9(2): 343-347 (1980)
- [j15]Brenda S. Baker, Edward G. Coffman Jr., Ronald L. Rivest: Orthogonal Packings in Two Dimensions. SIAM J. Comput. 9(4): 846-855 (1980)
1970 – 1979
- 1979
- [j14]Ronald L. Rivest, Jean-Paul Van de Wiele: 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. Inf. Process. Lett. 8(4): 178-180 (1979)
- 1978
- [j13]Ronald L. Rivest, Adi Shamir, Leonard M. Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM 21(2): 120-126 (1978)
- [j12]
- [j11]
- [c10]
- [c9]Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer: Coping with Errors in Binary Search Procedures (Preliminary Report). STOC 1978: 227-232
- 1977
- [j10]Ronald L. Rivest: On the Worst-Case Behavior of String-Searching Algorithms. SIAM J. Comput. 6(4): 669-674 (1977)
- [j9]Ronald L. Rivest: The Necessity of Feedback in Minimal Monotone Combinational Circuits. IEEE Trans. Computers 26(6): 606-607 (1977)
- [c8]Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest: An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem. STOC 1977: 11-17
- 1976
- [j8]
- [j7]Laurent Hyafil, Ronald L. Rivest: Constructing Optimal Binary Decision Trees is NP-Complete. Inf. Process. Lett. 5(1): 15-17 (1976)
- [j6]Jon Doyle, Ronald L. Rivest: Linear Expected Time of a Simple Union-Find Algorithm. Inf. Process. Lett. 5(5): 146-148 (1976)
- [j5]
- [j4]Ronald L. Rivest, Jean Vuillemin: On Recognizing Graph Properties from Adjacency Matrices. Theor. Comput. Sci. 3(3): 371-384 (1976)
- [c7]Ronald L. Rivest, Vaughan R. Pratt: The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report. FOCS 1976: 1-8
- [c6]
- 1975
- [j3]Robert W. Floyd, Ronald L. Rivest: Expected Time Bounds for Selection. Commun. ACM 18(3): 165-172 (1975)
- [j2]Robert W. Floyd, Ronald L. Rivest: The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489). Commun. ACM 18(3): 173 (1975)
- [c5]Ronald L. Rivest, Jean Vuillemin: A Generalization and Proof of the Aanderaa-Rosenberg Conjecture. STOC 1975: 6-11
- 1974
- [c4]Ronald L. Rivest: On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract). SWAT (FOCS) 1974: 95-103
- [c3]
- [c2]Ronald L. Rivest: On the Optimality of Elia's Algorithm for Performing Best-Match Searches. IFIP Congress 1974: 678-681
- 1973
- [j1]Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan: Time Bounds for Selection. J. Comput. Syst. Sci. 7(4): 448-461 (1973)
- 1972
- [c1]Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan: Linear Time Bounds for Median Computations. STOC 1972: 119-124
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:16 CEST by the dblp team