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)

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)

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 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)

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)

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

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

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

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

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)

Wireless Adapter Sleep Scheduling Based on Video QoE: How to Improve Battery Life When Watching Streaming Video? - Márton Csernai; András Gulyás (ICCCN, 2011)

Incentivizing the global wireless village. - Gergely Biczók; László Toka; András Gulyás; Tuan Anh Trinh; Attila Vidács (Comput. Networks, 2011)

OpenFlow Virtualization Framework with Advanced Capabilities. - Balázs Sonkoly; András Gulyás; Felician Németh; János Czentye; Krisztian Kurucz; Barnabas Novak; Gabor Vaszkun (EWSDN, 2012)

On QoS Support to Ofelia and OpenFlow. - Balázs Sonkoly; András Gulyás; Felician Németh; János Czentye; Krisztian Kurucz; Barnabas Novak; Gabor Vaszkun (EWSDN, 2012)

Heterogeneous Testbeds, Tools and Experiments -Measurement Requirements Perspective. - Anastasius Gavras; Andrzej Bak; Gergely Biczók; Piotr Gajowniczek; András Gulyás; Halid Hrasnica; Pedro Martinez-Julia; Felician Németh; Chrysa Papagianni; Symeon Papavassiliou; Marcin Pilarski; Antonio Fernandez Gómez-Skarmeta (FP7 FIRE/EULER, 2012)

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)

Poincaré: A Hyperbolic Data Center Architecture. - Márton Csernai; András Gulyás; Attila Korösi; Balázs Sonkoly; Gergely Biczók (ICDCS Workshops, 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)

Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches. - Felician Németh; Ádám Stipkovits; Balázs Sonkoly; András Gulyás (SIGCOMM, 2012)

On greedy network formation. - András Gulyás; Attila Korösi; Dávid Szabó; Gergely Biczók (SIGMETRICS Perform. Evaluation Rev., 2012)

Notes on the Topological Consequences of BGP Policy Routing on the Internet AS Topology. - Dávid Szabó; András Gulyás (EUNICE, 2013)

A large-scale multipath playground for experimenters and early adopters. - Felician Németh; Balázs Sonkoly; Levente Csikor; András Gulyás (SIGCOMM, 2013)

Incrementally upgradable data center architecture using hyperbolic tessellations. - Márton Csernai; András Gulyás; Attila Korösi; Balázs Sonkoly; Gergely Biczók (Comput. Networks, 2013)

Free-scaling your data center. - László Gyarmati; András Gulyás; Balázs Sonkoly; Tuan Anh Trinh; Gergely Biczók (Comput. Networks, 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)

Multi-layered Service Orchestration in a Multi-domain Network Environment. - Attila Csoma; Balázs Sonkoly; Levente Csikor; Felician Németh; András Gulyás; Dávid Jocha; János Elek; Wouter Tavernier; Sahel Sahhaf (EWSDN, 2014)

Towards Unified Programmability of Cloud and Carrier Infrastructure. - Pontus Sköldström; Balázs Sonkoly; András Gulyás; Felician Németh; Mario Kind; Fritz-Joachim Westphal; Wolfgang John; Jokin Garay; Eduardo Jacob; Dávid Jocha; János Elek; Róbert Szabó; et al. (EWSDN, 2014)

An Information-Theoretic Approach to Routing Scalability. - Gábor Rétvári; Dávid Szabó; András Gulyás; Attila Korösi; János Tapolcai (HotNets, 2014)

SDN based testbeds for evaluating and promoting multipath TCP. - Balázs Sonkoly; Felician Németh; Levente Csikor; László Gulyás; András Gulyás (ICC, 2014)

On the Computational Complexity of Policy Routing. - Márton Zubor; Attila Korösi; András Gulyás; Gábor Rétvári (EUNICE, 2014)

Reducing cabling complexity in large flattened butterfly networks by an order of magnitude. - Márton Csernai; Florin Ciucu; Ralf-Peter Braun; András Gulyás (OFC, 2014)

ESCAPE: extensible service chain prototyping environment using mininet, click, NETCONF and POX. - Attila Csoma; Balázs Sonkoly; Levente Csikor; Felician Németh; András Gulyás; Wouter Tavernier; Sahel Sahhaf (SIGCOMM, 2014)

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)

Towards 48-fold cabling complexity reduction in large flattened butterfly networks. - Márton Csernai; Florin Ciucu; Ralf-Peter Braun; András Gulyás (INFOCOM, 2015)

EPOXIDE: A Modular Prototype for SDN Troubleshooting. - Tamás Lévai; István Pelle; Felicián Németh; András Gulyás (SIGCOMM, 2015)

Towards the 5G Revolution: A Software Defined Network Architecture Exploiting Network Coding as a Service. - Dávid Szabó; Felician Németh; Balázs Sonkoly; András Gulyás; Frank H. P. Fitzek (SIGCOMM, 2015)

One tool to rule them all: a modular troubleshooting framework for SDN (and other) networks. - István Pelle; Tamás Lévai; Felicián Németh; András Gulyás (SOSR, 2015)

On lower estimating internet queuing delay. - Attila Csoma; László Toka; András Gulyás (TSP, 2015)

Initial Service Provider DevOps concept, capabilities and proposed tools. - Wolfgang John; Catalin Meirosu; Pontus Sköldström; Felician Németh; András Gulyás; Mario Kind; Sachin Sharma 001; Ioanna Papafili; George Agapiou; Guido Marchetto; Riccardo Sisto; Rebecca Steinert; et al. (CoRR, 2015)

Service Provider DevOps network capabilities and tools. - Rebecca Steinert; Wolfgang John; Pontus Sköldström; Bertrand Pechenot; András Gulyás; István Pelle; Tamás Lévai; Felicián Németh; Juhoon Kim; Catalin Meirosu; Xuejun Cai; Chunyan Fu; et al. (CoRR, 2015)

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)

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)

Network Coding as a Service. - Dávid Szabó; Attila Csoma; Péter Megyesi; András Gulyás; Frank H. P. Fitzek (CoRR, 2016)

On Measuring the Geographic Diversity of Internet Routes. - Attila Csoma; András Gulyás; László Toka (IEEE Commun. Mag., 2017)

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 Little Less Interaction, A Little More Action: A Modular Framework for Network Troubleshooting. - István Pelle; Felicián Németh; András Gulyás (CoRR, 2017)

An Extensible Automated Failure Localization Framework Using NetKAT, Felix, and SDN Traceroute. - István Pelle; András Gulyás (Future Internet, 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)

Random Walk for Generalization in Goal-Directed Human Navigation on Wikipedia. - Dániel Ficzere; Gergely Hollósi; Attila Frankó; András Gulyás (COMPLEX NETWORKS (1), 2022)