Michael J. Fischer

Jonathan E. Hochman

Daniel Boffa

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

2019

Incentives Don't Solve Blockchain's Problems.

[BibT_eX]

[DOI]

Shea Ketsdever

Eleftherios Kokoris-Kogias

Proceedings of the 10th IEEE Annual Ubiquitous Computing, 2019

2016

Scalable Bias-Resistant Distributed Randomness.

[BibT_eX]

[DOI]

Ewa Syta

Philipp Jovanovic

IACR Cryptol. ePrint Arch., 2016

2015

Private Eyes: Secure Remote Biometric Authentication.

[BibT_eX]

[DOI]

Proceedings of the SECRYPT 2015, 2015

2013

Secure sealed-bid online auctions using discreet cryptographic proofs.

[BibT_eX]

[DOI]

Math. Comput. Model., 2013

2011

A Public Randomness Service.

[BibT_eX]

Michaela Iorga

René Peralta

Proceedings of the SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography, Seville, Spain, 18, 2011

2010

Assigning tasks for efficiency in Hadoop: extended abstract.

[BibT_eX]

[DOI]

Xueyuan Su

Yitong Yin

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

2008

Self-stabilizing population protocols.

[BibT_eX]

[DOI]

ACM Trans. Auton. Adapt. Syst., 2008

Evolution of distributed computing theory: from concurrency to networks and beyond.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2006

Computation in networks of passively mobile finite-state sensors.

[BibT_eX]

[DOI]

Distributed Comput., 2006

Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents.

[BibT_eX]

[DOI]

Hong Jiang

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Stabilizing Consensus in Mobile Networks.

[BibT_eX]

[DOI]

Dana Angluin

Hong Jiang

Proceedings of the Distributed Computing in Sensor Systems, 2006

2005

Stably Computable Properties of Network Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2005

2003

JACM 1983-1986.

[BibT_eX]

[DOI]

J. ACM, 2003

Appraising two decades of distributed computing theory research.

[BibT_eX]

[DOI]

Michael Merritt

Distributed Comput., 2003

2001

Towards understanding the predictability of stock markets from the perspective of computational complexity.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

1999

Optimal Layout of Edge-weighted Forests.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

Estimating Parameters of Monotone Boolean Functions (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1996

The Wakeup Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

Bounds on Secret Key Exchange Using a Random Deal of Cards.

[BibT_eX]

[DOI]

J. Cryptol., 1996

A Secure Protocol for the Oblivious Transfer (Extended Abstract).

[BibT_eX]

Silvio Micali

Charles Rackoff

J. Cryptol., 1996

1994

Fishspear: A Priority Queue Algorithm.

[BibT_eX]

[DOI]

J. ACM, 1994

Reliable Communication Over Unreliable Channels.

[BibT_eX]

[DOI]

J. ACM, 1994

1993

Lambda-Calculus Schemata.

[BibT_eX]

LISP Symb. Comput., 1993

Space-Efficient Asynchronous Consensus Without Shared Memory Initialization.

[BibT_eX]

[DOI]

Shlomo Moran

Gadi Taubenfeld

Inf. Process. Lett., 1993

An Efficient Protocol for Unconditionally Secure Secret Key Exchange.

[BibT_eX]

[DOI]

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

1992

Optimal Placement of Identical Resources in a Tree

[BibT_eX]

[DOI]

Inf. Comput., January, 1992

Decision Making in the Presence of Noise.

[BibT_eX]

[DOI]

Sophia A. Paleologou

Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992

1991

Multiparty Secret Key Exchange Using a Random Deal of Cards.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

1990

The Wakeup Problem (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

An Application of Game-Theoretic Techniques to Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Advances In Computational Complexity Theory, 1990

1989

Distributed FIFO Allocation of Identical Resources Using Small Shared Space.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1989

Primitive recursion without implicit predecessor.

[BibT_eX]

[DOI]

Robert P. Fischer

Richard Beigel

SIGACT News, 1989

Secret Bit Transmission Using a Random Deal of Cards.

[BibT_eX]

[DOI]

Michael S. Paterson

Charles Rackoff

Proceedings of the Distributed Computing And Cryptography, 1989

1988

Reasoning about Uncertainty in Fault-tolerant Distributed Systems.

[BibT_eX]

[DOI]

Lenore D. Zuck

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1988

1987

Efficient Fault-Tolerant Routings in Networks

[BibT_eX]

[DOI]

Inf. Comput., October, 1987

Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse.

[BibT_eX]

[DOI]

Neil Immerman

Inf. Process. Lett., 1987

1986

Probabilistic Analysis of a Network Resource Allocation Algorithm

[BibT_eX]

[DOI]

Inf. Control., 1986

Easy Impossibility Proofs for Distributed Consensus Problems.

[BibT_eX]

[DOI]

Michael Merritt

Distributed Comput., 1986

Foundations of Knowledge for Distributed Systems.

[BibT_eX]

Neil Immerman

Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

A Theoretician's View of Fault Tolerant Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

1985

Impossibility of Distributed Consensus with One Faulty Process

[BibT_eX]

[DOI]

J. ACM, April, 1985

Dynamic Monotone Priorities on Planar Sets (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract)

[BibT_eX]

[DOI]

Josh D. Cohen

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

Fishspear: A Priority Queue Algorithm (Extended Abstract)

[BibT_eX]

[DOI]

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

1983

Efficiency of Synchronous Versus Asynchronous Distributed Systems

[BibT_eX]

[DOI]

Eshrat Arjomandi

J. ACM, July, 1983

A Technique for Decomposing Algorithms Which Use a Single Shared Variable.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

Storage Requirements for Fair Scheduling.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

The Consensus Problem in Unreliable Distributed Systems (A Brief Survey).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1983

1982

An Efficient Algorithm for Byzantine Agreement without Authentication

[BibT_eX]

[DOI]

Inf. Control., March, 1982

Global States of a Distributed System.

[BibT_eX]

[DOI]

Nancy D. Griffeth

IEEE Trans. Software Eng., 1982

Omega(n log n) Lower Bounds on Length of Boolean Formulas.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable.

[BibT_eX]

[DOI]

J. ACM, 1982

A Lower Bound for the Time to Assure Interactive Consistency.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

Sacrificing Serializability to Attain High Availability of Data.

[BibT_eX]

[DOI]

Alan Michael

Proceedings of the ACM Symposium on Principles of Database Systems, 1982

On computing weak transitive closure on O(log N) expected random parallel time.

[BibT_eX]

Albert G. Greenberg

Proceedings of the International Conference on Parallel Processing, 1982

1981

On Describing the Behavior and Implementation of Distributed Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1981

A Time-Space Tradeoff for Sorting on Non-Oblivious Machines.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

A Difference in Efficiency between Synchronous and Asynchronous Systems

[BibT_eX]

[DOI]

Eshrat Arjomandi

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

The Architecture of the Eden System.

[BibT_eX]

[DOI]

Proceedings of the Eighth Symposium on Operating System Principles, 1981

Optimal Placement of Identical Resources in a Distributed Network.

[BibT_eX]

Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

1980

Parallel Prefix Computation.

[BibT_eX]

[DOI]

Richard E. Ladner

J. ACM, 1980

Optimal Tree Layout (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

A time-space tradeoff for sorting and related non-oblivious computations.

[BibT_eX]

[DOI]

SIGACT News, 1979

Propositional Dynamic Logic of Regular Programs.

[BibT_eX]

[DOI]

Richard E. Ladner

J. Comput. Syst. Sci., 1979

Relations Among Complexity Measures.

[BibT_eX]

[DOI]

Nicholas Pippenger

J. ACM, 1979

Resource Allocation with Immunity to Limited Process Failure (Preliminary Report)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

Separating Nondeterministic Time Complexity Classes.

[BibT_eX]

[DOI]

Joel I. Seiferas

J. ACM, 1978

1977

Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract)

[BibT_eX]

[DOI]

Gary L. Peterson

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

Propositional Modal Logic of Programs (Extended Abstract)

[BibT_eX]

[DOI]

Richard E. Ladner

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

1976

A Note on the Average Time to Compute Transitive Closures.

[BibT_eX]

Peter A. Bloniarz

Proceedings of the Third International Colloquium on Automata, 1976

1975

Lower Bounds on the Size of Boolean Formulas: Preliminary Report

[BibT_eX]

[DOI]

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

Hauptvortrag: The complexity of negation-limited networks - A brief survey.

[BibT_eX]

[DOI]

Proceedings of the Automata Theory and Formal Languages, 1975

1974

Fast On-Line Integer Multiplication.

[BibT_eX]

[DOI]

Larry J. Stockmeyer

J. Comput. Syst. Sci., 1974

The String-to-String Correction Problem.

[BibT_eX]

[DOI]

Robert A. Wagner

J. ACM, 1974

1973

A note on disjunctive form tautologies.

[BibT_eX]

[DOI]

SIGACT News, 1973

Sets that Don't Help

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

Mode Modules as Representations of Domains.

[BibT_eX]

[DOI]

Alice E. Fischer

Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

Refinements of the Nondeterministic Time and Space Hierarchies

[BibT_eX]

[DOI]

Joel I. Seiferas

Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1972

Efficiency of Equivalence Algorithms.

[BibT_eX]

[DOI]

Proceedings of a symposium on the Complexity of Computer Computations, 1972

1971

Economy of Description by Automata, Grammars, and Formal Systems

[BibT_eX]

[DOI]

Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

Boolean Matrix Multiplication and Transitive Closure

[BibT_eX]

[DOI]

Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1969

Some Properties of Precedence Languages

[BibT_eX]

[DOI]

Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969

Two Characterizations of the Context-Sensitive Languages

[BibT_eX]

[DOI]

Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

1968

Real-Time Solutions of the Origin-Crossing Problem.

[BibT_eX]

[DOI]

Arnold L. Rosenberg

Math. Syst. Theory, 1968

Limited Random Access Turing Machines

[BibT_eX]

[DOI]

Arnold L. Rosenberg

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

Grammars with Macro-Like Productions

[BibT_eX]

[DOI]

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1965

The iteration element.

[BibT_eX]

[DOI]

Bernard A. Galler

Commun. ACM, 1965

1964

In defense of the equivalence algorithm.

[BibT_eX]

[DOI]

Bernard A. Galler

Commun. ACM, 1964

An improved equivalence algorithm.

[BibT_eX]

[DOI]

Bernard A. Galler