PhD defence, Jesper Mosegaard

---

[pi-lambda]: Talk (Martin Lange)

[pi-lambda] talk by Martin Lange: "A simple proof of the exponential succinctness gap between CTL+ and CTL"

As always, see the [ pi-lambda ] homepage for more info:
[ http://www.brics.dk/pilambda/ ]

---

PhD defence, Kristoffer Arnsfelt Hansen

---

ALCOM Seminar: Eric Allender "Grid Graph Reachability Problems"

Title: Grid Graph Reachability Problems

Speaker: Eric Allender, Rutgers

We study the complexity of restricted versions of st-connectivity,
which is the standard complete problem for NL. Grid graphs are a
useful tool in this regard, since

* reachability on grid graphs is logspace-equivalent to reachability
in general planar digraphs, and

* reachability on certain classes of grid graphs...

---

HCI Forskningssymposium v/Olav Bertelsen

Since 2001 the annual Danish Human-Computer Interaction Research Symposium has stimulated networking, and provided an overview across the various parts of the Danish HCI research scene.

---