BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
2 × USA
Collaborated with:
C.Dwork J.Aspnes M.Herlihy Y.Azar A.Fiat S.A.Plotkin
Talks about:
timestamp (2) algorithm (2) concurr (2) bound (2) comprehens (1) distribut (1) competit (1) virtual (1) schedul (1) modular (1)

Person: Orli Waarts

DBLP DBLP: Waarts:Orli

Contributed to:

STOC 19961996
STOC 19931993
STOC 19921992

Wrote 4 papers:

STOC-1996-AspnesW #algorithm #composition #distributed
Modular Competitiveness for Distributed Algorithms (JA, OW), pp. 237–246.
STOC-1993-AspnesAFPW #online #scheduling
On-line load balancing with applications to machine scheduling and virtual circuit routing (JA, YA, AF, SAP, OW), pp. 623–631.
STOC-1993-DworkHW #algorithm #memory management
Contention in shared memory algorithms (CD, MH, OW), pp. 174–183.
STOC-1992-DworkW #bound #concurrent #exclamation #performance
Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! (CD, OW), pp. 655–666.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.