Skip to main content
  • Conference proceedings
  • © 2010

Theory and Applications of Models of Computation

7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings

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

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

Conference series link(s): TAMC: Annual Conference on Theory and Applications of Models of Computation

Conference proceedings info: TAMC 2010.

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 (42 papers)

  1. Front Matter

  2. Special Sessions

    1. Proof Complexity of Non-classical Logics

      • Olaf Beyersdorff
      Pages 15-27
    2. Optimal Acceptors and Optimal Proof Systems

      • Edward A. Hirsch
      Pages 28-39
    3. Different Approaches to Proof Systems

      • Olaf Beyersdorff, Sebastian Müller
      Pages 50-59
  3. Contributed Papers

    1. Nonlocal Quantum XOR Games for Large Number of Players

      • Andris Ambainis, Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh
      Pages 72-83
    2. Nontriviality for Exponential Time w.r.t. Weak Reducibilities

      • Klaus Ambos-Spies, Timur Bakibayev
      Pages 84-93
    3. Streaming Algorithms for Some Problems in Log-Space

      • Ajesh Babu, Nutan Limaye, Girish Varma
      Pages 94-104
    4. Temperature Aware Online Scheduling with a Low Cooling Factor

      • Martin Birks, Stanley P. Y. Fung
      Pages 105-116
    5. On Solution Concepts for Matching Games

      • Péter Biró, Walter Kern, Daniël Paulusma
      Pages 117-127
    6. Binary De Bruijn Partial Words with One Hole

      • Francine Blanchet-Sadri, Jarett Schwartz, Slater Stich, Benjamin J. Wyatt
      Pages 128-138
    7. Complexity Invariance of Real Interpretations

      • Guillaume Bonfante, Florian Deloup
      Pages 139-150
    8. Pivot and Loop Complementation on Graphs and Set Systems

      • Robert Brijder, Hendrik Jan Hoogeboom
      Pages 151-162
    9. Revisiting the Minimum Breakpoint Linearization Problem

      • Laurent Bulteau, Guillaume Fertin, Irena Rusu
      Pages 163-174
    10. Centdian Computation for Sensor Networks

      • Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir
      Pages 187-198
    11. Twisted Jacobi Intersections Curves

      • Rongquan Feng, Menglong Nie, Hongfeng Wu
      Pages 199-210

Other Volumes

  1. Theory and Applications of Models of Computation

Keywords

  • algebra
  • algorithms
  • bipartite graphs
  • coding theory
  • complexity
  • computability
  • constraints
  • diffusion
  • eulerian paths
  • geometric routing
  • graph coloring
  • lower bounds
  • non-uniformity
  • planar graphs
  • sorting
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Charles University, Praha 1, Czech Republic

    Jan Kratochvíl, Jiří Fiala, Petr Kolman

  • State Key Lab. of Computer Science, Institute of Software,, Chinese Academy of Sciences, Beijing, P.R. China

    Angsheng Li

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