SigLog Logic and Complexity Column

I am now editing the Logic and Complexity Column for the new SigLog newsletter. I would greatly appreciate it if you would email me if you would like to volunteer to write a column, or have a suggestion for a topic or author for one. Thank you.

Here are the SigLog Logic and Complexity Columns that have appeared so far:

7/1/20 "The Weisfeiler-Leman Algorithm: An Exploration of its Power" by Sandra Kiefer
10/1/18 "Constraint Satisfaction Problems: Complexity and Algorithms" by Andrei Bulatov
7/1/18 "Two-Variable Logics with Counting and Semantic Constraints" by Emanuel Kieronski, Ian Pratt-Hartmann and Lidia Tendera
7/1/17 "Some Ways of Thinking Algorithmically About Impossibility" by Ryan Williams
4/1/17 "Stone Duality for Languages and Complexity" Mai Gehrke and Andreas Krebs
10/1/16 "An Improved Homomorphism Preservation Theorem from Lower Bounds in Circuit Complexity" by Benjamin Rossman
7/1/16: "Algebraic Proof Complexity: Progress, Frontiers and Challenges" by Toniann Pitassi and Iddo Tzameret
4/1/16: "Dynamic Complexity: Recent Updates" by Thomas Schwentick and Thomas Zeume
1/1/16: "Variants of Courcelle’s Theorem for Complexity Classes inside P" by Michael Elberfeld
7/1/15: "On the Interplay Between Proof Complexity and SAT Solving" by Jakob Nordström
1/1/15: "The Nature and Power of Fixed-Point Logic with Counting" by Anuj Dawar
10/1/14: "Constraint Satisfaction Problem and Universal Algebra" by Libor Barto
7/1/14: "Introductory Column"