Volume 362,
Numbers 1-3,
October 2006
- Nazim Fatès, Eric Thierry, Michel Morvan, Nicolas Schabanel:
Fully asynchronous behavior of double-quiescent elementary cellular automata.
1-16
Electronic Edition (link) BibTeX
- Khaled El-Fakih, Nina Yevtushenko, Sergey Buffalov, Gregor von Bochmann:
Progressive solutions to a parallel automata equation.
17-32
Electronic Edition (link) BibTeX
- Francesc Rosselló, Gabriel Valiente:
An algebraic view of the relation between largest common subtrees and smallest common supertrees.
33-53
Electronic Edition (link) BibTeX
- Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe:
If P neq NP then some strongly noninvertible functions are invertible.
54-62
Electronic Edition (link) BibTeX
- Guizhen Yang:
Computational aspects of mining maximal frequent patterns.
63-85
Electronic Edition (link) BibTeX
- Beate Bollig, Stephan Waack, Philipp Woelfel:
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication.
86-99
Electronic Edition (link) BibTeX
- Pedro García, José Ruiz:
Learning in varieties of the form V*LI from positive data.
100-114
Electronic Edition (link) BibTeX
- Min Ji, Yong He, T. C. Edwin Cheng:
Scheduling linear deteriorating jobs with an availability constraint on a single machine.
115-126
Electronic Edition (link) BibTeX
- Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk:
The maximum resource bin packing problem.
127-139
Electronic Edition (link) BibTeX
- Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini:
Minimal invariant sets in a vertex-weighted graph.
140-161
Electronic Edition (link) BibTeX
- Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao:
Improved algorithms for the k maximum-sums problems.
162-170
Electronic Edition (link) BibTeX
- Turlough Neary, Damien Woods:
Small fast universal Turing machines.
171-195
Electronic Edition (link) BibTeX
- Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin:
Deterministic M2M multicast in radio networks.
196-206
Electronic Edition (link) BibTeX
- Matthieu Picantin:
Finite transducers for divisibility monoids.
207-221
Electronic Edition (link) BibTeX
- Arto Salomaa:
Independence of certain quantities indicating subword occurrences.
222-231
Electronic Edition (link) BibTeX
- Mark Kambites:
Word problems recognisable by deterministic blind monoid automata.
232-237
Electronic Edition (link) BibTeX
- Mohamed Eid Hussein, Uwe Schwiegelshohn:
Utilization of nonclairvoyant online schedules.
238-247
Electronic Edition (link) BibTeX
- Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot:
Longest repeats with a block of k don't cares.
248-254
Electronic Edition (link) BibTeX
- Alain Bretto, Alain Faisant, Thierry Vallée:
Compatible topologies on graphs: An application to graph isomorphism problem complexity.
255-272
Electronic Edition (link) BibTeX
- T. C. Edwin Cheng, C. T. Ng, J. J. Yuan:
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs.
273-281
Electronic Edition (link) BibTeX
- Aldo de Luca, Alessandro De Luca:
Pseudopalindrome closure operators in free monoids.
282-300
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:25:09 2009
by Michael Ley (ley@uni-trier.de)