Advertisement

Mathematical Foundations of Computer Science 2004

29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004. Proceedings

  • Jiří Fiala
  • Václav Koubek
  • Jan Kratochvíl

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

Table of contents

  1. Front Matter
  2. Invited Lectures

    1. Jerzy Tiuryn, Ryszard Rudnicki, Damian Wójtowicz
      Pages 1-24
    2. Magnús M. Halldórsson, Guy Kortsarz
      Pages 25-41
    3. Matthew Brand, Sarah Frisken, Neal Lesh, Joe Marks, Daniel Nikovski, Ron Perry et al.
      Pages 106-118
    4. Eduardo Bonelli, Adriana Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda
      Pages 119-148
    5. Pascal Weil
      Pages 149-175
    6. Elias Koutsoupias
      Pages 177-179
  3. Graph Algorithms

    1. Hans L. Bodlaender, Fedor V. Fomin
      Pages 180-190
    2. Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos
      Pages 191-203
    3. Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger
      Pages 204-214
    4. Ioannis Caragiannis, Aleksei Fishkin, Christos Kaklamanis, Evi Papaioannou
      Pages 215-226
  4. Approximations

    1. Hans-Joachim Böckenhauer, Dirk Bongartz
      Pages 227-238
    2. Hubie Chen, Martin Pál
      Pages 239-250
    3. Andre Gronemeier
      Pages 251-262
    4. Miroslav Chlebík, Janka Chlebíková
      Pages 263-273
  5. Graphs and Complexity

    1. Daniel Král’, Pavel Nejedlý
      Pages 274-286
    2. Edith Hemaspaandra, Lane A. Hemaspaandra, Stanisław Radziszowski, Rahul Tripathi
      Pages 287-297
    3. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
      Pages 298-309
    4. Zeev Nutov, Raphael Yuster
      Pages 310-321
  6. Circuits

    1. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen
      Pages 334-345
    2. Alina Beygelzimer, Mitsunori Ogihara
      Pages 346-355
    3. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
      Pages 356-367
  7. General Complexity

    1. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
      Pages 368-379
    2. Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus Wagner
      Pages 392-403
    3. Sebastian Bab, Arfst Nickelsen
      Pages 404-415
  8. Automata

    1. Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari
      Pages 416-426
    2. Guillaume Theyssier
      Pages 427-438
    3. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
      Pages 451-462
  9. Parametrized and Kolmogorov Complexity

    1. Troy Lee, Andrei Romashchenko
      Pages 463-475
    2. John M. Hitchcock, María López-Valdés, Elvira Mayordomo
      Pages 476-487
    3. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
      Pages 500-512
  10. Semantics

    1. Yann Loyer, Umberto Straccia
      Pages 513-524
    2. Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron
      Pages 525-536
    3. Rob van Glabbeek, Gordon Plotkin
      Pages 550-561
  11. Scheduling

    1. Leah Epstein, Tamir Tassa
      Pages 562-573
    2. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
      Pages 574-585
    3. Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
      Pages 586-598
    4. Nadine Baumann, Ekkehard Köhler
      Pages 599-610
  12. Algebraic Theory of Languages

    1. Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
      Pages 611-622

About these proceedings

Introduction

This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.

Keywords

Automat XML algorithms automata complexity computer computer science

Editors and affiliations

  • Jiří Fiala
    • 1
  • Václav Koubek
    • 2
  • Jan Kratochvíl
    • 1
  1. 1.Institute for Theoretical Computer Science and Department of Applied MathematicsCharles UniversityPragueCzech Republic
  2. 2.Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and PhysicsCharles UniversityPraha1Czech Republic

Bibliographic information

  • DOI https://doi.org/10.1007/b99679
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-22823-3
  • Online ISBN 978-3-540-28629-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications