AAAAAA

   
Results: 1-25 | 26-50 | 51-75 | 76-89

Table of contents of journal: *Distributed computing

Results: 1-25/89
CAUSALITY AND ATOMICITY IN DISTRIBUTED COMPUTATIONS
Authors: KSHEMKALYANI AD
Citation: Ad. Kshemkalyani, CAUSALITY AND ATOMICITY IN DISTRIBUTED COMPUTATIONS, Distributed computing, 11(4), 1998, pp. 169-189
DETECTION OF GLOBAL PREDICATES - TECHNIQUES AND THEIR LIMITATIONS
Authors: CHASE CM GARG VK
Citation: Cm. Chase et Vk. Garg, DETECTION OF GLOBAL PREDICATES - TECHNIQUES AND THEIR LIMITATIONS, Distributed computing, 11(4), 1998, pp. 191-201
BYZANTINE QUORUM SYSTEMS
Authors: MALKHI D REITER M
Citation: D. Malkhi et M. Reiter, BYZANTINE QUORUM SYSTEMS, Distributed computing, 11(4), 1998, pp. 203-213
RANDOMIZED NAMING USING WAIT-FREE SHARED VARIABLES
Authors: PANCONESI A PAPATRIANTAFILOU M TSIGAS P VITANYI P
Citation: A. Panconesi et al., RANDOMIZED NAMING USING WAIT-FREE SHARED VARIABLES, Distributed computing, 11(3), 1998, pp. 113-124
MODEL CHECKING FOR A PROBABILISTIC BRANCHING TIME LOGIC WITH FAIRNESS
Authors: BAIER C KWIATKOWSKA M
Citation: C. Baier et M. Kwiatkowska, MODEL CHECKING FOR A PROBABILISTIC BRANCHING TIME LOGIC WITH FAIRNESS, Distributed computing, 11(3), 1998, pp. 125-155
A MODULAR ALGORITHM FOR RESOURCE-ALLOCATION
Authors: RHEE I
Citation: I. Rhee, A MODULAR ALGORITHM FOR RESOURCE-ALLOCATION, Distributed computing, 11(3), 1998, pp. 157-168
EFFICIENT DETECTION OF DISCREPANCIES IN MULTIPLE FILE COPIES
Authors: ABDELGHAFFAR KAS ELABBADI A
Citation: Kas. Abdelghaffar et A. Elabbadi, EFFICIENT DETECTION OF DISCREPANCIES IN MULTIPLE FILE COPIES, Distributed computing, 11(2), 1998, pp. 59-72
A LOGICAL APPROACH TO MULTILEVEL SECURITY OF PROBABILISTIC SYSTEMS
Authors: GRAY JW SYVERSON PF
Citation: Jw. Gray et Pf. Syverson, A LOGICAL APPROACH TO MULTILEVEL SECURITY OF PROBABILISTIC SYSTEMS, Distributed computing, 11(2), 1998, pp. 73-90
NECESSARY AND SUFFICIENT CONDITIONS ON INFORMATION FOR CAUSAL MESSAGEORDERING AND THEIR OPTIMAL IMPLEMENTATION
Authors: KSHEMKALYANI AD SINGHAL M
Citation: Ad. Kshemkalyani et M. Singhal, NECESSARY AND SUFFICIENT CONDITIONS ON INFORMATION FOR CAUSAL MESSAGEORDERING AND THEIR OPTIMAL IMPLEMENTATION, Distributed computing, 11(2), 1998, pp. 91-111
USING LOCAL-SPIN KAPPA-EXCLUSION ALGORITHMS TO IMPROVE WAIT-FREE OBJECT IMPLEMENTATIONS
Authors: ANDERSON JH MOIR M
Citation: Jh. Anderson et M. Moir, USING LOCAL-SPIN KAPPA-EXCLUSION ALGORITHMS TO IMPROVE WAIT-FREE OBJECT IMPLEMENTATIONS, Distributed computing, 11(1), 1997, pp. 1-20
VECTOR TIME AND CAUSALITY AMONG ABSTRACT EVENTS IN DISTRIBUTED COMPUTATIONS
Authors: BASTEN T KUNZ T BLACK JP COFFIN MH TAYLOR DJ
Citation: T. Basten et al., VECTOR TIME AND CAUSALITY AMONG ABSTRACT EVENTS IN DISTRIBUTED COMPUTATIONS, Distributed computing, 11(1), 1997, pp. 21-39
THE LEVEL OF HANDSHAKE REQUIRED FOR MANAGING A CONNECTION
Authors: ATTIYA H RAPPOPORT R
Citation: H. Attiya et R. Rappoport, THE LEVEL OF HANDSHAKE REQUIRED FOR MANAGING A CONNECTION, Distributed computing, 11(1), 1997, pp. 41-57
A SELF-STABILIZING ALGORITHM FOR THE MAXIMUM FLOW PROBLEM
Authors: GHOSH S GUPTA A PEMMARAJU SV
Citation: S. Ghosh et al., A SELF-STABILIZING ALGORITHM FOR THE MAXIMUM FLOW PROBLEM, Distributed computing, 10(4), 1997, pp. 167-180
SELF-STABILIZING TOKEN CIRCULATION IN UNIFORM NETWORKS
Authors: HUANG ST WUU LC
Citation: St. Huang et Lc. Wuu, SELF-STABILIZING TOKEN CIRCULATION IN UNIFORM NETWORKS, Distributed computing, 10(4), 1997, pp. 181-187
CONSTANT-TIME PER EDGE IS OPTIMAL ON ROOTED TREE NETWORKS
Authors: MITZENMACHER M
Citation: M. Mitzenmacher, CONSTANT-TIME PER EDGE IS OPTIMAL ON ROOTED TREE NETWORKS, Distributed computing, 10(4), 1997, pp. 189-197
EARLY CONSENSUS IN AN ASYNCHRONOUS SYSTEM WITH A WEAK FAILURE DETECTOR (VOL 10, PG 149, 1997)
Authors: SCHIPER A
Citation: A. Schiper, EARLY CONSENSUS IN AN ASYNCHRONOUS SYSTEM WITH A WEAK FAILURE DETECTOR (VOL 10, PG 149, 1997), Distributed computing, 10(4), 1997, pp. 198-198
KNOWLEDGE-BASED PROGRAMS
Authors: FAGIN R HALPERN JY MOSES Y VARDI MY
Citation: R. Fagin et al., KNOWLEDGE-BASED PROGRAMS, Distributed computing, 10(4), 1997, pp. 199-225
ON THE USE OF REGISTERS IN ACHIEVING WAIT-FREE CONSENSUS
Authors: BAZZI RA NEIGER G PETERSON GL
Citation: Ra. Bazzi et al., ON THE USE OF REGISTERS IN ACHIEVING WAIT-FREE CONSENSUS, Distributed computing, 10(3), 1997, pp. 117-127
LOWER BOUNDS FOR THE BROADCAST PROBLEM IN MOBILE RADIO NETWORKS
Authors: BRUSCHI D DELPINTO M
Citation: D. Bruschi et M. Delpinto, LOWER BOUNDS FOR THE BROADCAST PROBLEM IN MOBILE RADIO NETWORKS, Distributed computing, 10(3), 1997, pp. 129-135
KEEPING TRACK OF THE LATEST GOSSIP IN A DISTRIBUTED SYSTEM
Authors: MUKUND M SOHONI M
Citation: M. Mukund et M. Sohoni, KEEPING TRACK OF THE LATEST GOSSIP IN A DISTRIBUTED SYSTEM, Distributed computing, 10(3), 1997, pp. 137-148
EARLY CONSENSUS IN AN ASYNCHRONOUS SYSTEM WITH A WEAK FAILURE DETECTOR
Authors: SCHIPER A
Citation: A. Schiper, EARLY CONSENSUS IN AN ASYNCHRONOUS SYSTEM WITH A WEAK FAILURE DETECTOR, Distributed computing, 10(3), 1997, pp. 149-157
EFFICIENT LEADER ELECTION USING SENSE OF DIRECTION
Authors: SINGH G
Citation: G. Singh, EFFICIENT LEADER ELECTION USING SENSE OF DIRECTION, Distributed computing, 10(3), 1997, pp. 159-165
SPECIAL ISSUE - PRINCIPLES OF DISTRIBUTED COMPUTING - INTRODUCTION
Authors: HADZILACOS V
Citation: V. Hadzilacos, SPECIAL ISSUE - PRINCIPLES OF DISTRIBUTED COMPUTING - INTRODUCTION, Distributed computing, 10(2), 1997, pp. 63-63
UNIVERSAL ROUTING SCHEMES
Authors: FRAIGNIAUD P GAVOILLE C
Citation: P. Fraigniaud et C. Gavoille, UNIVERSAL ROUTING SCHEMES, Distributed computing, 10(2), 1997, pp. 65-78
COLLECTING CYCLIC DISTRIBUTED GARBAGE BY CONTROLLED MIGRATION
Authors: MAHESHWARI U LISKOV B
Citation: U. Maheshwari et B. Liskov, COLLECTING CYCLIC DISTRIBUTED GARBAGE BY CONTROLLED MIGRATION, Distributed computing, 10(2), 1997, pp. 79-86
Risultati: 1-25 | 26-50 | 51-75 | 76-89