Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Weihl, William E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic coscheduling on workstation clusters
Patrick G. Sobalvarro
,
Scott Pakin
,
William E. Weihl
,
Andrew A. Chien
Lecture Notes in Computer Science
1459
, 1998, pp. 231-256
Algorithms for search trees on message-passing architectures
Adrian Colbrook
,
Eric A. Brewer
,
Chrysanthos N. Dellarocas
,
William E. Weihl
IEEE Transactions on Parallel and Distributed Systems
7
(2), 1996, pp. 97-108
Scalable concurrent B-trees using multi-version memory
Paul Wang
,
William E. Weihl
Journal Parallel Distributed Computing
32
(1), 1996, pp. 28-48
Hybrid atomicity for nested transactions
Alan Fekete
,
Nancy Lynch
,
William E. Weihl
Theoretical Computer Science
149
(1), 1995, pp. 151-178
Specification and verification of object-oriented programs using supertype abstraction
Gary T. Leavens
,
William E. Weihl
Acta Informatica
32
, 1995, pp. 705-778
Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors
Patrick G. Sobalvarro
,
William E. Weihl
Lecture Notes in Computer Science
949
, 1995, pp. 106-126
Deriving global virtual time algorithms from conservative simulation protocols
George Varghese
,
Roger Chamberlain
,
William E. Weihl
Information Processing Letters
54
, 1995, pp. 121-126
The impact of recovery on concurrency control
William E. Weihl
Journal of Computer and System Sciences
47
(1), 1993, pp. 157-184
Hybrid concurrency control for abstract data types
Maurice P. Herlihy
,
William E. Weihl
Journal of Computer and System Sciences
43
, 1991, pp. 25-61
An evaluation of concurrent priority queue algorithms
Qin Huang
,
William E. Weihl
Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, SPDP'91 (Dallas, Texas, December 2-5, 1991)
, 1991, pp. 518-525