Skip to content

Orli Waarts

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

22

Venues

5

Active years

1988–1996

Best venue rank

A*

Where they publish

Papers

22 indexed papers, newest first.

YearVenueTitleAuthors
1996FOCSEfficient Information Gathering on the Internet (extended abstract).Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts
1996SODAError-Resilient DNA Computation.Richard M. Karp, Claire Kenyon, Orli Waarts
1996STOCModular Competitiveness for Distributed Algorithms.James Aspnes, Orli Waarts
1995FOCSImproved Algorithms and Analysis for Secretary Problems and Generalizations.Mikls Ajtai, Nimrod Megiddo, Orli Waarts
1995FOCSCompetitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).Amos Fiat, Yishay Mansour, Adi Rosn, Orli Waarts
1995FOCSThe Bit Vector Intersection Problem (Preliminary Version).Richard M. Karp, Orli Waarts, Geoffrey Zweig
1995PODCA Modular Measure of Competitiveness for Distributed Algorithms (Abstract).James Aspnes, Orli Waarts
1995SODAFairness in Scheduling.Mikls Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
1994FOCSA Theory of Competitive Analysis for Distributed AlgorithmsMikls Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
1994PODCCompetitiveness in Distributed Algorithms.Mikls Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
1994SODACompetitive Routing of Virtual Circuits with Unknown Duration.Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
1993PODCBounded Round Numbers.Cynthia Dwork, Maurice Herlihy, Orli Waarts
1993STOCOn-line load balancing with applications to machine scheduling and virtual circuit routing.James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
1993STOCContention in shared memory algorithms.Cynthia Dwork, Maurice Herlihy, Orli Waarts
1993WADSOnline Load Balancing of Temporary Tasks.Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
1992FOCSRandomized Consensus in Expected O(n log ^2 n) Operations Per ProcessorJames Aspnes, Orli Waarts
1992PODCPerforming Work Efficiently in the Presence of Faults.Cynthia Dwork, Joseph Y. Halpern, Orli Waarts
1992STOCSimple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible!Cynthia Dwork, Orli Waarts
1991FOCSLow Contention Linearizable CountingMaurice Herlihy, Nir Shavit, Orli Waarts
1990FOCSPerfectly Secure Message TransmissionDanny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung
1990PODCA Characterization of Eventual Byzantine Agreement.Joseph Y. Halpern, Yoram Moses, Orli Waarts
1988FOCSCoordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial TimeYoram Moses, Orli Waarts