The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Orli Waarts: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts
    Efficient Information Gathering on the Internet (extended abstract). [Citation Graph (1, 0)][DBLP]
    FOCS, 1996, pp:234-243 [Conf]
  2. James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
    On-line load balancing with applications to machine scheduling and virtual circuit routing. [Citation Graph (1, 0)][DBLP]
    STOC, 1993, pp:623-631 [Conf]
  3. Miklós Ajtai, Nimrod Megiddo, Orli Waarts
    Improved Algorithms and Analysis for Secretary Problems and Generalizations. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:473-482 [Conf]
  4. Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
    A Theory of Competitive Analysis for Distributed Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:401-411 [Conf]
  5. James Aspnes, Orli Waarts
    Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:137-146 [Conf]
  6. Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung
    Perfectly Secure Message Transmission [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:36-45 [Conf]
  7. Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts
    Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:392-401 [Conf]
  8. Maurice Herlihy, Nir Shavit, Orli Waarts
    Low Contention Linearizable Counting [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:526-535 [Conf]
  9. Richard M. Karp, Orli Waarts, Geoffrey Zweig
    The Bit Vector Intersection Problem (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:621-630 [Conf]
  10. Yoram Moses, Orli Waarts
    Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:246-255 [Conf]
  11. Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
    Time-Lapse Snapshots. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:154-170 [Conf]
  12. James Aspnes, Orli Waarts
    A Modular Measure of Competitiveness for Distributed Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:252- [Conf]
  13. Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
    Competitiveness in Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:398- [Conf]
  14. Cynthia Dwork, Joseph Y. Halpern, Orli Waarts
    Performing Work Efficiently in the Presence of Faults. [Citation Graph (0, 0)][DBLP]
    PODC, 1992, pp:91-102 [Conf]
  15. Cynthia Dwork, Maurice Herlihy, Orli Waarts
    Bounded Round Numbers. [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:53-64 [Conf]
  16. Joseph Y. Halpern, Yoram Moses, Orli Waarts
    A Characterization of Eventual Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:333-346 [Conf]
  17. Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
    Fairness in Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:477-485 [Conf]
  18. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
    Competitive Routing of Virtual Circuits with Unknown Duration. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:321-327 [Conf]
  19. Richard M. Karp, Claire Kenyon, Orli Waarts
    Error-Resilient DNA Computation. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:458-467 [Conf]
  20. James Aspnes, Orli Waarts
    Modular Competitiveness for Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:237-246 [Conf]
  21. Cynthia Dwork, Maurice Herlihy, Orli Waarts
    Contention in shared memory algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:174-183 [Conf]
  22. Cynthia Dwork, Orli Waarts
    Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:655-666 [Conf]
  23. Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
    Online Load Balancing of Temporary Tasks. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:119-130 [Conf]
  24. Cynthia Dwork, Joseph Y. Halpern, Orli Waarts
    Performing work efficiently in the presence of faults [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  25. James Aspnes, Orli Waarts
    Compositional competitiveness for distributed algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  26. Maurice Herlihy, Nir Shavit, Orli Waarts
    Linearizable Counting Networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1996, v:9, n:4, pp:193-203 [Journal]
  27. James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
    On-line routing of virtual circuits with applications to load balancing and machine scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:3, pp:486-504 [Journal]
  28. Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung
    Perfectly Secure Message Transmission. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:1, pp:17-47 [Journal]
  29. Cynthia Dwork, Maurice Herlihy, Orli Waarts
    Contention in shared memory algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:6, pp:779-805 [Journal]
  30. James Aspnes, Orli Waarts
    Compositional competitiveness for distributed algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:54, n:2, pp:127-151 [Journal]
  31. Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
    Fairness in Scheduling [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:306-357 [Journal]
  32. Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
    On-Line Load Balancing of Temporary Tasks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:93-110 [Journal]
  33. Yoram Moses, Orli Waarts
    Coordinated Traversal: (t + 1)- Round Byzantine Agreement in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:1, pp:110-156 [Journal]
  34. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
    Competitive Routing of Virtual Circuits with Unknown Duration. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:3, pp:385-397 [Journal]
  35. Richard M. Karp, Claire Kenyon, Orli Waarts
    Error-resilient DNA computation. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:450-466 [Journal]
  36. James Aspnes, Orli Waarts
    Randomized Consensus in Expected O(n log² n) Operations Per Processor. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:5, pp:1024-1044 [Journal]
  37. Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
    Time-Lapse Snapshots. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1848-1874 [Journal]
  38. Cynthia Dwork, Joseph Y. Halpern, Orli Waarts
    Performing Work Efficiently in the Presence of Faults. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1457-1491 [Journal]
  39. Joseph Y. Halpern, Yoram Moses, Orli Waarts
    A Characterization of Eventual Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:838-865 [Journal]
  40. Miklós Ajtai, Nimrod Megiddo, Orli Waarts
    Improved Algorithms and Analysis for Secretary Problems and Generalizations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:1, pp:1-27 [Journal]

Search in 0.003secs, Finished in 0.306secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002