Stephen Ponzio

According to our database, Stephen Ponzio authored at least 9 papers between 1991 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

The Communication Complexity of Pointer Chasing.

Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh

J. Comput. Syst. Sci., 2001

1999

The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling.

Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract).

Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

A Lower Bound for Integer Multiplication with Read-Once Branching Programs.

Stephen Ponzio

SIAM J. Comput., 1998

The Combinatorics of Effective Resistances and Resistive Inverses.

Stephen Ponzio

Inf. Comput., 1998

1995

Restricted branching programs and hardware verification.

Stephen Ponzio

PhD thesis, 1995

1992

Semisynchrony and Real-Time (Extended Abstract).

Stephen Ponzio, Ray Strong

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

Bounds on the time to detect failures using bounded-capacity message links.

Stephen Ponzio

Proceedings of the Real-Time Systems Symposium, 1992

1991

Consensus in the Presence of Timing Uncertainty: Omission and Byzantine Failures (Extended Abstract).

Stephen Ponzio

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991