PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Parallel and Distributed Computing with Coevolutionary Algorithms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A parallel implementation of an asynchronous team to the point-to-point connection problem
Parallel Computing - Special issue: Parallel computing in numerical optimization
On reducing the complexity of matrix clocks
Parallel Computing
A distributed algorithm to find k-dominating sets
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Graph traversal and graph transformation
Theoretical Computer Science
Local Leader Election, Signal Strength Aware Flooding, and Routeless Routing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Encyclopedia of Computer Science
Local heuristics and the emergence of spanning subgraphs in complex networks
Theoretical Computer Science - Complex networks
Cell-centric heuristics for the classification of cellular automata
Parallel Computing
Finding routes in anonymous sensor networks
Information Processing Letters
Sharing Variables in Distributed Memory
Fundamenta Informaticae
Universal Semi-local Election Protocol Using Forward Links
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Probabilistic heuristics for disseminating information in networks
IEEE/ACM Transactions on Networking (TON)
Modal Expressiveness of Graph Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Multiphase intrusion detection and revocation system for wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Randomized generation of acyclic orientations upon anonymous distributed systems
Journal of Parallel and Distributed Computing
A Logical Approach to Hamiltonian Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
M-DPOP: faithful distributed implementation of efficient social choice problems
Journal of Artificial Intelligence Research
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Implementing endogenous and exogenous connectors with the common component architecture
Proceedings of the 2009 Workshop on Component-Based High Performance Computing
Finding routes in anonymous sensor networks
Information Processing Letters
A distributed dynamics for webgraph decontamination
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Autonomous Agents and Multi-Agent Systems
Hybrid logics and NP graph properties
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
A distributed preflow-push for the maximum flow problem
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Scheduling links for heavy traffic on interfering routes in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic distributed backjumping
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Efficient subgraph matching on billion node graphs
Proceedings of the VLDB Endowment
Universal Semi-local Election Protocol Using Forward Links
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Sharing Variables in Distributed Memory
Fundamenta Informaticae
New Trends in Parallel and Distributed Evolutionary Computing
Fundamenta Informaticae
| Hi-index | 0.00 |
A senior undergraduate or graduate level computer science textbook on algorithm design for distributed computer systems.