[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Fundamentals of Computation Theory

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Olaf Owe

    1. Department of Informatics, University of Oslo, Oslo, Norway

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Martin Steffen

    1. Department of Informatics, University of Oslo, Oslo, Norway

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jan Arne Telle

    1. Department of Informatics, University of Bergen, Bergen, Norway

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 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)

Included in the following conference series:

Conference proceedings info: FCT 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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.

Similar content being viewed by others

Keywords

Table of contents (31 papers)

  1. Front Matter

    Download chapter PDF

  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. Almost Transparent Short Proofs for NPℝ

    • Klaus Meer
    Pages 41-52

  6. The Effect of Homogeneity on the Complexity of k-Anonymity

    • Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
    Pages 53-64

  7. On the Optimal Compression of Sets in PSPACE

    • Marius Zimand
    Pages 65-77

  8. Computational Randomness from Generalized Hardcore Sets

    • Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai
    Pages 78-89

  9. Data Reduction for Graph Coloring Problems

    • Bart M. P. Jansen, Stefan Kratsch
    Pages 90-101

  10. Hunting Distributed Malware with the κ-Calculus

    • Mila Dalla Preda, Cinzia Di Giusto
    Pages 102-113

  11. Edge-Matching Problems with Rotations

    • Martin Ebbesen, Paul Fischer, Carsten Witt
    Pages 114-125

  12. 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

  13. A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application

    • Gregory Gutin, Mark Jones, Anders Yeo
    Pages 138-147

  14. On Memoryless Quantitative Objectives

    • Krishnendu Chatterjee, Laurent Doyen, Rohit Singh
    Pages 148-159

  15. Principal Types for Nominal Theories

    • Elliot Fairweather, Maribel Fernández, Murdoch J. Gabbay
    Pages 160-172

  16. Modifying the Upper Bound on the Length of Minimal Synchronizing Word

    • A. N. Trahtman
    Pages 173-180

  17. Online Maximum k-Coverage

    • Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
    Pages 181-192

  18. Coloring Graphs without Short Cycles and Long Induced Paths

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

  19. Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes

    • Guillaume Malod
    Pages 205-216

  20. LIFO-Search on Digraphs: A Searching Game for Cycle-Rank

    • Paul Hunter
    Pages 217-228
Back to top

Other volumes

  1. Fundamentals of Computation Theory

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

Publish with us

Policies and ethics

Back to top

Search

Navigation