James E. Burns

According to our database, James E. Burns authored at least 21 papers between 1978 and 2003.

Collaborative distances:

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

2003

Path selection and bandwidth allocation in MPLS networks.

James E. Burns, Teunis J. Ott, Anthony E. Krzesinski, Karen E. Müller

Perform. Evaluation, 2003

2000

Almost Optimal Single Reader, Single Writer Atomic Register.

Prasad Jayanti, James E. Burns, Gary L. Peterson

J. Parallel Distributed Comput., 2000

1995

Causal Memory: Definitions, Implementation, and Programming.

Mustaque Ahamad, Gil Neiger, James E. Burns, Prince Kohli, Phillip W. Hutto

Distributed Comput., 1995

1994

Fast and Simple Distributed Consensus.

James E. Burns, Gil Neiger

Distributed Comput., 1994

1993

Bounds on Shared Memory for Mutual Exclusion

James E. Burns, Nancy A. Lynch

Inf. Comput., December, 1993

Stabilization and Pseudo-Stabilization.

James E. Burns, Mohamed G. Gouda, Raymond E. Miller

Distributed Comput., 1993

Generalized Agreement Between Concurrent Fail-Stop Processes.

James E. Burns, Rolando I. Cruz, Michael C. Loui

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

Protocols for Collecting Responses in Multi-Hop Radio Networks.

Chungki Lee, James E. Burns, Mostafa H. Ammar

Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

Improved randomized broadcast protocols in multi-hop radio networks.

Chungki Lee, James E. Burns, Mostafa H. Ammar

Proceedings of the 1993 International Conference on Network Protocols, 1993

1991

Causal Memory.

Mustaque Ahamad, James E. Burns, Phillip W. Hutto, Gil Neiger

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

1989

Distributed FIFO Allocation of Identical Resources Using Small Shared Space.

Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin

ACM Trans. Program. Lang. Syst., 1989

Uniform Self-Stabilizing Rings.

James E. Burns, Jan K. Pachl

ACM Trans. Program. Lang. Syst., 1989

The maximum independent set problem for cubic planar graphs.

James E. Burns

Networks, 1989

The Ambiguity of Choosing.

James E. Burns, Gary L. Peterson

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1987

Two Complementary Course Sequences on the Design and Implementation of Software Products.

James E. Burns, Edward L. Robertson

IEEE Trans. Software Eng., 1987

Constructing Multi-reader Atomic Values From Non-atomic Values.

James E. Burns, Gary L. Peterson

Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

Concurrent Reading While Writing II: The Multi-writer Case

Gary L. Peterson, James E. Burns

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

1982

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

James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson

J. ACM, 1982

1981

Symmetry in Systems of Asynchronous Processes

James E. Burns

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1979

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

Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin

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

1978

Mutual exclusion with linear waiting using binary shared variables.

James E. Burns

SIGACT News, 1978