Lecture Notes in Computer Science

21st International Symposium, MFCS' 96, Crakow, Poland, September 2 - 6, 1996. Proceedings

By: Wojciech Penczek (Editor), Andrzej Szalas (Editor)

Write A Review

Paperback | 7 August 1996

At a Glance

Paperback
612 Pages

Dimensions(cm)
23.39 x 15.6 x 3.15

Paperback

$169.00

or 4 interest-free payments of $42.25 with

or

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS '96, held in Crakow, Poland in September 1996.
The volume presents 35 revised full papers selected from a total of 95 submissions together with 8 invited papers and 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.

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 $79.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.

More in Discrete Mathematics

Discrete Mathematics with Applications, Metric Edition

5th edition

Paperback

RRP $184.95

$148.75

20%
OFF

Discrete Mathematics for Computing

Grassroots

Paperback

RRP $150.00

$129.75

13%
OFF

Marxian Economics : A New Japanese Tradition - Hiroshi Onishi

$70.75

Weakened Ramsey Theory : Discrete Mathematics and Its Applications - Mark R. Budden

$161.75

Parabolic Problems

60 Years of Mathematical Puzzles in Parabola

Paperback

RRP $69.99

$54.99

21%
OFF

Introduction to Modern Cryptography : Revised Third Edition - Jonathan Katz

$83.75

27%
OFF

Word level model checking	p. 1
Code problems on traces	p. 2
Models of DNA computation	p. 18
Theory and practice of action semantics	p. 37
Linear time temporal logics over Mazurkiewicz traces	p. 62
Partial order reduction: model-checking using representatives	p. 93
Nonmonotonic rule systems: forward chaining, constraints, and complexity	p. 113
Mind the gap! Abstract versus concrete models of specifications	p. 114
A sequent calculus for subtyping polymorphic types	p. 135
Kolmogorov complexity: recent research in Moscow	p. 156
A modal logic for data analysis	p. 167
From specifications to programs: a fork-algebraic approach to bridge the gap	p. 180
Logic of predicates with explicit substitutions	p. 192
On the query complexity of sets	p. 206
A lambda calculus of incomplete objects	p. 218
Bisimilarity problems requiring exponential time	p. 230
Linear dynamic Kahn networks are deterministic	p. 242
Shortest path problems with time constraints	p. 255
Parallel alternating-direction access machine	p. 267
Specification and verification of timed lazy systems	p. 279
A class of information logics with a decidable validity problem	p. 291
On the power of nonconservative PRAM	p. 303
Self-similarity viewed as a local property via tile sets	p. 312
Simulation of specification statements in Hoare logic	p. 324
Equational properties of iteration in algebraically complete categories	p. 336
On unconditional transfer	p. 348
(poly(log log n), poly(log log n))-restricted verifiers are unlikely to exist for languages in NP	p. 360
Minimizing congestion of layouts for ATM networks with faulty links	p. 372
Polynomial automaticity, context-free languages, and fixed points of morphisms (extended abstract)	p. 382
Casual testing	p. 394
Construction of list homomorphisms by tupling and fusion	p. 407
Probabilistic metric semantics for a simple language with recursion	p. 419
Dynamics graphs	p. 431
Equations on trees	p. 443
On the equivalence problem for E-pattern languages (extended abstract)	p. 457
Specifying and verifying parametric processes	p. 469
On saturation with flexible function symbols	p. 482
Approximating good simultaneous diophantine approximations is almost NP-hard	p. 494
On the conjugation of standard morphisms	p. 506
A semantic matching algorithm: analysis and implementation	p. 517
Routing on triangles, tori and honeycombs	p. 529
A uniform analysis of trie structures that store prefixing-keys with application to doubly-chained prefixing-tries	p. 542
On fairness in terminating and reactive programs	p. 554
Polynomial time samplable distributions	p. 556
From static to dynamic abstract data-types	p. 579
Author Index	p. 591
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

21st International Symposium, MFCS' 96, Crakow, Poland, September 2 - 6, 1996. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Discrete Mathematics

Discrete Mathematics with Applications, Metric Edition

5th edition

Discrete Mathematics for Computing

Grassroots

Marxian Economics

A New Japanese Tradition

How to Prove It

A Structured Approach

Weakened Ramsey Theory

Discrete Mathematics and Its Applications

Topics in Mathematical Modeling by Difference Equations

With Mathematica

The Green Crypto Handbook

Blockchain for Sustainability Professionals

Reading Randomness I

New Horizons for Understanding Fractal and Fractional Calculus

Fuzzy Sets and Triangular Norms

Aggregation in Decision-Aided Intelligent Systems

Discrete Mathematics and Its Applications

2025 Release ISE

Parabolic Problems

60 Years of Mathematical Puzzles in Parabola

Introduction to Modern Cryptography

Revised Third Edition

Business Process Analytics

Modeling, Simulation and Design

Introduction to Mathematical Logic

Discrete Mathematics and Its Applications

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Geometry of Frameworks

Compact Textbooks in Mathematics

Combinatorics and Combinatorial Computing

MCCCC34, Normal, IL, USA, October 21-23, 2022

Discrete Choice Models

Mathematical Methods, Econometrics, and Data Science

From Christoffel Words to Markoff Numbers

Quantum Communication and Cryptography

The Algebra of Code, Volume 1

Explore Set Theory, Abstract Algebra, and Category Theory with Functional Programming

New Probes into Discrete and Convex Geometry

Bolyai Society Mathematical Studies

An Introduction to Single-User Information Theory

Springer Undergraduate Texts in Mathematics and Technology

Axiomatic Set Theory

An Introduction

This product is categorised by