35 results on '"Fred S. Annexstein"'
Search Results
2. Synthesis ranking with critic resonance.
3. Depth-Latency Tradeoffs in Multicast Tree Algorithms.
4. Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet.
5. Dominating Connectivity and Reliability of Heterogeneous Sensor Networks.
6. Indexing techniques for file sharing in scalable peer-to-peer networks.
7. Latency effects on reachability in large-scale peer-to-peer networks.
8. Distributed Models and Algorithms for Survivability in Network Routing.
9. On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings.
10. An Empirical Study of 'Lazy' Protocols for Routing Information in Dynamic Networks.
11. A Multi-Tree Generating Routing Scheme Using Acyclic Orientations.
12. Broadcasting in unstructured peer-to-peer overlay networks.
13. On Testing Consecutive-Ones Property in Parallel.
14. A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs.
15. Ranking algorithms for Hamiltonian paths in hypercubic networks.
16. Parallel Implementations of Graph Embeddings.
17. SIMD-emulations of hypercubes and related networks.
18. A Unified Approach to Off-Line Permutation Routing on Parallel Networks.
19. A multi-tree routing scheme using acyclic orientations.
20. Directional Routing via Generalized st-Numberings.
21. Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service.
22. On Testing Consecutive-ones Property in Parallel.
23. A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities.
24. Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram.
25. On Finding Solutions for Extended Horn Formulas.
26. Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays.
27. On the Diameter and Bisector Size of Cayley Graphs.
28. Collaborative partitioning with maximum user satisfaction.
29. Fault tolerance in hypercube-derivative networks (preliminary version).
30. A Unified Framework for Off-Line Permutation Routing in Parallel Networks.
31. Group Action Graphs and Parallel Architectures.
32. Generating De Bruijn Sequences: An Efficient Implementation.
33. The lonely NATed node.
34. Fault Tolerance in Hypercube-Derivative Networks.
35. Achieving multigauge behavior in bit-serial SIMD architectures via emulation
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.