Juan A. Garay

IACR Cryptol. ePrint Arch., 2023

Generalized Hybrid Search and Applications.

[BibT_eX]

[DOI]

Alexandru Cojocaru

Fang Song

IACR Cryptol. ePrint Arch., 2023

Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Generalized Hybrid Search and Applications to Blockchain and Hash Function Security.

[BibT_eX]

[DOI]

Alexandru Cojocaru

Fang Song

CoRR, 2023

Completeness Theorems for Adaptively Secure Broadcast.

[BibT_eX]

[DOI]

Ran Cohen

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022

Permissionless Clock Synchronization with Public Setup.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2021

The Bitcoin Cash Backbone Protocol.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Adaptively Secure Broadcast in Resource-Restricted Cryptography.

[BibT_eX]

[DOI]

Ran Cohen

IACR Cryptol. ePrint Arch., 2021

Universally Composable Almost-Everywhere Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

On Bitcoin cash's target recalculation functions.

[BibT_eX]

[DOI]

Proceedings of the AFT '21: 3rd ACM Conference on Advances in Financial Technologies, Arlington, Virginia, USA, September 26, 2021

2020

The combinatorics of hidden diversity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Full Analysis of Nakamoto Consensus in Bounded-Delay Networks.

[BibT_eX]

[DOI]

Nikos Leonardos

IACR Cryptol. ePrint Arch., 2020

Post-Quantum Security of the Bitcoin Backbone and Quantum Multi-Solution Bernoulli Search.

[BibT_eX]

[DOI]

CoRR, 2020

Blockchains from Non-idealized Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Consensus from Signatures of Work.

[BibT_eX]

[DOI]

Muni Venkateswarlu Kumaramangalam

Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

2019

Perennial secure multi-party computation of universal Turing machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Probabilistic Termination and Composability of Cryptographic Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2019

Iterated Search Problems and Blockchain Security under Falsifiable Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Resource-Restricted Cryptography: Honest-Majority MPC from a CRS (and No Broadcast).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

The Bitcoin Backbone Protocol Against Quantum Adversaries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Broadcast-Optimal Two-Round MPC.

[BibT_eX]

[DOI]

Ran Cohen

IACR Cryptol. ePrint Arch., 2019

2018

SoK: A Consensus Taxonomy in the Blockchain Era.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

But Why does it Work? A Rational Protocol Design Treatment of Bitcoin.

[BibT_eX]

[DOI]

Christian Badertscher

IACR Cryptol. ePrint Arch., 2018

Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2017

Proofs of Work for Blockchain Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

The Price of Low Communication in Secure Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case.

[BibT_eX]

[DOI]

Payman Mohassel

Satyanarayana Vusirikala

IACR Cryptol. ePrint Arch., 2017

Special Issue: Algorithmic Tools in Cryptography.

[BibT_eX]

[DOI]

Algorithmica, 2017

Brief Announcement: Secure Self-Stabilizing Computation.

[BibT_eX]

[DOI]

Shlomi Dolev

Karim Eldefrawy

Muni Venkateswarlu Kumaramangalam

Moti Yung

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016

Optimal Probabilistic Synchronous Byzantine Agreement.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

MAC Precomputation with Applications to Secure Memory.

[BibT_eX]

[DOI]

Vladimir Kolesnikov

Rae McLellan

ACM Trans. Priv. Secur., 2016

Bootstrapping the Blockchain - Directly.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

The Bitcoin Backbone Protocol with Chains of Variable Difficulty.

[BibT_eX]

[DOI]

Nikos Leonardos

IACR Cryptol. ePrint Arch., 2016

Short and Adjustable Signatures.

[BibT_eX]

[DOI]

Xiong Fan

Payman Mohassel

IACR Cryptol. ePrint Arch., 2016

Constant-Round Asynchronous Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015

Almost-Everywhere Secure Computation with Edge Corruptions.

[BibT_eX]

[DOI]

J. Cryptol., 2015

Fair Distributed Computation of Reactive Functions.

[BibT_eX]

[DOI]

Björn Tackmann

IACR Cryptol. ePrint Arch., 2015

How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Blockchain-Based Consensus (Keynote).

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults.

[BibT_eX]

[DOI]

Wutichai Chongchitmate

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014

Secure Message Transmission With Small Public Discussion.

[BibT_eX]

[DOI]

Clint Givens

IEEE Trans. Inf. Theory, 2014

The Bitcoin Backbone Protocol: Analysis and Applications.

[BibT_eX]

[DOI]

Nikos Leonardos

IACR Cryptol. ePrint Arch., 2014

A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality.

[BibT_eX]

[DOI]

Wutichai Chongchitmate

IACR Cryptol. ePrint Arch., 2014

Fast and unconditionally secure anonymous channel.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

On the Complexity of UC Commitments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013

Rational Protocol Design: Cryptography Against Incentive-driven Adversaries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

EyeDecrypt - Private Interactions in Plain Sight.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Towards Efficient Private Distributed Computation on Unbounded Input Streams.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Broadcast (and Round) Efficient Verifiable Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 7th International Conference, 2013

Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2013

2012

Resource-based Corruptions and the Combinatorics of Hidden Diversity.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Broadcast-Efficient Secure Multiparty Computation.

[BibT_eX]

[DOI]

Clint Givens

IACR Cryptol. ePrint Arch., 2012

On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Efficient Private Distributed Computation on Unbounded Input Streams

[BibT_eX]

[DOI]

CoRR, 2012

Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Edge Fault Tolerance on Sparse Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Resource Fairness and Composability of Cryptographic Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2011

Adaptively secure broadcast, revisited.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

Secure Message Transmission by Public Discussion: A Brief Survey.

[BibT_eX]

[DOI]

Clint Givens

Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010

Brief announcement: swarming secrets.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Improved Fault Tolerance and Secure Computation on Sparse Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Swarming secrets.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

Optimal Probabilistic Synchronous Byzantine Agreement.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer.

[BibT_eX]

[DOI]

Daniel Wichs

Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2008

A Framework for the Sound Specification of Cryptographic Tasks.

[BibT_eX]

[DOI]

Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2008

Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security, Third International Conference, 2008

Sound and Fine-grain Specification of Ideal Functionalities.

[BibT_eX]

[DOI]

Hong-Sheng Zhou

Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

2007

Almost-everywhere Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Towards Optimal and Efficient Perfectly Secure Message Transmission.

[BibT_eX]

[DOI]

Matthias Fitzi

Matthew K. Franklin

Harsha Vardhan Simhadri

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Practical and Secure Solutions for Integer Comparison.

[BibT_eX]

[DOI]

Berry Schoenmakers

José Villegas

Proceedings of the Public Key Cryptography, 2007

Round Complexity of Authenticated Broadcast with a Dishonest Majority.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

Strengthening Zero-Knowledge Protocols Using Signatures.

[BibT_eX]

[DOI]

J. Cryptol., 2006

Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Round-Optimal and Efficient Verifiable Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Software integrity protection using timed executable agents.

[BibT_eX]

[DOI]

Lorenz Huelsbergen

Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, 2006

2005

Minimal Complete Primitives for Secure Multi-Party Computation.

[BibT_eX]

[DOI]

J. Cryptol., 2005

2004

Preface.

[BibT_eX]

[DOI]

Sergio Rajsbaum

Theor. Comput. Sci., 2004

Efficient and Universally Composable Committed Oblivious Transfer and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Efficient and Universally Composable Committed Oblivious Transfer and Applications.

[BibT_eX]

[DOI]

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

2003

Efficient authentication and key distribution in wireless IP networks.

[BibT_eX]

[DOI]

IEEE Wirel. Commun., 2003

Timed Fair Exchange of Standard Signatures.

[BibT_eX]

[DOI]

Carl Pomerance

IACR Cryptol. ePrint Arch., 2003

Sharing Video on Demand.

[BibT_eX]

[DOI]

Amotz Bar-Noy

Amir Herzberg

Discret. Appl. Math., 2003

Efficient player-optimal protocols for strong and differential consensus.

[BibT_eX]

[DOI]

Matthias Fitzi

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Timed Fair Exchange of Standard Signatures: [Extended Abstract].

[BibT_eX]

[DOI]

Carl Pomerance

Proceedings of the Financial Cryptography, 2003

Strengthening Zero-Knowledge Protocols Using Signatures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

2002

Efficient and Player-Optimal Strong Consensus.

[BibT_eX]

[DOI]

Matthias Fitzi

IACR Cryptol. ePrint Arch., 2002

A scheme for authentication and dynamic key exchange in wireless networks.

[BibT_eX]

[DOI]

Bell Labs Tech. J., 2002

On-line Admission Control and Packet Scheduling with Interleaving.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Timed Release of Standard Digital Signatures.

[BibT_eX]

[DOI]

Markus Jakobsson

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

2000

Secure distributed storage and retrieval.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Design, implementation, and deployment of the iKP secure electronic payment system.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2000

MicroISPs: providing convenient and low-cost high-bandwidth Internet access.

[BibT_eX]

[DOI]

José Carlos Brustoloni

Comput. Networks, 2000

Application-Independent End-to-End Security in Shared-Link Access Networks.

[BibT_eX]

[DOI]

José Carlos Brustoloni

Proceedings of the NETWORKING 2000, 2000

Concurrent Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Long-Lived Broadcast Encryption.

[BibT_eX]

[DOI]

Jessica Staddon

Avishai Wool

Proceedings of the Advances in Cryptology, 2000

1999

Mutual Search.

[BibT_eX]

[DOI]

J. ACM, 1999

Abuse-Free Multi-party Contract Signing.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 1999

Self-Testing/Correcting Protocols (Extended Abstract).

[BibT_eX]

[DOI]

Matthew K. Franklin

Moti Yung

Proceedings of the Distributed Computing, 1999

Multicast Security: A Taxonomy and Some Efficient Constructions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Abuse-Free Optimistic Contract Signing.

[BibT_eX]

[DOI]

Markus Jakobsson

Proceedings of the Advances in Cryptology, 1999

1998

Fully Polynomial Byzantine Agreement for <i>n</i> > 3t Processors in <i>t</i> + 1 Rounds.

[BibT_eX]

[DOI]

Yoram Moses

SIAM J. Comput., 1998

A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees.

[BibT_eX]

[DOI]

Shay Kutten

David Peleg

SIAM J. Comput., 1998

A Security Architecture for the Internet Protocol.

[BibT_eX]

[DOI]

IBM Syst. J., 1998

Fast Batch Verification for Modular Exponentiation and Digital Signatures.

[BibT_eX]

[DOI]

Mihir Bellare

Tal Rabin

IACR Cryptol. ePrint Arch., 1998

VarietyCash: A Multi-Purpose Electronic Payment System.

[BibT_eX]

[DOI]

Proceedings of the 3rd USENIX Workshop on Electronic Commerce, Boston, Massachusetts, USA, August 31, 1998

Mutual Search (Extended Abstract).

[BibT_eX]

[DOI]

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

Batch Verification with Applications to Cryptography and Checking.

[BibT_eX]

[DOI]

Mihir Bellare

Tal Rabin

Proceedings of the LATIN '98: Theoretical Informatics, 1998

Adaptability and the Usefulness of Hints (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

Efficient On-Line Call Control Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Competing against Specialists.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996

Fast, Long-Lived Renaming Improved and Simplified.

[BibT_eX]

[DOI]

Mark Moir

Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Fast, Long-Lived Renaming Improved and Simplified (Abstract).

[BibT_eX]

[DOI]

Mark Moir

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing.

[BibT_eX]

[DOI]

Mihir Bellare

Tal Rabin

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Optimal Amortized Distributed Consensus

[BibT_eX]

[DOI]

Inf. Comput., July, 1995

iKP - A Family of Secure Electronic Payment Protocols.

[BibT_eX]

[DOI]

Proceedings of the First USENIX Workshop on Electronic Commerce, 1995

Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX.

[BibT_eX]

[DOI]

Proceedings of the 5th USENIX Security Symposium, 1995

Securing the Internet (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Long-Lived Renaming Made Fast.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Optimal Resiliency against Mobile Faults.

[BibT_eX]

[DOI]

Harry Buhrman

Jaap-Henk Hoepman

Proceedings of the Digest of Papers: FTCS-25, 1995

Adaptive Video on Demand.

[BibT_eX]

[DOI]

Sudhanshu Aggarwal

Amir Herzberg

Proceedings of the Algorithms, 1995

1994

Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

1993

Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1993

Fast Consensus in Networks of Bounded Degree.

[BibT_eX]

[DOI]

Distributed Comput., 1993

Fully polynomial Byzantine agreement in t+1 rounds.

[BibT_eX]

[DOI]

Yoram Moses

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Randomized Distributed Agreement Revisited.

[BibT_eX]

[DOI]

Proceedings of the Digest of Papers: FTCS-23, 1993

A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract)

[BibT_eX]

[DOI]

Shay Kutten

David Peleg

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

A Continuum of Failure Models for Distributed Computing.

[BibT_eX]

[DOI]

Kenneth J. Perry

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Optimal Early Stopping in Distributed Consensus (Extended Abstract).

[BibT_eX]

[DOI]

Kenneth J. Perry

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Call Preemption in Communication Networks.

[BibT_eX]

[DOI]

Inder S. Gopal

Proceedings of the Proceedings IEEE INFOCOM '92, 1992

1991

Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Optimal Amortized Distributed Consensus (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

1990

Fast Consensus in Networks of Bounded Degree (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989

Analysis of Block-Paging Strategies.

[BibT_eX]

[DOI]

William H. Tetzlaff

Martin G. Kienzle

IBM J. Res. Dev., 1989

Efficient Agreement on Bounded-Degree Networks.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1989

Asymptotically Optimal Distributed Consensus (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Towards Optimal Distributed Consensus (Extended Abstract)

[BibT_eX]

[DOI]

Kenneth J. Perry

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

1988

Analysis of Page-Reference Strings of an Interactive System.

[BibT_eX]

[DOI]

Martin G. Kienzle

William H. Tetzlaff

IBM J. Res. Dev., 1988

1985

Preliminary Analysis of Page Reference Strings of an Interactive System.

[BibT_eX]

[DOI]