Travelled to:1 × Czech Republic
1 × Germany
1 × Italy
Collaborated with:A.E.F.Clementi J.D.P.Rolim J.L.Baskakov
Talks about:hard (3) derandom (2) random (2) set (2) new (2) function (1) program (1) explict (1) suffic (1) pseudo (1)
Person: Alexander E. Andreev
DBLP: Andreev:Alexander_E=
Contributed to:
199919971996Wrote 3 papers:
- 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.