[DMANET] Discrete algorithms and applications - Summer School in Mathematics, June 6 - 10, Budapest

First Announcement

The Institute of Mathematics of the Eotvos University Budapest is
organizing a summer school between June 6-10 entitled

"DISCRETE ALGORITHMS AND APPLICATIONS".

There will be 9 minicourses:

- Finding nearest neighbors among molecular fingerprints
- 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

The early bird registration closes on April 30.

Poster of the summer school is available at
http://www.math.elte.hu/summerschool/2016/egyeb/poster.pdf

For details, see
http://www.math.elte.hu/summerschool/

Kristof Berczi
Egervary Research Group
Eotvos Lorand University, Budapest
berkri@cs.elte.hu

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************