Parallel algorithms and architectures : international workshop, Suhl, GDR, May 25-30, 1987 : proceedings
সংরক্ষণ করুন:
| সংস্থা লেখক: | |
|---|---|
| অন্যান্য লেখক: | , , |
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science
269 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | 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: | • Parallel algorithms and architectures, international workshop, Suhl, GDR, May 25-30, 1987, proceedings, A. Albrecht, H. Jung, K. Mehlhorn, eds, Berlin, Springer-Verlag, 1987, 1 vol. (205 p.), Lecture notes in computer science, 3-540-18099-0 • Parallel Algorithms and Architectures, Texte imprimé, 9783662166284 |
সূচিপত্রের সারণি:
- Deterministic simulation of idealized parallel computers on more realistic ones
- Convex hull of randomly chosen points from a polytope
- Dataflow computing
- Parallel in sequence Towards the architecture of an elementary cortical processor
- Parallel algorithms and static analysis of parallel programs
- Parallel processing of combinatorial search trees
- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem
- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
- RELACS A recursive layout computing system
- Parallel linear conflict-tree subtree access
- A formal definition for systolic systems
- Parallel recognition of outerplanar graphs
- Solutions for the distributed termination problem
- Memories for parallel subtree-access
- Synapse: A multi-microprocessor lisp machine with parallel garbage collector
- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
- Optimal parallel parsing of bracket languages
- On reliable networks from unreliable gates
- Area-time tradeoffs for selection
- Optimization of special permutation networks using simple algebraic relations
- Computing a rectilinear steiner minimal tree in