default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMárk Jelasity
Person information
- affiliation: University of Szeged, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i4]Levente Halmosi, Bálint Mohos, Márk Jelasity:
Evaluating the Adversarial Robustness of Semantic Segmentation: Trying Harder Pays Off. CoRR abs/2407.09150 (2024)- 2023
- [c73]Gábor Danner
, István Hegedüs, Márk Jelasity:
Improving Gossip Learning via Limited Model Merging. ICCCI (CCIS Volume) 2023: 351-363 - [c72]András Balogh, Márk Jelasity:
On the Functional Similarity of Robust and Non-Robust Neural Representations. ICML 2023: 1614-1635 - [i3]Levente Halmosi, Márk Jelasity:
On Evaluating the Adversarial Robustness of Semantic Segmentation Models. CoRR abs/2306.14217 (2023) - 2022
- [c71]Árpád Berta, Gábor Danner, István Hegedüs, Márk Jelasity:
Hiding Needles in a Haystack: Towards Constructing Neural Networks that Evade Verification. IH&MMSec 2022: 51-62 - 2021
- [j24]István Hegedüs, Gábor Danner, Márk Jelasity:
Decentralized learning works: An empirical comparison of gossip learning and federated learning. J. Parallel Distributed Comput. 148: 109-124 (2021) - [c70]Dániel Zombori, Balázs Bánhelyi, Tibor Csendes, István Megyeri, Márk Jelasity:
Fooling a Complete Neural Network Verifier. ICLR 2021 - [c69]István Megyeri, István Hegedüs, Márk Jelasity:
Robust Classification Combined with Robust out-of-Distribution Detection: An Empirical Analysis. IJCNN 2021: 1-8 - 2020
- [c68]István Megyeri, István Hegedüs, Márk Jelasity:
Attacking Model Sets with Adversarial Examples. ESANN 2020: 1-6 - [c67]István Megyeri, István Hegedüs, Márk Jelasity:
Adversarial Robustness of Model Sets. IJCNN 2020: 1-8 - [c66]Gábor Danner, István Hegedüs, Márk Jelasity:
Decentralized machine learning using compressed push-pull averaging. DICG@Middleware 2020: 31-36 - [c65]Árpád Berta, Zoltán Szabó, Márk Jelasity:
Modeling Peer-to-Peer Connections over a Smartphone Network. DICG@Middleware 2020: 43-48
2010 – 2019
- 2019
- [j23]Edward Tremel, Ken Birman, Robert Kleinberg, Márk Jelasity:
Anonymous, Fault-Tolerant Distributed Queries for Smart Devices. ACM Trans. Cyber Phys. Syst. 3(2): 16:1-16:29 (2019) - [c64]István Hegedüs, Gábor Danner, Márk Jelasity:
Gossip Learning as a Decentralized Alternative to Federated Learning. DAIS 2019: 74-90 - [c63]Zoltán Szabó, Krisztián Téglás, Árpád Berta, Márk Jelasity, Vilmos Bilicki:
Stunner: A Smart Phone Trace for Developing Decentralized Edge Systems. DAIS 2019: 108-115 - [c62]István Megyeri, István Hegedüs, Márk Jelasity:
Adversarial robustness of linear models: regularization and dimensionality. ESANN 2019 - [c61]István Hegedüs, Gábor Danner, Márk Jelasity:
Decentralized Recommendation Based on Matrix Factorization: A Comparison of Gossip and Federated Learning. PKDD/ECML Workshops (1) 2019: 317-332 - 2018
- [j22]Gábor Danner, Árpád Berta, István Hegedüs, Márk Jelasity:
Robust Fully Distributed Minibatch Gradient Descent with Privacy Preservation. Secur. Commun. Networks 2018: 6728020:1-6728020:15 (2018) - [c60]Gábor Danner, Márk Jelasity:
Robust Decentralized Mean Estimation with Limited Communication. Euro-Par 2018: 447-461 - [c59]Gábor Danner, Márk Jelasity:
Token Account Algorithms: The Best of the Proactive and Reactive Worlds. ICDCS 2018: 885-895 - 2017
- [j21]István Hegedüs, Márk Jelasity:
Differentially Private Linear Models for Gossip Learning through Data Perturbation. Open J. Internet Things 3(1): 62-74 (2017) - [c58]Árpád Berta, Márk Jelasity:
Decentralized Management of Random Walks over a Mobile Phone Network. PDP 2017: 100-107 - 2016
- [j20]István Hegedüs, Árpád Berta, Márk Jelasity:
Robust Decentralized Differentially Private Stochastic Gradient Descent. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 7(2): 20-40 (2016) - [j19]István Hegedüs, Árpád Berta, Levente Kocsis, András A. Benczúr, Márk Jelasity:
Robust Decentralized Low-Rank Matrix Decomposition. ACM Trans. Intell. Syst. Technol. 7(4): 62:1-62:24 (2016) - [c57]Árpád Berta, István Hegedüs, Márk Jelasity:
Dimension Reduction Methods for Collaborative Mobile Gossip Learning. PDP 2016: 393-397 - [c56]István Hegedüs, Márk Jelasity:
Distributed Differentially Private Stochastic Gradient Descent: An Empirical Study. PDP 2016: 566-573 - [e3]Márk Jelasity, Evangelia Kalyvianaki:
Distributed Applications and Interoperable Systems - 16th IFIP WG 6.1 International Conference, DAIS 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings. Lecture Notes in Computer Science 9687, Springer 2016, ISBN 978-3-319-39576-0 [contents] - 2015
- [j18]Lehel Nyers, Márk Jelasity:
A comparative study of spanning tree and gossip protocols for aggregation. Concurr. Comput. Pract. Exp. 27(16): 4091-4106 (2015) - [j17]Ken Birman, Márk Jelasity, Robert Kleinberg, Edward Tremel:
Building a Secure and Privacy-Preserving Smart Grid. ACM SIGOPS Oper. Syst. Rev. 49(1): 131-136 (2015) - [j16]Fatemeh Rahimian, Amir Hossein Payberah, Sarunas Girdzijauskas, Márk Jelasity, Seif Haridi:
A Distributed Algorithm for Large-Scale Graph Partitioning. ACM Trans. Auton. Adapt. Syst. 10(2): 12:1-12:24 (2015) - [c55]Gábor Danner, Márk Jelasity:
Fully Distributed Privacy Preserving Mini-batch Gradient Descent Learning. DAIS 2015: 30-44 - 2014
- [c54]Lehel Nyers, Márk Jelasity:
Spanning Tree or Gossip for Aggregation: A Comparative Study. Euro-Par 2014: 379-390 - [c53]Márk Jelasity, Kenneth P. Birman:
Distributional differential privacy for large-scale smart metering. IH&MMSec 2014: 141-146 - [c52]Árpád Berta, Vilmos Bilicki, Márk Jelasity:
Defining and understanding smartphone churn over the internet: A measurement study. P2P 2014: 1-5 - [c51]István Hegedüs, Márk Jelasity, Levente Kocsis, András A. Benczúr:
Fully distributed robust singular value decomposition. P2P 2014: 1-9 - 2013
- [j15]István Hegedüs, Róbert Ormándi, Márk Jelasity:
Massively Distributed Concept Drift Handling in Large Networks. Adv. Complex Syst. 16(4-5) (2013) - [j14]Róbert Ormándi, István Hegedüs, Márk Jelasity:
Gossip learning with linear models on fully distributed data. Concurr. Comput. Pract. Exp. 25(4): 556-571 (2013) - [c50]Balázs Szörényi, Róbert Busa-Fekete, István Hegedüs, Róbert Ormándi, Márk Jelasity, Balázs Kégl:
Gossip-based distributed stochastic bandit algorithms. ICML (3) 2013: 19-27 - [c49]Roberto Roverso, Jim Dowling, Márk Jelasity:
Through the wormhole: Low cost, fresh peer sampling for the Internet. P2P 2013: 1-10 - [c48]Fatemeh Rahimian, Amir Hossein Payberah, Sarunas Girdzijauskas, Márk Jelasity, Seif Haridi:
JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning. SASO 2013: 51-60 - 2012
- [j13]J. A. M. Naranjo, Leocadio G. Casado, Márk Jelasity:
Asynchronous privacy-preserving iterative computation on peer-to-peer networks. Computing 94(8-10): 763-782 (2012) - [c47]István Hegedüs, Róbert Busa-Fekete, Róbert Ormándi, Márk Jelasity, Balázs Kégl:
Peer-to-Peer Multi-class Boosting. Euro-Par 2012: 389-400 - [c46]István Hegedüs, Róbert Ormándi, Márk Jelasity:
Gossip-Based Learning under Drifting Concepts in Fully Distributed Networks. SASO 2012: 79-88 - 2011
- [j12]Márk Jelasity, Vilmos Bilicki:
Scalable Stealth Mode P2P Overlays of Very Small Constant Degree. ACM Trans. Auton. Adapt. Syst. 6(4): 27:1-27:20 (2011) - [c45]Róbert Ormándi, István Hegedüs, Márk Jelasity:
Asynchronous Peer-to-Peer Data Mining with Stochastic Gradient Descent. Euro-Par (1) 2011: 528-540 - [c44]Kornel Csernai, Márk Jelasity, Johan A. Pouwelse, Tamás Vinkó:
Modeling Unconnectable Peers in Private BitTorrent Communities. PDP 2011: 582-589 - [c43]Márk Jelasity, Vilmos Bilicki, Miklos Kasza:
Modeling Network-Level Impacts of P2P Flows. PDP 2011: 590-594 - [p1]Márk Jelasity:
Gossip. Self-organising Software 2011: 139-162 - [i2]Róbert Ormándi, István Hegedüs, Márk Jelasity:
Efficient P2P Ensemble Learning with Linear Models on Fully Distributed Data. CoRR abs/1109.1396 (2011) - 2010
- [c42]István Hegedüs, Róbert Ormándi, Richárd Farkas, Márk Jelasity:
Novel Balanced Feature Representation for Wikipedia Vandalism Detection Task - Lab Report for PAN at CLEF 2010. CLEF (Notebook Papers/LABs/Workshops) 2010 - [c41]Róbert Ormándi, István Hegedüs, Márk Jelasity:
Overlay Management for Fully Distributed User-Based Collaborative Filtering. Euro-Par (1) 2010: 446-457 - [c40]Róbert Ormándi, István Hegedüs, Kornel Csernai, Márk Jelasity:
Towards Inferring Ratings from User Behavior in BitTorrent Communities. WETICE 2010: 217-222
2000 – 2009
- 2009
- [j11]Márk Jelasity, Alberto Montresor, Özalp Babaoglu:
T-Man: Gossip-based fast overlay topology construction. Comput. Networks 53(13): 2321-2339 (2009) - [c39]Norbert Tölgyesi, Márk Jelasity:
Adaptive Peer Sampling with Newscast. Euro-Par 2009: 523-534 - [c38]Balázs Bánhelyi, Marco Biazzini, Alberto Montresor, Márk Jelasity:
Peer-to-Peer Optimization in Large Unreliable Networks with Branch-and-Bound and Particle Swarms. EvoWorkshops 2009: 87-92 - [c37]Marco Biazzini, Balázs Bánhelyi, Alberto Montresor, Márk Jelasity:
Distributed hyper-heuristics for real parameter optimization. GECCO 2009: 1339-1346 - [c36]Márk Jelasity, Vilmos Bilicki:
Towards Automated Detection of Peer-to-Peer Botnets: On the Limits of Local Approaches. LEET 2009 - [c35]Alberto Montresor, Márk Jelasity:
PeerSim: A Scalable P2P Simulator. Peer-to-Peer Computing 2009: 99-100 - [c34]Márk Jelasity, Vilmos Bilicki:
Scalable P2P Overlays of Very Small Constant Degree: An Emerging Security Threat. SSS 2009: 399-412 - 2008
- [c33]Dick H. J. Epema, Márk Jelasity, Josep Jorba, Alberto Montresor:
Topic 7: Peer-to-Peer Computing. Euro-Par 2008: 599-600 - [c32]Alberto Montresor, Márk Jelasity, Özalp Babaoglu:
Decentralized Ranking in Large-Scale Overlay Networks. SASO Workshops 2008: 208-213 - 2007
- [j10]Paolo Costa, Vincent Gramoli, Márk Jelasity, Gian Paolo Jesi, Erwan Le Merrer, Alberto Montresor, Leonardo Querzoni:
Exploring the interdisciplinary connections of gossip-based systems. ACM SIGOPS Oper. Syst. Rev. 41(5): 51-60 (2007) - [j9]Márk Jelasity, Spyros Voulgaris, Rachid Guerraoui, Anne-Marie Kermarrec, Maarten van Steen:
Gossip-based peer sampling. ACM Trans. Comput. Syst. 25(3): 8 (2007) - [c31]Márk Jelasity, Geoffrey Canright, Kenth Engø-Monsen:
Asynchronous Distributed Power Iteration with Gossip-Based Normalization. Euro-Par 2007: 514-525 - [c30]Özalp Babaoglu, Toni Binci, Márk Jelasity, Alberto Montresor:
Firefly-inspired Heartbeat Synchronization in Overlay Networks. SASO 2007: 77-86 - [e2]Sven Brueckner, Salima Hassas, Márk Jelasity, Daniel Yamins:
Engineering Self-Organising Systems, 4th International Workshop, ESOA 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers. Lecture Notes in Computer Science 4335, Springer 2007, ISBN 978-3-540-69867-8 [contents] - 2006
- [j8]Márk Jelasity, Özalp Babaoglu, Robert Laddaga:
Guest Editors' Introduction: Self-Management through Self-Organization. IEEE Intell. Syst. 21(2): 8-9 (2006) - [j7]Özalp Babaoglu, Márk Jelasity, Anne-Marie Kermarrec, Alberto Montresor, Maarten van Steen:
Managing clouds: a case for a fresh look at large unreliable dynamic networks. ACM SIGOPS Oper. Syst. Rev. 40(3): 9-13 (2006) - [j6]Özalp Babaoglu, Geoffrey Canright, Andreas Deutsch, Gianni Di Caro, Frederick Ducatelle, Luca Maria Gambardella, Niloy Ganguly, Márk Jelasity, Roberto Montemanni, Alberto Montresor, Tore Urnes:
Design patterns from biology for distributed computing. ACM Trans. Auton. Adapt. Syst. 1(1): 26-66 (2006) - [c29]Henrique João L. Domingos, Anne-Marie Kermarrec, Pascal Felber, Márk Jelasity:
Topic 15: Peer-to-Peer and Web Computing. Euro-Par 2006: 993 - [c28]Márk Jelasity, Alberto Montresor, Özalp Babaoglu:
The Bootstrapping Service. ICDCS Workshops 2006: 11 - [c27]Márk Jelasity, Anne-Marie Kermarrec:
Ordered Slicing of Very Large-Scale Overlay Networks. Peer-to-Peer Computing 2006: 117-124 - 2005
- [j5]Márk Jelasity, Alberto Montresor, Özalp Babaoglu:
Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3): 219-252 (2005) - [c26]Márk Jelasity, Özalp Babaoglu:
T-Man: Gossip-Based Overlay Topology Management. Engineering Self-Organising Systems 2005: 1-15 - [c25]Özalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel:
The Self-Star Vision. Self-star Properties in Complex Information Systems 2005: 1-20 - [c24]Anne-Marie Kermarrec, Márk Jelasity, Antony I. T. Rowstron, Henrique João L. Domingos:
Topic 15 - Peer-to-Peer and Web Computing. Euro-Par 2005: 1141 - [c23]Alberto Montresor, Márk Jelasity, Özalp Babaoglu:
Chord on Demand. Peer-to-Peer Computing 2005: 87-94 - [e1]Özalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel, Maarten van Steen:
Self-star Properties in Complex Information Systems, Conceptual and Practical Foundations [the book is a result from a workshop at Bertinoro, Italy, Summer 2004]. Lecture Notes in Computer Science 3460, Springer 2005, ISBN 3-540-26009-9 [contents] - [i1]Özalp Babaoglu, Márk Jelasity, Alberto Montresor:
Gossip-based self-managing services for large scale dynamic networks. Service Management and Self-Organization in IP-based Networks 2005 - 2004
- [c22]Vittorio Maniezzo, Marco A. Boschetti, Márk Jelasity:
An Ant Approach to Membership Overlay Design. ANTS Workshop 2004: 37-48 - [c21]Alberto Montresor, Márk Jelasity, Özalp Babaoglu:
Robust Aggregation Protocols for Large-Scale Overlay Networks. DSN 2004: 19-28 - [c20]Márk Jelasity, Alberto Montresor:
Epidemic-Style Proactive Aggregation in Large Overlay Networks. ICDCS 2004: 102-109 - [c19]Márk Jelasity, Rachid Guerraoui, Anne-Marie Kermarrec, Maarten van Steen:
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations. Middleware 2004: 79-98 - [c18]Márk Jelasity, Wojtek Kowalczyk, Maarten van Steen:
An Approach to Massively Distributed Aggregate Computing on Peer-to-Peer Networks. PDP 2004: 200-207 - [c17]Özalp Babaoglu, Márk Jelasity, Alberto Montresor:
Grassroots Approach to Self-management in Large-Scale Distributed Systems. UPP 2004: 286-296 - 2003
- [c16]Spyros Voulgaris, Márk Jelasity, Maarten van Steen:
A Robust and Scalable Peer-to-Peer Gossiping Protocol. AP2PC 2003: 47-58 - [c15]Márk Jelasity, Alberto Montresor, Özalp Babaoglu:
A Modular Paradigm for Building Self-Organizing Peer-to-Peer Applications. Engineering Self-Organising Systems 2003: 265-282 - 2002
- [c14]Márk Jelasity, Mike Preuß, Maarten van Steen, Ben Paechter:
Maintaining Connectivity in a Scalable and Robust Distributed Environment. CCGRID 2002: 389-394 - [c13]Ágoston E. Eiben, Márk Jelasity:
A critical note on experimental research methodology in EC. IEEE Congress on Evolutionary Computation 2002: 582-587 - [c12]Márk Jelasity, Mike Press, Ben Paechter:
A scalable and robust framework for distributed applications. IEEE Congress on Evolutionary Computation 2002: 1540-1545 - [c11]Márk Jelasity, Mike Preuß:
On Obtaining Global Information in a Peer-to-Peer Fully Distributed Environment (Research Note). Euro-Par 2002: 573-577 - [c10]Márk Jelasity, Mike Preuß, A. E. Eiben:
Operator Learning for a Problem Class in a Distributed Peer-to-Peer Environment. PPSN 2002: 172-183 - [c9]Maribel García Arenas, Pierre Collet, A. E. Eiben, Márk Jelasity, Juan Julián Merelo Guervós, Ben Paechter, Mike Preuß, Marc Schoenauer:
A Framework for Distributed Evolutionary Algorithms. PPSN 2002: 665-675 - 2001
- [j4]Márk Jelasity, Pilar Martínez Ortigosa, Inmaculada García:
UEGO, an Abstract Clustering Technique for Multimodal Global Optimization. J. Heuristics 7(3): 215-233 (2001) - [j3]Pilar M. Ortigosa, Inmaculada García, Márk Jelasity:
Reliability and Performance of UEGO, a Clustering-based Global Optimizer. J. Glob. Optim. 19(3): 265-289 (2001) - 2000
- [j2]András Kocsor, László Tóth, András Kuba, Kornél Kovács, Márk Jelasity, Tibor Gyimóthy, János Csirik:
A Comparative Study of Several Feature Transformation and Learning Methods for Phoneme Classification. Int. J. Speech Technol. 3(3-4): 263-276 (2000) - [c8]Márk Jelasity:
Towards Automatic Domain Knowledge Extraction for Evolutionary Heuristics. PPSN 2000: 755-764
1990 – 1999
- 1999
- [c7]Márk Jelasity, Boglárka G.-Tóth, Tamás Vinkó:
Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. CEC 1999: 623-630 - [c6]Márk Jelasity:
The adaptationist stance and evolutionary computation. GECCO 1999: 1859-1864 - 1998
- [j1]Márk Jelasity, József Dombi:
GAS, A Concept on Modeling Species in Genetic Algorithms. Artif. Intell. 99(1): 1-19 (1998) - [c5]Márk Jelasity:
UEGO, an Abstract Niching Technique for Global Optimization. PPSN 1998: 378-387 - 1997
- [c4]Márk Jelasity:
A Wave Analysis of the Subset Sum Problem. ICGA 1997: 89-96 - [c3]Zoltán Alexin, János Csirik, Tibor Gyimóthy, Márk Jelasity, László Tóth:
Learning Phonetic Rules in a Speech Recognition System. ILP 1997: 37-44 - 1996
- [c2]Márk Jelasity, József Dombi:
Implicit Formae in Genetic Algorithms. PPSN 1996: 154-163 - 1995
- [c1]Márk Jelasity, József Dombi:
GAs, a Concept of Modeling Species in Genetic Algorithms. Artificial Evolution 1995: 69-85
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
