Lecture Notes in Computer Science : 24th International Symposium, MFCS'99 Szklarska Poreba, Poland, September 6-10, 1999 Proceedings - Miroslaw Kutylowski

Instant online reading.
Don't wait for delivery!

Lecture Notes in Computer Science

24th International Symposium, MFCS'99 Szklarska Poreba, Poland, September 6-10, 1999 Proceedings

By: Miroslaw Kutylowski (Editor), Leszek Pacholski (Editor), Tomasz Wierzbicki (Editor)

Write A Review

Paperback | 18 August 1999

At a Glance

Paperback
476 Pages

Dimensions(cm)
24.13 x 15.88 x 2.54

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This volume contains papers selected for presentation during the 24th Interna tional Symposium on Mathematical Foundations of Computer Science held on September 6-10, 1999 in Szklarska Por^ba, Poland. The symposium, organized alternately in the Czech Republic, Slovakia, and Poland, focuses on theoretical aspects and mathematical foundations of computer science. The scientific program of the symposium consists of five invited talks given by Martin Dyer, Dexter Kozen, Giovanni Manzini, Sergio Rajsbaum, and Mads Tofte, and 37 accepted papers chosen out of 68 submissions. The volume contains all accepted contributed papers, and three invited papers. The contributed papers have been selected for presentation based on their scientific quality, novelty, and interest for the general audience of MFCS par ticipants. Each paper has been reviewed by at least three independent referees - PC members and/or sub-referees appointed by them. The papers were se lected for presentation during a fully electronic virtual meeting of the program committee on May 7, 1999. The virtual PC meeting was supported by software written by Artur Zgoda, Ph.D. student at the University of Wroclaw. The entire communication and access to quite a sensitive database at PC headquarters in Wroclaw was secured by cryptographic protocols based on technology of certificates.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Mathematics Discrete Mathematics Computing & I.T.Computer Networking & Communications Computer Science Mathematical Theory of Computation Combinatorics & Graph Theory Mathematical Foundation Mathematical Logic Databases Data Capture & Analysis

Computer Hardware Network Hardware Nature & The Natural World

Computing over reals
On-Line Addition in Real Base	p. 1
Query languages for real number databases based on descriptive complex-ity over <$>{op R}<$>	p. 12
The Arithmetical Hierarchy of Real Numbers	p. 23
Compression techniques
Invited lecture: The Burrows-Wheeler Transform: Theory and Practice	p. 34
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts	p. 48
Foundations of programming
Computing and Comparing Semantics of Programs in Four-valued Logics	p. 59
Foundations of Modular SOS	p. 70
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces	p. 81
Complexity and algorithms
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophan-tine System	p. 92
The complexity of the extended GCD problem	p. 103
Complexity Results for Confluence Problems	p. 114
Model checking
Is your Model Checker on Time?	p. 125
Clausal Resolution for CTL^☆	p. 137
Model Checking and Higher-Order Recursion	p. 149
Distributed computing
Multiparty Communication Complexity: Very Hard Functions	p. 160
Invited lecture: New Perspectives in Distributed Computing	p. 170
Functional programming
An Improved Disjunctive Strictness Analysis for Lazy Functional Languages	p. 187
Unique Fixed Point Induction for McCarthy's Amb	p. 198
Automata
On Some Topological Properties of Linear Cellular Automata	p. 209
Real-time language recognition by one-way and two-way cellular automata	p. 220
Average state complexity of operations on unary automata	p. 231
Fooling Rebound Automata	p. 241
Algorithms and complexity
The Complexity of Minimizing FBDDs	p. 251
Efficient Strongly Universal and Optimally Universal Hashing	p. 262
Lower and Upper Bounds for the Problem of Page Replication in Ring Networks	p. 273
Security
Invited lecture: Language-Based Security	p. 284
Logic
An Algebraic Approach to Knowledge Representation	p. 299
On the structure of the monadic logic of the binary tree	p. 310
A New Space Bound for the Modal Logics K4, KD4 and S4	p. 321
Counting problems
On Approximating the Number of Bases of Exchange Preserving Matroids	p. 332
Processes and bisimulation
The Semantic Foundations of a Compositional Proof Method for Syn- chronously Communicating Processes	p. 343
On Plain and Hereditary History-Preserving Bisimulation	p. 354
Approximating Weak Bisimulation on Basic Process Algebras	p. 366
Graph algorithms
Edge Coloring of Bipartite Graphs with Constraints	p. 376
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover	p. 387
On Minimum Edge Ranking Spanning Trees	p. 398
Complexity
Football Elimination is Hard to Decide Under the 3-Point-Rule	p. 410
Generalized Regular Counting Classes	p. 419
A Foundation of Programming a Multi-Tape Quantum Turing Machine	p. 430
Types: theory and applications
Invited lecture: A Type Discipline for Solving Year 2000 Problems inCOBOL programs	p. 442
Type Reconstruction for Functional Programs with Subtyping over a Lat-tice of Atomic Types	p. 443
Author Index	p. 455
Table of Contents provided by Publisher. All Rights Reserved.

Lecture Notes in Computer Science

24th International Symposium, MFCS'99 Szklarska Poreba, Poland, September 6-10, 1999 Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Foundation

The Times Ultimate Killer Su Doku Book 18

200 of the deadliest Su Doku puzzles

Maths Sequences for the Early Years F-2

Challenging Children to Reason Mathematically

Oxford Maths for Australian Schools Year 3 Value Pack

3rd Edition

Oxford Maths for Australian Schools Year 4 Value Pack

3rd Edition

Oxford Maths for Australian Schools Value Pack Year 5

Oxford Maths

Oxford Maths for Australian Schools Year 6 Value Pack

3rd Edition

Unequal

The Maths of When Things Do and Don't Add Up

Handbook of Automated Reasoning

Current Trends in Automated Theorem Proving

Current Trends in Automated Reasoning

Oxford Maths for Australian Schools Year 1 Value Pack

3rd Edition

Oxford Maths for Australian Schools Year 4 Practice and Mastery Book

3rd Edition

Oxford Maths for Australian Schools Year 2 Value Pack

3rd Edition

Foundation Maths

7th Edition

Oxford Maths for Australian Schools Year 6 Practice and Mastery Book

3rd Edition

Maths Plus Australian Curriculum Mentals and Homework Book - Year 2 (2023)

Maths Plus Australian Curriculum Edition

Oxford Maths for Australian Schools Year 3 Practice and Mastery Book

3rd Edition

Oxford Maths for Australian Schools Year 5 Practice and Mastery Book

3rd Edition

The Times Fiendish Su Doku Book 19

200 challenging Su Doku puzzles

Building Thinking Classrooms in Mathematics, Grades K-12

14 Teaching Practices for Enhancing Learning

Teaching Secondary Mathematics

2nd Edition

Unequal

The Maths of When Things Do and Don't Add Up

Alex's Adventures in Numberland

Tenth Anniversary Edition

Oxford Maths for Australian Schools Year F Value Pack

3rd Edition

This product is categorised by