Get Free Shipping on orders over $89
Lecture Notes in Computer Science : Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - S.N. Maheshwari

Lecture Notes in Computer Science

Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings

By: S.N. Maheshwari (Editor)

Paperback | 1 November 1985

At a Glance

Paperback


$84.99

or 4 interest-free payments of $21.25 with

 or 

Ships in 5 to 7 business days

The mathematics of programming.- Concurrent programming using actors: Exploiting large-scale parallelism.- A new class of high level programs for distributed computing systems.- A class of termination detection algorithms for distributed computations.- New protocols for the election of a leader in a ring.- Program simplification via symbolic interpretation.- PROLOG-based inductive theorem proving.- On the calling behaviour of procedures.- Approximation algorithms for planar matching.- Geometric optimization and the polynomial hierarchy.- Deriving object octree from images.- Deduction with relation matching.- Recursively defined domains and their induction principles.- Large database specifications from small views.- A decision method for temporal logic based on resolution.- A generalization of the Parikh vector for finite and infinite words.- The implication problem for functional and multivalued dependencies : An algebraic approach.- A simple characterization of database serializability.- Who needs to verify programs if you can test them.- Partial correctness semantics for CP[?, |, &].- A proof technique for rely/guarantee properties.- A complete proof system for SCCS with modal assertions.- Demand-driven evaluation on dataflow machine.- Design and implementation of a procedural VLSI layout system.- VLSI systems for matrix multiplication.- Parallel algorithms for solving certain classes of linear recurrences.- O(1) parallel time incremental graph algorithms.- NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching.- Fast and efficient parallel algorithms for the exact inversion of integer matrices.

More in Mathematical Theory of Computation

AI Engineering : Building Applications with Foundation Models - Chip Huyen
Discrete Mathematics for Computing : Grassroots - Peter Grossman

RRP $150.00

$117.75

21%
OFF
Nonlinear Analysis for Human Movement Variability - Aaron D. Likens

RRP $194.00

$171.75

11%
OFF
Mathematical Foundations of Deep Learning : Theory and Algorithms - Xiaojing Ye
Zhang Time Discretization (ZTD) Formulas and Applications - Yunong Zhang
Introduction to Modern Cryptography : Revised Third Edition - Jonathan Katz