( en | de | ru )

 

Disambiguation of "Anta, Antonio Fernández"

Author of the publication

copydeleteadd this publication to your clipboard
Empirical Comparison of Graph-based Recommendation Engines for an Apps Ecosystem.

, , , , , , , and . Int. J. Interact. Multim. Artif. Intell., 3 (2): 33-39 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Antonio Fernández

Pedro Antonio Hernández Fernández

Bárbara Fernández Fernández

Fernando Fernández

Victoria Fernández

 

Other publications of authors with the same name

Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics., , , , and . Euro-Par, volume 7484 of Lecture Notes in Computer Science, page 451-463. Springer, (2012)Tales from the Porn: A Comprehensive Privacy Analysis of the Web Porn Ecosystem., , , , and . Internet Measurement Conference, page 245-258. ACM, (2019)Self-managed topologies in P2P networks., , , and . Comput. Networks, 53 (10): 1722-1736 (2009)Performance of random walks in one-hop replication networks., , , and . Comput. Networks, 54 (5): 781-796 (2010)Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentation., , , and . Future Gener. Comput. Syst., (2018)An early-stopping protocol for computing aggregate functions in Sensor Networks., , and . J. Parallel Distributed Comput., 73 (2): 111-121 (2013)Applying the dynamics of evolution to achieve reliability in master-worker computing., , , , and . Concurr. Comput. Pract. Exp., 25 (17): 2363-2380 (2013)Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony., , , and . Distributed Comput., 25 (4): 279-296 (2012)Tractable low-delay atomic memory., , , , and . Distributed Comput., 34 (1): 33-58 (2021)Unbounded Contention Resolution in Multiple-Access Channels., , and . Algorithmica, 67 (3): 295-314 (2013)