Danny Dolev / Zvi Galil / Michael Rodeh (eds.)

Theory of Computing and Systems

ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992. Proceedings
Mitarbeit:Dolev, Danny; Galil, Zvi; Rodeh, Michael

• Broschiertes Buch

Produktbeschreibung

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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 601
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-55553-7
• 1992.
• Seitenzahl: 232
• Erscheinungstermin: 6. Mai 1992
• Englisch
• Abmessung: 235mm x 155mm x 13mm
• Gewicht: 396g
• ISBN-13: 9783540555537
• ISBN-10: 3540555536
• Artikelnr.: 09214131

Inhaltsangabe

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.