Advertisement

Mathematical Foundations of Computer Science 2005

30th International Symposium, MFCS 2005, Gdansk, Poland, August 29–September 2, 2005. Proceedings

  • Joanna Jȩdrzejowicz
  • Andrzej Szepietowski

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

Table of contents

  1. Papers

    1. Konstantin Korovin, Andrei Voronkov
      Pages 591-602
    2. Martin Lange, Rafał Somla
      Pages 640-651
    3. Markus Lohrey, Nicole Ondrusch
      Pages 664-675
    4. María López-Valdés, Elvira Mayordomo
      Pages 676-685
    5. Tobias Riege, Jörg Rothe
      Pages 733-744
    6. Jakob Grue Simonsen
      Pages 757-768
    7. Falk Unger
      Pages 781-792
    8. Michał Wrona
      Pages 801-812
  2. Back Matter

About these proceedings

Keywords

algorithmic geometry algorithmics algorithms approximation algorithms automata calculus circuit theory combinatorial optimization complexity databases formal languages graph algorithms graph computations logic theore

Editors and affiliations

  • Joanna Jȩdrzejowicz
    • 1
  • Andrzej Szepietowski
    • 1
  1. 1.Institute of MathematicsGdansk UniversityGdanskPoland

Bibliographic information

  • DOI https://doi.org/10.1007/11549345
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-28702-5
  • Online ISBN 978-3-540-31867-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Automotive
Electronics
IT & Software
Telecommunications
Aerospace
Engineering