`Travelled to:`

1 × Czech Republic

1 × Denmark

1 × Spain

1 × Switzerland

2 × Italy

4 × USA

`Collaborated with:`

M.Karpinski ∅ S.Raskhodnikova G.Yaroslavtsev B.DasGupta C.Coulston J.A.Garay J.Simon A.Bhattacharyya Y.Nekrich J.Y.Halpern J.Tiuryn K.Makarychev E.Grigorescu D.P.Woodruff

`Talks about:`

approxim (3) steiner (2) spanner (2) problem (2) improv (2) min (2) relationship (1) nondetermin (1) determinist (1) throughout (1)

## Person: Piotr Berman

### DBLP: Berman:Piotr

### Contributed to:

### Wrote 13 papers:

- STOC-2014-BermanRY
- Lp-testing (PB, SR, GY), pp. 164–173.
- ICALP-v1-2011-BermanBGRWY #transitive
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets (PB, AB, EG, SR, DPW, GY), pp. 760–772.
- ICALP-v1-2011-BermanBMRY #approximate #problem
- Improved Approximation for the Directed Spanner Problem (PB, AB, KM, SR, GY), pp. 1–12.
- ICALP-2002-BermanK #approximate #bound
- Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION (PB, MK), pp. 623–632.
- ICALP-2002-BermanKN #approximate #parallel
- Approximating Huffman Codes in Parallel (PB, MK, YN), pp. 845–855.
- STOC-2000-BermanD #realtime #scheduling
- Improvements in throughout maximization for real-time scheduling (PB, BD), pp. 680–687.
- ICALP-1999-BermanK #on the
- On Some Tighter Inapproximability Results (PB, MK), pp. 200–209.
- STOC-1997-BermanC #algorithm #online #problem
- On-Line Algorithms for Steiner Tree Problems (PB, CC), pp. 344–353.
- ICALP-1989-BermanG #distributed
- Asymptotically Optimal Distributed Consensus (PB, JAG), pp. 80–94.
- STOC-1988-BermanS #fault tolerance #network
- Investigations of Fault-Tolerant Networks of Computers (PB, JS), pp. 66–77.
- ICALP-1982-BermanHT #logic #nondeterminism #on the #power of
- On the Power of Nondeterminism in Dynamic Logic (PB, JYH, JT), pp. 48–60.
- ICALP-1980-Berman #automaton
- A Note on Sweeping Automata (PB), pp. 91–97.
- ICALP-1978-Berman #complexity
- Relationship Between Density and Deterministic Complexity of NP-Complete Languages (PB), pp. 63–71.