AAAAAA
Results: 26-50/89
Authors:
PELEG D
WOOL A
Citation: D. Peleg et A. Wool, CRUMBLING WALLS - A CLASS OF PRACTICAL AND EFFICIENT QUORUM SYSTEMS, Distributed computing, 10(2), 1997, pp. 87-97
Authors:
SHAVIT N
TOUITOU D
Citation: N. Shavit et D. Touitou, SOFTWARE TRANSACTIONAL MEMORY, Distributed computing, 10(2), 1997, pp. 99-116
Authors:
BRUNEKREEF J
KATOEN JP
KOYMANS R
MAUW S
Citation: J. Brunekreef et al., DESIGN AND ANALYSIS OF DYNAMIC LEADER ELECTION PROTOCOLS IN BROADCASTNETWORKS, Distributed computing, 9(4), 1996, pp. 157-171
Authors:
CHARRONBOST B
MATTERN F
TEL G
Citation: B. Charronbost et al., SYNCHRONOUS, ASYNCHRONOUS, AND CAUSALLY ORDERED COMMUNICATION, Distributed computing, 9(4), 1996, pp. 173-191
Authors:
HERLIHY M
SHAVIT N
WAARTS O
Citation: M. Herlihy et al., LINEARIZABLE COUNTING NETWORKS, Distributed computing, 9(4), 1996, pp. 193-203
Authors:
ALUR R
TAUBENFELD G
Citation: R. Alur et G. Taubenfeld, FAST TIMING-BASED ALGORITHMS, Distributed computing, 10(1), 1996, pp. 1-10
Authors:
CRITCHLOW C
TAYLOR K
Citation: C. Critchlow et K. Taylor, THE INHIBITION SPECTRUM AND THE ACHIEVEMENT OF CAUSAL CONSISTENCY, Distributed computing, 10(1), 1996, pp. 11-27
Authors:
KANT C
HIGASHINO T
VONBOCHMANN G
Citation: C. Kant et al., DERIVING PROTOCOL SPECIFICATIONS FROM SERVICE SPECIFICATIONS WRITTEN IN LOTOS, Distributed computing, 10(1), 1996, pp. 29-47
Authors:
ORDA A
ROM R
Citation: A. Orda et R. Rom, DISTRIBUTED SHORTEST-PATH PROTOCOLS FOR TIME-DEPENDENT NETWORKS, Distributed computing, 10(1), 1996, pp. 49-62
Authors:
CHAUDHURI S
COAN BA
WELCH JL
Citation: S. Chaudhuri et al., USING ADAPTIVE TIMEOUTS TO ACHIEVE AT-MOST-ONCE MESSAGE DELIVERY, Distributed computing, 9(3), 1995, pp. 109-117
Authors:
FRIEDMAN R
Citation: R. Friedman, IMPLEMENTING HYBRID CONSISTENCY WITH HIGH-LEVEL SYNCHRONIZATION OPERATIONS, Distributed computing, 9(3), 1995, pp. 119-129
Authors:
GONG L
Citation: L. Gong, EFFICIENT NETWORK AUTHENTICATION PROTOCOLS - LOWER BOUNDS AND OPTIMALIMPLEMENTATIONS, Distributed computing, 9(3), 1995, pp. 131-145
Authors:
SAYEED HM
ABUAMARA M
ABUAMARA H
Citation: Hm. Sayeed et al., OPTIMAL ASYNCHRONOUS AGREEMENT AND LEADER ELECTION ALGORITHM FOR COMPLETE NETWORKS WITH BYZANTINE FAULTY LINKS, Distributed computing, 9(3), 1995, pp. 147-156
Authors:
CELIKKAN U
CLEAVELAND R
Citation: U. Celikkan et R. Cleaveland, GENERATING DIAGNOSTIC INFORMATION FOR BEHAVIORAL PREORDERS, Distributed computing, 9(2), 1995, pp. 61-75
Authors:
TAY YC
LOKE WT
Citation: Yc. Tay et Wt. Loke, ON DEADLOCKS OF EXCLUSIVE AND-REQUESTS FOR RESOURCES, Distributed computing, 9(2), 1995, pp. 77-94
Authors:
ZAMSKY A
ISRAELI A
PINTER SS
Citation: A. Zamsky et al., OPTIMAL TIME BYZANTINE AGREEMENT FOR T-LESS-THAN-N 8 WITH LINEAR-MESSAGES/, Distributed computing, 9(2), 1995, pp. 95-108
Authors:
BENAROYA I
EILAM T
SCHUSTER A
Citation: I. Benaroya et al., GREEDY HOT-POTATO ROUTING ON THE 2-DIMENSIONAL MESH, Distributed computing, 9(1), 1995, pp. 3-19
Authors:
HESSELINK WH
Citation: Wh. Hesselink, WAIT-FREE LINEARIZATION WITH A MECHANICAL PROOF, Distributed computing, 9(1), 1995, pp. 21-36
Authors:
AHAMAD M
NEIGER G
BURNS JE
KOHLI P
HUTTO PW
Citation: M. Ahamad et al., CAUSAL MEMORY - DEFINITIONS, IMPLEMENTATION, AND PROGRAMMING, Distributed computing, 9(1), 1995, pp. 37-49
Authors:
YANG JH
ANDERSON JH
Citation: Jh. Yang et Jh. Anderson, A FAST, SCALABLE MUTUAL EXCLUSION ALGORITHM, Distributed computing, 9(1), 1995, pp. 51-60
Authors:
AHARONSON E
ATTIYA H
Citation: E. Aharonson et H. Attiya, COUNTING NETWORKS WITH ARBITRARY FAN-OUT, Distributed computing, 8(4), 1995, pp. 163-169
Authors:
BALDONI R
CICIANI B
Citation: R. Baldoni et B. Ciciani, A CLASS OF HIGH-PERFORMANCE MAEKAWA-TYPE ALGORITHMS FOR DISTRIBUTED SYSTEMS UNDER HEAVY DEMAND, Distributed computing, 8(4), 1995, pp. 171-180
Authors:
BOUKERCHE A
TROPPER C
Citation: A. Boukerche et C. Tropper, PARALLEL SIMULATION ON THE HYPERCUBE MULTIPROCESSOR, Distributed computing, 8(4), 1995, pp. 181-190
Authors:
IBARAKI T
NAGAMOCHI H
KAMEDA T
Citation: T. Ibaraki et al., OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS, Distributed computing, 8(4), 1995, pp. 191-201
Authors:
LUBITCH R
MORAN S
Citation: R. Lubitch et S. Moran, CLOSED SCHEDULERS - A NOVEL TECHNIQUE FOR ANALYZING ASYNCHRONOUS PROTOCOLS, Distributed computing, 8(4), 1995, pp. 203-210