default search action
József Bíró
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c55]Dániel Ficzere, Gergely Hollósi, Attila Frankó, Pál Varga, József Bíró:
Orderliness of Navigation Patterns in Hyperbolic Complex Networks. COMPLEX NETWORKS (3) 2023: 271-282 - 2022
- [c54]Bence Ladóczki, József Bíró, János Tapolcai:
Stochastic analysis of the success rate in atomic swaps between blockchains. BCCA 2022: 41-46 - [c53]Rolland Vida
, József Bíró:
Connected Hyperbolic Complex Networks. CSCI 2022: 432-437 - [c52]Ákos Leiter, István Kispál, Attila Hegyi, Péter Fazekas, Nándor Galambosi, Péter Hegyi, Péter Kulics, József Bíró:
Intent-based 5G UPF configuration via Kubernetes Operators in the Edge. ICUFN 2022: 186-189 - 2021
- [j19]Balázs Vass
Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters. IEEE J. Sel. Areas Commun. 39(9): 2672-2687 (2021) - [c51]Zalán Heszberger, András Majdán, András Gulyás, András Biró, László Balázs, József Bíró:
Analysis of Routing Entropy in Hyperbolic Trees. CSCI 2021: 587-591 - 2020
- [j18]Attila Korösi, András Gulyás
On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces. IEEE/ACM Trans. Netw. 28(3): 1353-1363 (2020)
2010 – 2019
- 2018
- [c50]János Tapolcai, Bálazs Vass
A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters. INFOCOM 2018: 2105-2113 - 2017
- [i4]Máté Csigi, Attila Korösi, József Bíró, Zalán Heszberger, Yury Malkov, András Gulyás:
Geometric explanation of the rich-club phenomenon in complex networks. CoRR abs/1702.02399 (2017) - [i3]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:
Routes Obey Hierarchy in Complex Networks. CoRR abs/1702.05912 (2017) - 2016
- [c49]Csaba Simon, Markosz Maliosz, József Bíró, Balázs Péter Gero, András Kern:
5G exchange for inter-domain resource sharing. LANMAN 2016: 1-6 - 2015
- [j17]János Tapolcai
Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding. IEEE/ACM Trans. Netw. 23(6): 1832-1845 (2015) - [i2]Dávid Szabó, Attila Korösi, József Bíró, András Gulyás:
Deductive Way of Reasoning about the Internet AS Level Topology. CoRR abs/1512.03169 (2015) - 2014
- [i1]András Gulyás, József Bíró, Attila Korösi, Gábor Rétvári, Dmitri Krioukov:
Complex Networks as Nash Equilibria of Navigation Games. CoRR abs/1412.7229 (2014) - 2013
- [j16]Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József Bíró:
Compact policy routing. Distributed Comput. 26(5-6): 309-320 (2013) - [c48]József Bíró, Tamás Bérczes, Attila Korösi, Zalán Heszberger, János Sztrik:
Discriminatory Processor Sharing from Optimization Point of View. ASMTA 2013: 67-80 - [c47]János Tapolcai
Reduced information scenario for Shared Segment Protection. CogInfoCom 2013: 589-594 - 2012
- [j15]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:
Challenges for the comprehensive management of Cloud Services in a PaaS framework. Scalable Comput. Pract. Exp. 13(3) (2012) - [c46]János Tapolcai
Stateless multi-stage dissemination of information: Source routing revisited. GLOBECOM 2012: 2797-2802 - [c45]Sergio García-Gómez, Manuel Escriche Vicente, Pablo Arozarena-Llopis, Francesco Lelli
4CaaSt: Comprehensive Management of Cloud Services through a PaaS. ISPA 2012: 494-499 - [c44]András Gulyás, Attila Korösi, Gábor Rétvári, József Bíró, Dávid Szabó:
Brief announcement: network formation games can give rise to realistic networks. PODC 2012: 329-330 - 2011
- [c43]Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József Bíró:
Compact policy routing. PODC 2011: 149-158 - 2010
- [j14]József Bíró:
Novel bandwidth requirement estimation based on exact large deviation asymptotics. Comput. Commun. 33(Supplement-1): S152-S156 (2010)
2000 – 2009
- 2009
- [c42]András Gulyás, József Bíró, Felician Németh
New stochastic network calculus for loss analysis. VALUETOOLS 2009: 38 - 2007
- [j13]Dinh-Dung Luong, Attila Vidács, József Bíró, Trang Dinh Dang, Daisuke Satoh, Keisuke Ishibashi:
Unicast probing techniques for estimation of shared loss rate. Int. J. Commun. Syst. 20(5): 613-632 (2007) - [j12]Mátyás Martinecz, András Kern, Zalán Heszberger, József Bíró:
Architecture and Configuration of Broadband Access Networks Supporting Multimedia Applications. Int. J. Comput. Their Appl. 14(1): 2-12 (2007) - [j11]Gábor Rétvári, József Bíró, Tibor Cinkler:
On shortest path representation. IEEE/ACM Trans. Netw. 15(6): 1293-1306 (2007) - [c41]Gábor Rétvári, József Bíró, Tibor Cinkler:
Routing-Independent Fairness in Capacitated Networks. ICC 2007: 6344-6349 - [c40]Gábor Rétvári, József Bíró, Tibor Cinkler:
Fairness in Capacitated Networks: A Polyhedral Approach. INFOCOM 2007: 1604-1612 - [c39]Szabolcs Máté Kis, József Bíró, Sándor Székely:
Estimation of Multiplexing Gain on Small Business VoIP Networks. ISCC 2007: 913-919 - 2006
- [j10]András Gulyás, József Bíró:
A stochastic extension of network calculus for workload loss examinations. IEEE Commun. Lett. 10(5): 399-401 (2006) - [c38]József Bíró:
Bandwidth Requirement Estimates Based on Asymptotic Loss Performance Analysis with QoS Constraint. GLOBECOM 2006 - [c37]András Gulyás, József Bíró, Zalán Heszberger:
A Probabilistic Network Calculus for Characterizing Long-run Network Behavior. ICC 2006: 465-470 - [c36]Mohamed Yahia, József Bíró:
Behavior of TCP algorithms on ad-hoc networks based on Different Routing Protocols(MANETs) and propagation models. ICWMC 2006: 40 - [c35]Tero Laine, József Bíró, Jussi Riihelä, Jens Jensen, Magnus Karlson, Peter Kristiansson:
Searching for Synergy: Java and SAF AIS. ISAS 2006: 229-252 - [c34]Gábor Rétvári, József Bíró, Tibor Cinkler:
On Improving the Accuracy of OSPF Traffic Engineering. Networking 2006: 51-62 - [c33]András Gulyás, József Bíró:
Workload Loss Examinations with a Novel Probabilistic Extension of Network Calculus. Networking 2006: 533-544 - [c32]József Bíró:
Loss ratio approximations in buffered systems with regulated inputs. VALUETOOLS 2006: 68 - 2005
- [j9]Felician Németh
Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline. Comput. Networks 48(6): 910-940 (2005) - [j8]József Bíró, András Gulyás, Mátyás Martinecz:
Parsimonious estimates of bandwidth requirement for quality of service packet networks. Perform. Evaluation 59: 159-178 (2005) - [c31]András Gulyás, József Bíró, Zalán Heszberger, Tamás Szénási:
Dependency criteria on regulated inputs for buffer overflow approximation. ICC 2005: 83-87 - [c30]Gábor Rétvári, József Bíró, Tibor Cinkler, Tamás Henk:
A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm. INFOCOM 2005: 260-268 - [c29]József Bíró, András Gulyás, Zalán Heszberger:
A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems. NETWORKING 2005: 718-729 - 2004
- [c28]István Moldován, Trang Dinh Dang, József Bíró, Daisuke Satoh, Keisuke Ishibashi:
Bottleneck links detection method based on passive monitoring. Communications, Internet, and Information Technology 2004: 115-121 - [c27]Attila Takács, András Császár, József Bíró, Róbert Szabó, Tamás Henk:
Path integrity aware traffic engineering [telecom traffic]. GLOBECOM 2004: 692-696 - [c26]András Gulyás, Tamás Szénási, József Bíró:
Buffer overflow estimation in network elements, multiplexing independent regulated inputs [packet switched networks]. GLOBECOM 2004: 1208-1212 - [c25]József Bíró, Zalán Heszberger, Mátyás Martinecz, Felician Németh, Octavian Pop:
Towards a framework of QoS measure estimates for packet-based networks. ICC 2004: 2231-2235 - [c24]József Bíró, András Gulyás, Tamás Szénási, Zalán Heszberger:
Distribution-free conservative bounds for QoS measures. ISCC 2004: 915-920 - [c23]Gábor Rétvári, József Bíró, Tibor Cinkler:
A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. ISCC 2004: 957-962 - [c22]József Bíró, Zalán Heszberger, Mátyás Martinecz:
A Family of Performance Bounds for QoS Measures in Packet-Based Networks. NETWORKING 2004: 1108-1119 - [c21]Gábor Rétvári, Róbert Szabó, József Bíró:
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. NETWORKING 2004: 1180-1191 - 2003
- [j7]Peter Barta, Felician Németh
Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds. Comput. Commun. 26(2): 65-78 (2003) - [j6]Gergely Seres, Árpád Szlávik, János Zátonyi, József Bíró:
Towards efficient decision rules for admission control based on the many sources asymptotics. Perform. Evaluation 53(3-4): 209-223 (2003) - [c20]József Bíró, Zalán Heszberger, Mátyás Martinecz:
Equivalent capacity estimators for bufferless fluid flow multiplexing. GLOBECOM 2003: 3706-3710 - [c19]Árpád Szlávik, Gergely Seres, János Zátonyi, József Bíró:
On the applicability of the on-off type approximation of the effective bandwidth function. ICC 2003: 183-187 - [c18]Felician Németh
Network Level Call Admission Control Algorithms for Generalized Processor Sharing Scheduling Discipline. ISCC 2003: 1299-1305 - [c17]Dinh-Dung Luong, Attila Vidács, József Bíró, Daisuke Satoh, Keisuke Ishibashi:
Unicast Probing to Estimate Shared Loss Rate. MMNS 2003: 503-515 - 2002
- [j5]Dinh-Dung Luong, József Bíró:
Hop-by-hop versus end-to-end active measurements. Comput. Commun. 25(10): 954-963 (2002) - [j4]Zalán Heszberger, József Bíró:
An optimization neural network model with time-dependent and lossy dynamics. Neurocomputing 48(1-4): 53-62 (2002) - [j3]Zalán Heszberger, János Zátonyi, József Bíró:
Performance bounds for rate envelope multiplexing. Perform. Evaluation 48(1/4): 87-101 (2002) - [j2]Zalán Heszberger, János Zátonyi, József Bíró:
Efficient Chernoff-Based Resource Assessment Techniques in Multi-Service Networks. Telecommun. Syst. 20(1-2): 59-80 (2002) - [c16]Peter Barta, Felician Németh
Call admission control algorithms for tandem generalized processor sharing networks. ISCC 2002: 789-795 - [c15]Dinh-Dung Luong, József Bíró:
Analysis and application of congestion measures. ISCC 2002: 843-848 - [c14]Gergely Seres, Árpád Szlávik, János Zátonyi, József Bíró:
Alternative admission rules based on the many sources asymptotics. ISCC 2002: 995-1000 - [c13]Gergely Seres, Árpád Szlávik, János Zátonyi, József Bíró:
Towards Efficient Decision Rules for Admission Control Based on the Many Sources Asymptotics. NETWORKING 2002: 166-177 - 2001
- [c12]Dinh-Dung Luong, József Bíró:
On the proportional fairness of TCP Vegas. GLOBECOM 2001: 1718-1722 - [c11]Peter Barta, Felician Németh, Róbert Szabó, József Bíró:
An approach for traffic characterization in generalized processor sharing networks. ICC 2001: 625-629 - [c10]Peter Barta, Felician Németh, Róbert Szabó, József Bíró:
End-to-End Delay Bound Calculation in Generalized Processor Sharing Networks. ISCC 2001: 282-287 - 2000
- [c9]Zalán Heszberger, József Bíró, Edith Halász:
An optimization neural network model with time-dependent and lossy dynamics. ESANN 2000: 287-292 - [c8]Zalán Heszberger, János Zátonyi, József Bíró, Tamás Henk:
Efficient bounds for bufferless statistical multiplexing. GLOBECOM 2000: 641-645 - [c7]Róbert Szabó, Peter Barta, Felician Németh, József Bíró:
Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions. INFOCOM 2000: 1243-1252 - [c6]Csaba Antal, József Bíró, Tamás Henk, Gergely Mátéfi:
Performance Evaluation of a Time Division Multiplexing Method Applicable for Dynamic Transfer Mode Networks. ISCC 2000: 34-39 - [c5]Róbert Szabó, Peter Barta, Felician Németh, József Bíró:
Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers. NETWORKING 2000: 727-739 - [c4]Octavian Pop, István Moldován, Csaba Simon, József Bíró, Arata Koike, Hiroshi Ishii:
Advertised Window-Based TCP Flow Control in Routers. SMARTNET 2000: 197-218
1990 – 1999
- 1999
- [c3]József Bíró, Zalán Heszberger:
Comparison of simple tail distribution estimators. ICC 1999: 1841-1845 - 1997
- [j1]András Faragó, József Bíró, Tamás Henk, Miklós Boda:
Analog Neural Optimization for ATM Resource Management. IEEE J. Sel. Areas Commun. 15(2): 156-164 (1997) - 1996
- [c2]József Bíró, Edith Halász, Tibor Trón, Miklós Boda, Gábor Privitzky:
Neural Networks for Exact Constrained Optimization. ICANN 1996: 537-542 - [c1]József Bíró, Zoltán Koronkai, Tibor Trón:
A noise annealing neural network for global optimization. ICNN 1996: 513-518
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-10-07 21:23 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: