Theory of Computing and Systems: ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992. Proceedings by Danny DolevTheory of Computing and Systems: ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992. Proceedings by Danny Dolev

Theory of Computing and Systems: ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992…

EditorDanny Dolev

Paperback | May 6, 1992

Pricing and Purchase Info

$104.20 online 
$116.95 list price save 10%
Earn 521 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

ISTCS '92, the Israel Symposium on the Theory of Computingand Systems, cameabout spontaneously as a result ofinformal interaction between a group of people who viewedthe conference as an appropriate expression of Israelistrength in theoretical aspects of computing and systems.The enthusiasm that the symposium created resulted in thesubmission of a large number of extremely high qualitypapers, which led in turn to strict acceptance criteria.This volume contains nineteen selected papers representingthe cream of Israeli talent in the field, on a variety ofactive and interesting topics in the theory of computing andsystems.
Title:Theory of Computing and Systems: ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992…Format:PaperbackDimensions:228 pagesPublished:May 6, 1992Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540555536

ISBN - 13:9783540555537

Look for similar items by category:

Reviews

Table of Contents

Merging and splitting priority queues and deques in parallel.- Lower bounds for the complexity of functions in a realistic RAM model.- On Boolean decision trees with faulty nodes.- Interval graphs, interval orders and the consistency of temporal events (extended abstract).- Higher order functions in first order logics.- Reduction relations in strict applicative languages.- Approximation algorithms for minimum time broadcast.- The complexity of reconfiguring network models.- Optimal mapping in direct mapped cache environments.- New algorithms for generalized network flows.- Factoring polynomials via relation-finding.- New resultant inequalities and complex polynomial factorization.- Can symmetric Toeplitz solvers be strongly stable?.- Bounds on parallel computation of multivariate polynomials.- Time-lapse snapshots.- Concurrent Timestamping made simple.- Distributed evaluation: a tool for constructing distributed detection programs.- Foundations of asymptotical theory of Determinate Compact Testing.- Optimal k-colouring and k-nesting of intervals.