default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOrli Waarts
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j15]James Aspnes, Orli Waarts:
Compositional competitiveness for distributed algorithms. J. Algorithms 54(2): 127-151 (2005)- 2003
- [i2]James Aspnes, Orli Waarts:
Compositional competitiveness for distributed algorithms. CoRR cs.DS/0306044 (2003) - 2001
- [j14]Baruch Awerbuch, Yossi Azar
, Serge A. Plotkin, Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration. J. Comput. Syst. Sci. 62(3): 385-397 (2001) - [j13]Joseph Y. Halpern, Yoram Moses, Orli Waarts:
A Characterization of Eventual Byzantine Agreement. SIAM J. Comput. 31(3): 838-865 (2001) - [j12]Miklós Ajtai, Nimrod Megiddo, Orli Waarts:
Improved Algorithms and Analysis for Secretary Problems and Generalizations. SIAM J. Discret. Math. 14(1): 1-27 (2001) - 2000
- [i1]Cynthia Dwork, Joseph Y. Halpern, Orli Waarts:
Performing work efficiently in the presence of faults. CoRR cs.DC/0006008 (2000)
1990 – 1999
- 1999
- [j11]Richard M. Karp, Claire Kenyon, Orli Waarts:
Error-resilient DNA computation. Random Struct. Algorithms 15(3-4): 450-466 (1999) - [j10]Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts:
Time-Lapse Snapshots. SIAM J. Comput. 28(5): 1848-1874 (1999) - 1998
- [j9]Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts:
Fairness in Scheduling. J. Algorithms 29(2): 306-357 (1998) - [j8]Cynthia Dwork, Joseph Y. Halpern, Orli Waarts:
Performing Work Efficiently in the Presence of Faults. SIAM J. Comput. 27(5): 1457-1491 (1998) - 1997
- [j7]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. J. ACM 44(3): 486-504 (1997) - [j6]Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Contention in shared memory algorithms. J. ACM 44(6): 779-805 (1997) - [j5]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
On-Line Load Balancing of Temporary Tasks. J. Algorithms 22(1): 93-110 (1997) - 1996
- [j4]Maurice Herlihy, Nir Shavit, Orli Waarts:
Linearizable Counting Networks. Distributed Comput. 9(4): 193-203 (1996) - [j3]James Aspnes, Orli Waarts:
Randomized Consensus in Expected O(n log² n) Operations Per Processor. SIAM J. Comput. 25(5): 1024-1044 (1996) - [c23]Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts:
Efficient Information Gathering on the Internet (extended abstract). FOCS 1996: 234-243 - [c22]Richard M. Karp, Claire Kenyon, Orli Waarts:
Error-Resilient DNA Computation. SODA 1996: 458-467 - [c21]James Aspnes, Orli Waarts:
Modular Competitiveness for Distributed Algorithms. STOC 1996: 237-246 - 1995
- [c20]Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts:
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). FOCS 1995: 392-401 - [c19]Miklós Ajtai, Nimrod Megiddo, Orli Waarts:
Improved Algorithms and Analysis for Secretary Problems and Generalizations. FOCS 1995: 473-482 - [c18]Richard M. Karp, Orli Waarts, Geoffrey Zweig:
The Bit Vector Intersection Problem (Preliminary Version). FOCS 1995: 621-630 - [c17]James Aspnes, Orli Waarts:
A Modular Measure of Competitiveness for Distributed Algorithms (Abstract). PODC 1995: 252 - [c16]Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts:
Fairness in Scheduling. SODA 1995: 477-485 - 1994
- [j2]Yoram Moses, Orli Waarts:
Coordinated Traversal: (t + 1)- Round Byzantine Agreement in Polynomial Time. J. Algorithms 17(1): 110-156 (1994) - [c15]Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts:
A Theory of Competitive Analysis for Distributed Algorithms. FOCS 1994: 401-411 - [c14]Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts:
Competitiveness in Distributed Algorithms. PODC 1994: 398 - [c13]Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration. SODA 1994: 321-327 - 1993
- [j1]Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung:
Perfectly Secure Message Transmission. J. ACM 40(1): 17-47 (1993) - [c12]Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Bounded Round Numbers. PODC 1993: 53-64 - [c11]Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Contention in shared memory algorithms. STOC 1993: 174-183 - [c10]James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts:
On-line load balancing with applications to machine scheduling and virtual circuit routing. STOC 1993: 623-631 - [c9]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
Online Load Balancing of Temporary Tasks. WADS 1993: 119-130 - 1992
- [b1]Orli Waarts:
New algorithms and primitives for multi-processor coordination. Stanford University, USA, 1992 - [c8]James Aspnes, Orli Waarts:
Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor. FOCS 1992: 137-146 - [c7]Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts:
Time-Lapse Snapshots. ISTCS 1992: 154-170 - [c6]Cynthia Dwork, Joseph Y. Halpern, Orli Waarts:
Performing Work Efficiently in the Presence of Faults. PODC 1992: 91-102 - [c5]Cynthia Dwork, Orli Waarts:
Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! STOC 1992: 655-666 - 1991
- [c4]Maurice Herlihy, Nir Shavit, Orli Waarts:
Low Contention Linearizable Counting. FOCS 1991: 526-535 - 1990
- [c3]Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung:
Perfectly Secure Message Transmission. FOCS 1990: 36-45 - [c2]Joseph Y. Halpern, Yoram Moses, Orli Waarts:
A Characterization of Eventual Byzantine Agreement. PODC 1990: 333-346
1980 – 1989
- 1988
- [c1]Yoram Moses, Orli Waarts:
Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time. FOCS 1988: 246-255
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
