Jan K. Pachl

	2003
30		Jan K. Pachl: Reachability problems for communicating finite state machines CoRR cs.LO/0306121: (2003)
	2002
29		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)
	1999
28		Jan K. Pachl, Shmuel Zaks: Computation in an algebra of test selection criteria CoRR cs.SE/9912018: (1999)
	1997
27		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
26		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)
25		Jan K. Pachl: A Proof of Protocol Correctness. ITA 28(3-4): 213-220 (1994)
	1993
24		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
23		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
22		Sanjay R. Radia, Jan K. Pachl: Coherence in Naming in Distributed Computing Environments. ICDCS 1993: 83-92
21		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
20		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
19		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
18		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)
17		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)
	1991
16		Ann Gawman, Jan K. Pachl, Jacob Slonim, Anne Stilman: Proceedings of the 1991 Conference of the Centre for Advanced Studies on Collaborative Research, October 28-30, 1991, Toronto, Ontario, Canada IBM 1991
15		Jan K. Pachl: Analysis of Toggle Protocols. Distributed Computing 5: 25-35 (1991)
	1990
14		Jan K. Pachl: A notation for specifying test selection criteria. PSTV 1990: 71-84
	1989
13		James E. Burns, Jan K. Pachl: Uniform Self-Stabilizing Rings. ACM Trans. Program. Lang. Syst. 11(2): 330-344 (1989)
12		Karel Culik II, Jan K. Pachl, Sheng Yu: On the Limit Sets of Cellular Automata. SIAM J. Comput. 18(4): 831-842 (1989)
	1988
11		James E. Burns, Jan K. Pachl: Uniform Self-Stabilizing Rings. AWOC 1988: 391-400
10		Jan K. Pachl: Two Livelock-Free Protocols for Slotted Rings. Comput. J. 31(5): 474-476 (1988)
	1987
9		Jan K. Pachl: Protocol Description and Analysis Based on a State Transition Model with Channel Expressions. PSTV 1987: 207-219
8		Violet R. Syrotiuk, Jan K. Pachl: A Distributed Ring Orientation Algorithm (Preliminary Version). WDAG 1987: 332-336
7		Jan K. Pachl, Liam Casey: A Robust Ring Transmission Protocol. Computer Networks 13: 313-321 (1987)
6		Jan K. Pachl: A Lower Bound for Probabilistic Distributed Algorithms. J. Algorithms 8(1): 53-65 (1987)
	1984
5		Jan K. Pachl, Ephraim Korach, Doron Rotem: Lower Bounds for Distributed Maximum-Finding Algorithms. J. ACM 31(4): 905-918 (1984)
4		Jan K. Pachl: Finding Pseudoperipheral Nodes in Graphs. J. Comput. Syst. Sci. 29(1): 48-53 (1984)
	1982
3		Karel Culik II, Jan K. Pachl: Folding and Unrolling Systolic Arrays (Preliminary Version). PODC 1982: 254-261
2		Jan K. Pachl, Ephraim Korach, Doron Rotem: A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms STOC 1982: 378-382
	1981
1		Karel Culik II, Jan K. Pachl: Equivalence Problems for Mappings on Infinite Strings Information and Control 49(1): 52-63 (1981)

Coauthor Index

1	Gopi K. Attaluri	[23]
2	Michael A. Bauer	[19] [24] [26]
3	Dexter P. Bradshaw	[23]
4	James E. Burns	[11] [13]
5	Liam Casey	[7]
6	Neil Coburn	[19] [26]
7	Charles J. Colbourn	[21] [27]
8	Stephen A. Cook	[20] [29]
9	Karel Culik II	[1] [3] [12]
10	Doreen L. Erickson	[26]
11	Patrick J. Finnigan	[23] [24] [26]
12	Ann Gawman	[16]
13	Nigel Hinds	[23]
14	James Won-Ki Hong (James W. Hong)	[24] [26]
15	Michael H. Kalantar	[23]
16	Ephraim Korach	[2] [5]
17	Per-Åke Larson (Paul Larson)	[19] [26]
18	Kelly A. Lyons	[23]
19	Andrew D. Marshall	[23]
20	Patrick Martin (T. Patrick Martin)	[19]
21	Gerald Neufeld	[19]
22	Irwin S. Pressman	[20] [29]
23	Sanjay R. Radia	[22]
24	Doron Rotem	[2] [5]
25	Jacob Slonim	[16] [19] [26]
26	Anne Stilman	[16]
27	Violet R. Syrotiuk	[8] [21] [27]
28	David J. Taylor	[26]
29	Toby J. Teorey	[24] [26]
30	Hong Tran	[23]
31	Sheng Yu	[12]
32	Shmuel Zaks	[28]

Colors in the list of coauthors