Volume 401,
Numbers 1-3,
July 2008
- Gregory Karagiorgos, Nikolaos M. Missirlis:
Convergence of the diffusion method for weighted torus graphs using Fourier analysis.
1-16
- Christian J. Michel, Giuseppe Pirillo, Mario A. Pirillo:
A relation between trinucleotide comma-free codes and trinucleotide circular codes.
17-26
- Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena:
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions.
27-35
- David A. Cohen, Martin C. Cooper, Peter Jeavons:
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms.
36-51
- Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Yao:
Optimizing deletion cost for secure multicast key management.
52-61
- Dániel Marx:
Complexity of unique list colorability.
62-76
- Hing-Fung Ting:
A near optimal scheduler for on-demand data broadcasts.
77-84
- Yumei Huo, Joseph Y.-T. Leung, Xin Wang:
Online scheduling of equal-processing-time task systems.
85-95
- Janina A. Brenner, Guido Schäfer:
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems.
96-106
- Rodolphe Giroudeau, Jean-Claude König, Farida Kamila Moulai, Jérôme Palaysi:
Complexity and approximation for precedence constrained scheduling problems with large communication delays.
107-119
- Eduardo Sany Laber:
A randomized competitive algorithm for evaluating priced AND/OR trees.
120-130
- Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length.
131-143
- Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura:
The complexity of uniform Nash equilibria and related regular subgraph problems.
144-152
- Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia:
Seeing the trees and their branches in the network is hard.
153-164
- Simon J. Puglisi, Jamie Simpson, William F. Smyth:
How many runs can a string contain?
165-171
- Eitan Bachmat, Tao-Kai Lam, Avner Magen:
Analysis of set-up time models: A metric perspective.
172-180
- Chang-Hsiung Tsai:
Embedding of meshes in Möbius cubes.
181-190
- André Hernich, Nicole Schweikardt:
Reversal complexity revisited.
191-205
- José Carlos Costa, Conceição Nogueira:
On bases of identities for the omega-variety generated by locally testable semigroups.
206-216
- Manuel Kauers:
Solving difference equations whose coefficients are not transcendental.
217-227
- Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti:
The complexity of Tarski's fixed point theorem.
228-235
Notes
- David Ilcinkas:
Setting port numbers for fast graph exploration.
236-242
- Dietrich Kuske:
Schützenberger's theorem on formal power series follows from Kleene's theorem.
243-248
Last update Tue Feb 14 04:22:58 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
