The new EATCS Bulletin #147 is available!
https://eatcs.org/images/bulletin/beatcs147.pdf
In the Computational Complexity Column, Ryan Williams provides a background
exposition of a recent theorem in computational complexity related to how
fast algorithms can be simulated with less memory.
In the TCS on the Web Column, Stefan Neumann talks to the current
maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath. The TCS Blog Aggregator is a community-maintained hub for
researchers in complexity theory and algorithms.
In the Formal Language Column, Antonio Casares studies transition-based vs
stated-based acceptance for automata over infinite words, and advocates
using the former. He presents a collection of problems where the choice of
formalism has a major impact and discuss the causes of these differences.
In the Distributed Computing Column, Amitabh Trehan provides insights into
a most simple yet surprisingly deep algorithmic problem: flooding with no
memory.
Pablo Barcelo and David Saulpic are our new editors for the new Machine
Learning column. In their first column, they present a nice and wide review
on how different areas of TCS have contributed to recent advances in ML, or
how it could contribute.
Anuj Dawar is the new editor of the Logic in Computer Science Column,
stepping into the shoes of Yuri Gurevich. Welcome aboard! And many thanks
Yuri for all your great contributions to the Bulletin over so many years –
since 1988! In his first column, he explores the question about the
smallest number of variables with which a formula can be equivalently
written, an important measure related to notions of width arising in
database theory, graph theory and permutation groups.
In the Education Column, R. Ramanujam explores whether concepts from formal
logic can meaningfully contribute to mathematics education at the school
level, reporting on an attempt to work with high school teachers of
mathematics in India.
For the jubilee year of the DISC conference, the "DISC historians" Michel
Raynal and Nicola Santoro tell us the story of WADS/DISC since 1985, a
sibling to the then 4-years old PODC conference. They also share their
thoughts of what makes a good conference in general, and share several nice
historical photos.
Furthermore, I am very happy to announce a new initiative, which aims to
accompany the Bulletin with videos. The initiative is led by Sophie
Huiberts and Ian Mertz. In his essay in the Perspective Column, Ian gives a
motivation and overview of this initiative, and also advertises a call for
videos for EATCS.
The Bulletin also contains several nice conference reports: Matthias
Bentert provides a spotlight of the ALGO conference, Florian Chudigiewitsch
of STACS, and there is also a summary of the British Colloquium for
Theoretical Computer Science.
Last but not least, in case you are in Prague soon, you are welcome to
check out the exhibition 'The Making of a New Science,' on the early
history of theoretical computer science.
Enjoy the new Bulletin!
Stefan
--
Prof. Dr. Stefan Schmid
Intelligent Networks (INET)
TU Berlin, Germany
Research group at TU Berlin: https://www.tu.berlin/en/eninet
Research group at Weizenbaum Institute:
https://plamadiso.weizenbaum-institut.de/
<https://plamadiso.weizenbaum-institut.de/>
Personal: *https://schmiste.github.io/ <https://schmiste.github.io/>*
**********************************************************
*
* 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
