Travelled to:1 × Brazil
1 × Latvia
Collaborated with:L.Becchetti V.Bonifaci M.Dirnberger K.Mehlhorn E.Althaus S.Canzar M.R.Emmett A.G.Marshall A.Meyer-Bäse H.Zhang
Talks about:comput (2) shortest (1) physarum (1) fragment (1) exchang (1) converg (1) complex (1) residu (1) peptic (1) speed (1)
Person: Andreas Karrenbauer
DBLP: Karrenbauer:Andreas
Contributed to:
2013
2008Wrote 2 papers:
- ICALP-v2-2013-BecchettiBDKM #bound #complexity #convergence #proving
- Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (LB, VB, MD, AK, KM), pp. 472–483.
- SAC-2008-AlthausCEKMMZ
- Computing H/D-exchange speeds of single residues from data of peptic fragments (EA, SC, MRE, AK, AGM, AMB, HZ), pp. 1273–1277.