Authors:
COLBROOK A
BREWER EA
DELLAROCAS CN
WEIHL WE
Citation: A. Colbrook et al., ALGORITHMS FOR SEARCH-TREES ON MESSAGE-PASSING ARCHITECTURES, IEEE transactions on parallel and distributed systems, 7(2), 1996, pp. 97-108
Citation: P. Wang et We. Weihl, SCALABLE CONCURRENT B-TREES USING MULTIVERSION MEMORY, Journal of parallel and distributed computing, 32(1), 1996, pp. 28-48
Authors:
WALLACH DA
HSIEH WC
JOHNSON KL
KAASHOEK MF
WEIHL WE
Citation: Da. Wallach et al., OPTIMISTIC ACTIVE MESSAGES - A MECHANISM FOR SCHEDULING COMMUNICATIONWITH COMPUTATION, ACM SIGPLAN NOTICES, 30(8), 1995, pp. 217-226
Citation: G. Varghese et al., DERIVING GLOBAL VIRTUAL TIME ALGORITHMS FROM CONSERVATIVE SIMULATION PROTOCOLS, Information processing letters, 54(2), 1995, pp. 121-126
Citation: Gt. Leavens et We. Weihl, SPECIFICATION AND VERIFICATION OF OBJECT-ORIENTED PROGRAMS USING SUPERTYPE ABSTRACTION, Acta informatica, 32(8), 1995, pp. 705-778