ISTCS '92, the Israel Symposium on the Theory of Computing
and Systems, cameabout spontaneously as a result of
informal interaction between a group of people who viewed
the conference as an appropriate expression of Israeli
strength in theoretical aspects of computing and systems.
The enthusiasm that the symposium created resulted in the
submission of a large number of extremely high quality
papers, which led in turn to strict acceptance criteria.
This volume contains nineteen selected papers representing
the cream of Israeli talent in the field, on a variety of
active and interesting topics in the theory of computing and
systems.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 235 mm
Breite: 155 mm
Dicke: 13 mm
Gewicht
ISBN-13
978-3-540-55553-7 (9783540555537)
DOI
Schweitzer Klassifikation
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.
