Neural Networks for Exact Constrained Optimization. - József Bíró; Edith Halász; Tibor Trón; Miklós Boda; Gábor Privitzky (ICANN, 1996)

A noise annealing neural network for global optimization. - József Bíró; Zoltán Koronkai; Tibor Trón (ICNN, 1996)

Analog Neural Optimization for ATM Resource Management. - András Faragó; József Bíró; Tamás Henk; Miklós Boda (IEEE J. Sel. Areas Commun., 1997)

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)

Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions. - Róbert Szabó; Peter Barta; Felician Németh; József Bíró (INFOCOM, 2000)

Performance Evaluation of a Time Division Multiplexing Method Applicable for Dynamic Transfer Mode Networks. - Csaba Antal; József Bíró; Tamás Henk; Gergely Mátéfi (ISCC, 2000)

Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers. - Róbert Szabó; Peter Barta; Felician Németh; József Bíró (NETWORKING, 2000)

Advertised Window-Based TCP Flow Control in Routers. - Octavian Pop; István Moldován; Csaba Simon; József Bíró; Arata Koike; Hiroshi Ishii 002 (SMARTNET, 2000)

On the proportional fairness of TCP Vegas. - Dinh-Dung Luong; József Bíró (GLOBECOM, 2001)

An approach for traffic characterization in generalized processor sharing networks. - Peter Barta; Felician Németh; Róbert Szabó; József Bíró (ICC, 2001)

End-to-End Delay Bound Calculation in Generalized Processor Sharing Networks. - Peter Barta; Felician Németh; Róbert Szabó; József Bíró (ISCC, 2001)

Call admission control algorithms for tandem generalized processor sharing networks. - Peter Barta; Felician Németh; Róbert Szabó; József Bíró (ISCC, 2002)

Analysis and application of congestion measures. - Dinh-Dung Luong; József Bíró (ISCC, 2002)

Alternative admission rules based on the many sources asymptotics. - Gergely Seres; Árpád Szlávik; János Zátonyi; József Bíró (ISCC, 2002)

Hop-by-hop versus end-to-end active measurements. - Dinh-Dung Luong; József Bíró (Comput. Commun., 2002)

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)

On the applicability of the on-off type approximation of the effective bandwidth function. - Árpád Szlávik; Gergely Seres; János Zátonyi; József Bíró (ICC, 2003)

Network Level Call Admission Control Algorithms for Generalized Processor Sharing Scheduling Discipline. - Felician Németh; Peter Barta; József Bíró (ISCC, 2003)

Unicast Probing to Estimate Shared Loss Rate. - Dinh-Dung Luong; Attila Vidács; József Bíró; Daisuke Satoh; Keisuke Ishibashi (MMNS, 2003)

Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds. - Peter Barta; Felician Németh; Róbert Szabó; József Bíró (Comput. Commun., 2003)

Towards efficient decision rules for admission control based on the many sources asymptotics. - Gergely Seres; Árpád Szlávik; János Zátonyi; József Bíró (Perform. Evaluation, 2003)

Bottleneck links detection method based on passive monitoring. - István Moldován; Trang Dinh Dang; József Bíró; Daisuke Satoh; Keisuke Ishibashi (Communications, Internet, and Information Technology, 2004)

Buffer overflow estimation in network elements, multiplexing independent regulated inputs [packet switched networks]. - András Gulyás; Tamás Szénási; József Bíró (GLOBECOM, 2004)

Path integrity aware traffic engineering [telecom traffic]. - Attila Takács; András Császár; József Bíró; Róbert Szabó; Tamás Henk (GLOBECOM, 2004)

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 novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. - Gábor Rétvári; József Bíró; Tibor Cinkler (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)

On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. - Gábor Rétvári; Róbert Szabó; József Bíró (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)

A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm. - Gábor Rétvári; József Bíró; Tibor Cinkler; Tamás Henk (INFOCOM, 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)

Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline. - Felician Németh; Peter Barta; Róbert Szabó; József Bíró (Comput. Networks, 2005)

Parsimonious estimates of bandwidth requirement for quality of service packet networks. - József Bíró; András Gulyás; Mátyás Martinecz (Perform. Evaluation, 2005)

Bandwidth Requirement Estimates Based on Asymptotic Loss Performance Analysis with QoS Constraint. - József Bíró (GLOBECOM, 2006)

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

Behavior of TCP algorithms on ad-hoc networks based on Different Routing Protocols(MANETs) and propagation models. - Mohamed Yahia; József Bíró (ICWMC, 2006)

Searching for Synergy: Java and SAF AIS. - Tero Laine; József Bíró; Jussi Riihelä; Jens Jensen; Magnus Karlson; Peter Kristiansson (ISAS, 2006)

Workload Loss Examinations with a Novel Probabilistic Extension of Network Calculus. - András Gulyás; József Bíró (Networking, 2006)

On Improving the Accuracy of OSPF Traffic Engineering. - Gábor Rétvári; József Bíró; Tibor Cinkler (Networking, 2006)

Loss ratio approximations in buffered systems with regulated inputs. - József Bíró (VALUETOOLS, 2006)

A stochastic extension of network calculus for workload loss examinations. - András Gulyás; József Bíró (IEEE Commun. Lett., 2006)

Routing-Independent Fairness in Capacitated Networks. - Gábor Rétvári; József Bíró; Tibor Cinkler (ICC, 2007)

Fairness in Capacitated Networks: A Polyhedral Approach. - Gábor Rétvári; József Bíró; Tibor Cinkler (INFOCOM, 2007)

Estimation of Multiplexing Gain on Small Business VoIP Networks. - Szabolcs Máté Kis; József Bíró; Sándor Székely (ISCC, 2007)

Unicast probing techniques for estimation of shared loss rate. - Dinh-Dung Luong; Attila Vidács; József Bíró; Trang Dinh Dang; Daisuke Satoh; Keisuke Ishibashi (Int. J. Commun. Syst., 2007)

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)

On shortest path representation. - Gábor Rétvári; József Bíró; Tibor Cinkler (IEEE/ACM Trans. Netw., 2007)

New stochastic network calculus for loss analysis. - András Gulyás; József Bíró; Felician Németh (VALUETOOLS, 2009)

Novel bandwidth requirement estimation based on exact large deviation asymptotics. - József Bíró (Comput. Commun., 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)

4CaaSt: Comprehensive Management of Cloud Services through a PaaS. - Sergio García-Gómez; Manuel Escriche Vicente; Pablo Arozarena-Llopis; Francesco Lelli; Yehia Taher; Christof Momm; Axel Spriestersbach; Jürgen Vogel 001; Andrea Giessmann; Frederic Junker; Miguel Jiménez-Gañán; József Bíró; et al. (ISPA, 2012)

Brief announcement: network formation games can give rise to realistic networks. - András Gulyás; Attila Korösi; Gábor Rétvári; József Bíró; Dávid Szabó (PODC, 2012)

Challenges for the comprehensive management of Cloud Services in a PaaS framework. - Sergio García-Gómez; Miguel Jiménez-Gañán; Yehia Taher; Christof Momm; Frederic Junker; József Bíró; Andreas Menychtas; Vasilios Andrikopoulos; Steve Strauch (Scalable Comput. Pract. Exp., 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)

Complex Networks as Nash Equilibria of Navigation Games. - András Gulyás; József Bíró; Attila Korösi; Gábor Rétvári; Dmitri Krioukov (CoRR, 2014)

Deductive Way of Reasoning about the Internet AS Level Topology. - Dávid Szabó; Attila Korösi; József Bíró; András Gulyás (CoRR, 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)

5G exchange for inter-domain resource sharing. - Csaba Simon; Markosz Maliosz; József Bíró; Balázs Péter Gero; András Kern (LANMAN, 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)

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)

Stochastic analysis of the success rate in atomic swaps between blockchains. - Bence Ladóczki; József Bíró; János Tapolcai (BCCA, 2022)

Connected Hyperbolic Complex Networks. - Rolland Vida; József Bíró (CSCI, 2022)

Intent-based 5G UPF configuration via Kubernetes Operators in the Edge. - Ákos Leiter; István Kispál; Attila Hegyi; Péter Fazekas; Nándor Galambosi; Péter Hegyi; Péter Kulics; József Bíró (ICUFN, 2022)

Orderliness of Navigation Patterns in Hyperbolic Complex Networks. - Dániel Ficzere; Gergely Hollósi; Attila Frankó; Pál Varga; József Bíró (COMPLEX NETWORKS (3), 2023)

Optimizing Partner Selection for Cooperative Solar Generation Forecasting. - Lejla Pasic; Azra Pasic; Alija Pasic; József Bíró (RTSI, 2024)

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

A Distributed and Self-Organizing Attack Model in Hyperbolically Embedded Networks. - András Majdán; Lejla Pasic; Dániel Ficzere; Gergely Hollósi; József Bíró (NetSoft, 2025)

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)