PhD student / Post-Doc position in Algorithms Engineering at University Vienna
Christian Schulz <[email protected]> Mon, 23 Oct 2017 13:17:06 +0200
| Newsgroups | gmane.comp.mathematics.csc |
|---|---|
| Message-ID | <[email protected]> |
This is a multi-part message in MIME format.
--===============7445221920564485323==
Content-Type: multipart/alternative;
boundary="------------3D0379C274D2400468EDEF7A"
Content-Language: en-US
This is a multi-part message in MIME format.
--------------3D0379C274D2400468EDEF7A
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
You love algorithms, their analysis and efficient implementation? You
are about to or know somebody who graduates with an excellent Master’s
degree and is looking
for a PhD position? Then please read on:
The research group "Theory and Applications of Algorithms" led by
Professor Monika Henzinger
at the University of Vienna is inviting applications for the full-time
position of a
PhD Student / University Assistant ("Prae-Doc") (m/f)
or
Post-Doc / University Assistant ("Post-Doc") (m/f)
starting on December 1st, 2017 (the exact date is negotiable).
The initial contract length is one year, but an extension is possible
(and in the case of a PhD student also expected).
Working Area:
A successful candidate will work under the supervision of Prof. Monika
Henzinger and Dr. Christian Schulz
on the topics of algorithm engineering, parallel and distributed
algorithms, dynamic algorithms and
combinatorial optimization (such as graph partitioning/clustering,
process mapping, independent sets, ...).
Exceptional candidates in the general area of algorithms and data
structures will also be considered.
Further responsibilities as part of the position include the supervision
of bachelor and master students
and possibly TA duties.
Requirements:
- Very good university degree (Master or equivalent) in computer science
or a related field
- Solid skills in software development and in the theoretical analysis
of algorithms (evidenced by your thesis or relevant courses); knowledge
in combinatorial algorithms and
linear algebra is particularly desirable
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects
- Knowledge in parallel programming (in particular MPI) is a plus, but
no requirement
University Vienna offers excellent conditions for undergraduate,
graduate, and PhD
students. As part of the university we pursue a non-discriminatory
employment policy and value equal
opportunities, as well as diversity (http://diversity.univie.ac.at). The
university lays special
emphasis on increasing the number of women in senior and in academic
positions. Given equal qualifications,
preference will be given to female applicants.
Please forward this email to anyone who may be interested or send your
application documents (cover letter,
CV, copies of certificates, a skype address for a possible interview and
the contact information of
two references) to the address below. To receive full consideration,
submit the documents via email
by November 10, 2017 to:
Theory and Applications of Algorithms
Faculty of Computer Science
University of Vienna
Dr. Christian Schulz
Währinger Str. 29
A-1090 Vienna
Austria
email: [email protected]
--
Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics
Dr. rer. nat. Christian Schulz
Research Associate
Am Fasanengarten 5
Building 50.34, Room 208
76131 Karlsruhe
Telephone: +49 721 608-4-4232
E-Mail: [email protected]
http://algo2.iti.kit.edu/christian.schulz.php
Open Source:
KaHIP -- Karlsruhe High Quality Graph Partitioning
ParHIP -- Parallel High Quality Partitioning
http://algo2.iti.kit.edu/kahip/
KaDraw -- Karlsruhe Graph Drawing
http://algo2.iti.kit.edu/kadraw/
KaLP -- Karlsruhe Longest Paths
http://algo2.iti.kit.edu/kalp/
KaMIS -- Karlsruhe Maximum Independent Sets
http://algo2.iti.kit.edu/kamis/
VieM -- Vienna Mapping and Sparse Quadratic Assignment
http://viem.taa.univie.ac.at/
KIT - Universität des Landes Baden-Württemberg und nationales
Großforschungszentrum in der Helmholtz-Gemeinschaft
--------------3D0379C274D2400468EDEF7A
Content-Type: text/html; charset=utf-8
Content-Transfer-Encoding: 8bit
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=utf-8">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">You love algorithms, their
analysis and efficient implementation? You
<br>
are about to or know somebody who graduates with an excellent
Master’s degree and is looking
<br>
for a PhD position? Then please read on:
<br>
<br>
The research group "Theory and Applications of Algorithms" led by
Professor Monika Henzinger
<br>
at the University of Vienna is inviting applications for the
full-time position of a
<br>
<br>
PhD Student / University Assistant ("Prae-Doc") (m/f)
<br>
<br>
or
<br>
<br>
Post-Doc / University Assistant ("Post-Doc") (m/f)
<br>
<br>
starting on December 1st, 2017 (the exact date is negotiable).
<br>
The initial contract length is one year, but an extension is
possible (and in the case of a PhD student also expected).
<br>
<br>
Working Area:
<br>
<br>
A successful candidate will work under the supervision of Prof.
Monika Henzinger and Dr. Christian Schulz
<br>
on the topics of algorithm engineering, parallel and distributed
algorithms, dynamic algorithms and
<br>
combinatorial optimization (such as graph partitioning/clustering,
process mapping, independent sets, ...).
<br>
Exceptional candidates in the general area of algorithms and data
structures will also be considered.
<br>
Further responsibilities as part of the position include the
supervision of bachelor and master students
<br>
and possibly TA duties.
<br>
<br>
Requirements:
<br>
<br>
- Very good university degree (Master or equivalent) in computer
science or a related field
<br>
- Solid skills in software development and in the theoretical
analysis
<br>
of algorithms (evidenced by your thesis or relevant courses);
knowledge in combinatorial algorithms and
<br>
linear algebra is particularly desirable
<br>
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects
<br>
- Knowledge in parallel programming (in particular MPI) is a plus,
but no requirement
<br>
<br>
University Vienna offers excellent conditions for undergraduate,
graduate, and PhD
<br>
students. As part of the university we pursue a non-discriminatory
employment policy and value equal
<br>
opportunities, as well as diversity (<a
class="moz-txt-link-freetext"
href="http://diversity.univie.ac.at">http://diversity.univie.ac.at</a>).
The university lays special
<br>
emphasis on increasing the number of women in senior and in
academic positions. Given equal qualifications,
<br>
preference will be given to female applicants.
<br>
<br>
Please forward this email to anyone who may be interested or send
your application documents (cover letter,
<br>
CV, copies of certificates, a skype address for a possible
interview and the contact information of
<br>
two references) to the address below. To receive full
consideration, submit the documents via email
<br>
by November 10, 2017 to:
<br>
<br>
Theory and Applications of Algorithms
<br>
Faculty of Computer Science
<br>
University of Vienna
<br>
Dr. Christian Schulz
<br>
Währinger Str. 29
<br>
A-1090 Vienna
<br>
Austria
<br>
email: <a class="moz-txt-link-abbreviated"
href="mailto:[email protected]">[email protected]</a>
<br>
</div>
<br>
<pre class="moz-signature" cols="72">--
Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics
Dr. rer. nat. Christian Schulz
Research Associate
Am Fasanengarten 5
Building 50.34, Room 208
76131 Karlsruhe
Telephone: +49 721 608-4-4232
E-Mail: <a class="moz-txt-link-abbreviated" href="mailto:[email protected]">[email protected]</a>
<a class="moz-txt-link-freetext" href="http://algo2.iti.kit.edu/christian.schulz.php">http://algo2.iti.kit.edu/christian.schulz.php</a>
Open Source:
KaHIP -- Karlsruhe High Quality Graph Partitioning
ParHIP -- Parallel High Quality Partitioning
<a class="moz-txt-link-freetext" href="http://algo2.iti.kit.edu/kahip/">http://algo2.iti.kit.edu/kahip/</a>
KaDraw -- Karlsruhe Graph Drawing
<a class="moz-txt-link-freetext" href="http://algo2.iti.kit.edu/kadraw/">http://algo2.iti.kit.edu/kadraw/</a>
KaLP -- Karlsruhe Longest Paths
<a class="moz-txt-link-freetext" href="http://algo2.iti.kit.edu/kalp/">http://algo2.iti.kit.edu/kalp/</a>
KaMIS -- Karlsruhe Maximum Independent Sets
<a class="moz-txt-link-freetext" href="http://algo2.iti.kit.edu/kamis/">http://algo2.iti.kit.edu/kamis/</a>
VieM -- Vienna Mapping and Sparse Quadratic Assignment
<a class="moz-txt-link-freetext" href="http://viem.taa.univie.ac.at/">http://viem.taa.univie.ac.at/</a>
KIT - Universität des Landes Baden-Württemberg und nationales
Großforschungszentrum in der Helmholtz-Gemeinschaft</pre>
</body>
</html>
--------------3D0379C274D2400468EDEF7A--
--===============7445221920564485323==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
_______________________________________________
Csc mailing list
[email protected]
https://lists.purdue.edu/mailman/listinfo/csc
--===============7445221920564485323==--