default search action
ACM SIGLOG News, Volume 7
Volume 7, Number 1, January 2020
- Neil Immerman:
Complexity column. 3 - Christoph Berkholz, Fabian Gerhardt, Nicole Schweikardt:
Constant delay enumeration for conjunctive queries: a tutorial. 4-33 - Ranko Lazic:
Verification column. 34 - Nathalie Bertrand:
Model checking randomized distributed algorithms. 35-45 - Jorge A. Pérez:
Conference reports. 46 - Mário S. Alvim, Konstantinos Chatzikokolakis, Carlos Olarte, Frank D. Valencia:
Catuscia Palamidessi: a journey from logic and concurrency to security and privacy. 47-50 - Andrzej S. Murawski:
The 2020 Alonzo Church award for outstanding contributions to logic and computation: call for nominations. 51 - Daniela Petrisan:
Siglog monthly 204. 52-73
Volume 7, Number 2, April 2020
- Ranko Lazic:
Verification column. 3 - Laure Daviaud:
Register complexity and determinisation of max-plus automata. 4-14 - Jorge A. Pérez:
Conference reports. 15 - Diego Calvanese, Paul Fodor, Marco Montali:
Report on the 3rd International Joint Conference on Rules and Reasoning (RuleML+RR 2019). 16-18 - Daniela Petrisan:
SIGLOG monthly 205. 19-39
Volume 7, Number 3, July 2020
- Neil Immerman:
Complexity column. 4 - Sandra Kiefer:
The Weisfeiler-Leman algorithm: an exploration of its power. 5-27 - Ranko Lazic:
Verification column. 28 - Michael Blondin:
The ABCs of petri net reachability relaxations. 29-43 - Jorge A. Pérez:
Conference reports. 44 - Jamie Vicary:
Online worldwide seminar on logic and semantics https: //www.cs.bham.ac.uk/~vicaryjo/owls. 45-46 - Daniela Petrisan:
SIGLOG monthly 206. 47-54
Volume 7, Number 4, October 2020
- Ranko Lazic:
Verification column. 3 - Mohamed Faouzi Atig:
What is decidable under the TSO memory model? 4-19 - Daniela Petrisan:
SIGLOG monthly 207. 20-26
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.