Skip to main content
SpringerLink
Log in
Book cover

Adventures Between Lower Bounds and Higher Altitudes

Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday

  • Book
  • © 2018

Overview

Editors:
  1. Hans-Joachim Böckenhauer

    1. ETH Zürich, Zürich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Dennis Komm

    1. ETH Zürich, Zürich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Walter Unger

    1. RWTH Aachen University, Aachen, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Honorary volume dedicated to Juraj Hromkovic on occasion to his 60 birthday
  • Written by well-known experts
  • Features the broad range of Juraj Hromkovic’s research topics

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

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

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 EPUB and 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 (36 chapters)

  1. Front Matter

    Pages I-XXIV
    Download chapter PDF

  2. Automata and Formal Languages

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Determinism and Nondeterminism in Finite Automata with Advice

      • Pavol Ďuriš, Rafael Korbaš, Rastislav Královič, Richard Královič
      Pages 3-16

    3. A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity

      • Michal Hospodár, Galina Jirásková, Peter Mlynárčik
      Pages 17-32

    4. Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols

      • Christos A. Kapoutsis
      Pages 33-48

    5. Regularity of k-Abelian Equivalence Classes of Fixed Cardinality

      • Juhani Karhumäki, Markus A. Whiteland
      Pages 49-62

    6. Reaction Systems, Transition Systems, and Equivalences

      • Jetty Kleijn, Maciej Koutny, Łukasz Mikulski, Grzegorz Rozenberg
      Pages 63-84

    7. On Usefulness of Information: Framework and NFA Case

      • Branislav Rovan, Šimon Sádovský
      Pages 85-99

    8. Parikh Matrices: Subword Indicators and Degrees of Ambiguity

      • Arto Salomaa
      Pages 100-112

    9. Probabilism versus Alternation for Automata

      • Georg Schnitger
      Pages 113-126

  3. Algorithmics

    1. Front Matter

      Pages 127-127
      Download chapter PDF

    2. Classical and Quantum Computations with Restricted Memory

      • Farid Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev
      Pages 129-155

    3. Stability of Reapproximation Algorithms for the \(\beta \)-Metric Traveling Salesman (Path) Problem

      • Annalisa D’Andrea, Luca Forlizzi, Guido Proietti
      Pages 156-171

    4. Fully Online Matching with Advice on General Bipartite Graphs and Paths

      • Hans-Joachim Böckenhauer, Lucia Di Caro, Walter Unger
      Pages 172-190

    5. Sequence Hypergraphs: Paths, Flows, and Cuts

      • Kateřina Böhmová, Jérémie Chalopin, Matúš Mihalák, Guido Proietti, Peter Widmayer
      Pages 191-215

    6. Relative Worst-Order Analysis: A Survey

      • Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
      Pages 216-230

    7. Length-Weighted Disjoint Path Allocation

      • Elisabet Burjons, Fabian Frei, Jasmin Smula, David Wehner
      Pages 231-256

    8. Universal Hashing via Integer Arithmetic Without Primes, Revisited

      • Martin Dietzfelbinger
      Pages 257-279

    9. Small Complexity Gaps for Comparison-Based Sorting

      • Shogo Ehara, Kazuo Iwama, Junichi Teruyama
      Pages 280-296

    10. Online Matching in Regular Bipartite Graphs with Randomized Adversary

      • Josep Fàbrega, Xavier Muñoz
      Pages 297-310
Back to top

Keywords

About this book

This Festschrift volume is published in honor of Juraj Hromkovič on the occasion of his 60th birthday. Juraj Hromkovič is a leading expert in the areas of automata and complexity theory, algorithms for hard problems, and computer science education.
The contributions in this volume reflect the breadth and impact of his work. The volume contains 35 full papers related to Juraj Hromkovič’s research. They deal with various aspects of the complexity of finite automata, the information content of online problems, stability of approximation algorithms, reoptimization algorithms, computer science education, and many other topics within the fields of algorithmics and complexity theory. Moreover, the volume contains a prologue and an epilogue of laudatios from several collaborators, colleagues, and friends.

Editors and Affiliations

  • ETH Zürich, Zürich, Switzerland

    Hans-Joachim Böckenhauer, Dennis Komm

  • RWTH Aachen University, Aachen, Germany

    Walter Unger

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation