Volume 205,
Number 1,
January 2007
Special Issue:
TIME 2005
Volume 205,
Number 2,
February 2007
Volume 205,
Number 3,
March 2007
Volume 205,
Number 4,
April 2007
Special Issue:
16th International Conference on Rewriting Techniques and Applications
- Jürgen Giesl:
RTA 2005.
417-418
Electronic Edition (link) BibTeX
- Delia Kesner, Stéphane Lengrand:
Resource operators for lambda-calculus.
419-473
Electronic Edition (link) BibTeX
- Nao Hirokawa, Aart Middeldorp:
Tyrolean termination tool: Techniques and features.
474-511
Electronic Edition (link) BibTeX
- Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
On tree automata that certify termination of left-linear term rewriting systems.
512-534
Electronic Edition (link) BibTeX
- Nachum Dershowitz, E. Castedo Ellerman:
Leanest quasi-orderings.
535-556
Electronic Edition (link) BibTeX
- Robert Nieuwenhuis, Albert Oliveras:
Fast congruence closure and extensions.
557-580
Electronic Edition (link) BibTeX
- Pascal Lafourcade, Denis Lugiez, Ralf Treinen:
Intruder deduction for the equational theory of Abelian groups with distributive encryption.
581-623
Electronic Edition (link) BibTeX
- Thierry Boy de la Tour, Mnacho Echenim:
Permutative rewriting and unification.
624-650
Electronic Edition (link) BibTeX
Volume 205,
Number 5,
May 2007
- Andrei A. Bulatov, Víctor Dalmau:
Towards a dichotomy theorem for the counting constraint satisfaction problem.
651-678
Electronic Edition (link) BibTeX
- Christian Lavault, Jean-François Marckert, Vlady Ravelomanana:
Quasi-optimal energy-efficient leader election algorithms in radio networks.
679-693
Electronic Edition (link) BibTeX
- John M. Hitchcock, Aduri Pavan:
Comparing reductions to NP-complete sets.
694-706
Electronic Edition (link) BibTeX
- Alexander Rabinovich:
Temporal logics with incommensurable distances are undecidable.
707-715
Electronic Edition (link) BibTeX
- Andreas Klein, Markus Wessler:
Extended visual cryptography schemes.
716-732
Electronic Edition (link) BibTeX
- Paolo Baldan, Andrea Corradini, Ugo Montanari, Leila Ribeiro:
Unfolding semantics of graph transformation.
733-782
Electronic Edition (link) BibTeX
- Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Bastian Pochon:
The perfectly synchronized round-based model of distributed computing.
783-815
Electronic Edition (link) BibTeX
Volume 205,
Number 6,
June 2007
Volume 205,
Number 7,
July 2007
Addendum
Volume 205,
Number 8,
August 2007
- Nir Ailon, Noga Alon:
Hardness of fully dense problems.
1117-1129
Electronic Edition (link) BibTeX
- Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham:
When not losing is better than winning: Abstraction and refinement for the full mu-calculus.
1130-1148
Electronic Edition (link) BibTeX
- Elena Fersman, Pavel Krcál, Paul Pettersson, Wang Yi:
Task automata: Schedulability, decidability and undecidability.
1149-1172
Electronic Edition (link) BibTeX
- Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
Complementing two-way finite automata.
1173-1187
Electronic Edition (link) BibTeX
- Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema:
Generalizing DPLL and satisfiability for equalities.
1188-1211
Electronic Edition (link) BibTeX
- Markus Lohrey, Nicole Ondrusch:
Inverse monoids: Decidability and complexity of algebraic questions.
1212-1234
Electronic Edition (link) BibTeX
- Silvia Crafa, Sabina Rossi:
Controlling information release in the pi-calculus.
1235-1273
Electronic Edition (link) BibTeX
- Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub:
Cluster computing and the power of edge recognition.
1274-1293
Electronic Edition (link) BibTeX
Volume 205,
Number 9,
September 2007
Volume 205,
Number 10,
October 2007
Volume 205,
Number 11,
November 2007
Volume 205,
Number 12,
December 2007
Copyright © Sun May 17 00:00:04 2009
by Michael Ley (ley@uni-trier.de)
