Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics

International Conference IFIP TCS 2000 Sendai, Japan, August 17–19, 2000 Proceedings

  • Jan van Leeuwen
  • Osamu Watanabe
  • Masami Hagiya
  • Peter D. Mosses
  • Takayasu Ito
Conference proceedings TCS 2000

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

Table of contents

  1. Front Matter
    Pages I-XV
  2. Breaking and fixing the Needham-Schroeder public-key protocol using FDR

    1. Martí;n Abadi, Phillip Rogaway
      Pages 3-22
  3. Theory and Construction of Molecular Computers

  4. On the hardness of the permanent

  5. Approximation Algorithms for String Folding Problems

    1. Giancarlo Mauri, Giulio Pavesi
      Pages 45-58
  6. Fast multi-dimensional approximate string matching

    1. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
      Pages 59-75
  7. Parallel Edge Coloring of a Tree on a Mesh Connected Computer

    1. Chang -Sung Jeong, Sung-Up Cho, Sun-Chul Whang, Mi-Young Choi
      Pages 76-83
  8. Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs

  9. It Is on the Boundary: Complexity Considerations for Polynomial Ideals

  10. An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks

    1. Yoojin Chung, Kunsoo Park, Hyuk-Chul Kwon
      Pages 100-111
  11. Reducibility among combinatorial problems

    1. Evgeny V. Shchepin, Nodari N. Vakhania
      Pages 112-125
  12. Fast Interpolation Using Kohonen Self-Organizing Neural Networks

    1. Olivier Sarzeaud, Yann Stéphan
      Pages 126-139
  13. Steganography Using Modern Arts

    1. Carlo Blundo, Clemente Galdi
      Pages 140-151
  14. Gossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs

    1. Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, Paul Spirakis
      Pages 152-168
  15. An effcient way for edge-connectivity augmentation

  16. On the Approximability of NP-complete Optimization Problems

  17. How Many People Can Hide in a Terrain ?

    1. Stephan Eidenbenz, Christoph Stamm
      Pages 200-212
  18. Language recognition and the synchronization of cellular automata

    1. Thomas Buchholz, Andreas Klein, Martin Kutrib
      Pages 213-225
  19. Inducing an order on cellular automata by a grouping operation

  20. Financial Applications of Monte Carlo and Quasi-Monte Carlo Methods

  21. Fully consistent extensions of partially defined Boolean functions with missing bits

    1. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
      Pages 257-272
  22. Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key

    1. Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
      Pages 273-285
  23. Algebraic Complexity Theory

  24. On Logarithmic Simulated Annealing

    1. Andreas Albrecht, Chak-Kuen Wong
      Pages 301-314
  25. Specification and verification of concurrent programs in CESAR

    1. Mihalis Yannakakis
      Pages 315-330
  26. Validating firewalls in mobile ambients

    1. Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon
      Pages 333-347
  27. Multiway synchronization verified with coupled simulation

    1. Cédric Fournet, Jean-Jacques Lévy, Alan Schmitt
      Pages 348-364
  28. Graph types for monadic mobile processes

  29. Aliasing Models for Mobile Objects

    1. Massimo Merro, Josva Kleist, Uwe Nestmann
      Pages 390-408
  30. Typed concurrent objects

  31. Inductive definitions in the system coq. rules and properties

  32. Compositionality through an operational semantics of contexts

    1. Roberto Bruni, Ugo Montanari, Vladimiro Sassone
      Pages 440-456
  33. Observe behaviour categorically

  34. The Equivalence Problem for Deterministic Pushdown Automata is Decidable

  35. Session 2.4

    1. Yukiyoshi Kameyama
      Pages 489-504
    2. Ken-Etsu Fujita, Aleksy Schubert
      Pages 505-520
    3. Christof Loding, Wolfgang Thomas
      Pages 521-535
    4. Yann Loyer, Nicolas Spyratos, Daniel Stamate
      Pages 536-548
  36. Invited Talk 2.2

  37. Session 2.5

  38. Invited Talk 2.3

  39. Panel Discussion on New Challanges for TCS

  40. Open Lectures

    1. Jan van Leeuwen, Jiří Wiedermann
      Pages 619-623
    2. Peter D. Mosses
      Pages 624-628

About these proceedings


In 1996 the International Federation for Information Processing (IFIP) establ- hed its rst Technical Committee on foundations of computer science, TC1. The aim of IFIP TC1 is to support the development of theoretical computer science as a fundamental science and to promote the exploration of fundamental c- cepts, models, theories, and formal systems in order to understand laws, limits, and possibilities of information processing. This volume constitutes the proceedings of the rst IFIP International C- ference on Theoretical Computer Science (IFIP TCS 2000) { Exploring New Frontiers of Theoretical Informatics { organized by IFIP TC1, held at Tohoku University, Sendai, Japan in August 2000. The IFIP TCS 2000 technical program consists of invited talks, contributed talks, and a panel discussion. In conjunction with this program there are two special open lectures by Professors Jan van Leeuwen and Peter D. Mosses. The decision to hold this conference was made by IFIP TC1 in August 1998, and since then IFIP TCS 2000 has bene ted from the e orts of many people; in particular, the TC1 members and the members of the Steering Committee, the Program Committee, and the Organizing Committee of the conference. Our special thanks go to the Program Committee Co-chairs: Track (1): Jan van Leeuwen (U. Utrecht), Osamu Watanabe (Tokyo Inst. Tech.) Track (2): Masami Hagiya (U. Tokyo), Peter D. Mosses (U. Aarhus).


Computational Geometry Computational Mathematics Discrete Mathematics Distributed Systems Formal Methods Foundations of Computing Mathematical Logic Program Semantics Programming Theory Rack Theoretical Computer Science algorithms complexity

Editors and affiliations

  • Jan van Leeuwen
    • 1
  • Osamu Watanabe
    • 2
  • Masami Hagiya
    • 3
  • Peter D. Mosses
    • 4
  • Takayasu Ito
    • 5
  1. 1.Department of Computer Science Centrumgebouw Noord, Office A309University of UtrechtUtrechtThe Netherlands
  2. 2.Department of Information ScienceTokyo Institute of TechnologyTokyoJapan
  3. 3.Graduate School of Science Department of Information ScienceThe University of TokyoTokyoJapan
  4. 4.Department of Computer ScienceUniversity of AarhusAarhus CDenmark
  5. 5.Graduate School of Information Sciences Department of Computer and Mathematical SciencesTohoku UniversitySendaiJapan

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-67823-6
  • Online ISBN 978-3-540-44929-4
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
IT & Software