Book Volume 8808 2014

Computing with New Resources

Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday

Editors:

ISBN: 978-3-319-13349-2 (Print) 978-3-319-13350-8 (Online)

Table of contents (34 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XXI

  2. Computing with Automata: Classical, Cellular and Systolic

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-16

      Counting with Probabilistic and Ultrametric Finite Automata

    3. No Access

      Chapter

      Pages 17-31

      Systolic Automata and P Systems

    4. No Access

      Chapter

      Pages 32-48

      Soliton Automata with Multiple Waves

    5. No Access

      Chapter

      Pages 49-55

      On Power Series over a Graded Monoid

    6. No Access

      Chapter

      Pages 56-70

      Advances on Random Sequence Generation by Uniform Cellular Automata

    7. No Access

      Chapter

      Pages 71-82

      On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages

    8. No Access

      Chapter

      Pages 83-98

      Aspects of Reversibility for Classical Automata

    9. No Access

      Chapter

      Pages 99-113

      A Weakly Universal Cellular Automaton in the Pentagrid with Five States

    10. No Access

      Chapter

      Pages 114-128

      Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem

    11. No Access

      Chapter

      Pages 129-145

      Time-Optimum Smaller-State Synchronizers for Cellular Automata

  3. Computing with Quantum Resources

    1. Front Matter

      Pages 147-147

    2. No Access

      Chapter

      Pages 149-160

      Computing Boolean Functions via Quantum Hashing

    3. No Access

      Chapter

      Pages 161-175

      Complexity of Promise Problems on Classical and Quantum Automata

    4. No Access

      Chapter

      Pages 176-191

      Quantum Complexity of Boolean Matrix Multiplication and Related Problems

    5. No Access

      Chapter

      Pages 192-199

      Quantum Distributed Computing Applied to Grover’s Search Algorithm

    6. No Access

      Chapter

      Pages 200-207

      Maximally Entangled State in Pseudo-Telepathy Games

    7. No Access

      Chapter

      Pages 208-222

      Quantum Finite Automata: A Modern Introduction

    8. No Access

      Chapter

      Pages 223-230

      Physical Aspects of Oracles for Randomness and Hadamard’s Conjecture

    9. No Access

      Chapter

      Pages 231-245

      From Quantum Query Complexity to State Complexity

  4. Computing with Controlled Resources

    1. Front Matter

      Pages 247-247

    2. No Access

      Chapter

      Pages 249-263

      Small Universal Devices

    3. No Access

      Chapter

      Pages 264-276

      A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey

previous Page of 2