Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
The algebraic eigenvalue problem
The algebraic eigenvalue problem
Spreading rumors rapidly despite an adversary
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Cooperative sharing and asynchronous consensus using single-reader single-writer registers
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Neighborhood Information Dissemination in the Star Graph
IEEE Transactions on Computers
Fast distributed graph coloring with O(&Dgr;) colors
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Discrete Mathematics
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Network Communication in Edge-Colored Graphs: Gossiping
IEEE Transactions on Parallel and Distributed Systems
Lower Bounds on Systolic Gossip
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Distributed coloring and communication in rings with local knowledge
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Gossiping in the Multicasting Communication Environment
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Deterministic Broadcasting Time with Partial Knowledge of the Network
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Recognizing Bipartite Incident-Graphs of Circulant Digraphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Deterministic broadcasting time with partial knowledge of the network
Theoretical Computer Science
An Efficient Algorithm for Gossiping in the Multicasting Communication Environment
IEEE Transactions on Parallel and Distributed Systems
Gossiping and broadcasting versus computing functions in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Distributed Colouring and Communication in Rings with Local Knowledge
Combinatorics, Probability and Computing
Lower bounds on systolic gossip
Information and Computation
Discrete Applied Mathematics
Deterministic Models of Communication Faults
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Note: A note on the lower bound of centralized radio broadcasting for planar reachability graphs
Discrete Applied Mathematics
Lower bounds on systolic gossip
Information and Computation
When agents communicate hypotheses in critical situations
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.01 |