Lecture Notes in Computer Science

15th Conference; Bangalore, India, December 1995. Proceedings

By: P.S. Thiagarajan (Editor)

Write A Review

Paperback | 4 December 1995

At a Glance

Paperback
536 Pages

Dimensions(cm)
24.13 x 16.51 x 3.18

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 15th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS '95, held in Bangalore, India in December 1995.
The volume presents 31 full revised research papers selected from a total of 106 submissions together with full papers of four invited talks. Among the topics covered are algorithms, software technology, functional programming theory, distributed algorithms, term rewriting and constraint logic programming, complexity theory, process algebras, computational geometry, and temporal logics and verification theory.

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.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Computer Architecture & Logic Design Mathematics Mathematical Foundation Mathematical Logic Artificial Intelligence Computer Programming & Software Development Algorithms & Data Structures Graphical & Digital Media Applications Combinatorics & Graph Theory

Software Engineering Discrete Mathematics

Looking for MUM and DAD: text-text comparisons do help	p. 1
Branch and Bound on the Network Model	p. 11
A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors	p. 22
Efficient Algorithms for Vertex Arboricity of Planar Graphs	p. 37
A Condition for the Three Colourability of Planar Locally Path Graphs	p. 52
A Framework for the Specification of Reactive and Concurrent Systems in Z	p. 62
Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed Systems	p. 80
Verifying Part of the ACCESS.bus Protocol Using PVS	p. 96
Reusing Batch Parsers as Incremental Parsers	p. 111
The Expressive Power of Indeterminate Primitives in Asynchronous Computation	p. 124
The Transformation Calculus	p. 151
Equational Axiomatization of Bicoercibility for Polymorphic Types	p. 166
From Causal Consistency to Sequential Consistency in Shared Memory Systems	p. 180
Observation of Software for Distributed Systems with RCL	p. 195
Partiality and Approximation Schemes for Local Consistency in Networks of Constraints	p. 210
Maximal Extensions of Simplification Orderings	p. 225
Average Polynomial Time Is Hard for Exponential Time Under sn-Reductions	p. 240
On Self-Testing without the Generator Bottleneck	p. 248
Observing Behaviour Categorically	p. 263
An Algorithm for Reducing Binary Branchings	p. 279
On the Complexity of Bisimilarity for Value-Passing Processes	p. 294
On the Expressive Power of CCS	p. 309
Polarized Name Passing	p. 324
Path Balance Heuristic for Self-Adjusting Binary Search Trees	p. 338
Pattern Matching in Compressed Texts	p. 349
All-Pairs Min-Cut in Sparse Networks	p. 363
Minimizing Space Usage in Evaluation of Expression Trees	p. 377
Smooth Surfaces for Multi-Scale Shape Representation	p. 391
On Parallel Complexity of Planar Triangulations	p. 413
Computing a Largest Empty Anchored Cylinder, and Related Problems	p. 428
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time	p. 443
Determinizing Buchi Asynchronous Automata	p. 456
Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy	p. 471
Generalized Temporal Verification Diagrams	p. 484
Model Checking of Probabilistic and Nondeterministic Systems	p. 499
Authors Index	p. 515
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

15th Conference; Bangalore, India, December 1995. 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 for Computing

Grassroots

Marxian Economics

A New Japanese Tradition

How to Prove It

A Structured Approach

Weakened Ramsey Theory

Discrete Mathematics and Its Applications

Fuzzy Sets and Triangular Norms

Aggregation in Decision-Aided Intelligent Systems

The Green Crypto Handbook

Blockchain for Sustainability Professionals

Topics in Mathematical Modeling by Difference Equations

With Mathematica

Reading Randomness I

New Horizons for Understanding Fractal and Fractional Calculus

Business Process Analytics

Modeling, Simulation and Design

Parabolic Problems

60 Years of Mathematical Puzzles in Parabola

Discrete Mathematics and Its Applications

2025 Release ISE

Introduction to Mathematical Logic

Discrete Mathematics and Its Applications

Automatic Generation Of Algorithms

Advances in Metaheuristics

Lights and Shadows on Generalizations in Fixed Point Theory

Introduction to Modern Cryptography

Revised Third Edition

Federated Learning for Smart Communication using IoT Application

Chapman & Hall/CRC Cyber-Physical Systems

Discrete Choice Models

Mathematical Methods, Econometrics, and Data Science

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

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Geometry of Frameworks

Compact Textbooks in Mathematics

This product is categorised by