Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2000

Mathematical Foundations of Computer Science 2000

25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 Proceedings

Editors:

  1. Mogens Nielsen

    1. Department of Computer Science, University of Aarhus, Aarhus C, Denmark

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Branislav Rovan

    1. Department of Computer Sciene, Comenius University, Bratislava, Slovakia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Sections

Buy it now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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

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

Table of contents (65 papers)

  1. Front Matter

    Pages I-XIII
    PDF

  2. Invited Talks

    1. Region Analysis and a π-Calculus with Groups

      • Silvano Dal Zilio, Andrew D. Gordon
      Pages 1-20

    2. Abstract Data Types in Computer Algebra

      • James H. Davenport
      Pages 21-35

    3. What Do We Learn from Experimental Algorithmics?

      • Camil Demetrescu, Giuseppe F. Italiano
      Pages 36-51

    5. Computational Politics: Electoral Systems

      • Edith Hemaspaandra, Lane A. Hemaspaandra
      Pages 64-83

    6. 0–1 Laws for Fragments of Existential Second-Order Logic: A Survey

      • Phokion G. Kolaitis, Moshe Y. Vardi
      Pages 84-98

    7. On Algorithms and Interaction

      • Jan van Leeuwen, Jiří Wiedermann
      Pages 99-113

  3. Contributed Papers

    1. On the Lower Bounds for One-Way Quantum Automata

      • Farid Ablayev, Aida Gainutdinova
      Pages 132-140

    2. Axiomatizing Fully Complete Models for ML Polymorphic Types

      • Samson Abramsky, Marina Lenisa
      Pages 141-151

    4. Edge-Bisection of Chordal Rings

      • Lali Barriére, Josep Fábrega
      Pages 162-171

    5. Equation Satisfiability and Program Satisfiability for Finite Monoids

      • David Mix Barrington, Pierre McKenzie, Cris Moore, Pascal Tesson, Denis Thérien
      Pages 172-181

    6. XML Grammars

      • Jean Berstel, Luc Boasson
      Pages 182-191

    7. Simplifying Flow Networks

      • Therese C. Biedl, Broňa Brejová, Tomáš Vinař
      Pages 192-201

    8. Balanced k-Colorings

      • Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer et al.
      Pages 202-211

    9. A Compositional Model for Confluent Dynamic Data-Flow Networks

      • Frank S. de Boer, Marcello M. Bonsangue
      Pages 212-221

    11. Expressiveness of Updatable Timed Automata

      • P. Bouyer, C. Dufourd, E. Fleury, A. Petit
      Pages 232-242
Back to top

Keywords

Back to top

Editors and Affiliations

  • Department of Computer Science, University of Aarhus, Aarhus C, Denmark

    Mogens Nielsen

  • Department of Computer Sciene, Comenius University, Bratislava, Slovakia

    Branislav Rovan

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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

Search

Navigation