Skip to main content
  • Conference proceedings
  • © 2011

Fundamentals of Computation Theory

18th International Symposium, FCT 2011, Oslo, Norway, August 22-28, 2011, Proceedings

  • Up-to-date results

  • Fast-track conference proceedings

  • State-of-the-art research

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6914)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): FCT: International Symposium on Fundamentals of Computation Theory

Conference proceedings info: FCT 2011.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (31 papers)

  1. Front Matter

  2. The Rewriting Logic Semantics Project: A Progress Report

    • José Meseguer, Grigore Roşu
    Pages 1-37
  3. Impugning Randomness, Convincingly

    • Yuri Gurevich
    Pages 38-38
  4. Kernelization: An Overview

    • Daniel Lokshtanov
    Pages 39-40
  5. The Effect of Homogeneity on the Complexity of k-Anonymity

    • Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
    Pages 53-64
  6. Computational Randomness from Generalized Hardcore Sets

    • Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai
    Pages 78-89
  7. Data Reduction for Graph Coloring Problems

    • Bart M. P. Jansen, Stefan Kratsch
    Pages 90-101
  8. Hunting Distributed Malware with the κ-Calculus

    • Mila Dalla Preda, Cinzia Di Giusto
    Pages 102-113
  9. Edge-Matching Problems with Rotations

    • Martin Ebbesen, Paul Fischer, Carsten Witt
    Pages 114-125
  10. On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems

    • Jacques M. Bahi, Jean-Francois Couchot, Christophe Guyeux, Adrien Richard
    Pages 126-137
  11. A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application

    • Gregory Gutin, Mark Jones, Anders Yeo
    Pages 138-147
  12. On Memoryless Quantitative Objectives

    • Krishnendu Chatterjee, Laurent Doyen, Rohit Singh
    Pages 148-159
  13. Principal Types for Nominal Theories

    • Elliot Fairweather, Maribel Fernández, Murdoch J. Gabbay
    Pages 160-172
  14. Online Maximum k-Coverage

    • Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
    Pages 181-192
  15. Coloring Graphs without Short Cycles and Long Induced Paths

    • Petr A. Golovach, Daniël Paulusma, Jian Song
    Pages 193-204

Other Volumes

  1. Fundamentals of Computation Theory

About this book

This book constitutes the refereed proceedings of the 18th International Symposium Fundamentals of Computation Theory, FCT 2011, held in Oslo, Norway, in August 2011. The 28 revised full papers presented were carefully reviewed and selected from 78 submissions. FCT 2011 focused on algorithms, formal methods, and emerging fields, such as ad hoc, dynamic and evolving systems; algorithmic game theory; computational biology; foundations of cloud computing and ubiquitous systems; and quantum computation.

Keywords

  • Turing machines
  • approximability
  • complexity theory
  • computability
  • computational graph theory
  • term rewriting
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Department of Informatics, University of Oslo, Oslo, Norway

    Olaf Owe, Martin Steffen

  • Department of Informatics, University of Bergen, Bergen, Norway

    Jan Arne Telle

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions