Travelled to:1 × Cyprus
1 × Sweden
11 × USA
Collaborated with:H.R.Strong C.Dwork N.Shavit J.Y.Halpern I.Abraham I.Keidar D.Malki B.Simons J.D.Ullman M.Naor E.Gafni K.Ostrowski K.Birman J.H.Ahnn B.A.Coan L.J.Stockmeyer A.Z.Broder M.J.Fischer D.Maier H.G.Mairson A.Borodin F.E.Fich W.J.Paul N.Pippenger A.Wigderson Y.Weinsberg T.Anker M.Ben-Yehuda P.Wyckoff K.Karplus A.Siegel A.Strong
Talks about:distribut (3) optim (3) fault (3) algorithm (2) agreement (2) polynomi (2) program (2) network (2) general (2) system (2)
Person: Danny Dolev
DBLP: Dolev:Danny
Contributed to:
2015
2008
2008
1995
199319911989198819851984198319821981Wrote 17 papers:
- STOC-2015-AbrahamD #complexity #polynomial
- Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity (IA, DD), pp. 605–614.
- ASPLOS-2008-WeinsbergDABW #operating system #programmable
- Tapping into the fountain of CPUs: on operating system support for programmable devices (YW, DD, TA, MBY, PW), pp. 179–188.
- ECOOP-2008-OstrowskiBDA #distributed #programming
- Programming with Live Distributed Objects (KO, KB, DD, JHA), pp. 463–489.
- PODS-1995-KeidarD #commit
- Increasing the Resilience of Atomic Commit at No Additional Cost (IK, DD), pp. 245–254.
- ICALP-1993-DolevM #algorithm #distributed #on the
- On Distributed Algorithms in a Broadcast Domain (DD, DM), pp. 371–387.
- STOC-1991-DolevDN #encryption
- Non-Malleable Cryptography (DD, CD, MN), pp. 542–552.
- STOC-1989-DolevS #bound #concurrent
- Bounded Concurrent Time-Stamp Systems Are Constructible (DD, NS), pp. 454–466.
- STOC-1988-DolevGS #testing #towards
- Toward a Non-Atomic Era: 𝓁-Exclusion as a Test Case (DD, EG, NS), pp. 78–92.
- STOC-1985-CoanDDS #distributed #problem
- The Distributed Firing Squad Problem (BAC, DD, CD, LJS), pp. 335–345.
- STOC-1984-BroderDFS #fault tolerance #network #performance
- Efficient Fault Tolerant Routings in Networks (AZB, DD, MJF, BS), pp. 536–541.
- STOC-1984-DolevHS #on the
- On the Possibility and Impossibility of Achieving Clock Synchronization (DD, JYH, HRS), pp. 504–511.
- STOC-1984-DolevHSS #fault tolerance #network
- A New Look at Fault Tolerant Network Routing (DD, JYH, BS, HRS), pp. 526–535.
- STOC-1984-DolevMMU #fault #memory management
- Correcting Faults in Write-Once Memory (DD, DM, HGM, JDU), pp. 225–229.
- STOC-1983-BorodinDFP #bound #branch #source code
- Bounds for Width Two Branching Programs (AB, DD, FEF, WJP), pp. 87–93.
- STOC-1983-DolevDPW
- Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (DD, CD, NP, AW), pp. 42–51.
- STOC-1982-DolevS #algorithm #multi #polynomial
- Polynomial Algorithms for Multiple Processor Agreement (DD, HRS), pp. 401–407.
- STOC-1981-DolevKSSU
- Optimal Wiring between Rectangles (DD, KK, AS, AS, JDU), pp. 312–317.