The following pages link to Miguel A. Mosteiro (Q362556):
Displaying 37 items.
- An early-stopping protocol for computing aggregate functions in Sensor Networks (Q362558) (← links)
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- Initializing sensor networks of non-uniform density in the weak sensor model (Q494934) (← links)
- Station assignment with reallocation (Q666668) (← links)
- Deterministic recurrent communication in restricted sensor networks (Q764337) (← links)
- INSERTION SORT is \(O(n \log n)\) (Q864951) (← links)
- A faster exact-counting protocol for anonymous dynamic networks (Q1755728) (← links)
- Station assignment with applications to sensing (Q1796433) (← links)
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (Q1938370) (← links)
- Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound) (Q1939254) (← links)
- Crowd computing as a cooperation problem: An evolutionary approach (Q1953122) (← links)
- Information dissemination in wireless ad-hoc networks under the weighted-TIM framework (Q2067613) (← links)
- Polynomial anonymous dynamic distributed computing without a unique leader (Q2237890) (← links)
- Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions (Q2261582) (← links)
- Fault-tolerant aggregation: flow-updating meets mass-distribution (Q2401680) (← links)
- Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism (Q2894474) (← links)
- Bootstrapping a hop-optimal network in the weak sensor model (Q2930263) (← links)
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS (Q3084678) (← links)
- Unbounded Contention Resolution in Multiple-Access Channels (Q3095329) (← links)
- Lower Bounds for Clear Transmissions in Radio Networks (Q3525780) (← links)
- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks (Q3578338) (← links)
- Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony (Q3588315) (← links)
- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model (Q3603558) (← links)
- (Q4580194) (← links)
- Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations (Q5002846) (← links)
- Polynomial anonymous dynamic distributed computing without a unique leader (Q5092352) (← links)
- Dynamic Windows Scheduling with Reallocation (Q5102055) (← links)
- Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations (Q5133967) (← links)
- Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing (Q5268367) (← links)
- (Q5363819) (← links)
- Sensor Network Gossiping or How to Break the Broadcast Lower Bound (Q5387760) (← links)
- (Q5403057) (← links)
- Algorithms – ESA 2005 (Q5475890) (← links)
- Brief announcement (Q5891979) (← links)
- Correction to: ``Dynamic multiple-message broadcast: bounding throughput in the affectance model'' (Q6056635) (← links)
- Dynamic multiple-message broadcast: bounding throughput in the affectance model (Q6174655) (← links)
- Verifiable crowd computing: coping with bounded rationality (Q6558636) (← links)
