Pages that link to "Item:Q5308444"
From MaRDI portal
The following pages link to Foundations of Software Science and Computation Structures (Q5308444):
Displaying 12 items.
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Locally guided randomized elections in trees: The totally fair case (Q1775889) (← links)
- Election in partially anonymous networks with arbitrary knowledge in message passing systems (Q1938371) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (Q3540388) (← links)
- Graph Transformations (Q5292599) (← links)
- Experimental and Efficient Algorithms (Q5710027) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711520) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)