The following pages link to Chen Avin (Q360262):
Displayed 46 items.
- (Q402385) (redirect page) (← links)
- Testing the irreducibility of nonsquare Perron-Frobenius systems (Q402391) (← links)
- A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model (Q714763) (← links)
- Online balanced repartitioning (Q1660940) (← links)
- Information spreading in dynamic networks under oblivious adversaries (Q1660948) (← links)
- rDAN: toward robust demand-aware network designs (Q1705692) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- Dynamically optimal self-adjusting single-source tree networks (Q2081610) (← links)
- Mixed preferential attachment model: homophily and minorities in social networks (Q2139688) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
- Self-adjusting linear networks (Q2303298) (← links)
- Self-adjusting grid networks to minimize expected path length (Q2345461) (← links)
- On the cover time and mixing time of random geometric graphs (Q2373731) (← links)
- The power of choice in random walks: An empirical study (Q2464885) (← links)
- Hotelling games in fault-prone settings (Q2672575) (← links)
- Self-adjusting Grid Networks to Minimize Expected Path Length (Q2868630) (← links)
- Faster Rumor Spreading: Breaking the logn Barrier (Q2920965) (← links)
- Bounds for algebraic gossip on graphs (Q2925522) (← links)
- Homophily and the Glass Ceiling Effect in Social Networks (Q2989013) (← links)
- Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs (Q3400883) (← links)
- Core Size and Densification in Preferential Attachment Networks (Q3449499) (← links)
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) (Q3521913) (← links)
- On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources (Q3639260) (← links)
- Cover time and mixing time of random walks on dynamic graphs (Q4584911) (← links)
- Assortative Mixing Equilibria in Social Network Games (Q4588251) (← links)
- (Q4798018) (← links)
- (Q5072475) (← links)
- (Q5072479) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
- Distributed Computing on Core-Periphery Networks: Axiom-Based Design (Q5167855) (← links)
- SINR diagrams (Q5170317) (← links)
- Many Random Walks Are Faster Than One (Q5199503) (← links)
- (Q5321550) (← links)
- SINR Diagrams (Q5395688) (← links)
- (Q5428934) (← links)
- Automata, Languages and Programming (Q5716818) (← links)
- Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications (Q5741743) (← links)
- (Q5743416) (← links)
- Order optimal information spreading using algebraic gossip (Q5891123) (← links)
- Order optimal information spreading using algebraic gossip (Q5892124) (← links)
- Self-adjusting grid networks (Q6044463) (← links)
- (Q6161055) (← links)
- (Q6161061) (← links)
- (Q6190873) (← links)
- (Q6190880) (← links)