default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZalán Heszberger
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Zalán Heszberger
:
Hyperbolic trees for efficient routing computation. J. Supercomput. 78(13): 15250-15268 (2022)- 2021
- [j10]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:
Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters. IEEE J. Sel. Areas Commun. 39(9): 2672-2687 (2021) - [c21]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
- [j9]Attila Korösi, András Gulyás, Zalán Heszberger, József Bíró, Gábor Rétvári:
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
- 2019
- [c20]Lajos Zongor, Zalán Heszberger, Alija Pasic, János Tapolcai:
The Performance of Multi-Path TCP with Overlapping Paths. SIGCOMM Posters and Demos 2019: 116-118 - 2018
- [c19]János Tapolcai, Bálazs Vass, Zalán Heszberger, József Bíró, David Hay, Fernando A. Kuipers, Lajos Rónyai:
A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters. INFOCOM 2018: 2105-2113 - 2017
- [i3]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) - [i2]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
- [j8]Gábor Rétvári, János Tapolcai, Attila Korösi, András Majdán, Zalán Heszberger:
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond. IEEE/ACM Trans. Netw. 24(1): 149-162 (2016) - 2015
- [j7]András Gulyás, Gábor Rétvári, Zalán Heszberger, Rachit Agarwal:
On the Scalability of Routing With Policies. IEEE/ACM Trans. Netw. 23(5): 1610-1618 (2015) - [j6]János Tapolcai, József Bíró, Péter Babarczi, András Gulyás, Zalán Heszberger, Dirk Trossen:
Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding. IEEE/ACM Trans. Netw. 23(6): 1832-1845 (2015) - 2014
- [i1]Gábor Rétvári, János Tapolcai, Attila Korösi, András Majdán, Zalán Heszberger:
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond. CoRR abs/1402.1194 (2014) - 2013
- [j5]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) - [c18]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 - [c17]János Tapolcai, Zalán Heszberger, Gábor Rétvári, József Bíró:
Reduced information scenario for Shared Segment Protection. CogInfoCom 2013: 589-594 - [c16]Gábor Rétvári, János Tapolcai, Attila Korösi, András Majdán, Zalán Heszberger:
Compressing IP forwarding tables: towards entropy bounds and beyond. SIGCOMM 2013: 111-122 - 2012
- [c15]János Tapolcai, András Gulyás, Zalán Heszberger, József Bíró, Péter Babarczi, Dirk Trossen:
Stateless multi-stage dissemination of information: Source routing revisited. GLOBECOM 2012: 2797-2802 - [c14]Zoltan Feher, Andras Veres, Zalán Heszberger:
Ping-Pong Reduction Using Sub Cell Movement Detection. VTC Spring 2012: 1-5 - 2011
- [c13]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
- [c12]Márton Csernai, András Gulyás, Gábor Rétvári, Zalán Heszberger, András Császár:
The Skeleton of the Internet. GLOBECOM 2010: 1-5
2000 – 2009
- 2007
- [j4]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) - 2006
- [c11]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 - 2005
- [c10]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 - [c9]András Kern, Mátyás Martinecz, Zalán Heszberger, Gyula Sallai:
Architecture and Configuration of Broadband Access Networks Supporting Multimedia Applications. ISCC 2005: 173-178 - [c8]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
- [c7]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 - [c6]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 - [c5]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 - 2003
- [c4]József Bíró, Zalán Heszberger, Mátyás Martinecz:
Equivalent capacity estimators for bufferless fluid flow multiplexing. GLOBECOM 2003: 3706-3710 - 2002
- [j3]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) - [j2]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) - [j1]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) - 2000
- [c3]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 - [c2]Zalán Heszberger, János Zátonyi, József Bíró, Tamás Henk:
Efficient bounds for bufferless statistical multiplexing. GLOBECOM 2000: 641-645
1990 – 1999
- 1999
- [c1]József Bíró, Zalán Heszberger:
Comparison of simple tail distribution estimators. ICC 1999: 1841-1845
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-04-25 05:43 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:
