The following pages link to Orli Waarts (Q202106):
Displaying 28 items.
- Improved Algorithms and Analysis for Secretary Problems and Generalizations (Q2706186) (← links)
- A Characterization of Eventual Byzantine Agreement (Q2784483) (← links)
- On-Line Load Balancing of Temporary Tasks (Q3125220) (← links)
- (Q3128891) (← links)
- Simple and efficient bounded concurrent timestamping and the traceable use abstraction (Q3158553) (← links)
- Perfectly secure message transmission (Q4033834) (← links)
- Contention in shared memory algorithms (Q4208874) (← links)
- Performing Work Efficiently in the Presence of Faults (Q4210118) (← links)
- Fairness in Scheduling (Q4225867) (← links)
- (Q4228476) (← links)
- (Q4230335) (← links)
- (Q4252724) (← links)
- (Q4252732) (← links)
- (Q4252747) (← links)
- Time-Lapse Snapshots (Q4268845) (← links)
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time (Q4304063) (← links)
- On-line routing of virtual circuits with applications to load balancing and machine scheduling (Q4376979) (← links)
- Compositional competitiveness for distributed algorithms (Q4652408) (← links)
- (Q4704801) (← links)
- Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor (Q4714556) (← links)
- (Q4875219) (← links)
- (Q4886081) (← links)
- Online load balancing of temporary tasks (Q5060106) (← links)
- Linearizable counting networks (Q5137016) (← links)
- Contention in shared memory algorithms (Q5248484) (← links)
- On-line load balancing with applications to machine scheduling and virtual circuit routing (Q5248533) (← links)
- Performing work efficiently in the presence of faults (Q5348838) (← links)
- Competitive routing of virtual circuits with unknown duration (Q5943097) (← links)
