Travelled to:1 × Czech Republic
1 × Denmark
1 × Japan
Collaborated with:R.Kulkarni W.Hesse A.Mukherjee T.Schwentick T.Zeume E.Allender A.Ambainis D.A.M.Barrington H.LeThanh
Talks about:reachabl (2) arithmet (1) problem (1) complex (1) circuit (1) direct (1) closur (1) other (1) dynam (1) depth (1)
Person: Samir Datta
DBLP: Datta:Samir
Contributed to:
201520141999Wrote 3 papers:
- ICALP-v2-2015-DattaKMSZ #reachability
- Reachability is in DynFO (SD, RK, AM, TS, TZ), pp. 159–170.
- ICALP-v1-2014-DattaHK #complexity #problem #reachability
- Dynamic Complexity of Directed Reachability and Other Problems (SD, WH, RK), pp. 356–367.
- ICALP-1999-AllenderABDL #bound
- Bounded Depth Arithmetic Circuits: Counting and Closure (EA, AA, DAMB, SD, HL), pp. 149–158.