Curriculum Vitae, Jelasity, Márk

Márk Jelasity's Curriculum Vitae

Positions Held

2016-	full professor at the Department of Algorithms and AI, University of Szeged, H-6701 Szeged, PO Box 652, Hungary
2015-2016	research advisor (research equivalent of full professor) at the Research Group on Artificial Intelligence (RGAI) of the Hungarian Academy of Sciences, University of Szeged H-6701 Szeged, PO Box 652, Hungary Fax: +36 62-425-508
2003-2015	senior research scientist at the Research Group on Artificial Intelligence (RGAI) of the Hungarian Academy of Sciences, University of Szeged H-6701 Szeged, PO Box 652, Hungary Fax: +36 62-425-508
2012 June-August	visiting researcher at SICS, Isafjordsgatan 22, Box 1263, SE-164 29 Kista, Sweden
2006 May-July	visiting researcher at Telenor R&D, Snarøyveien 30, N-1331 Fornebu, Norway
2006 March-April	visiting researcher at IRISA, IRISA/INRIA Rennes, Campus universitaire de Beaulieu, Avenue du Général Leclerc, F-35042 Rennes Cedex, France
2003-2006	postdoc at Department of Computer Science, University of Bologna, Mura Anteo Zamboni 7, I-40126 Bologna, Italy, Fax: +39 051 2094510
2001-2003	postdoc at Computational Intelligence Group, Department of Artificial Intelligence, Faculty of Sciences, Vrije Universiteit Amsterdam, De Boelelaan 1081a, NL-1081 HV Amsterdam, The Netherlands, Fax: +31 20 444 7653
2000	postdoc at Leiden Institute of Advanced Computer Science, Niels Bohrweg 1, Leiden NL-2333 AC, The Netherlands, Fax: +31 71 5276985
1996-2002	research assistant at the Research Group on Artificial Intelligence (RGAI) of the Hungarian Academy of Sciences, József Attila University H-6701 Szeged, PO Box 652, Hungary Fax: +36 62-425-508

Education and Degrees

2014	DSc degree, Hungarian Academy of Sciences. Title of thesis: Gossip-based Protocols for Large-scale Distributed Systems
2011	Habilitation (teaching related degree), University of Szeged, Hungary.
2001	PhD degree, Leiden University, the Netherlands. Title of thesis: The shape of evolutionary search: discovering and representing search space structure (1.1M). Check the errata if you have the original printed version.
2001	MSc degree in general linguistics, University of Szeged, Hungary. Title of thesis: A Framework for Modeling Non-Supervised Learning of Phonemes from Acoustic Input (856k).
1998-2000	cognitive science phd studies at the Eötvös Loránd University, Budapest, Hungary.
1996-2000	theoretical linguistics studies at the József Attila University (predecessor of University of Szeged), Szeged, Hungary.
1996	MSc degree in mathematics and computer science, József Attila University (predecessor of University of Szeged), Szeged, Hungary. Title of thesis: The Wave Model of Genetic Algorithms.
1991-1996	computer science and mathematics studies at the József Attila University (predecessor of University of Szeged), Szeged, Hungary.
1987-1991	Secondary school József Attila Gimnázium in Székesfehérvár.

Scholarships and Awards

2015 July	Bolyai Plaquette. Awarded to about 10% of Bolyai Scholarship holders by the Hungarian Academy of Sciences.
2014 December	10 years best paper award at the ACM/IFIP/USENIX Middleware Conference.
2014 September	Best paper award at the 14th IEEE International Conference on Peer-to-Peer Computing (P2P 2014).
2013 September	Best paper award at the 7th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2013).
2013	Scientific Award of the Faculty of Science and Informatics, University of Szeged, Hungary.
2013 March-July	Fulbright Scholarship to visit Cornell University, Ithaca, NY, USA.
2011-2014	Bolyai Scholarship. Awarded to young researchers by the Hungarian Academy of Sciences for research excellence.
2007-2010	Bolyai Scholarship. Awarded to young researchers by the Hungarian Academy of Sciences for research excellence.
November 1997	Pro Scientia Medal of the Council of National Scientific Students' Associations (OTDT). Awarded to students for research excellence.
June 1997	Outstanding Student Award, Faculty of Sciences, József Attila University (predecessor of University of Szeged), Szeged, Hungary.
April 1997	1st Prize at the National Scientific Conference of Students (in Hungarian OTDK) with the work entitled The Wave Model of Genetic Algorithms.
June 1996	Graduation with honors (Master's degree in computer science and mathematics).
1995/96	Scholarship of the Hungarian Republic. Full year scholarship awarded to students with an outsdanding scholastic record, by the Ministry of Education.
May 1995	3rd Prize at the National Scientific Conference of Students with the work entitled Genetic algorithms, introduction of species-structure.

Organization and Editing

The 16th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS'16), Heraklion, Crete, Greece on June 6-9, 2016. TPC co-chair.
The 7th International Workshop on Modeling, Simulation, and Optimization of Peer-to-peer Environments (MSOP2P'13), Special session of Euromicro PDP 2013, Belfast, Northern Ireland, February 27-March 1, 2013. TPC chair.
The 11th IEEE International Conference on Peer-to-Peer Computing (IEEE P2P'11), Tokyo, Japan, August 31-September 2, 2011. TPC co-chair.
The 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2010), Budapest, Hungary, September 27-October 1, 2010. General Co-Chair.
Self-Organizing Systems Track, 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), New York City, USA, September 20-22, 2010. Co-Chair.
The 2nd IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2008), Isola di San Servolo (Venice), Italy, October 20-24, 2008. Publication Chair.
The 1st IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), Boston, Massachusetts, USA, July, 2007. TPC co-chair.
The 4th International Workshop on Engineering Self-Organising Applications (ESOA'06), Hakodate, Japan, May, 2006. The Springer post-proceedings is available.
IEEE Intelligent Systems, 21(2), 2006. Special Issue: Self-Management through Self-Organization in Information Systems. (original CFP)
Engineering with Complexity and Emergence (ECE2005), Satellite workshop of the European Conference on Complex Systems (ECCS'05), November 15-16, 2005.
SELF-STAR, International Workshop on Self-* Properties in Complex Information Systems, University of Bologna Residential Center, Bertinoro (Forlì), Italy, 31 May - 2 June 2004. The Springer post-proceedings is available.

Publications

Levente Halmosi, Bálint Mohos, and Márk Jelasity. Evaluating the adversarial robustness of semantic segmentation: Trying harder pays off. In Aleš Leonardis, Elisa Ricci, Stefan Roth, Olga Russakovsky, Torsten Sattler, and Gül Varol, editors, Computer Vision – ECCV 2024, Part LXXIX, volume 15137 of Lecture Notes in Computer Science, pages 1–18, Cham, 2025. Springer Nature Switzerland. (doi:10.1007/978-3-031-72986-7_1)
Ammar Al-Najjar, István Megyeri, and Márk Jelasity. Adversarial training without hard labels. In Proceedings of the 32nd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN), pages 179–184, Bruges, Belgium, 2024. i6doc.com. (doi:10.14428/esann/2024.ES2024-81)
András Balogh and Márk Jelasity. On the functional similarity of robust and non-robust neural representations. In Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett, editors, Proceedings of the 40th International Conference on Machine Learning (ICML 2023), volume 202 of Proceedings of Machine Learning Research, pages 1614–1635. PMLR, 23–29 Jul 2023.
Gábor Danner, István Hegedűs, and Márk Jelasity. Improving gossip learning via limited model merging. In Ngoc Thanh Nguyen, János Botzheim, László Gulyás, Manuel Nunez, Jan Treur, Gottfried Vossen, and Adrianna Kozierkiewicz, editors, Advances in Computational Collective Intelligence (ICCCI 2023), pages 351–363, Cham, 2023. Springer Nature Switzerland. (doi:10.1007/978-3-031-41774-0_28)
Árpád Berta, Gábor Danner, István Hegedűs, and Márk Jelasity. Hiding needles in a haystack: Towards constructing neural networks that evade verification. In Proceedings of the 2022 ACM Workshop on Information Hiding and Multimedia Security (IH & MMSec'22), pages 51–62, New York, NY, USA, 2022. ACM. (doi:10.1145/3531536.3532966)
István Megyeri, István Hegedűs, and Márk Jelasity. Robust classification combined with robust out-of-distribution detection: An empirical analysis. In International Joint Conference on Neural Networks (IJCNN). IEEE, 2021. (doi:10.1109/IJCNN52387.2021.9533635)
Dániel Zombori, Balázs Bánhelyi, Tibor Csendes, István Megyeri, and Márk Jelasity. Fooling a complete neural network verifier. In International Conference on Learning Representations (ICLR), 2021.
István Hegedűs, Gábor Danner, and Márk Jelasity. Decentralized learning works: An empirical comparison of gossip learning and federated learning. Journal of Parallel and Distributed Computing, 148:109–124, February 2021. (doi:10.1016/j.jpdc.2020.10.006)
Árpád Berta, Zoltán Szabó, and Márk Jelasity. Modeling peer-to-peer connections over a smartphone network. In Proceedings of the 1st International Workshop on Distributed Infrastructure for Common Good (DICG), pages 43–48. ACM, 2020. (doi:10.1145/3428662.3428791)
Gábor Danner, István Hegedűs, and Márk Jelasity. Decentralized machine learning using compressed push-pull averaging. In Proceedings of the 1st International Workshop on Distributed Infrastructure for Common Good (DICG), pages 31–36. ACM, 2020. (doi:10.1145/3428662.3428792)
István Hegedűs, Gábor Danner, and Márk Jelasity. Decentralized recommendation based on matrix factorization: A comparison of gossip and federated learning. In Peggy Cellier and Kurt Driessens, editors, ECML PKDD Workshops 2019, number 1167 in Communications in Computer and Information Science, pages 317–332. Springer Nature Switzerland AG, 2020. DMLE19. (doi:10.1007/978-3-030-43823-4_27)
István Megyeri, István Hegedűs, and Márk Jelasity. Adversarial robustness of model sets. In International Joint Conference on Neural Networks (IJCNN). IEEE, 2020. (doi:10.1109/IJCNN48605.2020.9206656)
István Megyeri, István Hegedűs, and Márk Jelasity. Attacking model sets with adversarial examples. In Proceedings of the 28th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN), pages 1–6, Bruges, Belgium, 2020. i6doc.com.
István Hegedűs, Gábor Danner, and Márk Jelasity. Gossip learning as a decentralized alternative to federated learning. In José Pereira and Laura Ricci, editors, Proceedings of the 19th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS 2019), volume 11534 of Lecture Notes in Computer Science, pages 74–90. Springer International Publishing, 2019. (doi:10.1007/978-3-030-22496-7_5)
István Megyeri, István Hegedűs, and Márk Jelasity. Adversarial robustness of linear models: Regularization and dimensionality. In Proceedings of the 27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN), pages 61–66, Bruges, Belgium, 2019. i6doc.com.
Zoltán Szabó, Árpád Berta, Krisztián Téglás, Márk Jelasity, and Vilmos Bilicki. Stunner: A smart phone trace for developing decentralized edge systems. In José Pereira and Laura Ricci, editors, Proceedings of the 19th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS 2019), volume 11534 of Lecture Notes in Computer Science, pages 108–115. Springer International Publishing, 2019. (doi:10.1007/978-3-030-22496-7_7)
Edward Tremel, Ken Birman, Robert Kleinberg, and Márk Jelasity. Anonymous, fault-tolerant distributed queries for smart devices. ACM Transactions on Cyber-Physical Systems, 3(2):16:1–16:29, March 2019. (doi:10.1145/3204411)
Gábor Danner and Márk Jelasity. Robust decentralized mean estimation with limited communication. In Marco Aldinucci, Luca Padovani, and Massimo Torquati, editors, Euro-Par 2018, volume 11014 of Lecture Notes in Computer Science, pages 447–461. Springer International Publishing, 2018. (doi:10.1007/978-3-319-96983-1_32)
Gábor Danner and Márk Jelasity. Token account algorithms: The best of the proactive and reactive worlds. In Proceedings of The 38th International Conference on Distributed Computing Systems (ICDCS 2018), pages 885–895. IEEE Computer Society, 2018. (doi:10.1109/ICDCS.2018.00090)
Gábor Danner, Árpád Berta, István Hegedűs, and Márk Jelasity. Robust fully distributed mini-batch gradient descent with privacy preservation. Security and Communication Networks, 2018:6728020, 2018. (doi:10.1155/2018/6728020)
Árpád Berta and Márk Jelasity. Decentralized management of random walks over a mobile phone network. In Proceedings of the 25th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'17), pages 100–107, St. Petersburg, Russia, 2017. IEEE Computer Society. (doi:10.1109/PDP.2017.73)
Árpád Berta, István Hegedűs, and Márk Jelasity. Dimension reduction methods for collaborative mobile gossip learning. In Proceedings of the 24th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'16), pages 393–397, Heraklion, Greece, 2016. IEEE Computer Society. (doi:10.1109/PDP.2016.20)
Márk Jelasity and Evangelia Kalyvianaki, editors. Distributed Applications and Interoperable Systems, volume 9687 of Lecture Notes in Computer Science. Springer International Publishing, 2016. (doi:10.1007/978-3-319-39577-7)
István Hegedűs, Árpád Berta, Levente Kocsis, András A. Benczúr, and Márk Jelasity. Robust decentralized low-rank matrix decomposition. ACM Transactions on Intelligent Systems and Technology, 7(4):62:1–62:24, May 2016. (doi:10.1145/2854157)
Gábor Danner and Márk Jelasity. Fully distributed privacy preserving mini-batch gradient descent learning. In Alysson Bessani and Sara Bouchenak, editors, Proceedings of the 15th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS 2015), volume 9038 of Lecture Notes in Computer Science, pages 30–44. Springer International Publishing, 2015. (doi:10.1007/978-3-319-19129-4_3)
Lehel Nyers and Márk Jelasity. A comparative study of spanning tree and gossip protocols for aggregation. Concurrency and Computation: Practice and Experience, 27(16):4091–4106, 2015. (doi:10.1002/cpe.3549)
Fatemeh Rahimian, Amir H. Payberah, Šarūnas Girdzijauskas, Márk Jelasity, and Seif Haridi. A distributed algorithm for large-scale graph partitioning. ACM Transactions on Autonomous and Adaptive Systems, 10(2):12:1–12:24, June 2015. (doi:10.1145/2714568)
Ken Birman, Márk Jelasity, Robert Kleinberg, and Edward Tremel. Building a secure and privacy-preserving smart grid. ACM SIGOPS Operating Systems Review, 49(1):131–136, January 2015. (doi:10.1145/2723872.2723891)
Árpád Berta, Vilmos Bilicki, and Márk Jelasity. Defining and understanding smartphone churn over the internet: a measurement study. In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P 2014). IEEE, 2014. (doi:10.1109/P2P.2014.6934317)
István Hegedűs, Márk Jelasity, Levente Kocsis, and András A. Benczúr. Fully distributed robust singular value decomposition. In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P 2014). IEEE, 2014. (doi:10.1109/P2P.2014.6934299)
Márk Jelasity and Kenneth P. Birman. Distributional differential privacy for large-scale smart metering. In Proceedings of the 2nd ACM Workshop on Information Hiding and Multimedia Security (IH & MMSec'14), pages 141–146, New York, NY, USA, 2014. ACM. (doi:10.1145/2600918.2600919)
Lehel Nyers and Márk Jelasity. Spanning tree or gossip for aggregation: A comparative study. In Fernando Silva, Inês Dutra, and Vítor Santos Costa, editors, Euro-Par 2014, volume 8632 of Lecture Notes in Computer Science, pages 379–390. Springer International Publishing, 2014. (doi:10.1007/978-3-319-09873-9_32)
Gábor Berend, Richárd Farkas, Veronika Vincze, János Zsibrita, and Márk Jelasity. Kulcsszókinyerés alapú dokumentumklaszterezés. In Attila Tanács and Veronika Vincze, editors, IX. Magyar Számítógépes Nyelvészeti Konferencia (MSZNY), pages 251–262. JATEPress, 2013. in Hungarian.
István Hegedűs, Róbert Ormándi, and Márk Jelasity. Massively distributed concept drift handling in large networks. Advances in Complex Systems, 16(04n05):1350021, 2013. (doi:10.1142/S0219525913500215)
Róbert Ormándi, István Hegedűs, and Márk Jelasity. Gossip learning with linear models on fully distributed data. Concurrency and Computation: Practice and Experience, 25(4):556–571, 2013. (doi:10.1002/cpe.2858)
Fatemeh Rahimian, Amir H. Payberah, Šarūnas Girdzijauskas, Márk Jelasity, and Seif Haridi. Ja-be-ja: A distributed algorithm for balanced graph partitioning. In Seventh IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2013), pages 51–60. IEEE Computer Society, 2013. Best paper award. (doi:10.1109/SASO.2013.13)
Roberto Roverso, Jim Dowling, and Márk Jelasity. Through the wormhole: Low cost, fresh peer sampling for the internet. In Proceedings of the 13th IEEE International Conference on Peer-to-Peer Computing (P2P 2013). IEEE, 2013. (doi:10.1109/P2P.2013.6688707)
Balázs Szörényi, Róbert Busa-Fekete, István Hegedűs, Róbert Ormándi, Márk Jelasity, and Balázs Kégl. Gossip-based distributed stochastic bandit algorithms. JMLR Workshop and Conference Proceedings, 28(3):19–27, 2013. Proceedings of the 30th International Conference on Machine Learning (ICML 2013).
S. Buckingham Shum, K. Aberer, A. Schmidt, S. Bishop, P. Lukowicz, S. Anderson, Y. Charalabidis, J. Domingue, S. Freitas, I. Dunwell, B. Edmonds, F. Grey, M. Haklay, M. Jelasity, A. Karpištšenko, J. Kohlhammer, J. Lewis, J. Pitt, R. Sumner, and D. Helbing. Towards a global participatory platform. The European Physical Journal Special Topics, 214(1):109–152, 2012. (doi:10.1140/epjst/e2012-01690-3)
István Hegedűs, Róbert Busa-Fekete, Róbert Ormándi, Márk Jelasity, and Balázs Kégl. Peer-to-peer multi-class boosting. In Christos Kaklamanis, Theodore Papatheodorou, and Paul G. Spirakis, editors, Euro-Par 2012, volume 7484 of Lecture Notes in Computer Science, pages 389–400. Springer-Verlag, 2012. (doi:10.1007/978-3-642-32820-6_39)
István Hegedűs, Róbert Ormándi, and Márk Jelasity. Gossip-based learning under drifting concepts in fully distributed networks. In Sixth IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2012), pages 79–88. IEEE Computer Society, 2012. (doi:10.1109/SASO.2012.13)
Márk Jelasity, Wojtek Kowalczyk, and Maarten van Steen. Newscast computing. In Calin Enachescu, Florin-Gheorghe Filip, and Barna Iantovics, editors, Advanced Computational Technologies, pages 22–44. Romanian Academy Publishing House, Bucharest, Romania, 2012. Reprint of VU University Tech. Rep. IR-CS-006.03.
Juan A. M. Naranjo, Leocadio G. Casado, and Márk Jelasity. Asynchronous privacy-preserving iterative computation on peer-to-peer networks. Computing, 94(8–10):763–782, 2012. (doi:10.1007/s00607-012-0200-5)
Kornél Csernai, Márk Jelasity, Johan Pouwelse, and Tamás Vinkó. Modeling unconnectable peers in private BitTorrent communities. In Proceedings of the 19th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'11), pages 582–589, Ayia Napa, Cyprus, 2011. IEEE Computer Society. MSOP2P special track. (doi:10.1109/PDP.2011.21)
Márk Jelasity. Gossip. In Giovanna Di Marzo Serugendo, Marie-Pierre Gleizes, and Anthony Karageorgos, editors, Self-Organising Software: From Natural to Artificial Adaptation, Natural Computing Series, pages 139–162. Springer, 2011. (doi:10.1007/978-3-642-17348-6_7)
Márk Jelasity, Vilmos Bilicki, and Miklós Kasza. Modeling network-level impacts of P2P flows. In Proceedings of the 19th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'11), pages 590–594, Ayia Napa, Cyprus, 2011. IEEE Computer Society. MSOP2P special track. (doi:10.1109/PDP.2011.9)
Róbert Ormándi, István Hegedűs, and Márk Jelasity. Asynchronous peer-to-peer data mining with stochastic gradient descent. In Emmanuel Jeannot, Raymond Namyst, and Jean Roman, editors, Euro-Par 2011, volume 6852 of Lecture Notes in Computer Science, pages 528–540. Springer-Verlag, 2011. (doi:10.1007/978-3-642-23400-2_49)
Márk Jelasity and Vilmos Bilicki. Scalable stealth mode P2P overlays of very small constant degree. ACM Transactions on Autonomous and Adaptive Systems, 6(4):27:1–27:20, October 2011. (doi:10.1145/2019591.2019596)
Balázs Szappanos, Károly Kovács, Béla Szamecz, Frantisek Honti, Michael Costanzo, Anastasia Baryshnikova, Gabriel Gelius-Dietrich, Martin J. Lercher, Márk Jelasity, Chad L. Myers, Brenda J. Andrews, Charles Boone, Stephen G. Oliver, Csaba Pál, and Balázs Papp. An integrated approach to characterize genetic interaction networks in yeast metabolism. Nature Genetics, 43(7):656–662, July 2011. (doi:10.1038/ng.846)
Róbert Ormándi, István Hegedűs, Kornél Csernai, and Márk Jelasity. Towards inferring ratings from user behavior in BitTorrent communities. In Proceedings of the 6th International Workshop on Collaborative Peer-to-Peer Systems (COPS) at WETICE'10, pages 217–222. IEEE Computer Society, 2010. Best paper award. (doi:10.1109/WETICE.2010.41)
Róbert Ormándi, István Hegedűs, Richárd Farkas, and Márk Jelasity. Novel balanced feature representation for Wikipedia vandalism detection task. In CLEF 2010 Labs and Workshops, 2010. http://www.clef-initiative.eu/edition/clef2010/working-notes.
Róbert Ormándi, István Hegedűs, and Márk Jelasity. Overlay management for fully distributed user-based collaborative filtering. In Pasqua D'Ambra, Mario Guarracino, and Domenico Talia, editors, Euro-Par 2010, volume 6271 of Lecture Notes in Computer Science, pages 446–457. Springer-Verlag, 2010. (doi:10.1007/978-3-642-15277-1_43)
Balázs Bánhelyi, Marco Biazzini, Alberto Montresor, and Márk Jelasity. Peer-to-peer optimization in large unreliable networks with branch-and-bound and particle swarms. In Applications of Evolutionary Computing (EvoWorkshops), volume 5484 of Lecture Notes in Computer Science, pages 87–92. Springer-Verlag, 2009. (doi:10.1007/978-3-642-01129-0_10)
Marco Biazzini, Balázs Bánhelyi, Alberto Montresor, and Márk Jelasity. Distributed hyper-heuristics for real parameter optimization. In Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO '09), pages 1339–1346, Montreal, Québec, Canada, 2009. ACM. (doi:10.1145/1569901.1570081)
Márk Jelasity and Vilmos Bilicki. Scalable P2P overlays of very small constant degree: an emerging security threat. In Rachid Guerraoui and Franck Petit, editors, The 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), volume 5873 of Lecture Notes in Computer Science, pages 399–412. Springer-Verlag, 2009. (doi:10.1007/978-3-642-05118-0_28)
Márk Jelasity and Vilmos Bilicki. Towards automated detection of peer-to-peer botnets: On the limits of local approaches. In 2nd USENIX Workshop on Large-Scale Exploits and Emergent Threats (LEET'09). USENIX, 2009. http://www.usenix.org/events/leet09/tech/.
Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. T-Man: Gossip-based fast overlay topology construction. Computer Networks, 53(13):2321–2339, 2009. (doi:10.1016/j.comnet.2009.03.013)
István Nagy, Richárd Farkas, and Márk Jelasity. Researcher affiliation extraction from homepages. In Proceedings of the 2009 Workshop on text and citation analysis for scholarly digital libraries (NLPIR4DL), pages 1–9, Suntec City, Singapore, 2009. Association for Computational Linguistics.
Norbert Tölgyesi and Márk Jelasity. Adaptive peer sampling with newscast. In Henk Sips, Dick Epema, and Hai-Xiang Lin, editors, Euro-Par 2009, volume 5704 of Lecture Notes in Computer Science, pages 523–534. Springer-Verlag, 2009. (doi:10.1007/978-3-642-03869-3_50)
Alberto Montresor and Márk Jelasity. Peersim: A scalable P2P simulator. In Proceedings of the 9th IEEE International Conference on Peer-to-Peer Computing (P2P 2009), pages 99–100, Seattle, Washington, USA, September 2009. IEEE. extended abstract. (doi:10.1109/P2P.2009.5284506)
Richárd Farkas, Róbert Ormándi, Márk Jelasity, and János Csirik. A manually annotated HTML corpus for a novel scientific trend analysis. In The Eighth IAPR International Workshop on Document Analysis Systems (DAS2008): Extended abstracts, 2008.
Alberto Montresor, Márk Jelasity, and Ozalp Babaoglu. Decentralized ranking in large-scale overlay networks. In Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW 2008), pages 208–213. IEEE Computer Society, 2008. (doi:10.1109/SASOW.2008.17)
Ozalp Babaoglu and Márk Jelasity. Self-* properties through gossiping. Philosophical Transactions of the Royal Society A, 366(1881):3747–3757, October 2008. (doi:10.1098/rsta.2008.0122)
Ozalp Babaoglu, Toni Binci, Márk Jelasity, and Alberto Montresor. Firefly-inspired heartbeat synchronization in overlay networks. In First IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), pages 77–86, Boston (MA), USA, 2007. IEEE Computer Society. (doi:10.1109/SASO.2007.25)
Paolo Costa, Vincent Gramoli, Márk Jelasity, Gian Paolo Jesi, Erwan Le Merrer, Alberto Montresor, and Leonardo Querzoni. Exploring the interdisciplinary connections of gossip-based systems. ACM SIGOPS Operating Systems Review, 41(5):51–60, 2007. (doi:10.1145/1317379.1317388)
Giovanna Di Marzo Serugendo, Jean-Philippe Martin-Flatin, Márk Jelasity, and Franco Zambonelli, editors. First IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO'07). IEEE Computer Society, 2007. (doi:10.1109/SASO.2007.22)
Márk Jelasity, Geoffrey Canright, and Kenth Engø-Monsen. Asynchronous distributed power iteration with gossip-based normalization. In Anne-Marie Kermarrec, Luc Bougé, and Thierry Priol, editors, Euro-Par 2007, volume 4641 of Lecture Notes in Computer Science, pages 514–525. Springer-Verlag, 2007. (doi:10.1007/978-3-540-74466-5_55)
Márk Jelasity, Spyros Voulgaris, Rachid Guerraoui, Anne-Marie Kermarrec, and Maarten van Steen. Gossip-based peer sampling. ACM Transactions on Computer Systems, 25(3):8, August 2007. (doi:10.1145/1275517.1275520)
Sven A. Brueckner, Salima Hassas, Márk Jelasity, and Daniel Yamins, editors. Engineering Self-Organising Systems, volume 4335 of Lecture Notes in Artificial Intelligence. Springer-Verlag, January 2007. (doi:10.1007/978-3-540-69868-5)
Ozalp Babaoglu, Márk Jelasity, Anne-Marie Kermarrec, Alberto Montresor, and Maarten van Steen. Managing clouds: A case for a fresh look at large unreliable dynamic networks. ACM SIGOPS Operating Systems Review, 40(3):9–13, 2006. (doi:10.1145/1151374.1151379)
Márk Jelasity and Ozalp Babaoglu. T-Man: Gossip-based overlay topology management. In Sven A. Brueckner, Giovanna Di Marzo Serugendo, David Hales, and Franco Zambonelli, editors, Engineering Self-Organising Systems: Third International Workshop (ESOA 2005), Revised Selected Papers, volume 3910 of Lecture Notes in Computer Science, pages 1–15. Springer-Verlag, 2006. (doi:10.1007/11734697_1)
Márk Jelasity, Ozalp Babaoglu, and Robert Laddaga, editors. IEEE Intelligent Systems 21(2). IEEE Computer Society, 2006. Special issue on Self-Management through Self-Organization in Information Systems. (doi:10.1109/MIS.2006.27)
Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. The bootstrapping service. In Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS WORKSHOPS), Lisboa, Portugal, 2006. IEEE Computer Society. International Workshop on Dynamic Distributed Systems (IWDDS). (doi:10.1109/ICDCSW.2006.105)
Ozalp Babaoglu, Geoffrey Canright, Andreas Deutsch, Gianni A. Di Caro, Frederick Ducatelle, Luca M. Gambardella, Niloy Ganguly, Márk Jelasity, Roberto Montemanni, Alberto Montresor, and Tore Urnes. Design patterns from biology for distributed computing. ACM Transactions on Autonomous and Adaptive Systems, 1(1):26–66, September 2006. (doi:10.1145/1152934.1152937)
Márk Jelasity and Anne-Marie Kermarrec. Ordered slicing of very large-scale overlay networks. In Proceedings of the 6th IEEE International Conference on Peer-to-Peer Computing (P2P 2006), pages 117–124, Cambridge, UK, September 2006. IEEE Computer Society. (doi:10.1109/P2P.2006.25)
Ozalp Babaoglu, Márk Jelasity, and Alberto Montresor. Gossip-based self-managing services for large scale dynamic networks. In Matthias Bossardt, Georg Carle, D. Hutchison, Hermann de Meer, and Bernhard Plattner, editors, Service Management and Self-Organization in IP-based Networks, number 04411 in Dagstuhl Seminar Proceedings. IBFI, Schloss Dagstuhl, Germany, 2005. extended abstract, proceedings online at http://drops.dagstuhl.de/portals/04411/.
Ozalp Babaoglu, Márk Jelasity, and Alberto Montresor. Grassroots approach to self-management in large-scale distributed systems. In Jean-Pierre Banâtre, Pascal Fradet, Jean-Louis Giavitto, and Olivier Michel, editors, Unconventional Programming Paradigms (UPP 2004), volume 3566 of Lecture Notes in Computer Science, pages 286–296. Springer-Verlag, 2005. (doi:10.1007/11527800_22)
Marco A. Boschetti, Márk Jelasity, and Vittorio Maniezzo. A fully distributed Lagrangean metaheuristic for a P2P overlay network design problem. In Proceedings of the 6th Metaheuristics International Conference (MIC2005), 2005. extended abstract, on CD-ROM.
Márk Jelasity. Engineering emergence through gossip. In Bruce Edmonds, Nigel Gilbert, Steven Gustafson, David Hales, and Natalio Krasnogor, editors, Proceedings of the Joint Symposium on Socially Inspired Computing, AISB Convention, pages 123–126, Hatfield, UK, 2005. AISB. extended abstract, invited talk.
Ozalp Babaoglu, Geoffrey Canright, Andreas Deutsch, Gianni Di Caro, Frederick Ducatelle, Luca Gambardella, Niloy Ganguly, Márk Jelasity, Roberto Montemanni, and Alberto Montresor. Design patterns from biology for distributed computing. In Proceedings of the European Conference on Complex Systems (ECCS'05), Paris, France, November 2005. on CD-ROM.
Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems, 23(3):219–252, August 2005. (doi:10.1145/1082469.1082470)
Alberto Montresor, Márk Jelasity, and Ozalp Babaoglu. Chord on demand. In Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing (P2P 2005), pages 87–94, Konstanz, Germany, August 2005. IEEE Computer Society. (doi:10.1109/P2P.2005.4)
Ozalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad van Moorsel, and Maarten van Steen, editors. Self-Star Properties in Complex Information Systems, volume 3460 of Lecture Notes in Computer Science, Hot Topics. Springer-Verlag, May 2005. (doi:10.1007/b136551)
Márk Jelasity and Alberto Montresor. Epidemic-style proactive aggregation in large overlay networks. In Proceedings of The 24th International Conference on Distributed Computing Systems (ICDCS 2004), pages 102–109, Tokyo, Japan, 2004. IEEE Computer Society. (doi:10.1109/ICDCS.2004.1281573)
Márk Jelasity, Rachid Guerraoui, Anne-Marie Kermarrec, and Maarten van Steen. The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In Hans-Arno Jacobsen, editor, Middleware 2004, volume 3231 of Lecture Notes in Computer Science, pages 79–98. Springer-Verlag, 2004. (doi:10.1007/978-3-540-30229-2_5)
Márk Jelasity, Wojtek Kowalczyk, and Maarten van Steen. An approach to massively distributed aggregate computing on peer-to-peer networks. In Proceedings of the 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'04), pages 200–207, A Coruna, Spain, 2004. IEEE Computer Society. (doi:10.1109/EMPDP.2004.1271446)
Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. A modular paradigm for building self-organizing peer-to-peer applications. In Giovanna Di Marzo Serugendo, Anthony Karageorgos, Omer F. Rana, and Franco Zambonelli, editors, Engineering Self-Organising Systems, volume 2977 of Lecture Notes in Artificial Intelligence, pages 265–282. Springer, 2004. invited paper. (doi:10.1007/978-3-540-24701-2_18)
Vittorio Maniezzo, Marco A. Boschetti, and Márk Jelasity. An ant approach to membership overlay design. In Marco Dorigo, Mauro Birattari, Christian Blum, Luca M. Gambardella, Francesco Mondada, and Thomas Stützle, editors, Ant Colony Optimization and Swarm Intelligence, 4th International Workshop (ANTS 2004), volume 3172 of Lecture Notes in Computer Science, pages 37–48. Springer-Verlag, 2004. (doi:10.1007/978-3-540-28646-2_4)
Alberto Montresor, Márk Jelasity, and Ozalp Babaoglu. Robust aggregation protocols for large-scale overlay networks. In Proceedings of The 2004 International Conference on Dependable Systems and Networks (DSN), pages 19–28, Florence, Italy, 2004. IEEE Computer Society. (doi:10.1109/DSN.2004.1311873)
Spyros Voulgaris, Márk Jelasity, and Maarten van Steen. A robust and scalable peer-to-peer gossiping protocol. In Gianluca Moro, Claudio Sartori, and Munindar P. Singh, editors, Agents and Peer-to-Peer Computing: Second International Workshop, AP2PC 2003, volume 2872 of Lecture Notes in Artificial Intelligence, pages 47–58. Springer, 2004. (doi:10.1007/978-3-540-25840-7_6)
Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. Detection and removal of malicious peers in gossip-based protocols. In 2nd Bertinoro Workshop on Future Directions in Distributed Computing: Survivability: Obstacles and Solutions (FuDiCo II: S.O.S.), Bertinoro, Italy, June 2004. invitation only workshop, proceedings online at http://www.cs.utexas.edu/users/lorenzo/sos/.
Wojtek Kowalczyk, Márk Jelasity, and A. E. Eiben. Towards data mining in large and fully distributed peer-to-peer overlay networks. In Tom Heskes, Peter Lucas, Louis Vuurpijl, and Wim Wiegerinck, editors, Proceedings of The 15th Belgian-Dutch Conference on Artificial Intelligence (BNAIC'03), pages 203–210. University of Nijmegen, 2003.
Maribel G. Arenas, Pierre Collet, A. E. Eiben, Márk Jelasity, Juan J. Merelo, Ben Paechter, Mike Preuß, and Marc Schoenauer. A framework for distributed evolutionary algorithms. In Juan Julián Merelo Guervós, Panagiotis Adamidis, Hans-Georg Beyer, José-Luis Fernández-Villacañas, and Hans-Paul Schwefel, editors, Parallel Problem Solving from Nature - PPSN VII, volume 2439 of Lecture Notes in Computer Science, pages 665–675. Springer-Verlag, 2002. (doi:10.1007/3-540-45712-7_64)
Ágoston E. Eiben and Márk Jelasity. A critical note on experimental research methodology in EC. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), pages 582–587. IEEE Press, 2002. (doi:10.1109/CEC.2002.1006991)
Márk Jelasity. Reflections on Niyogi's book `The informational complexity of learning'. Akusztikai Szemle, IV(1–2):19–21, 2002. book review.
Márk Jelasity and Mike Preuß. On obtaining global information in a peer-to-peer fully distributed environment. In Burkhard Monien and Rainer Feldman, editors, Euro-Par 2002, volume 2400 of Lecture Notes in Computer Science, pages 573–577. Springer-Verlag, 2002. (doi:10.1007/3-540-45706-2_78)
Márk Jelasity, Mike Preuß, and A. E. Eiben. Operator learning for a problem class in a distributed peer-to-peer environment. In Juan Julián Merelo Guervós, Panagiotis Adamidis, Hans-Georg Beyer, José-Luis Fernández-Villacañas, and Hans-Paul Schwefel, editors, Parallel Problem Solving from Nature - PPSN VII, volume 2439 of Lecture Notes in Computer Science, pages 172–183. Springer-Verlag, 2002. (doi:10.1007/3-540-45712-7_17)
Márk Jelasity, Mike Preuß, and Ben Paechter. A scalable and robust framework for distributed applications. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), pages 1540–1545. IEEE Press, 2002. special session Distributed Learning for Optimization. (doi:10.1109/CEC.2002.1004471)
Márk Jelasity, Mike Preuß, Maarten van Steen, and Ben Paechter. Maintaining connectivity in a scalable and robust distributed environment. In Henri E. Bal, Klaus-Peter Löhr, and Alexander Reinefeld, editors, Proceedings of the Second IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid2002), pages 389–394, Berlin, Germany, 2002. IEEE Computer Society. 2nd GP2PC workshop. (doi:10.1109/CCGRID.2002.1017166)
Pilar Martínez Ortigosa, Inmaculada García, and Márk Jelasity. Two approaches for parallelizing the UEGO algorithm. In Franco Giannessi, Panos M. Pardalos, and Tamás Rapcsák, editors, Optimization Theory: Recent Developments from Mátraháza, volume 59 of Applied Optimization, pages 159–177. Kluwer Academic Publishers, October 2001. (doi:10.1007/978-1-4613-0295-7_12)
Márk Jelasity, Pilar Martínez Ortigosa, and Inmaculada García. UEGO, an abstract clustering technique for multimodal global optimization. Journal of Heuristics, 7(3):215–233, May 2001. (doi:10.1023/A:1011367930251)
Pilar Martínez Ortigosa, Inmaculada García, and Márk Jelasity. Reliability and performance of UEGO, a clustering-based global optimizer. Journal of Global Optimization, 19(3):265–289, March 2001. (doi:10.1023/A:1011224107143)
Márk Jelasity. The shape of evolutionary search: discovering and representing search space structure. PhD thesis, Leiden University, January 2001. IPA Dissertation Series 2001-01.
Márk Jelasity. Towards automatic domain knowledge extraction for evolutionary heuristics. In Marc Schoenauer, Kalyanmoy Deb, Günter Rudolph, Xin Yao, Evelyne Lutton, Juan Julián Merelo, and Hans-Paul Schwefel, editors, Parallel Problem Solving from Nature - PPSN VI, volume 1917 of Lecture Notes in Computer Science, pages 755–764. Springer-Verlag, 2000. (doi:10.1007/3-540-45356-3_74)
András Kocsor, László Tóth, András Kuba, Jr, Kornél Kovács, Márk Jelasity, Tibor Gyimóthy, and János Csirik. A comparative study of several feature transformation and learning methods for phoneme classification. International Journal of Speech Technology, 3(3/4):263–276, 2000. (doi:10.1023/A:1026554814106)
Márk Jelasity. Instance-based manifesto?. Behavioral and Brain Sciences, 23(4):482–483, August 2000. commentary. (doi:10.1017/S0140525X00383352)
Márk Jelasity. The adaptationist stance and evolutionary computation. In Wolfgang Banzhaf, Jason Daida, A. E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99), pages 1859–1864, San Francisco, CA, 1999. Morgan Kaufmann.
Márk Jelasity. Genetikus algoritmusok. In Iván Futó, editor, Mesterséges Intelligencia, pages 549–568. Aula Kiadó, 1999. in Hungarian.
Márk Jelasity, Boglárka Tóth, and Tamás Vinkó. Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), pages 623–630. IEEE, IEEE Press, 1999. special session Theory and Foundation of Evolutionary Computation. (doi:10.1109/CEC.1999.781990)
Pilar Martínez Ortigosa, Inmaculada García, and Márk Jelasity. Evaluating UEGO, an evolutionary global optimization algorithm. In Proceedings of the International Workshop on Global Optimization (GO.99), pages 97–100, Firenze, Italy, 1999. extended abstract.
András Kocsor, András Kuba, Jr, László Tóth, Márk Jelasity, László Felföldi, Tibor Gyimóthy, and János Csirik. A segment-based statistical speech recognition system for isolated/continuous number recognition. In Jaan Penjam, editor, Proceedings of the 6th Fenno-Ugric Symposium on Software Technology (FUSST'99), pages 201–211, Sagadi, Estonia, August 1999.
Márk Jelasity. UEGO, an abstract niching technique for global optimization. In A. E. Eiben, Thomas Bäck, Marc Schoenauer, and Hans-Paul Schwefel, editors, Parallel Problem Solving from Nature - PPSN V, volume 1498 of Lecture Notes in Computer Science, pages 378–387. Springer-Verlag, 1998. (doi:10.1007/BFb0056880)
Márk Jelasity and József Dombi. GAS, a concept on modeling species in genetic algorithms. Artificial Intelligence, 99(1):1–19, 1998. (doi:10.1016/S0004-3702(97)00071-4)
Zoltán Alexin, János Csirik, Tibor Gyimóthy, Márk Jelasity, and László Tóth. Learning phonetic rules in a speech recognition system. In Nada Lavrač and Sašo Džeroski, editors, Inductive Logic Programming, 7th International Workshop, volume 1297 of Lecture Notes in Computer Science, pages 37–44. Springer-Verlag, 1997. (doi:10.1007/3540635149_33)
Márk Jelasity. A wave analysis of the subset sum problem. In Thomas Bäck, editor, Proceedings of the 7th International Conference on Genetic Algorithms (ICGA'97), pages 89–96. Morgan Kaufmann, 1997.
Márk Jelasity and József Dombi. GAS, a concept on modeling species in genetic algorithms. In Jean-Marc Alliot, Evelyne Lutton, Edmund M. A. Ronald, Marc Schoenauer, and Dominique Snyers, editors, Artificial Evolution, volume 1063 of Lecture Notes in Computer Science, pages 69–85. Springer-Verlag, 1996. (doi:10.1007/3-540-61108-8_31)
Márk Jelasity and József Dombi. Implicit formae in genetic algorithms. In Werner Ebeling, Ingo Rechenberg, Hans-Paul Schwefel, and Hans-Michael Voigt, editors, Parallel Problem Solving from Nature - PPSN IV, volume 1141 of Lecture Notes in Computer Science, pages 154–163. Springer-Verlag, 1996. (doi:10.1007/3-540-61723-X_979)
Márk Jelasity and József Dombi. GAS, an approach to a solution of the niche radius problem. In Proceedings of the First International Conference on Genetic Agorithms in Engeneering Systems: Innovations and Applications (GALESIA'95), pages 424–429, Sheffield, UK, 1995. IEE. (doi:10.1049/cp:19951086)

Jelasity Márk
Sat Aug 14 04:20:12 PM CEST 2021