default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan K. Pachl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2002
[j16]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): 57-66 (2002)- 1997
- [j15]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
- [j14]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): 399-425 (1994) - [j13]Jan K. Pachl:
A Proof of Protocol Correctness. RAIRO Theor. Informatics Appl. 28(3-4): 213-220 (1994) - 1993
- [j12]Sanjay R. Radia, Jan K. Pachl:
The per-process view of naming and remote execution. IEEE Parallel Distributed Technol. Syst. Appl. 1(3): 71-80 (1993) - 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) - 1991
- [j9]Jan K. Pachl:
Analysis of Toggle Protocols. Distributed Comput. 5: 25-35 (1991) - 1989
- [j8]Karel Culík 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]Jan K. Pachl:
Two Livelock-Free Protocols for Slotted Rings. Comput. J. 31(5): 474-476 (1988) - 1987
- [j5]Jan K. Pachl, Liam Casey:
A Robust Ring Transmission Protocol. Comput. Networks 13: 313-321 (1987) - [j4]Jan K. Pachl:
A Lower Bound for Probabilistic Distributed Algorithms. J. Algorithms 8(1): 53-65 (1987) - 1984
- [j3]Jan K. Pachl, Ephraim Korach, Doron Rotem:
Lower Bounds for Distributed Maximum-Finding Algorithms. J. ACM 31(4): 905-918 (1984) - [j2]Jan K. Pachl:
Finding Pseudoperipheral Nodes in Graphs. J. Comput. Syst. Sci. 29(1): 48-53 (1984) - 1981
- [j1]Karel Culík II, Jan K. Pachl:
Equivalence Problems for Mappings on Infinite Strings. Inf. Control. 49(1): 52-63 (1981)
Conference and Workshop Papers
- 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
- [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 - 1990
- [c6]Jan K. Pachl:
A notation for specifying test selection criteria. PSTV 1990: 71-84 - 1988
- [c5]James E. Burns, Jan K. Pachl:
Uniform Self-Stabilizing Rings. AWOC 1988: 391-400 - 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 - 1982
- [c2]Karel Culík 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
Editorship
- 1991
- [e1]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 [contents]
Informal and Other Publications
- 2003
- [i2]Jan K. Pachl:
Reachability problems for communicating finite state machines. CoRR cs.LO/0306121 (2003) - 1999
- [i1]Jan K. Pachl, Shmuel Zaks:
Computation in an algebra of test selection criteria. CoRR cs.SE/9912018 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
