Theory of Computing and Systems ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992. Proceedings

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 enthusias...

Full description

Bibliographic Details
Other Authors: Dolev, Danny (Editor), Galil, Zvi (Editor), Rodeh, Michael (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1992, 1992
Edition:1st ed. 1992
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 03105nmm a2200385 u 4500
001 EB000657715
003 EBX01000000000000001349352
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540472148 
100 1 |a Dolev, Danny  |e [editor] 
245 0 0 |a Theory of Computing and Systems  |h Elektronische Ressource  |b ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992. Proceedings  |c edited by Danny Dolev, Zvi Galil, Michael Rodeh 
250 |a 1st ed. 1992 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1992, 1992 
300 |a VIII, 224 p  |b online resource 
505 0 |a 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 
653 |a Computer Science Logic and Foundations of Programming 
653 |a Computer science 
653 |a Memory management (Computer science) 
653 |a Algorithms 
653 |a Computer Memory Structure 
653 |a Formal Languages and Automata Theory 
653 |a Machine theory 
653 |a Computer storage devices 
653 |a Theory of Computation 
700 1 |a Galil, Zvi  |e [editor] 
700 1 |a Rodeh, Michael  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/BFb0035160 
856 4 0 |u https://doi.org/10.1007/BFb0035160?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.0151 
520 |a 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