the
** 82. Workshop on Algorithms and Complexity **
* by Fachgruppe Algorithmen and Fachgruppe Komplexität of the
Gesellschaft für Informatik (GI) will take place on
* 08. of June to 09. of June 2022
* in Frankfurt.
* Invited Talk: Pascal Schweitzer (Darmstadt) on "The Theory of
Practical Graph Isomorphism Solving"
* Registration: via E-Mail to theorietag@uni-frankfurt.de until 25.05.2022
* If you plan to give a talk: Please include title and abstract
(preferrably LaTeX) in your mail, also by 25.05.2022. If there is a
corresponding manuscript available online, please provide a link. Talks
should be ~25 minutes long (including discussion).
* Website: https://tcs.uni-frankfurt.de/tt-82/
The workshop is aimed at all those interested in research in the field
of theoretical computer science. The focus is mainly on complexity,
algorithms and data structures, as well as parallel and distributed
algorithms. Participation in the workshop does not constitute a
publication, so both ongoing and completed work can be presented. A
declared goal of the workshop is to enable contact between young and
senior scientists.
We would be happy to welcome you to Frankfurt in June.
Directly after the workshop, there will be the final meeting of the DFG
Priority Programme "Algorithms for Big Data" (09.06.-10.06.) at the same
venue, see https://big-data-spp.de/events/upcoming-events/abschlussevent.
Best regards
Anselm Haak
**********************************************************
*
* 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/
*
**********************************************************
Posts
