The following pages link to Robert Elsässer (Q391756):
Displaying 21 items.
- Randomised broadcasting: memory vs. randomness (Q391757) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- (Q838153) (redirect page) (← links)
- On the runtime and robustness of randomized broadcasting (Q838155) (← links)
- Agent-based randomized broadcasting in large networks (Q867856) (← links)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity (Q896861) (← links)
- On randomized broadcasting in star graphs (Q1003763) (← links)
- On \(k\)-partitioning of Hamming graphs (Q1302152) (← links)
- An edge-isoperimetric problem for powers of the Petersen graph (Q1575084) (← links)
- Fast consensus for voting on general expander graphs (Q1664139) (← links)
- Diffusion schemes for load balancing on heterogeneous networks (Q1849576) (← links)
- On spectral bounds for the \(k\)-partitioning of graphs (Q1879186) (← links)
- Edge-isoperimetric problems for Cartesian powers of regular graphs (Q1885043) (← links)
- Sparse topologies with small spectrum size (Q1885049) (← links)
- The spider poset is Macaulay (Q1976317) (← links)
- Time-space trade-offs in population protocols for the majority problem (Q2025852) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States (Q5090899) (← links)
- Distributing Unit Size Workload Packages in Heterogeneous Networks (Q5301381) (← links)
- Cover Time and Broadcast Time (Q5389992) (← links)
