Travelled to:1 × Greece
1 × Spain
8 × USA
Collaborated with:R.E.Schapire ∅ C.M.Fiduccia A.Shamir A.S.LaPaugh J.Vuillemin D.E.Clarke M.Burnside S.Devadas A.C.Yao D.Avis M.Ben-Or O.Goldreich S.Micali S.Raman A.R.Meyer D.J.Kleitman K.Winklmann J.Spencer M.Blum R.W.Floyd V.R.Pratt R.E.Tarjan T.Mills A.Maywah
Talks about:protocol (2) problem (2) network (2) bound (2) interconnect (1) homeomorph (1) rosenberg (1) placement (1) discoveri (1) conjectur (1)
Person: Ronald L. Rivest
DBLP: Rivest:Ronald_L=
Facilitated 1 volumes:
EdContributed to:
200320021989
1985
198219821978197719751972Wrote 12 papers:
- SAC-2003-RamanCBDR #network #pervasive #resource management
- Access-Controlled Resource Discovery for Pervasive Networks (SR, DEC, MB, SD, RLR), pp. 338–345.
- SAC-2002-BurnsideCMMDR #mobile #protocol #security
- Proxy-based security protocols in networked mobile devices (MB, DEC, TM, AM, SD, RLR), pp. 265–272.
- STOC-1989-RivestS #automaton #finite #sequence #using
- Inference of Finite Automata Using Homing Sequences (RLR, RES), pp. 411–420.
- ICALP-1985-Ben-OrGMR #contract #protocol
- A Fair Protocol for Signing Contracts (MBO, OG, SM, RLR), pp. 43–52.
- DAC-1982-Rivest
- The “PI” (placement and interconnect) system (RLR), pp. 475–481.
- DAC-1982-RivestF
- A “greedy” channel router (RLR, CMF), pp. 418–424.
- STOC-1982-RivestS #how #memory management #reuse
- How to Reuse a “Write-Once” Memory (RLR, AS), pp. 105–113.
- STOC-1978-LapaughR #morphism #problem
- The Subgraph Homeomorphism Problem (ASL, RLR), pp. 40–50.
- STOC-1978-RivestMKWS #fault
- Coping with Errors in Binary Search Procedures (RLR, ARM, DJK, KW, JS), pp. 227–232.
- STOC-1977-YaoAR #bound #problem
- An Ω(n² log n) Lower Bound to the Shortest Paths Problem (ACCY, DA, RLR), pp. 11–17.
- STOC-1975-RivestV #proving
- A Generalization and Proof of the Aanderaa-Rosenberg Conjecture (RLR, JV), pp. 6–11.
- STOC-1972-BlumFPRT #bound #linear
- Linear Time Bounds for Median Computations (MB, RWF, VRP, RLR, RET), pp. 119–124.