236 results on '"Petra Berenbrink"'
Search Results
2. Not all scale-free networks are born equal: the role of the seed graph in PPI network evolution.
3. Dynamic Averaging Load Balancing on Arbitrary Graphs.
4. Distributed Averaging in Opinion Dynamics.
5. Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model.
6. Inference of a rumor's source in the independent cascade model.
7. Undecided State Dynamics with Stubborn Agents.
8. Population Protocols for Exact Plurality Consensus - How a small chance of failure helps to eliminate insignificant opinions.
9. Loosely-Stabilizing Phase Clocks and The Adaptive Majority Problem.
10. Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions.
11. On the Optimality of the Greedy Garbage Collection Strategy for SSDs.
12. Asynchronous Opinion Dynamics in Social Networks.
13. On the Hierarchy of Distributed Majority Protocols.
14. On early extinction and the effect of travelling in the SIR model.
15. Fast Consensus via the Unconstrained Undecided State Dynamics.
16. Infinite Balanced Allocation via Finite Capacities.
17. Optimal time and space leader election in population protocols.
18. Simulating Population Protocols in Sub-Constant Time per Interaction.
19. Randomized renaming in shared memory systems.
20. Time-space trade-offs in population protocols for the majority problem.
21. Distributed Averaging in Population Protocols.
22. Inference of a Rumor's Source in the Independent Cascade Model.
23. Tight & Simple Load Balancing.
24. On Counting the Population Size.
25. Brief Announcement: Optimal Time and Space Leader Election in Population Protocols.
26. A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States.
27. Simple and Efficient Leader Election.
28. Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs.
29. Fast Consensus via the Unconstrained Undecided State Dynamics.
30. Self-Stabilizing Phase Clocks and the Adaptive Majority Problem.
31. Improved Analysis of Deterministic Load-Balancing Schemes.
32. Tight Load Balancing Via Randomized Local Search.
33. Ignore or Comply?: On Breaking Symmetry in Consensus.
34. Threshold load balancing with weighted tasks.
35. Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins.
36. Bounds on the Voter Model in Dynamic Networks.
37. Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time.
38. Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing.
39. Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract].
40. Threshold Load Balancing with Weighted Tasks.
41. Randomized Renaming in Shared Memory Systems.
42. Improved Analysis of Deterministic Load-Balancing Schemes.
43. Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion.
44. Introduction to the Special Issue for SPAA 2019.
45. Dynamic Averaging Load Balancing on Arbitrary Graphs
46. LIPIcs, Volume 254, STACS 2023, Complete Volume
47. Front Matter, Table of Contents, Preface, Conference Organization
48. On the Hierarchy of Distributed Majority Protocols
49. A simple approach for adapting continuous load balancing processes to discrete settings.
50. Concurrent imitation dynamics in congestion games.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.