Comparison of simple tail distribution estimators. - József Bíró; Zalán Heszberger (ICC, 1999)

An optimization neural network model with time-dependent and lossy dynamics. - Zalán Heszberger; József Bíró; Edith Halász (ESANN, 2000)

Efficient bounds for bufferless statistical multiplexing. - Zalán Heszberger; János Zátonyi; József Bíró; Tamás Henk (GLOBECOM, 2000)

An optimization neural network model with time-dependent and lossy dynamics. - Zalán Heszberger; József Bíró (Neurocomputing, 2002)

Performance bounds for rate envelope multiplexing. - Zalán Heszberger; János Zátonyi; József Bíró (Perform. Evaluation, 2002)

Efficient Chernoff-Based Resource Assessment Techniques in Multi-Service Networks. - Zalán Heszberger; János Zátonyi; József Bíró (Telecommun. Syst., 2002)

Equivalent capacity estimators for bufferless fluid flow multiplexing. - József Bíró; Zalán Heszberger; Mátyás Martinecz (GLOBECOM, 2003)

Towards a framework of QoS measure estimates for packet-based networks. - József Bíró; Zalán Heszberger; Mátyás Martinecz; Felician Németh; Octavian Pop (ICC, 2004)

An optimization neural network model with lossy dynamics and time-varying activation functions. - József Bíró; Zalán Heszberger (IJCNN, 2004)

Analog neural networks as asymptotically exact dynamic solvers. - József Bíró; Zalán Heszberger (IJCNN, 2004)

Distribution-free conservative bounds for QoS measures. - József Bíró; András Gulyás; Tamás Szénási; Zalán Heszberger (ISCC, 2004)

A Family of Performance Bounds for QoS Measures in Packet-Based Networks. - József Bíró; Zalán Heszberger; Mátyás Martinecz (NETWORKING, 2004)

Dependency criteria on regulated inputs for buffer overflow approximation. - András Gulyás; József Bíró; Zalán Heszberger; Tamás Szénási (ICC, 2005)

Architecture and Configuration of Broadband Access Networks Supporting Multimedia Applications. - András Kern; Mátyás Martinecz; Zalán Heszberger; Gyula Sallai (ISCC, 2005)

A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems. - József Bíró; András Gulyás; Zalán Heszberger (NETWORKING, 2005)

A Probabilistic Network Calculus for Characterizing Long-run Network Behavior. - András Gulyás; József Bíró; Zalán Heszberger (ICC, 2006)

Architecture and Configuration of Broadband Access Networks Supporting Multimedia Applications. - Mátyás Martinecz; András Kern; Zalán Heszberger; József Bíró (Int. J. Comput. Their Appl., 2007)

The Skeleton of the Internet. - Márton Csernai; András Gulyás; Gábor Rétvári; Zalán Heszberger; András Császár (GLOBECOM, 2010)

Stateless multi-stage dissemination of information: Source routing revisited. - János Tapolcai; András Gulyás; Zalán Heszberger; József Bíró; Péter Babarczi; Dirk Trossen (GLOBECOM, 2012)

Ping-Pong Reduction Using Sub Cell Movement Detection. - Zoltan Feher; Andras Veres; Zalán Heszberger (VTC Spring, 2012)

Discriminatory Processor Sharing from Optimization Point of View. - József Bíró; Tamás Bérczes; Attila Korösi; Zalán Heszberger; János Sztrik (ASMTA, 2013)

Reduced information scenario for Shared Segment Protection. - János Tapolcai; Zalán Heszberger; Gábor Rétvári; József Bíró (CogInfoCom, 2013)

Compact policy routing. - Gábor Rétvári; András Gulyás; Zalán Heszberger; Márton Csernai; József Bíró (Distributed Comput., 2013)

On the Scalability of Routing With Policies. - András Gulyás; Gábor Rétvári; Zalán Heszberger; Rachit Agarwal 001 (IEEE/ACM Trans. Netw., 2015)

Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding. - János Tapolcai; József Bíró; Péter Babarczi; András Gulyás; Zalán Heszberger; Dirk Trossen (IEEE/ACM Trans. Netw., 2015)

Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond. - Gábor Rétvári; János Tapolcai; Attila Korösi; András Majdán; Zalán Heszberger (IEEE/ACM Trans. Netw., 2016)

Geometric explanation of the rich-club phenomenon in complex networks. - Máté Csigi; Attila Korösi; József Bíró; Zalán Heszberger; Yury Malkov; András Gulyás (CoRR, 2017)

Routes Obey Hierarchy in Complex Networks. - Attila Csoma; Attila Korösi; Gábor Rétvári; Zalán Heszberger; József Bíró; Mariann Slíz; Andrea Avena-Koenigsberger; Alessandra Griffa; Patric Hagmann; András Gulyás (CoRR, 2017)

A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters. - János Tapolcai; Bálazs Vass; Zalán Heszberger; József Bíró; David Hay; Fernando A. Kuipers; Lajos Rónyai (INFOCOM, 2018)

The Performance of Multi-Path TCP with Overlapping Paths. - Lajos Zongor; Zalán Heszberger; Alija Pasic; János Tapolcai (SIGCOMM Posters and Demos, 2019)

On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces. - Attila Korösi; András Gulyás; Zalán Heszberger; József Bíró; Gábor Rétvári (IEEE/ACM Trans. Netw., 2020)

Analysis of Routing Entropy in Hyperbolic Trees. - Zalán Heszberger; András Majdán; András Gulyás; András Biró; László Balázs; József Bíró (CSCI, 2021)

Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters. - Balázs Vass; János Tapolcai; Zalán Heszberger; József Bíró; David Hay; Fernando A. Kuipers; Jorik Oostenbrink; Alessandro Valentini; Lajos Rónyai (IEEE J. Sel. Areas Commun., 2021)

Hyperbolic trees for efficient routing computation. - Zalán Heszberger (J. Supercomput., 2022)

Navigable Architectures for Complex Communication Networks. - András Majdán; Lejla Pasic; Zalán Heszberger; Rolland Vida; József Bíró (VCC, 2024)

IoT Connectivity Management by Hyperbolic Trees. - András Majdán; Lejla Pasic; Dániel Ficzere; Gergely Hollósi; Zalán Heszberger; Rolland Vida; József Bíró (NOMS, 2025)