Jan K. Pachl

Publication Activity (10 Years)

Years Active: 1981-2003
Publications (10 Years): 0

Publications

Jan K. Pachl
Reachability problems for communicating finite state machines CoRR (2003)
Stephen A. Cook, Jan K. Pachl, Irwin S. Pressman
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy. Distributed Comput. 15 (1) (2002)
Jan K. Pachl, Shmuel Zaks
Computation in an algebra of test selection criteria CoRR (1999)
Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl
Wang Tilings and Distributed Verification on Anonymous Torus Networks. Theory Comput. Syst. 30 (2) (1997)
Jan K. Pachl
A Proof of Protocol Correctness. RAIRO Theor. Informatics Appl. 28 (3-4) (1994)
Michael A. Bauer, Neil Coburn, Doreen L. Erickson, Patrick J. Finnigan, James W. Hong, Per-Åke Larson, Jan K. Pachl, Jacob Slonim, David J. Taylor, Toby J. Teorey
A Distributed System Architecture for a Distributed Application Environment. IBM Syst. J. 33 (3) (1994)
Michael A. Bauer, Patrick J. Finnigan, James W. Hong, Jan K. Pachl, Toby J. Teorey
An integrated distributed systems management architecture. CASCON (1993)
Sanjay R. Radia, Jan K. Pachl
Coherence in Naming in Distributed Computing Environments. ICDCS (1993)
Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl
Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract). WDAG (1993)
Gopi K. Attaluri, Dexter P. Bradshaw, Patrick J. Finnigan, Nigel Hinds, Michael H. Kalantar, Kelly A. Lyons, Andrew D. Marshall, Jan K. Pachl, Hong Tran
Operation jump start: a CORDS integration prototype using DCE. CASCON (1993)
Sanjay R. Radia, Jan K. Pachl
The per-process view of naming and remote execution. IEEE Parallel Distributed Technol. Syst. Appl. 1 (3) (1993)
Jan K. Pachl
Corrigendum: A Simple Proof of a Completeness Result for Leads-To in the UNITY Logic. Inf. Process. Lett. 44 (3) (1992)
Jan K. Pachl
A Simple Proof of a Completeness Result for leads-to in the UNITY Logic. Inf. Process. Lett. 41 (1) (1992)
T. Patrick Martin, Michael A. Bauer, Neil Coburn, Per-Åke Larson, Gerald Neufeld, Jan K. Pachl, Jacob Slonim
Directory requirements for a multidatabase service. CASCON (1992)
Irwin S. Pressman, Stephen A. Cook, Jan K. Pachl
The optimal placement of replicas in a network using a read any - write all policy. CASCON (1992)
Jan K. Pachl
Analysis of Toggle Protocols. Distributed Comput. 5 (1991)
Jan K. Pachl
A notation for specifying test selection criteria. PSTV (1990)
Karel Culík II, Jan K. Pachl, Sheng Yu
On the Limit Sets of Cellular Automata. SIAM J. Comput. 18 (4) (1989)
James E. Burns, Jan K. Pachl
Uniform Self-Stabilizing Rings. ACM Trans. Program. Lang. Syst. 11 (2) (1989)
James E. Burns, Jan K. Pachl
Uniform Self-Stabilizing Rings. AWOC (1988)
Jan K. Pachl
Two Livelock-Free Protocols for Slotted Rings. Comput. J. 31 (5) (1988)
Jan K. Pachl
A Lower Bound for Probabilistic Distributed Algorithms. J. Algorithms 8 (1) (1987)
Violet R. Syrotiuk, Jan K. Pachl
A Distributed Ring Orientation Algorithm (Preliminary Version). WDAG (1987)
Jan K. Pachl, Liam Casey
A Robust Ring Transmission Protocol. Comput. Networks 13 (1987)
Jan K. Pachl
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions. PSTV (1987)
Jan K. Pachl
Finding Pseudoperipheral Nodes in Graphs. J. Comput. Syst. Sci. 29 (1) (1984)
Jan K. Pachl, Ephraim Korach, Doron Rotem
Lower Bounds for Distributed Maximum-Finding Algorithms. J. ACM 31 (4) (1984)
Jan K. Pachl, Ephraim Korach, Doron Rotem
A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms STOC (1982)
Karel Culík II, Jan K. Pachl
Folding and Unrolling Systolic Arrays (Preliminary Version). PODC (1982)
Karel Culík II, Jan K. Pachl
Equivalence Problems for Mappings on Infinite Strings Inf. Control. 49 (1) (1981)