dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. Discrete algorithms and applications, June 6 - 10, Budapest
(Kristof Berczi)
2. PhD student position at KIT (parallel algorithms /
theoretical CS) (Henning Meyerhenke)
----------------------------------------------------------------------
Message: 1
Date: Mon, 4 Apr 2016 18:23:21 +0200 (CEST)
From: Kristof Berczi <berkri@cs.elte.hu>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Discrete algorithms and applications, June 6 - 10,
Budapest
Message-ID: <54254.157.181.227.129.1459787001.squirrel@www.cs.elte.hu>
Content-Type: text/plain;charset=iso-8859-15
The Institute of Mathematics of the Eotvos Lorand University, Budapest,
Hungary is organizing a summer school entitled "DISCRETE ALGORITHMS AND
APPLICATIONS" between June 6 and 10 for undergraduate, graduate and PhD
students.
The summer school will consist of 9 minicourses:
- Mathematical analysis of satellite images
- Hundred thousand dollars for a prime number
- Pseudorandom binary sequences and lattices
- Permutation group algorithms
- LEMON: Library for Efficient Modeling and Optimization in Networks
- Graph algorithms and LP duality
- Recent techniques in algorithm design
- Scheduling problems and algorithms
- Modeling propagation processes on networks by using differential equations
Lecturers of the summer school:
Istvan Fekete, Robert Freud, Katalin Gyarmati, Zoltan Halasi, Alpar
Juttner, Tamas Kiraly, Zoltan Kiraly, Tamas Kis, Istvan Laszlo, Peter
Simon
The abstracts of the minicourses are available at
http://www.math.elte.hu/summerschool/
The poster of the summer school can be downloaded from
http://www.math.elte.hu/summerschool/2016/egyeb/poster.pdf
Early bird registration closes on April 30. The registration form and
further information (regarding accommodation, travelling, visa, etc) is
available on the homepage of the summer school:
http://www.math.elte.hu/summerschool/.
We would be grateful if you could forward this message to your colleagues
and students. If you have any questions, please contact us at
summerschool@math.elte.hu.
Kristof Berczi
Egervary Research Group
Eotvos Lorand University, Budapest
berkri@cs.elte.hu
------------------------------
Message: 2
Date: Mon, 4 Apr 2016 18:31:36 +0200
From: Henning Meyerhenke <henning.meyerhenke@kit.edu>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] PhD student position at KIT (parallel algorithms /
theoretical CS)
Message-ID: <570296E8.5050508@kit.edu>
Content-Type: text/plain; charset=utf-8
You love algorithms, their analysis and efficient implementation? You
are about to graduate with an excellent Master's degree and are looking
for a PhD position? Then please read on:
The group "Theoretical Computer Science / Parallel Computing" at the
Department of Informatics of Karlsruhe Institute of Technology (Germany)
is inviting applications for the position of a
PhD Student / Research Assistant (m/f) (pay grade 13 TV-L)
starting on or after July 1st, 2016 (the exact date is negotiable). This
full-time position is expected to have funding for three years. An
initial restriction to a shorter contract may be necessary.
Working Area:
The research group is primarily concerned with the development of
algorithms for problems from network science, combinatorial scientific
computing, and applied optimization. In the focus of this position are
research projects on parallel graph algorithms that work well both in
theory and in practice.
Further responsibilities as part of the position include the supervision
of bachelor and master students and possibly TA duties. That is why
decent knowledge of German is desirable.
Requirements:
- Very good university degree (Master or equivalent) in computer science
or a related field
- Solid skills in the design and analysis of algorithms and data
structures as well as their implementation (evidenced by your thesis or
relevant courses); knowledge in graph algorithms is particularly desirable
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects
- Knowledge in parallel algorithms / parallel programming is a plus, but
no requirement
KIT offers excellent conditions for undergraduate, graduate, and PhD
students. Its computer science department is one of the largest in
Germany. KIT is pursuing a gender equality policy. We would therefore
particularly encourage qualified women to apply. If qualified,
handicapped applicants will be preferred.
Please send your application documents (cover letter, CV, copies of
certificates and the contact information of two references), preferably
via email in one attached PDF file, to the address below. To receive
full consideration, submit the documents by May 12, 2016 to:
Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics
Prof. Dr. Henning Meyerhenke
Am Fasanengarten 5
D-76131 Karlsruhe
Germany
Email: meyerhenke@kit.edu
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 98, Issue 5
*************************************
No comments:
Post a Comment