Skip to main content

Theory of Computing Systems

Ausgabe 2/2010

Inhalt (12 Artikel)

Time and Space Complexity for Splicing Systems

Remco Loos, Mitsunori Ogihara

Open Access

Non-Uniform Reductions

Harry Buhrman, Benjamin Hescott, Steven Homer, Leen Torenvliet

New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem

Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith

Sublinear Fully Distributed Partition with Applications

Bilel Derbel, Mohamed Mosbah, Akka Zemmari

Computing Nash Equilibria for Scheduling on Restricted Parallel Links

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

The Complexity of Problems for Quantified Constraints

Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer

On the Automatizability of Polynomial Calculus

Nicola Galesi, Massimo Lauria

Designing Fast Converging Cost Sharing Methods for Multicast Transmissions

Vittorio Bilò, Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli

Automatic Presentations and Semigroup Constructions

Alan J. Cain, Graham Oliver, Nik Ruškuc, Richard M. Thomas

Exact OBDD Bounds for Some Fundamental Functions

Beate Bollig, Niko Range, Ingo Wegener

Premium Partner