Ronald L. Rivest

Proceedings of the Financial Cryptography and Data Security, 2019

Bernoulli Ballot Polling: A Manifest Improvement for Risk-Limiting Audits.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2019

A "paradoxical" solution to the signature problem.

[BibT_eX]

[DOI]

Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018

Consistent Sampling with Replacement.

[BibT_eX]

[DOI]

CoRR, 2018

Bayesian Tabulation Audits: Explained and Extended.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

CoRR, 2018

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games.

[BibT_eX]

[DOI]

Soheil Behnezhad

Avrim Blum

Mahsa Derakhshan

Mohammad Mahdian

Christos H. Papadimitriou

Saeed Seddighin

Philip B. Stark

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

When Is an Election Verifiable?

[BibT_eX]

[DOI]

Philip B. Stark

IEEE Secur. Priv., 2017

ClipAudit: A Simple Risk-Limiting Post-Election Audit.

[BibT_eX]

[DOI]

CoRR, 2017

Public Evidence from Secret Ballots.

[BibT_eX]

[DOI]

Proceedings of the Electronic Voting - Second International Joint Conference, 2017

Time-Space Trade-offs in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

BatchVote: Voting Rules Designed for Auditability.

[BibT_eX]

[DOI]

Philip B. Stark

Zara Perumal

Proceedings of the Financial Cryptography and Data Security, 2017

Marked Mix-Nets.

[BibT_eX]

[DOI]

Olivier Pereira

Proceedings of the Financial Cryptography and Data Security, 2017

2016

Spritz - a spongy RC4-like stream cipher and hash function.

[BibT_eX]

[DOI]

Jacob C. N. Schuldt

IACR Cryptol. ePrint Arch., 2016

Towards Secure Quadratic Voting.

[BibT_eX]

[DOI]

Sunoo Park

IACR Cryptol. ePrint Arch., 2016

The Optimality of Correlated Sampling.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

An IBE-based Signcryption Scheme for Group Key Management.

[BibT_eX]

[DOI]

CoRR, 2016

Auditing Australian Senate Ballots.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Keys under doormats: mandating insecurity by requiring government access to all data and communications.

[BibT_eX]

[DOI]

J. Cybersecur., 2015

DiffSum - A Simple Post-Election Risk-Limiting Audit.

[BibT_eX]

[DOI]

CoRR, 2015

End-to-end verifiability.

[BibT_eX]

[DOI]

CoRR, 2015

Keys under doormats.

[BibT_eX]

[DOI]

Commun. ACM, 2015

2014

Picture-Hanging Puzzles.

[BibT_eX]

[DOI]

Erik D. Demaine

Martin L. Demaine

Yair N. Minsky

Joseph S. B. Mitchell

Mihai Patrascu

Theory Comput. Syst., 2014

2013

FlipIt: The Game of "Stealthy Takeover".

[BibT_eX]

[DOI]

J. Cryptol., 2013

Drifting Keys: Impersonation detection for constrained devices.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Honeywords: making password-cracking detectable.

[BibT_eX]

[DOI]

Ari Juels

Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012

Defending Against the Unknown Enemy: Applying FlipIt to System Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

A Bayesian Method for Auditing Elections.

[BibT_eX]

[DOI]

Emily Shen

Proceedings of the 2012 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 2012

Hourglass schemes: how to prove that cloud files are encrypted.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Computer and Communications Security, 2012

Information, Data, Security in a Networked Future.

[BibT_eX]

[DOI]

Proceedings of the ACM Turing Centenary Celebration, 2012

2011

RSA Problem.

[BibT_eX]

[DOI]

Burt Kaliski

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Tweakable Block Ciphers.

[BibT_eX]

[DOI]

Moses D. Liskov

David A. Wagner

J. Cryptol., 2011

The invertibility of the XOR of rotations of a binary word.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2011

Computing the Margin of Victory in IRV Elections.

[BibT_eX]

[DOI]

Thomas R. Magrino

Emily Shen

Proceedings of the 2011 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 2011

2010

Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2010

How to Tell if Your Cloud Files Are Vulnerable to Drive Crashes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

A Modular Voting Architecture ("Frog Voting").

[BibT_eX]

[DOI]

Shuki Bruck

David R. Jefferson

Proceedings of the Towards Trustworthy Elections, New Directions in Electronic Voting, 2010

Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy.

[BibT_eX]

[DOI]

Proceedings of the 19th USENIX Security Symposium, 2010

Scantegrity Mock Election at Takoma Park.

[BibT_eX]

[DOI]

Proceedings of the Electronic Voting 2010, 2010

2009

Guest editorial: special issue on electronic voting.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2009

Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2009

Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 16th International Workshop, 2009

Introduction to Algorithms, 3rd Edition.

[BibT_eX]

[DOI]

MIT Press, ISBN: 9780262533058, 2009

2008

Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes.

[BibT_eX]

[DOI]

Proceedings of the 2008 USENIX/ACCURATE Electronic Voting Workshop, 2008

On Auditing Elections When Precincts Have Different Sizes.

[BibT_eX]

[DOI]

Javed A. Aslam

Raluca A. Popa

Proceedings of the 2008 USENIX/ACCURATE Electronic Voting Workshop, 2008

2007

On Estimating the Size and Confidence of a Statistical Audit.

[BibT_eX]

[DOI]

Javed A. Aslam

Raluca A. Popa

Proceedings of the 2007 USENIX/ACCURATE Electronic Voting Technology Workshop, 2007

Robbing the Bank with a Theorem Prover - (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Security Protocols, 2007

On the Security of the EMV Secure Messaging API (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Security Protocols, 2007

Security of Voting Systems.

[BibT_eX]

[DOI]

Proceedings of the 4th Symposium on Networked Systems Design and Implementation (NSDI 2007), 2007

07311 Abstracts Collection -- Frontiers of Electronic Voting.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Electronic Voting, 29.07. - 03.08.2007, 2007

07311 Executive Summary -- Frontiers of Electronic Voting.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Electronic Voting, 29.07. - 03.08.2007, 2007

Amplifying Collision Resistance: A Complexity-Theoretic Treatment.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Scratch & vote: self-contained paper-based cryptographic voting.

[BibT_eX]

[DOI]

Ben Adida

Proceedings of the 2006 ACM Workshop on Privacy in the Electronic Society, 2006

Phish and Chips.

[BibT_eX]

[DOI]

Proceedings of the Security Protocols, 2006

Lightweight Email Signatures (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

Fourth-factor authentication: somebody you know.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Computer and Communications Security, 2006

How to Leak a Secret: Theory and Applications of Ring Signatures.

[BibT_eX]

[DOI]

Yael Tauman

Proceedings of the Theoretical Computer Science, 2006

2005

RSA Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Lightweight Encryption for Email.

[BibT_eX]

[DOI]

Ben Adida

Susan Hohenberger

Proceedings of the Steps to Reducing Unwanted Traffic on the Internet Workshop, 2005

2004

Access-controlled resource discovery in pervasive networks.

[BibT_eX]

[DOI]

Concurr. Pract. Exp., 2004

On the Notion of Pseudo-Free Groups.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

On Permutation Operations in Cipher Design.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04), 2004

Peppercoin Micropayments.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 2004

2003

Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems.

[BibT_eX]

[DOI]

Proceedings of the Security in Pervasive Computing, 2003

Does Anyone Really Need MicroPayments?

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 2003

The blocker tag: selective blocking of RFID tags for consumer privacy.

[BibT_eX]

[DOI]

Ari Juels

Michael Szydlo

Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2002

Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking.

[BibT_eX]

[DOI]

Markus Jakobsson

Ari Juels

IACR Cryptol. ePrint Arch., 2002

Proxy-based security protocols in networked mobile devices.

[BibT_eX]

[DOI]

Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

The Untrusted Computer Problem and Camera-Based Authentication.

[BibT_eX]

[DOI]

Proceedings of the Pervasive Computing, 2002

Privacy Tradeoffs: Myth or Reality? Panel.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 6th International Conference, 2002

Transitive Signature Schemes.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2002

Micropayments Revisited.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2002

2001

Certificate Chain Discovery in SPKI/SDSI.

[BibT_eX]

[DOI]

J. Comput. Secur., 2001

Are 'Strong' Primes Needed for RSA.

[BibT_eX]

[DOI]

Robert Silverman

IACR Cryptol. ePrint Arch., 2001

The Business of Electronic Voting.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 2001

How to Leak a Secret.

[BibT_eX]

[DOI]

Yael Tauman

Proceedings of the Advances in Cryptology, 2001

Introduction to Algorithms, Second Edition

[BibT_eX]

The MIT Press and McGraw-Hill Book Company, ISBN: 0-07-013151-1, 2001

2000

RC6 as the AES.

[BibT_eX]

Yiqun Lisa Yin

Proceedings of the Third Advanced Encryption Standard Candidate Conference, 2000

1999

SPKI Certificate Theory.

[BibT_eX]

[DOI]

RFC, September, 1999

Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer.

[BibT_eX]

[DOI]

Mihir Bellare

J. Cryptol., 1999

Piecemeal Graph Exploration by a Mobile Robot.

[BibT_eX]

[DOI]

Inf. Comput., 1999

Pseudonym Systems.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 6th Annual International Workshop, 1999

Improved Analysis of Some Simplified Variants of RC6.

[BibT_eX]

[DOI]

Scott Contini

Yiqun Lisa Yin

Proceedings of the Fast Software Encryption, 6th International Workshop, 1999

1998

A Description of the RC2(r) Encryption Algorithm.

[BibT_eX]

[DOI]

Ron Rivest

RFC, March, 1998

On the Design and Security of RC2.

[BibT_eX]

[DOI]

Lars R. Knudsen

Vincent Rijmen

Proceedings of the Fast Software Encryption, 5th International Workshop, 1998

Can We Eliminate Certificate Revocations Lists?

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 1998

1997

The risks of key recovery, key escrow, and trusted third-party encryption.

[BibT_eX]

World Wide Web J., 1997

Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop.

[BibT_eX]

[DOI]

Oded Goldreich

Birgit Pfitzmann

IACR Cryptol. ePrint Arch., 1997

All-or-Nothing Encryption and the Package Transform.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 4th International Workshop, 1997

Electronic Lottery Tickets as Micropayments.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 1997

Perspectives on Financial Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 1997

1996

The RC5, RC5-CBC, RC5-CBC-Pad, and RC5-CTS Algorithms.

[BibT_eX]

[DOI]

Robert W. Baldwin

RFC, October, 1996

On breaking a Huffman code.

[BibT_eX]

[DOI]

David W. Gillman

Mojdeh Mohtashemi

IEEE Trans. Inf. Theory, 1996

PayWord and MicroMint: Two Simple Micropayment Schemes.

[BibT_eX]

[DOI]

Proceedings of the Security Protocols, 1996

1995

Piecemeal Learning of an Unknown Environment.

[BibT_eX]

[DOI]

Margrit Betke

Mona Singh

Mach. Learn., 1995

Complete Variable-Length "Fix-Free" Codes.

[BibT_eX]

[DOI]

David Gillman

Des. Codes Cryptogr., 1995

Being Taught can be Faster than Asking Questions.

[BibT_eX]

[DOI]

Yiqun Lisa Yin

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Picking the Best Expert from a Sequence.

[BibT_eX]

[DOI]

Ruth Bergman

Proceedings of the Learning from Data, 1995

1994

A Formal Model of Hierarchical Concept Learning

[BibT_eX]

[DOI]

Inf. Comput., October, 1994

Diversity-Based Inference of Finite Automata.

[BibT_eX]

[DOI]

J. ACM, 1994

The RC5 Encryption Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption: Second International Workshop. Leuven, 1994

1993

On Choosing between Experimenting and Thinking when Learning

[BibT_eX]

[DOI]

Inf. Comput., September, 1993

Inference of Finite Automata Using Homing Sequences

[BibT_eX]

[DOI]

Inf. Comput., April, 1993

Learning Binary Relations and Total Orders.

[BibT_eX]

[DOI]

Sally A. Goldman

SIAM J. Comput., 1993

To Tap or not to Tap.

[BibT_eX]

[DOI]

Commun. ACM, 1993

Scapegoat Trees.

[BibT_eX]

[DOI]

Igal Galperin

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Introduction.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning: From Theory to Applications, 1993

Strategic Directions in Machine Learning.

[BibT_eX]

[DOI]

Stephen Jose Hanson

Werner Remmele

Proceedings of the Machine Learning: From Theory to Applications, 1993

1992

The MD5 Message-Digest Algorithm.

[BibT_eX]

[DOI]

RFC, April, 1992

The MD4 Message-Digest Algorithm.

[BibT_eX]

[DOI]

RFC, April, 1992

Training a 3-node neural network is NP-complete.

[BibT_eX]

[DOI]

Avrim Blum

Neural Networks, 1992

Responses to NIST's Proposal.

[BibT_eX]

[DOI]

Commun. ACM, 1992

1991

Results on Learnability and the Vapnik-Chervonenkis Dimension

[BibT_eX]

[DOI]

Nathan Linial

Yishay Mansour

Inf. Comput., January, 1991

Incrementally Learning Time-Varying Half Planes.

[BibT_eX]

[DOI]

Anthony Kuh

Thomas Petsche

Proceedings of the Advances in Neural Information Processing Systems 4, 1991

On NIST's Proposed Digital Signature Standard.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

Cryptography and Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

1990

A fair protocol for signing contracts.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

Learning Time-Varying Concepts.

[BibT_eX]

[DOI]

Anthony Kuh

Thomas Petsche

Proceedings of the Advances in Neural Information Processing Systems 3, 1990

Finding Four Million Large Random Primes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1990

On the Sample Complexity of PAC-Learning Using Random and Chosen Examples.

[BibT_eX]

[DOI]

Bonnie Eisenberg

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Inferring Graphs from Walks.

[BibT_eX]

[DOI]

Javed A. Aslam

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Cryptography.

[BibT_eX]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Inferring Decision Trees Using the Minimum Description Length Principle

[BibT_eX]

[DOI]

J. Ross Quinlan

Inf. Comput., March, 1989

Inference of Finite Automata Using Homing Sequences (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Learning Binary Relations and Total Orders (Extended Abstract)

[BibT_eX]

[DOI]

Sally A. Goldman

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Introduction to Algorithms

[BibT_eX]

Thomas H. Cormen

Charles E. Leiserson

The MIT Press and McGraw-Hill Book Company, ISBN: 0-07-013143-0, 1989

1988

A knapsack-type public key cryptosystem based on arithmetic in finite fields.

[BibT_eX]

[DOI]

Benny Chor

IEEE Trans. Inf. Theory, 1988

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES).

[BibT_eX]

[DOI]

J. Cryptol., 1988

A New Model for Inductive Inference.

[BibT_eX]

Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, 1988

Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract)

[BibT_eX]

[DOI]

Nathan Linial

Yishay Mansour

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Results on Learnability and the Vapnick-Chervonenkis Dimension.

[BibT_eX]

[DOI]

Nathan Linial

Yishay Mansour

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Learning Complicated Concepts Reliably and Usefully.

[BibT_eX]

[DOI]

Proceedings of the 7th National Conference on Artificial Intelligence, 1988

1987

Network control by Bayesian broadcast.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1987

Learning Decision Lists.

[BibT_eX]

[DOI]

Mach. Learn., 1987

Global Wire Routing in Two-Dimensional Arrays.

[BibT_eX]

[DOI]

Richard M. Karp

Algorithmica, 1987

Game Tree Searching by Min/Max Approximation.

[BibT_eX]

[DOI]

Artif. Intell., 1987

Diversity-Based Inference of Finite Automata (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Estimating a probability using finite memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

An application of number theory to the organization of raster-graphics memory.

[BibT_eX]

[DOI]

J. ACM, 1986

A non-iterative maximum entropy algorithm.

[BibT_eX]

[DOI]

Sally A. Goldman

Proceedings of the UAI '86: Proceedings of the Second Annual Conference on Uncertainty in Artificial Intelligence, 1986

1985

A Fair Protocol for Signing Contracts (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

Efficient Factoring Based on Partial Information.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1985

Is the Data Encryption Standard a Group? (Preliminary Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1985

Is DES a Pure Cipher? (Results of More Cycling Experiments on DES).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1985

1984

How to Expose an Eavesdropper.

[BibT_eX]

[DOI]

Commun. ACM, 1984

A "Paradoxical" Solution to the Signature Problem (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

RSA Chips (Past/Present/Future).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

A "Paradoxical'"Solution to the Signature Problem (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1984

1983

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint).

[BibT_eX]

[DOI]

Leonard M. Adleman

Commun. ACM, 1983

Global Wire Routing in Two-Dimensional Arrays (Extended Abstract)

[BibT_eX]

[DOI]

Richard M. Karp

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Estimating a Probability Using Finite Memory (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1983

1982

How to Reuse a "Write-Once" Memory

[BibT_eX]

[DOI]

Inf. Control., 1982

How to Reuse a "Write-Once" Memory (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract)

[BibT_eX]

[DOI]

Benny Chor

Charles E. Leiserson

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

A "greedy" channel router.

[BibT_eX]

[DOI]

Charles M. Fiduccia

Proceedings of the 19th Design Automation Conference, 1982

The "PI" (placement and interconnect) system.

[BibT_eX]

[DOI]

Proceedings of the 19th Design Automation Conference, 1982

Randomized Encryption Techniques.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

A Short Report on the RSA Chip.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981

Statistical Analysis of the Hagelin Cryptograph.

[BibT_eX]

[DOI]

Cryptologia, 1981

1980

On the Polyhedral Decision Problem.

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

SIAM J. Comput., 1980

Orthogonal Packings in Two Dimensions.

[BibT_eX]

[DOI]

Brenda S. Baker

Edward G. Coffman Jr.

SIAM J. Comput., 1980

Coping with Errors in Binary Search Procedures.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

The Subgraph Homeomorphism Problem.

[BibT_eX]

[DOI]

Andrea S. LaPaugh

J. Comput. Syst. Sci., 1980

"Forwards and Backwards" Encryption.

[BibT_eX]

[DOI]

Cryptologia, 1980

1979

The BLIZZARD computer architecture.

[BibT_eX]

[DOI]

SIGARCH Comput. Archit. News, 1979

An Omega(n/lg n)<sup>1/2</sup> Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials.

[BibT_eX]

[DOI]

Jean-Paul Van de Wiele

Inf. Process. Lett., 1979

1978

k+1 Heads Are Better than k.

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

J. ACM, 1978

Optimal Arrangement of Keys in a Hash Table.

[BibT_eX]

[DOI]

J. ACM, 1978

Remarks on a Proposed Cryptanalytic Attack on the M.I.T. Public-Key Cryptosystem.

[BibT_eX]

[DOI]

Cryptologia, 1978

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.

[BibT_eX]

[DOI]

Leonard M. Adleman

Commun. ACM, 1978

Coping with Errors in Binary Search Procedures (Preliminary Report)

[BibT_eX]

[DOI]

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1977

The Necessity of Feedback in Minimal Monotone Combinational Circuits.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1977

On the Worst-Case Behavior of String-Searching Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1977

The game of "N questions" on a tree.

[BibT_eX]

[DOI]

Discret. Math., 1977

An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

David Avis

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976

On Recognizing Graph Properties from Adjacency Matrices.

[BibT_eX]

[DOI]

Jean Vuillemin

Theor. Comput. Sci., 1976

Partial-Match Retrieval Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1976

Constructing Optimal Binary Decision Trees is NP-Complete.

[BibT_eX]

[DOI]

Laurent Hyafil

Inf. Process. Lett., 1976

Linear Expected Time of a Simple Union-Find Algorithm.

[BibT_eX]

[DOI]

Jon Doyle

Inf. Process. Lett., 1976

On Self-Organizing Sequential Search Heuristics.

[BibT_eX]

[DOI]

Commun. ACM, 1976

The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report

[BibT_eX]

[DOI]

Vaughan R. Pratt

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975

The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489).

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1975

Expected Time Bounds for Selection.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1975

A Generalization and Proof of the Aanderaa-Rosenberg Conjecture

[BibT_eX]

[DOI]

Jean Vuillemin

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974

Analysis of associative retrieval algorithms.

[BibT_eX]

[DOI]

PhD thesis, 1974

Asymptotic bounds for the number of convex n-ominoes.

[BibT_eX]

[DOI]

David A. Klarner

Discret. Math., 1974

On the Optimality of Elia's Algorithm for Performing Best-Match Searches.

[BibT_eX]

Proceedings of the Information Processing, 1974

On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract)

[BibT_eX]

[DOI]