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...
সংরক্ষণ করুন:
| সংস্থা লেখক: | |
|---|---|
| অন্যান্য লেখক: | , , |
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science
601 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theory of computing and systems, ISTCS '92, Israel symposium, Haifa, Israel, May 27-28, 1992, proceedings, D. Dolev, Z. Galil, M. Rodeh, eds, Berlin, Springer-Verlag, 1992, 1 vol. (VIII-220 p.), Lecture notes in computer science, 3-540-55553-6 • Theory of Computing and Systems, Texte imprimé, 9783662199367 |
সূচিপত্রের সারণি:
- 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.