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.
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.
Series: Lecture Notes in Computer Science
Number Of Pages: 224
Published: 6th May 1992
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6
Weight (kg): 0.33