Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Gossip-based aggregation in large dynamic networks
2005414 citationsMárk Jelasity, Alberto Montresor et al.profile →
This map shows the geographic impact of Márk Jelasity's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Márk Jelasity with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Márk Jelasity more than expected).
This network shows the impact of papers produced by Márk Jelasity. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Márk Jelasity. The network helps show where Márk Jelasity may publish in the future.
Co-authorship network of co-authors of Márk Jelasity
This figure shows the co-authorship network connecting the top 25 collaborators of Márk Jelasity.
A scholar is included among the top collaborators of Márk Jelasity based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Márk Jelasity. Márk Jelasity is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Bánhelyi, Balázs, et al.. (2021). Fooling a Complete Neural Network Verifier. SZTE Publicatio Repozitórium (University of Szeged).2 indexed citations
2.
Hegedűs, István, et al.. (2020). Attacking Model Sets with Adversarial Examples.. SZTE Publicatio Repozitórium (University of Szeged). 1–6.1 indexed citations
3.
Hegedűs, István & Márk Jelasity. (2017). Differentially Private Linear Models for Gossip Learning through Data Perturbation. SZTE Publicatio Repozitórium (University of Szeged). 3(1). 62–74.1 indexed citations
4.
Hegedűs, István, et al.. (2016). Robust Decentralized Differentially Private Stochastic Gradient Descent. SZTE Publicatio Repozitórium (University of Szeged).3 indexed citations
5.
Szörényi, Balázs, Róbert Busa‐Fekete, István Hegedűs, et al.. (2013). Gossip-based distributed stochastic bandit algorithms. SPIRE - Sciences Po Institutional REpository. 28. 19–27.22 indexed citations
Hegedűs, István, Róbert Ormándi, Richárd Farkas, & Márk Jelasity. (2010). Novel balanced feature representation for wikipedia vandalism detection task: Lab report for PAN at CLEF 2010.1 indexed citations
Babaoğlu, Özalp, Geoffrey Canright, Andreas Deutsch, et al.. (2005). Design Patterns from Biology for Distributed Computing. Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna). 1. 1–27.20 indexed citations
11.
Babaoğlu, Özalp, Márk Jelasity, & Alberto Montresor. (2005). Grassroots approach to self-management in large-scale distributed systems. Lecture notes in computer science. 3566. 286–296.12 indexed citations
Babaoğlu, Özalp, Márk Jelasity, Alberto Montresor, et al.. (2005). Self-star Properties in Complex Information Systems: Conceptual and Practical Foundations (Lecture Notes in Computer Science). Springer eBooks.7 indexed citations
14.
Jelasity, Márk, et al.. (2005). Engineering Emergence through Gossip.4 indexed citations
15.
Maniezzo, Vittorio, Marco Antonio Boschetti, & Márk Jelasity. (2004). An ant approach to membership overlay design ? Results on the dynamic global setting. Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna). 37–48.2 indexed citations
Jelasity, Márk & Mike Preuß. (2002). On Obtaining Global Information in a Peer-to-Peer Fully Distributed Environment (Research Note). 573–577.3 indexed citations
Jelasity, Márk. (1997). A Wave Analysis of the Subset Sum Problem.. 89–96.8 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.