Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Computation Theory

19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Leszek Gąsieniec

    1. Computer Science, University of Liverpool, Liverpool, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Frank Wolter

    1. Department of Computer Science, University of Liverpool, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Proceedings of the 19th International Symposium on Fundamentals of Computation Theory, FCT 2013

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

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

Included in the following conference series:

Conference proceedings info: FCT 2013.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • 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

Table of contents (29 papers)

  1. Front Matter

    Download chapter PDF

  2. Together or Separate? Algorithmic Aggregation Problems

    • Marek Chrobak
    Pages 1-1

  3. Decision Problems for Linear Recurrence Sequences

    • Joël Ouaknine
    Pages 2-2

  4. Randomized Distributed Decision (Invited Lecture Abstract)

    • David Peleg
    Pages 3-3

  5. On the Complexity of Finding a Largest Common Subtree of Bounded Degree

    • Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu
    Pages 4-15

  6. On the Isomorphism Problem for Decision Trees and Decision Lists

    • Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
    Pages 16-27

  7. Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree

    • Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
    Pages 28-39

  8. One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata

    • Kaspars Balodis
    Pages 40-47

  9. Efficient Sampling of Non-strict Turnstile Data Streams

    • Neta Barkay, Ely Porat, Bar Shalem
    Pages 48-59

  10. The Frequent Items Problem in Online Streaming under Various Performance Measures

    • Joan Boyar, Kim S. Larsen, Abyayananda Maiti
    Pages 60-71

  11. On the Average Size of Glushkov and Equation Automata for KAT Expressions

    • Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
    Pages 72-83

  12. An O *(1.84k) Parameterized Algorithm for the Multiterminal Cut Problem

    • Yixin Cao, Jianer Chen, Jia-Hao Fan
    Pages 84-94

  13. Expressivity of Time-Varying Graphs

    • Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
    Pages 95-106

  14. Parameterized Complexity of Weak Odd Domination Problems

    • David Cattanéo, Simon Perdrix
    Pages 107-120

  15. Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree

    • Steven Chaplick, Jiří Fiala, Pim van ’t Hof, Daniël Paulusma, Marek Tesař
    Pages 121-132

  16. A Formal Framework for Property-Driven Obfuscation Strategies

    • Mila Dalla Preda, Isabella Mastroeni, Roberto Giacobazzi
    Pages 133-144

  17. Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy

    • Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou
    Pages 145-158

  18. Cancellation-Free Circuits in Unbounded and Bounded Depth

    • Joan Boyar, Magnus Gausdal Find
    Pages 159-170

  19. The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design

    • Laurent Gourvès, Jérôme Monnot, Aris T. Pagourtzis
    Pages 171-182

  20. On Independence Domination

    • Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang
    Pages 183-194
Back to top

Other volumes

  1. Fundamentals of Computation Theory

Keywords

About this book

This book constitutes the refereed proceedings of the 19th International Symposium on Fundamentals of Computation Theory, FCT 2013, held in Liverpool, UK, in August 2013. The 29 papers (26 full papers and 3 invited papers) were carefully reviewed and selected from 58 submissions. The papers cover the following topics: algorithms, formal methods, and emerging fields.

Editors and Affiliations

  • Computer Science, University of Liverpool, Liverpool, UK

    Leszek Gąsieniec

  • Department of Computer Science, University of Liverpool, United Kingdom

    Frank Wolter

Bibliographic Information

  • Book Title: Fundamentals of Computation Theory

  • Book Subtitle: 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings

  • Editors: Leszek Gąsieniec, Frank Wolter

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-642-40164-0

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2013

  • Softcover ISBN: 978-3-642-40163-3Published: 08 August 2013

  • eBook ISBN: 978-3-642-40164-0Published: 22 July 2013

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XII, 318

  • Number of Illustrations: 45 b/w illustrations

  • Topics: Theory of Computation, Discrete Mathematics in Computer Science

Publish with us

Policies and ethics

Back to top

Search

Navigation