Coverart for item
The Resource Theory of Computing and Systems : ISTCS '92, Israel Symposium Haifa, Israel, May 27-28, 1992 Proceedings, edited by D. Dolev, Z. Galil, M. Rodeh

Theory of Computing and Systems : ISTCS '92, Israel Symposium Haifa, Israel, May 27-28, 1992 Proceedings, edited by D. Dolev, Z. Galil, M. Rodeh

Label
Theory of Computing and Systems : ISTCS '92, Israel Symposium Haifa, Israel, May 27-28, 1992 Proceedings
Title
Theory of Computing and Systems
Title remainder
ISTCS '92, Israel Symposium Haifa, Israel, May 27-28, 1992 Proceedings
Statement of responsibility
edited by D. Dolev, Z. Galil, M. Rodeh
Creator
Contributor
Subject
Language
eng
Summary
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
Member of
Dewey number
004
Image bit depth
0
Index
no index present
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1992
http://bibfra.me/vocab/lite/meetingName
Israel Symposium ISTCS '92
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • Dolev, D.
  • Galil, Zvi
  • Rodeh, M.
Series statement
Lecture Notes in Computer Science,
Series volume
601
http://library.link/vocab/subjectName
  • Computer science
  • Memory management (Computer science)
  • Computer Communication Networks
  • Computer software
  • Logic design
Label
Theory of Computing and Systems : ISTCS '92, Israel Symposium Haifa, Israel, May 27-28, 1992 Proceedings, edited by D. Dolev, Z. Galil, M. Rodeh
Instantiates
Publication
Antecedent source
mixed
Color
not applicable
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
Control code
ocn827360045
Dimensions
unknown
Extent
1 online resource
File format
multiple file formats
Form of item
online
Isbn
9783540472148
Level of compression
uncompressed
Note
SpringerLink
Other physical details
v.: digital
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)827360045
Label
Theory of Computing and Systems : ISTCS '92, Israel Symposium Haifa, Israel, May 27-28, 1992 Proceedings, edited by D. Dolev, Z. Galil, M. Rodeh
Publication
Antecedent source
mixed
Color
not applicable
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
Control code
ocn827360045
Dimensions
unknown
Extent
1 online resource
File format
multiple file formats
Form of item
online
Isbn
9783540472148
Level of compression
uncompressed
Note
SpringerLink
Other physical details
v.: digital
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)827360045

Library Locations

    • InternetBorrow it
      Albany, Auckland, 0632, NZ
Processing Feedback ...