The following pages link to Antonio Fernández Anta (Q282237):
Displaying 40 items.
- Measuring the impact of adversarial errors on packet scheduling strategies (Q282242) (← links)
- An early-stopping protocol for computing aggregate functions in Sensor Networks (Q362558) (← links)
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- (Q631764) (redirect page) (← links)
- The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost (Q631767) (← links)
- Deterministic recurrent communication in restricted sensor networks (Q764337) (← links)
- Maria Serna's contributions to adversarial queuing theory (Q826320) (← links)
- Fair linking mechanisms for resource allocation with correlated player types (Q1698330) (← 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)
- Detecting and classifying outliers in big functional data (Q2103860) (← links)
- Fragmented objects: boosting concurrency of shared large objects (Q2117716) (← links)
- Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions (Q2261582) (← links)
- Novel techniques to speed up the computation of the automorphism group of a graph (Q2336847) (← links)
- Online parallel scheduling of non-uniform tasks: trading failures for energy (Q2348044) (← links)
- Adaptive packet scheduling over a wireless channel under constrained jamming (Q2401762) (← links)
- Performance of scheduling policies in adversarial networks with non-synchronized clocks (Q2429719) (← links)
- Tractable low-delay atomic memory (Q2657276) (← links)
- Brief Announcement (Q2796253) (← links)
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
- Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy (Q2842781) (← links)
- Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism (Q2894474) (← links)
- Energy-Efficient Network Routing with Discrete Cost Functions (Q2898042) (← links)
- Bisection (Band)Width of Product Networks with Application to Data Centers (Q2898058) (← links)
- CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS (Q3084678) (← links)
- Unbounded Contention Resolution in Multiple-Access Channels (Q3095329) (← links)
- (Q3174960) (← links)
- Adaptive Scheduling Over a Wireless Channel Under Constrained Jamming (Q3467851) (← 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)
- Superintelligence Cannot be Contained: Lessons from Computability Theory (Q5145835) (← links)
- Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing (Q5268367) (← links)
- Routing and scheduling for energy and delay minimization in the powerdown model (Q5326790) (← links)
- (Q5363810) (← links)
- (Q5403057) (← links)
- Brief announcement (Q5891979) (← links)
- Multivariate functional outlier detection using the fast massive unsupervised outlier detection indices (Q6548811) (← links)
- A sizable fraction of workers provides hasty, wrong answers in crowd-sourced tasks (Q6700866) (← links)
