The following pages link to Andréa W. Richa (Q529027):
Displaying 39 items.
- (Q360272) (redirect page) (← links)
- (Q1293913) (redirect page) (← links)
- Competitive throughput in multi-hop wireless networks despite adaptive jamming (Q360275) (← links)
- Universal coating for programmable matter (Q529029) (← links)
- Accessing nearby copies of replicated objects in a distributed environment (Q1293914) (← links)
- Sade: competitive MAC under adversarial SINR (Q1635833) (← links)
- A stochastic approach to shortcut bridging in programmable matter (Q1694423) (← links)
- Collaborative computation in self-organizing particle systems (Q1799376) (← links)
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules (Q1964594) (← links)
- A note on the parallel runtime of self-stabilizing graph linearization (Q2254491) (← links)
- Simulation of programmable matter systems using active tile-based self-assembly (Q2278616) (← links)
- On the Runtime of Universal Coating for Programmable Matter (Q2835712) (← links)
- Competitive and fair throughput for co-existing networks under adversarial interference (Q2933804) (← links)
- A jamming-resistant MAC protocol for single-hop wireless networks (Q2934331) (← links)
- (Q2934685) (← links)
- Leader Election and Shape Formation with Self-organizing Programmable Matter (Q2948412) (← links)
- (Q3044346) (← links)
- On Sampling in Higher-Dimensional Peer-to-Peer Systems (Q3525797) (← links)
- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension (Q3540244) (← links)
- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization (Q3557028) (← links)
- A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks (Q3588303) (← links)
- A Tight Lower Bound for the Steiner Point Removal Problem on Trees (Q3595405) (← links)
- (Q4542556) (← links)
- (Q4788604) (← links)
- Principles of Robust Medium Access and an Application to Leader Election (Q4962158) (← links)
- Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension (Q4962603) (← links)
- Improved Leader Election for Self-organizing Programmable Matter (Q5056058) (← links)
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs (Q5170310) (← links)
- Broadcasting in unreliable radio networks (Q5176210) (← links)
- Optimal-stretch name-independent compact routing in doubling metrics (Q5177281) (← links)
- Brief Announcement (Q5197716) (← links)
- Linearization: Locally Self-Stabilizing Sorting in Graphs (Q5233496) (← links)
- A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems (Q5361946) (← links)
- Compact routing with slack in low doubling dimension (Q5401395) (← links)
- SKIP <sup>+</sup> (Q5501939) (← links)
- (Q5875513) (← links)
- (Q6083383) (← links)
- The canonical amoebot model: algorithms and concurrency control (Q6099032) (← links)
- A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems (Q6301482) (← links)
- Adaptive collective responses to local stimuli in anonymous dynamic networks (Q6652447) (← links)
