From Wikipedia, the free encyclopedia
German theoretical computer scientist
Susanne Albers
is a German theoretical
computer scientist
and professor of computer science at the
Department of Informatics
of the
Technical University of Munich
.
[1]
She is a recipient of the
Otto Hahn Medal
[2]
and the
Leibniz Prize
.
[3]
Education and career
[
edit
]
Albers studied mathematics, computer science, and
business administration
in
Osnabruck
and received her PhD (
Dr. rer. nat.
) in 1993 at
Saarland University
under the supervision of
Kurt Mehlhorn
. Until 1999, she was associated with the
Max Planck Institute for Computer Science
and held visiting and postdoctoral positions at the
International Computer Science Institute
in Berkeley,
Free University of Berlin
, and
University of Paderborn
. In 1999, she received her
habilitation
and accepted a position at
Dortmund University
.
[4]
From 2001 to 2009, she was professor of computer science at
University of Freiburg
. From 2009 to 2013, she has been at
Humboldt University of Berlin
.
Since 2013, Albers has held the Chair for Efficient Algorithms at the
Department of Informatics
of the
Technical University of Munich
.
[5]
Research
[
edit
]
Albers' research is in the design and
analysis of algorithms
, especially
online algorithms
,
approximation algorithms
,
algorithmic game theory
and
algorithm engineering
.
[6]
[7]
Awards and honors
[
edit
]
In 1993, she received the
Otto Hahn Medal
from the
Max Planck Society
, and in 2008 the
Leibniz Prize
from the
German Research Foundation
, considered the most important German research prize that includes a grant of €2.5 million. In 2011, she was elected as a fellow of the
German Informatics Society
.
[8]
In 2014, she became one of ten inaugural fellows of the
European Association for Theoretical Computer Science
.
[9]
References
[
edit
]
- ^
Bayer, Ernst.
"Susanne Albers"
.
www14.in.tum.de
. Retrieved
19 September
2018
.
- ^
"SECOND PROGRESS REPORT 1993 / 1995 February 1995 INFORMATIK"
.
www.nzdl.org
. MIT Press, in 1993
. Retrieved
19 September
2018
.
- ^
"DFG, German Research Foundation ? Honour, Prize Money and "Idyllic Freedom": 2008 Leibniz Prizewinners Announced"
.
www.dfg.de
. Retrieved
19 September
2018
.
- ^
Unknown, Unknown.
"KISSWIN.DE"
.
KISSWIN.DE
. Retrieved
19 September
2018
.
- ^
"Institute for Advanced Study (IAS): Gottfried Wilhelm Leibniz Prizewinners"
.
www.ias.tum.de
. Retrieved
19 September
2018
.
- ^
"Algorithms and Complexity (Freiburg)"
.
ac.informatik.uni-freiburg.de
(in German)
. Retrieved
19 September
2018
.
- ^
Klaus, Jansen; Sanjeev, Khanna; Jose D. P., Rolim; Dana, Ron (2004).
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 7th International Workshop on Approximation Algorithms for ...
(2004 ed.). Springer. p. 12.
ISBN
978-3-540-22894-3
.
- ^
GI-Fellow citation
, retrieved 2012-03-09.
- ^
"EATCS names 2014 fellows", Milestones: Computer Science Awards, Appointments,
Communications of the ACM
,
58
(1): 24, January 2015,
doi
:
10.1145/2686734
,
S2CID
11485095
External links
[
edit
]
|
---|
International
| |
---|
National
| |
---|
Academics
| |
---|
People
| |
---|
Other
| |
---|