Year |
Citation |
Score |
2016 |
Dolev D, Függer M, Lenzen C, Perner M, Schmid U. HEX: Scaling honeycombs is easier than scaling clock trees Journal of Computer and System Sciences. 82: 929-956. DOI: 10.1016/J.Jcss.2016.03.001 |
0.407 |
|
2016 |
Dolev D, Heljanko K, Järvisalo M, Korhonen JH, Lenzen C, Rybicki J, Suomela J, Wieringa S. Synchronous counting and computational algorithm design Journal of Computer and System Sciences. 82: 310-332. DOI: 10.1016/J.Jcss.2015.09.002 |
0.402 |
|
2014 |
Dolev D, Függer M, Posch M, Schmid U, Steininger A, Lenzen C. Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip. Journal of Computer and System Sciences. 80: 860-900. PMID 26516290 DOI: 10.1016/J.Jcss.2014.01.001 |
0.454 |
|
2014 |
Dolev D, Függer M, Schmid U, Lenzen C. Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation Journal of the Acm. 61: 30. DOI: 10.1145/2560561 |
0.458 |
|
2012 |
Dolev D, Hoch EN, Moses Y. An Optimal Self-Stabilizing Firing Squad Siam Journal On Computing. 41: 415-435. DOI: 10.1137/090776512 |
0.378 |
|
2011 |
Bickson D, Baron D, Ihler A, Avissar H, Dolev D. Fault Identification Via Nonparametric Belief Propagation Ieee Transactions On Signal Processing. 59: 2602-2613. DOI: 10.1109/Tsp.2011.2116014 |
0.404 |
|
2010 |
Amir Y, Danilov C, Dolev D, Kirsch J, Lane J, Nita-Rotaru C, Olsen J, Zage D. Steward: Scaling byzantine fault-Tolerant replication to wide area networks Ieee Transactions On Dependable and Secure Computing. 7: 80-93. DOI: 10.1109/Tdsc.2008.53 |
0.626 |
|
2010 |
Bickson D, Reinman T, Dolev D, Pinkas B. Peer-to-peer secure multi-party numerical computation facing malicious adversaries Peer-to-Peer Networking and Applications. 3: 129-144. DOI: 10.1007/S12083-009-0051-9 |
0.36 |
|
2007 |
Ostrowski K, Birman K, Dolev D. Extensible architecture for high-performance, scalable, reliable publish-subscribe eventing and notification International Journal of Web Services Research. 4: 18-58. DOI: 10.4018/Jwsr.2007100102 |
0.341 |
|
2006 |
Kalisky T, Cohen R, Mokryn O, Dolev D, Shavitt Y, Havlin S. Tomography of scale-free networks and shortest path trees. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics. 74: 066108. PMID 17280122 DOI: 10.1103/Physreve.74.066108 |
0.334 |
|
2006 |
Carmi S, Cohen R, Dolev D. Searching complex networks efficiently with minimal information Epl. 74: 1102-1108. DOI: 10.1209/Epl/I2006-10049-1 |
0.347 |
|
2006 |
Dolev D, Mokryn O, Shavitt Y. On multicast trees: structure and size estimation Ieee Acm Transactions On Networking. 14: 557-567. DOI: 10.1109/Tnet.2006.876195 |
0.32 |
|
2006 |
Abraham I, Dolev D. Asynchronous resource discovery Computer Networks. 50: 1616-1629. DOI: 10.1016/J.Comnet.2005.09.015 |
0.408 |
|
2005 |
Daliot A, Dolev D. Self-stabilization of byzantine protocols Lecture Notes in Computer Science. 48-67. DOI: 10.1007/11577327_4 |
0.417 |
|
2003 |
Breitgand D, Dolev D, Raz D. Accounting Mechanism for Membership Size-Dependent Pricing of Multicast Traffic Lecture Notes in Computer Science. 276-286. DOI: 10.1007/978-3-540-39405-1_25 |
0.316 |
|
2003 |
Daliot A, Dolev D, Parnas H. Self-stabilizing pulse synchronization inspired by biological pacemaker networks Lecture Notes in Computer Science. 32-48. DOI: 10.1007/3-540-45032-7_3 |
0.353 |
|
2002 |
Keidar I, Sussman J, Marzullo K, Dolev D. Moshe: A Group Membership Service for WANs Acm Transactions On Computer Systems. 20: 191-238. DOI: 10.1145/566340.566341 |
0.413 |
|
2000 |
Rodeh O, Birman K, Dolev D. Using AVL Trees for Fault Tolerant Group Key Management International Journal of Information Security. 1: 84-99. DOI: 10.1007/S102070100008 |
0.367 |
|
1999 |
Sivan E, Parnas H, Dolev D. Fault Tolerance In The Cardiac Ganglion Of The Lobster Biological Cybernetics. 81: 11-23. DOI: 10.1007/S004220050541 |
0.419 |
|
1998 |
Shamir G, Ben-Or M, Dolev D. A Safe And Scalable Payment Infrastructure For Trade Of Electronic Content International Journal of Cooperative Information Systems. 7: 331-354. DOI: 10.1142/S0218843098000167 |
0.366 |
|
1998 |
Shamir G, Ben-Or M, Dolev D. BARTER: A Backbone Architecture for Trade of Electronic Content Lecture Notes in Computer Science. 65-79. DOI: 10.1007/Bfb0053402 |
0.353 |
|
1997 |
Dolev D, Shavit N. Bounded Concurrent Time-Stamping Siam Journal On Computing. 26: 418-455. DOI: 10.1137/S0097539790192647 |
0.313 |
|
1997 |
Bruck J, Dolev D, Ho C, Roşu M, Strong R. Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations Journal of Parallel and Distributed Computing. 40: 19-34. DOI: 10.1006/Jpdc.1996.1267 |
0.331 |
|
1996 |
Dolev D, Malki D. The Transis approach to high availability cluster communication Communications of the Acm. 39: 64-70. DOI: 10.1145/227210.227227 |
0.362 |
|
1995 |
Dolev D, Halpern JY, Simons B, Strong R. Dynamic fault-tolerant clock synchronization Journal of the Acm. 42: 143-185. DOI: 10.1145/200836.200870 |
0.512 |
|
1995 |
Attiya H, Bar-Noy A, Dolev D. Sharing Memory Robustly in Message-Passing Systems Journal of the Acm (Jacm). 42: 124-142. DOI: 10.1145/200836.200869 |
0.411 |
|
1995 |
Cristian F, Aghili H, Strong R, Dolev D. Atomic Broadcast Information & Computation. 118: 158-179. DOI: 10.1006/Inco.1995.1060 |
0.366 |
|
1993 |
Dolev D, Dwork C, Waarts O, Yung M. Perfectly secure message transmission Journal of the Acm. 40: 17-47. DOI: 10.1145/138027.138036 |
0.41 |
|
1993 |
Bar-Noy A, Dolev D. A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment Mathematical Systems Theory. 26: 21-39. DOI: 10.1007/Bf01187073 |
0.367 |
|
1992 |
Bar-Noy A, Dolev D, Dwork C, Raymond Strong H. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement Information and Computation. 97: 205-233. DOI: 10.1016/0890-5401(92)90035-E |
0.34 |
|
1991 |
Bar-Noy A, Dolev D, Koller D, Peleg D. Fault-tolerant critical section management in asynchronous environments Information and Computation. 95: 1-20. DOI: 10.1016/0890-5401(91)90014-S |
0.425 |
|
1991 |
Bar-Noy A, Dolev D. Consensus algorithms with one-bit messages Distributed Computing. 4: 105-110. DOI: 10.1007/Bf01798957 |
0.365 |
|
1990 |
Dolev D, Reischuk R, Strong HR. Early stopping in Byzantine agreement Journal of the Acm. 37: 720-741. DOI: 10.1145/96559.96565 |
0.408 |
|
1990 |
Attiya H, Bar-Noy A, Dolev D, Peleg D, Reischuk R. Renaming in an Asynchronous Environment Journal of the Acm (Jacm). 37: 524-548. DOI: 10.1145/79147.79158 |
0.349 |
|
1989 |
Coan BA, Dolev D, Dwork C, Stockmeyer L. The distributed firing squad problem Siam Journal On Computing. 18: 990-1012. DOI: 10.1137/0218068 |
0.429 |
|
1989 |
Bar-Noy A, Ben-Or M, Dolev D. Choice coordination with limited failure Distributed Computing. 3: 61-72. DOI: 10.1007/Bf01558664 |
0.319 |
|
1987 |
Dolev D, Dwork C, Stockmeyer L. On the minimal synchronism needed for distributed consensus Journal of the Acm. 34: 77-97. DOI: 10.1145/7531.7533 |
0.391 |
|
1987 |
Broder A, Dolev D, Fischer M, Simons B. Efficient fault—tolerant routings in networks Information & Computation. 75: 52-64. DOI: 10.1016/0890-5401(87)90063-0 |
0.403 |
|
1987 |
Dolev D, Halpern JY, Simons B, Strong HR. A new look at fault-tolerant network routing Information & Computation. 72: 180-196. DOI: 10.1016/0890-5401(87)90031-9 |
0.413 |
|
1986 |
Dolev D, Lynch NA, Pinter SS, Stark EW, Weihl WE. Reaching approximate agreement in the presence of faults Journal of the Acm. 33: 499-516. DOI: 10.1145/5925.5931 |
0.388 |
|
1986 |
Dolev D, Upfal E, Warmuth MK. The parallel complexity of scheduling with precedence constraints Journal of Parallel and Distributed Computing. 3: 553-576. DOI: 10.1016/0743-7315(86)90014-6 |
0.346 |
|
1986 |
Dolev D, Halpern JY, Strong RH. On the possibility and impossibility of achieving clock synchronization Journal of Computer and System Sciences. 32: 230-250. DOI: 10.1016/0022-0000(86)90028-0 |
0.446 |
|
1985 |
Dolev D, Reischuk R. Bounds on information exchange for Byzantine agreement Journal of the Acm. 32: 191-204. DOI: 10.1145/2455.214112 |
0.425 |
|
1985 |
Dolev D, Warmuth MK. Profile Scheduling of Opposing Forests and Level Orders Siam Journal On Algebraic and Discrete Methods. 6: 665-687. DOI: 10.1137/0606066 |
0.334 |
|
1985 |
Dolev D, Warmuth MK. Scheduling Flat Graphs Siam Journal On Computing. 14: 638-657. DOI: 10.1137/0214047 |
0.336 |
|
1983 |
Dolev D, Strong HR. Authenticated Algorithms for Byzantine Agreement Siam Journal On Computing. 12: 656-666. DOI: 10.1137/0212045 |
0.399 |
|
1982 |
Dolev D, Klawe MM, Rodeh M. An O(n log n) unidirectional distributed algorithm for extrema finding in a circle Journal of Algorithms. 3: 245-260. DOI: 10.1016/0196-6774(82)90023-2 |
0.33 |
|
1981 |
Dolev D, Yao AC. ON THE SECURITY OF PUBLIC KEY PROTOCOLS Annual Symposium On Foundations of Computer Science - Proceedings. 350-357. DOI: 10.1109/Tit.1983.1056650 |
0.339 |
|
1981 |
Dolev D. The Byzantine Generals strike again Journal of Algorithms. 3: 14-30. DOI: 10.1016/0196-6774(82)90004-9 |
0.4 |
|
1978 |
Dolev D, Shamir E. Commutation relations of slices characterize some synchronization primitives Information Processing Letters. 7: 7-9. DOI: 10.1016/0020-0190(78)90029-7 |
0.608 |
|
Show low-probability matches. |