Theory of Computing and Systems
ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992. Proceedings
Series: Lecture Notes in Computer Science; 601;
- Publisher's listprice EUR 53.49
-
22 690 Ft (21 609 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 8% (cc. 1 815 Ft off)
- Discounted price 20 874 Ft (19 880 Ft + 5% VAT)
22 690 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 1992
- Publisher Springer
- Date of Publication 6 May 1992
- Number of Volumes 1 pieces, Book
- ISBN 9783540555537
- Binding Paperback
- No. of pages224 pages
- Size 235x155 mm
- Weight 730 g
- Language English
- Illustrations VIII, 224 p. 0
Categories
Long description:
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.
Springer Book Archives
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.
More
