|
Journals in DBLP
Inf. Comput. 2007, volume: 205, number: 8
- Nir Ailon, Noga Alon
Hardness of fully dense problems. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1117-1129 [Journal]
- Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham
When not losing is better than winning: Abstraction and refinement for the full mu-calculus. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1130-1148 [Journal]
- Elena Fersman, Pavel Krcál, Paul Pettersson, Wang Yi
Task automata: Schedulability, decidability and undecidability. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1149-1172 [Journal]
- Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Complementing two-way finite automata. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1173-1187 [Journal]
- Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema
Generalizing DPLL and satisfiability for equalities. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1188-1211 [Journal]
- Markus Lohrey, Nicole Ondrusch
Inverse monoids: Decidability and complexity of algebraic questions. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1212-1234 [Journal]
- Silvia Crafa, Sabina Rossi
Controlling information release in the pi-calculus. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1235-1273 [Journal]
- Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
Cluster computing and the power of edge recognition. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1274-1293 [Journal]
|