Information Disseminating Schemes and Their Fault Tolerance in Hypercubes
スポンサーリンク
概要
著者
-
Carlsson Svante
Department Of Computer Science Lund University
-
Igarashi Yoshihide
Department of Computer Science, Gunma University
-
Kanai Kumiko
Department of Computer Science, Gunma University
-
Kanai Kumiko
Department Of Computer Science Gunma University
-
Igarashi Yoshihide
Department Of Computer Science Gunma University
関連論文
- Information Disseminating Schemes and Their Fault Tolerance in Hypercubes
- Optimal Time Broadcasting Schemes in Faulty Star Graphs (Special Section on Discrete Mathematics and Its Applications)
- Reliable Broadcasting and Secure Distributing in Channel Networks(Special Section on Discrete Mathematics and Its Applications)
- Independent Spanning Trees of Product Graphs and Their Construction
- Nonadaptive Fault-Tolerant File Transmission in Rotator Graphs (Special Section on Discrete Mathematics and Its Applications)
- Broadcasting in Hypercubes with Randamly Distributed Byzantine Faults
- Embeddings of Hyper-Rings in Hypercubes
- REMARKS ON REAL-TIME DETERMINISTIC CONTEXT-FREE LANGUAGES(Mathematical Theories on Computing Schemes and Their Applications)
- Roughly Sorting: Sequential and Parallel Approach
- Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model (Special Issue on Selected Papers from LA Symposium)
- Highly Concurrent Group Mutual Exclusion Algorithms Based on Ticket Ordersl(Foundations of Computer Science)
- Construction of Secret Key Exchange Spanning Trees by Random Deals of Cards on Hierarchical Structures (Special Section on Discrete Mathematics and Its Applications)
- Secure Multi-Party Computation over Networks(Special Issue on Algorithm Engineering : Surveys)
- Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
- Roughly Sorting: A Generalization of Sorting