The following pages link to Bernard Mans (Q287122):
Displaying 44 items.
- On the impact of sense of direction on message complexity (Q287123) (← links)
- Random walks, bisections and gossiping in circulant graphs (Q486995) (← links)
- Incremental problems in the parameterized complexity setting (Q519883) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Functional graphs of polynomials over finite fields (Q895996) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Optimal coteries and voting schemes (Q1328755) (← links)
- Optimal distributed algorithms in unlabeled tori and chordal rings (Q1384522) (← links)
- On the spectral Ádám property for circulant graphs (Q1613548) (← links)
- Efficient trigger-broadcasting in heterogeneous clusters (Q1779733) (← links)
- Sense of direction in distributed computing (Q1870525) (← links)
- Performances of parallel branch and bound algorithms with best-first search (Q1917301) (← links)
- On the exploration of time-varying networks (Q1935801) (← links)
- A note on the Ádám conjecture for double loops. (Q2583552) (← links)
- (Q2753924) (← links)
- Random Walks and Bisections in Random Circulant Graphs (Q2894496) (← links)
- Shortest, Fastest, and Foremost Broadcast in Dynamic Networks (Q2947805) (← links)
- On the Throughput-Delay Tradeoff in Georouting Networks (Q2976773) (← links)
- Network Exploration by Silent and Oblivious Robots (Q3057626) (← links)
- Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility (Q3163877) (← links)
- Distributed Disaster Disclosure (Q3512463) (← links)
- Tree Decontamination with Temporary Immunity (Q3596730) (← links)
- Exploration of Periodically Varying Graphs (Q3652241) (← links)
- (Q3838397) (← links)
- Portable distributed priority queues with MPI (Q4208612) (← links)
- (Q4218427) (← links)
- Sense of direction: Definitions, properties, and classes (Q4540074) (← links)
- Optimal elections in faulty loop networks and applications (Q4571453) (← links)
- (Q4764005) (← links)
- (Q4764007) (← links)
- On the Treewidth of Dynamic Graphs (Q4925251) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (extended abstract) (Q5176767) (← links)
- On Functional Graphs of Quadratic Polynomials (Q5228846) (← links)
- Measuring Temporal Lags in Delay-Tolerant Networks (Q5268324) (← links)
- Highway Vehicular Delay Tolerant Networks: Information Propagation Speed Properties (Q5272064) (← links)
- Information Propagation Speed in Mobile and Delay Tolerant Networks (Q5281257) (← links)
- AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE (Q5315922) (← links)
- Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks (Q5855244) (← links)
- LATIN 2004: Theoretical Informatics (Q5901677) (← links)
- Functional graphs of families of quadratic polynomials (Q6045332) (← links)
- Balanced allocation on dynamic hypergraphs (Q6084354) (← links)
- (Q6128602) (← links)
- Balanced allocation on hypergraphs (Q6133644) (← links)
