did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9783540679011

Mathematical Foundations of Computer Science 2000 : 25th International Symposium, MFCS 2000, Bratislava, Slovakia August 28-Septemer 1, 2000, Proceedings

by ;
  • ISBN13:

    9783540679011

  • ISBN10:

    3540679014

  • Format: Paperback
  • Copyright: 2000-09-01
  • Publisher: Springer Verlag
  • Purchase Benefits
List Price: $149.00

Summary

This book constitutes the refereed proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000, held in Bratislava/Slovakia in August/September 2000. The 57 revised full papers presented together with eight invited papers were carefully reviewed and selected from a total of 147 submissions. The book gives an excellent overview on current research in theoretical informatics. All relevant foundational issues, from mathematical logics as well as from discrete mathematics are covered. Anybody interested in theoretical computer science or the theory of computing will benefit from this book.

Table of Contents

Invited Talks
Region Analysis and a π-Calculus with Groups
1(20)
Silvano Dal Zilio
Andrew D. Gordon
Abstract Data Types in Computer Algebra
21(15)
James H. Davenport
What Do We Learn from Experimental Algorithmics?
36(16)
Camil Demetrescu
Giuseppe F. Italiano
And/Or Hierarchies and Round Abstraction
52(12)
Radu Grosu
Computational Politics: Electoral Systems
64(20)
Edith Hemaspaandra
Lane A. Hemaspaandra
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
84(15)
Phokion G. Kolaitis
Moshe Y. Vardi
On Algorithms and Interaction
99(15)
Jan van Leeuwen
Jiri Wiedermann
On the Use of Duality and Geometry in Layouts for ATM Networks
114(18)
Shmuel Zaks
Contributed Papers
On the Lower Bounds for One-Way Quantum Automata
132(9)
Farid Ablayev
Aida Gainutdinova
Axiomatizing Fully Complete Models for ML Polymorphic Types
141(11)
Samson Abramsky
Marina Lenisa
Measure Theoretic Completeness Notions for the Exponential Time Classes
152(10)
Klaus Ambos-Spies
Edge-Bisection of Chordal Rings
162(10)
Lali Barriere
Josep Fabrega
Equation Satisfiability and Program Satisfiability for Finite Monoids
172(10)
David Mix Barrington
Pierre McKenzie
Cris Moore
Pascal Tesson
Denis Therien
XML Grammars
182(10)
Jean Berstel
Luc Boasson
Simplifying Flow Networks
192(10)
Therese C. Biedl
Brona Brejova
Tomas Vinar
Balanced k-Colorings
202(10)
Therese C. Biedl
Eowyn Cenek
Timothy M. Chan
Erik D. Demaine
Martin L. Demaine
Rudolf Fleischer
Ming-Wei Wang
A Compositional Model for Confluent Dynamic Data-Flow Networks
212(10)
Frank S. de Boer
Marcello M. Bonsangue
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication (Extended Abstract)
222(10)
Beate Bolling
Expressiveness of Updatable Timed Automata
232(11)
P. Bouyer
C. Dufourd
E. Fleury
A. Petit
Iterative Arrays with Small Time Bounds
243(10)
Thomas Buchholz
Andreas Klein
Martin Kutrib
Embedding Fibonacci Cubes into Hypercubes with Ω(2cn) Faulty Nodes
253(11)
Rostislav Caha
Petr Gregor
Periodic-Like Words
264(11)
Arturo Carpi
Aldo de Luca
The Monadic Theory of Morphic Infinite Words and Generalizations
275(10)
Olivier Carton
Wolfgang Thomas
Optical Routing of Uniform Instances in Tori
285(10)
Francesc Comellas
Margarida Mitjana
Lata Narayanan
Jaroslav Opatrny
Factorizing Codes and Schutzenberger Conjectures
295(9)
Clelia De Felice
Compositional Characterizations of λ-Terms Using Intersection Types (Extended Abstract)
304(10)
M. Dezani-Ciancaglini
F. Honsell
Y. Motohama
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks
314(9)
Stefan Dobrev
Subtractive Reductions and Complete Problems for Counting Complexity Classes
323(10)
Arnaud Durand
Miki Hermann
Phokion G. Kolaitis
On the Autoreducibility of Random Sequences
333(10)
Todd Ebert
Heribert Vollmer
Iteration Theories of Boolean Functions
343(10)
Zoltan Esik
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS (Extended Abstract)
353(10)
A. Finkel
G. Sutre
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs
363(10)
D.A. Fotakis
S.E. Nikoletseas
V.G. Papadopoulou
P.G. Spirakis
Explicit Fusions
373(10)
Philippa Gardner
Lucian Wischik
State Space Reduction Using Partial τ-Confluence
383(11)
Jan Friso Groote
Jaco van de Pol
Reducing the Number of Solutions of NP Functions
394(11)
Lane A. Hemaspaandra
Mitsunori Ogihara
Gerd Wechsung
Regular Collections of Message Sequence Charts (Extended Abstract)
405(10)
Jesper G. Henriksen
Madhavan Mukund
K. Narayan Kumar
P.S. Thiagarajan
Alternating and Empty Alternating Auxiliary Stack Automata
415(11)
Markus Holzer
Pierre McKenzie
Counter Machines: Decidable Properties and Applications to Verification Problems
426(10)
Oscar H. Ibarra
Jianwen Su
Zhe Dang
Tevfik Bultan
Richard Kemmerer
A Family of NFA's Which Need 2n - a Deterministic State
436(10)
Kazuo Iwama
Akihiro Matsuura
Mike Paterson
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring
446(10)
Klaus Jansen
Lorant Porkolab
Matching Modulo Associativity and Idempotency is NP-Complete
456(11)
Ondrej Klima
Jiri Srba
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
467(10)
Sven Kosub
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization (Extended Abstract)
477(11)
Daniel Kral'
Formal Series over Algebras
488(9)
Werner Kuich
μ-Calculus Synthesis
497(11)
Orna Kupferman
Moshe Y. Vardi
The Infinite Versions of LogSpace ≠ P Are Consistent with the Axioms of Set Theory
508(10)
Gregory Lafitte
Jacques Mazoyer
Timed Automata with Monotonic Activities
518(10)
Ruggero Lanotte
Andrea Maggiolo-Schettini
On a Generalization of Bi-Complement Reducible Graphs
528(11)
Vadim V. Lozin
Automatic Graphs and Graph DOL-Systems
539(10)
Olivier Ly
Bilinear Functions and Trees over the (max, +) Semiring
549(10)
Sabrina Mantaci
Vincent D. Blondel
Jean Mairesse
Derivability in Locally Quantified Modal Logics via Translation in Set Theory
559(10)
Angelo Montanari
Alberto Policriti
Matteo Slanina
π-Calculus, Structured Coalgebras, and Minimal HD-Automata
569(10)
Ugo Montanari
Marco Pistore
Informative Labeling Schemes for Graphs (Extended Abstract)
579(10)
David Peleg
Separation Results for Rebound Automata
589(10)
Holger Petersen
Unary Pushdown Automata and Auxiliary Space Lower Bounds
599(10)
Giovanni Pighizzini
Binary Decision Diagrams by Shared Rewriting
609(10)
Jaco van de Pol
Hans Zantema
Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/Hol
619(10)
Leonor Prensa Nieto
Javier Esparza
Why so Many Temporal Logics Climb up the Trees?
629(11)
Alexander Rabinovich
Shahar Maoz
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
640(10)
Steffen Reith
Heribert Vollmer
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism (Extended Abstract)
650(10)
Petr Savicky
Detlef Sieling
On Diving in Trees
660(10)
Thomas Schwentick
Abstract Syntax and Variable Binding for Linear Binders
670(10)
Miki Tanaka
Regularity of Congruential Graphs
680(10)
Tanguy Urvoy
Sublinear Ambiguity
690(9)
Klaus Wich
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions
699(10)
Hiroaki Yamamoto
Author Index 709

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program