József Bíró

József Bíró
Office:
I.B. 227
+36 (1) 463-2764
E-mail:
biro_at_tmit_dot_bme_dot_hu
CV:
download pdf
[shorter version]

Current Research

  • Queuing theory and its applications
  • Performance evaluation methods for computer networks
  • Large deviations, hyperbolic graphs

Awards

  • János Bolyai Research Fellow, Hungarian Academy of Sciences, 2002-2005
  • Distinguished János Bolyai Research Fellow, Hungarian Academy of Sciences, 2007-2010
  • HTE Gold Medal, Scientific Association for Infocommunications Hungary (HTE), 2005
  • Certificate of Merit, János Bolyai Research Fellowship Board of Trustees, Hungarian Academy of Sciences, 2011.

Scientific Membership

  • Hungarian Academy of Sciences, elected member and secretary of Telecommunications Scientific Committee (MTA TTB)
  • Elected member of the General Assembly of the Hungarian Academy of Sciences
  • Institute of Electrical and Electronics Engineers (IEEE)
  • IEEE Communications Society (ComSoc)
  • Scientific Association for Infocommunications Hungary (HTE)

Publications

2015

  • A. Gulyás, J. Bíró, A. Kőrösi, G. Rétvári, and D. Krioukov, “Navigable networks as Nash equilibria of navigation games,” Nature communications, vol. 6, 2015.
    [Bibtex]
    @article{gulyas2015navigable,
    title={Navigable networks as Nash equilibria of navigation games},
    author={Guly{\'a}s, Andr{\'a}s and J. B\'ir\'o and K{\H{o}}r{\"o}si, Attila and R{\'e}tv{\'a}ri, G{\'a}bor and Krioukov, Dmitri},
    journal={Nature communications},
    volume={6},
    year={2015},
    publisher={Nature Publishing Group},
    keywords = {top and complex networks}
    }
  • [PDF] [DOI] J. Tapolcai, J. Bíró, P. Babarczi, A. Gulyás, Z. Heszberger, and D. Trossen, “Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding,” IEEE/ACM Transactions on Networking, vol. 23, iss. 6, pp. 1832-1845, 2015. impact factor 1.986
    [Bibtex]
    @ARTICLE{tapolcai2014bloom_ton,
    author = {J. Tapolcai and J. B\'ir\'o and P. Babarczi and A. Guly\'as and Z. Heszberger and D. Trossen},
    title = {Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast
    Forwarding},
    journal = {IEEE/ACM Transactions on Networking},
    volume={23},
    number={6},
    pages={1832--1845},
    year={2015},
    comment = {impact factor 1.986},
    doi = {10.1109/TNET.2014.2342155},
    issn = {1063-6692},
    keywords = {multicast addressing and future internet architectures and top}
    }

2013

  • G. Rétvári, A. Gulyás, Z. Heszberger, M. Csernai, and J. J. Bíró, “Compact policy routing,” Distributed computing, vol. 26, iss. 5-6, pp. 309-320, 2013.
    [Bibtex]
    @ARTICLE{retvari2013compact,
    author = {R\'etv\'ari, G\'abor and Guly\'as, Andr\'as and Heszberger, Zal\'an and Csernai, M\'arton and B{\'i}r\'o, J\'ozsef J},
    title = {Compact policy routing},
    journal = {Distributed computing},
    year = {2013},
    volume = {26},
    pages = {309--320},
    number = {5-6},
    keywords = {compact routing},
    publisher = {Springer Berlin Heidelberg}
    }

2012

  • A. Gulyás, A. Kőrösi, G. Rétvári, J. Bíró, and D. Szabó, “Brief announcement: network formation games can give rise to realistic networks,” in Proc. ACM symposium on Principles of Distributed Computing (PODC), brief announcement, 2012, pp. 329-330.
    [Bibtex]
    @INPROCEEDINGS{gulyas2012brief,
    author = {Guly\'as, Andr\'as and K{\H{o}}r{\"o}si, Attila and R\'etv\'ari, G\'abor and B\'ir\'o, J\'ozsef and Szab\'o, D\'avid},
    title = {Brief announcement: network formation games can give rise to realistic
    networks},
    booktitle = {Proc. ACM symposium on Principles of Distributed
    Computing (PODC), brief announcement},
    year = {2012},
    pages = {329--330},
    organization = {ACM},
    keywords = {complex networks and top}
    }
  • [DOI] J. Tapolcai, A. Gulyás, Z. Heszberger, J. Bíró, P. Babarczi, and D. Trossen, “Stateless Multi-Stage Dissemination of Information: Source Routing Revisited,” in Proc. IEEE Global Communications Conference (GLOBECOM) – Next Generation Networking and Internet Symposium, 2012, pp. 2797-2802.
    [Bibtex]
    @INPROCEEDINGS{tapolcai2012bloom,
    author = {J. Tapolcai and A. Guly\'as and Z. Heszberger and J. B\'ir\'o and P. Babarczi and D. Trossen},
    title = {Stateless Multi-Stage Dissemination of Information: Source Routing
    Revisited},
    booktitle = {Proc. IEEE Global Communications Conference (GLOBECOM) - Next Generation
    Networking and Internet Symposium},
    year = {2012},
    pages = {2797-2802},
    month = {Dec},
    doi = {10.1109/GLOCOM.2012.6503540},
    issn = {1930-529X},
    keywords = {multicast addressing and future internet architectures}
    }

2011

  • Z. Heszberger, J. Tapolcai, A. Gulyás, J. Bíró, A. Zahemszky, and P. Ho, “Adaptive Bloom Filters for Multicast Addressing,” in Proc. IEEE Infocom Workshop, High-Speed Networks (HSN), Shanghai, P.R. China, 2011, pp. 174-179.
    [Bibtex]
    @INPROCEEDINGS{heszi2011abloom,
    author = {Z. Heszberger and J. Tapolcai and A. Guly\'as and J. B\'ir\'o and A. Zahemszky and Pin-Han Ho},
    title = {Adaptive Bloom Filters for Multicast Addressing},
    booktitle = {Proc. IEEE Infocom Workshop, High-Speed Networks (HSN)},
    year = {2011},
    pages = {174-179},
    address = {Shanghai, P.R. China},
    month = {4},
    days = {10},
    keywords = {multicast addressing and future internet architectures}
    }