Jan K. Pachl

31 papers A* 2A 1Journal 18Unranked 9
YearRankTypeTitle / Venue / Authors
2003 J jnl
Reachability problems for communicating finite state machines
CoRR
Jan K. Pachl
2002 J jnl
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy.
Distributed Comput.
Stephen A. Cook, Jan K. Pachl, Irwin S. Pressman
1999 J jnl
Computation in an algebra of test selection criteria
CoRR
Jan K. Pachl, Shmuel Zaks
1997 J jnl
Wang Tilings and Distributed Verification on Anonymous Torus Networks.
Theory Comput. Syst.
Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl
1994 J jnl
A Distributed System Architecture for a Distributed Application Environment.
IBM Syst. J.
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
1994 J jnl
A Proof of Protocol Correctness.
RAIRO Theor. Informatics Appl.
Jan K. Pachl
1993 — conf
An integrated distributed systems management architecture.
CASCON
Michael A. Bauer, Patrick J. Finnigan, James W. Hong, Jan K. Pachl, Toby J. Teorey
1993 A conf
Coherence in Naming in Distributed Computing Environments.
ICDCS
Sanjay R. Radia, Jan K. Pachl
1993 — conf
Operation jump start: a CORDS integration prototype using DCE.
CASCON
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
1993 J jnl
The per-process view of naming and remote execution.
IEEE Parallel Distributed Technol. Syst. Appl.
Sanjay R. Radia, Jan K. Pachl
1993 — conf
Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract).
WDAG
Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl
1992 J jnl
A Simple Proof of a Completeness Result for leads-to in the UNITY Logic.
Inf. Process. Lett.
Jan K. Pachl
1992 J jnl
Corrigendum: A Simple Proof of a Completeness Result for Leads-To in the UNITY Logic.
Inf. Process. Lett.
Jan K. Pachl
1992 — conf
Directory requirements for a multidatabase service.
CASCON
T. Patrick Martin, Michael A. Bauer, Neil Coburn, Per-Åke Larson, Gerald Neufeld, Jan K. Pachl, Jacob Slonim
1992 — conf
The optimal placement of replicas in a network using a read any - write all policy.
CASCON
Irwin S. Pressman, Stephen A. Cook, Jan K. Pachl
1991 J jnl
Analysis of Toggle Protocols.
Distributed Comput.
Jan K. Pachl
1991 — ed.
Proceedings of the 1991 Conference of the Centre for Advanced Studies on Collaborative Research, October 28-30, 1991, Toronto, Ontario, Canada
CASCON
Ann Gawman, Jan K. Pachl, Jacob Slonim, Anne Stilman
1990 — conf
A notation for specifying test selection criteria.
PSTV
Jan K. Pachl
1989 J jnl
On the Limit Sets of Cellular Automata.
SIAM J. Comput.
Karel Culík II, Jan K. Pachl, Sheng Yu
1989 J jnl
Uniform Self-Stabilizing Rings.
ACM Trans. Program. Lang. Syst.
James E. Burns, Jan K. Pachl
1988 J jnl
Two Livelock-Free Protocols for Slotted Rings.
Comput. J.
Jan K. Pachl
1988 — conf
Uniform Self-Stabilizing Rings.
AWOC
James E. Burns, Jan K. Pachl
1987 — conf
A Distributed Ring Orientation Algorithm (Preliminary Version).
WDAG
Violet R. Syrotiuk, Jan K. Pachl
1987 J jnl
A Lower Bound for Probabilistic Distributed Algorithms.
J. Algorithms
Jan K. Pachl
1987 J jnl
A Robust Ring Transmission Protocol.
Comput. Networks
Jan K. Pachl, Liam Casey
1987 — conf
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions.
PSTV
Jan K. Pachl
1984 J jnl
Finding Pseudoperipheral Nodes in Graphs.
J. Comput. Syst. Sci.
Jan K. Pachl
1984 J jnl
Lower Bounds for Distributed Maximum-Finding Algorithms.
J. ACM
Jan K. Pachl, Ephraim Korach, Doron Rotem
1982 A* conf
A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms
STOC
Jan K. Pachl, Ephraim Korach, Doron Rotem
1982 A* conf
Folding and Unrolling Systolic Arrays (Preliminary Version).
PODC
Karel Culík II, Jan K. Pachl
1981 J jnl
Equivalence Problems for Mappings on Infinite Strings
Inf. Control.
Karel Culík II, Jan K. Pachl