Travelled to:1 × Czech Republic
1 × France
1 × Germany
1 × Greece
1 × Italy
Collaborated with:A.E.Andreev J.D.P.Rolim R.Silvestri A.Monti F.Pasquale J.L.Baskakov
Talks about:hard (3) derandom (2) random (2) mobil (2) set (2) new (2) transmiss (1) function (1) revolut (1) program (1)
Person: Andrea E. F. Clementi
DBLP: Clementi:Andrea_E=_F=
Contributed to:
20102009199919971996Wrote 5 papers:
- ICALP-v2-2010-ClementiMS #modelling
- Modelling Mobility: A Discrete Revolution (AEFC, AM, RS), pp. 490–501.
- ICALP-v2-2009-ClementiPS #named
- MANETS: High Mobility Can Make Up for Low Transmission Power (AEFC, FP, RS), pp. 387–398.
- ICALP-1999-AndreevBCR #bound #branch #pseudo #set #source code
- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs (AEA, JLB, AEFC, JDPR), pp. 179–189.
- ICALP-1997-AndreevCR #trade-off #worst-case
- Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs (AEA, AEFC, JDPR), pp. 177–187.
- ICALP-1996-AndreevCR #set
- Hitting Sets Derandomize BPP (AEA, AEFC, JDPR), pp. 357–368.