Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jan K. Pachl
2000 – 2009
- 2003
[i2]Jan K. Pachl: Reachability problems for communicating finite state machines. CoRR cs.LO/0306121 (2003)- 2002
- [j15]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 Computing 15(1): 57-66 (2002)
1990 – 1999
- 1999
- [i1]Jan K. Pachl, Shmuel Zaks: Computation in an algebra of test selection criteria. CoRR cs.SE/9912018 (1999)
- 1997
- [j14]Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl: Wang Tilings and Distributed Verification on Anonymous Torus Networks. Theory Comput. Syst. 30(2): 145-163 (1997)
- 1994
- [j13]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 Systems Journal 33(3): 399-425 (1994)
- [j12]
- 1993
- [c12]Michael A. Bauer, Patrick J. Finnigan, James W. Hong, Jan K. Pachl, Toby J. Teorey: An integrated distributed systems management architecture. CASCON 1993: 27-40
- [c11]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: 621-636
- [c10]Sanjay R. Radia, Jan K. Pachl: Coherence in Naming in Distributed Computing Environments. ICDCS 1993: 83-92
- [c9]Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl: Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract). WDAG 1993: 264-278
- 1992
- [j11]Jan K. Pachl: A Simple Proof of a Completeness Result for leads-to in the UNITY Logic. Inf. Process. Lett. 41(1): 35-38 (1992)
- [j10]Jan K. Pachl: Corrigendum: A Simple Proof of a Completeness Result for Leads-To in the UNITY Logic. Inf. Process. Lett. 44(3): 171 (1992)
- [c8]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: 189-201
- [c7]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: 339-350
- 1991
- [j9]
- [e1]Ann Gawman, Jan K. Pachl, Jacob Slonim, Anne Stilman (Eds.): Proceedings of the 1991 Conference of the Centre for Advanced Studies on Collaborative Research, October 28-30, 1991, Toronto, Ontario, Canada. IBM 1991
- 1990
- [c6]
1980 – 1989
- 1989
- [j8]Karel Culik II, Jan K. Pachl, Sheng Yu: On the Limit Sets of Cellular Automata. SIAM J. Comput. 18(4): 831-842 (1989)
- [j7]James E. Burns, Jan K. Pachl: Uniform Self-Stabilizing Rings. ACM Trans. Program. Lang. Syst. 11(2): 330-344 (1989)
- 1988
- [j6]
- [c5]
- 1987
- [j5]
- [j4]Jan K. Pachl: A Lower Bound for Probabilistic Distributed Algorithms. J. Algorithms 8(1): 53-65 (1987)
- [c4]Jan K. Pachl: Protocol Description and Analysis Based on a State Transition Model with Channel Expressions. PSTV 1987: 207-219
- [c3]Violet R. Syrotiuk, Jan K. Pachl: A Distributed Ring Orientation Algorithm (Preliminary Version). WDAG 1987: 332-336
- 1984
- [j3]Jan K. Pachl, Ephraim Korach, Doron Rotem: Lower Bounds for Distributed Maximum-Finding Algorithms. J. ACM 31(4): 905-918 (1984)
- [j2]
- 1982
- [c2]Karel Culik II, Jan K. Pachl: Folding and Unrolling Systolic Arrays (Preliminary Version). PODC 1982: 254-261
- [c1]Jan K. Pachl, Ephraim Korach, Doron Rotem: A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms. STOC 1982: 378-382
- 1981
- [j1]Karel Culik II, Jan K. Pachl: Equivalence Problems for Mappings on Infinite Strings. Information and Control 49(1): 52-63 (1981)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:43 CET by the dblp team