Person:282237: Difference between revisions

From MaRDI portal
Person:282237
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Antonio Fernández Anta to Antonio Fernández Anta: Duplicate
 
(No difference)

Latest revision as of 14:02, 10 December 2023

Available identifiers

zbMath Open fernandez-anta.antonioDBLPf/AntonioFernandezAntaWikidataQ59684328 ScholiaQ59684328MaRDI QIDQ282237

List of research outcomes





PublicationDate of PublicationType
Multivariate functional outlier detection using the fast massive unsupervised outlier detection indices2024-06-03Paper
Detecting and classifying outliers in big functional data2022-12-09Paper
Fragmented objects: boosting concurrency of shared large objects2022-03-22Paper
Maria Serna's contributions to adversarial queuing theory2021-12-20Paper
Tractable low-delay atomic memory2021-03-12Paper
Superintelligence Cannot be Contained: Lessons from Computability Theory2021-01-22Paper
A sizable fraction of workers provides hasty, wrong answers in crowd-sourced tasks2019-11-20Dataset
Novel techniques to speed up the computation of the automorphism group of a graph2019-11-19Paper
Station assignment with applications to sensing2018-10-17Paper
https://portal.mardi4nfdi.de/entity/Q31749602018-07-18Paper
Fair linking mechanisms for resource allocation with correlated player types2018-02-15Paper
https://portal.mardi4nfdi.de/entity/Q53638102017-09-29Paper
Adaptive packet scheduling over a wireless channel under constrained jamming2017-09-05Paper
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing2017-06-20Paper
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model2016-09-02Paper
Measuring the impact of adversarial errors on packet scheduling strategies2016-05-12Paper
Brief Announcement2016-03-23Paper
Adaptive Scheduling Over a Wireless Channel Under Constrained Jamming2016-02-05Paper
Online parallel scheduling of non-uniform tasks: trading failures for energy2015-06-10Paper
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions2015-03-06Paper
Brief announcement2014-12-05Paper
https://portal.mardi4nfdi.de/entity/Q54030572014-03-25Paper
Measuring the impact of adversarial errors on packet scheduling strategies2013-12-17Paper
Unbounded contention resolution in multiple-access channels2013-11-11Paper
An early-stopping protocol for computing aggregate functions in Sensor Networks2013-08-22Paper
Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy2013-08-16Paper
Routing and scheduling for energy and delay minimization in the powerdown model2013-08-06Paper
Crowd computing as a cooperation problem: An evolutionary approach2013-06-07Paper
Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)2013-03-04Paper
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony2013-02-04Paper
Energy-Efficient Network Routing with Discrete Cost Functions2012-07-16Paper
Bisection (Band)Width of Product Networks with Application to Data Centers2012-07-16Paper
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism2012-06-29Paper
Deterministic recurrent communication in restricted sensor networks2012-03-13Paper
Unbounded Contention Resolution in Multiple-Access Channels2011-10-28Paper
Performance of scheduling policies in adversarial networks with non-synchronized clocks2011-04-01Paper
CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS2011-03-25Paper
The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost2011-03-14Paper
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony2010-09-10Paper
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks2010-07-20Paper

Research outcomes over time

This page was built for person: Antonio Fernández Anta