Travelled to:
1 × Italy
3 × USA
Collaborated with:
S.Micali ∅ M.Blum J.Friedman N.Pippenger
Talks about:
algorithm (2) agreement (2) byzantin (2) network (2) optim (2) non (2) probabilist (1) synchron (1) knowledg (1) interact (1)
Person: Paul Feldman
DBLP: Feldman:Paul
Contributed to:
Wrote 5 papers:
- ICALP-1989-FeldmanM #algorithm #probability
- An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement (PF, SM), pp. 341–378.
- STOC-1988-BlumFM
- Non-Interactive Zero-Knowledge and Its Applications (MB, PF, SM), pp. 103–112.
- STOC-1988-FeldmanM #algorithm
- Optimal Algorithms for Byzantine Agreement (PF, SM), pp. 148–161.
- STOC-1986-FeldmanFP #network
- Non-Blocking Networks (PF, JF, NP), pp. 247–254.
- STOC-1985-Feldman #fault tolerance #network
- Fault Tolerance of Minimal Path Routings in a Network (PF), pp. 327–334.