Sledovať
Erika Bérczi-Kovács
Erika Bérczi-Kovács
Eötvös Loránd University
Overená e-mailová adresa na: ttk.elte.hu
Názov
Citované v
Citované v
Rok
Compiling packet programs to reconfigurable switches: Theory and algorithms
B Vass, E Bérczi-Kovács, C Raiciu, G Rétvári
Proceedings of the 3rd P4 Workshop in Europe, 28-35, 2020
272020
Envy-free relaxations for goods, chores, and mixed items
K Bérczi, ER Bérczi-Kovács, E Boros, FT Gedefa, N Kamiyama, T Kavitha, ...
Theoretical Computer Science 1002, 114596, 2024
26*2024
The complexity of the Clar number problem and an exact algorithm
ER Bérczi-Kovács, A Bernáth
Journal of Mathematical Chemistry, 1-9, 2017
20*2017
Scalable and efficient multipath routing via redundant trees
J Tapolcai, G Rétvári, P Babarczi, ER Bérczi-Kovács
IEEE Journal on Selected Areas in Communications 37 (5), 982-996, 2019
192019
Diversity coding in two-connected networks
P Babarczi, J Tapolcai, A Pašić, L Rónyai, ER Bérczi-Kovács, M Médard
IEEE/ACM transactions on networking 25 (4), 2308-2319, 2017
172017
Optimal and heuristic network coding algorithms for multi‐layered video broadcast
ER Bérczi‐Kovács, Z Király
Networks, 2017
15*2017
Enumerating Maximal Shared Risk Link Groups of Circular Disk Failures Hitting k Nodes
B Vass, J Tapolcai, ER Bérczi-Kovács
IEEE/ACM Transactions on Networking 29 (4), 1648-1661, 2021
142021
How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes
SI Nikolenko, K Kogan, G Rétvári, ER Bérczi-Kovács, A Shalimov
2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS …, 2016
142016
Scalable and efficient multipath routing: Complexity and algorithms
J Tapolcai, G Rétvári, P Babarczi, ER Bérczi-Kovács, P Kristóf, G Enyedi
2015 IEEE 23rd International Conference on Network Protocols (ICNP), 376-385, 2015
142015
Survivable routing meets diversity coding
A Pašić, J Tapolcai, P Babarczi, ER Bérczi-Kovács, Z Király, L Rónyai
2015 IFIP Networking Conference (IFIP Networking), 1-9, 2015
132015
Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem
B Vass, E Bérczi-Kovács, Á Barabás, ZL Hajdú, J Tapolcai
112022
Enumerating Shared Risk Link Groups of Circular Disk Failures Hitting k Nodes
B Vass, E Berczi-Kovacs, J Tapolcai
DRCN 2017-Design of Reliable Communication Networks; 13th International …, 2017
112017
Minimum cost survivable routing algorithms for generalized diversity coding
A Pašić, P Babarczi, J Tapolcai, ER Bérczi-Kovács, Z Király, L Rónyai
IEEE/ACM Transactions on Networking 28 (1), 289-300, 2020
82020
Shared risk link group enumeration of node excluding disaster failures
B Vass, E Bérczi-Kovács, J Tapolcai
2016 International Conference on Networking and Network Applications (NaNA …, 2016
72016
Constructive characterization theorems in combinatorial optimization
ER Kovács, LA Végh
RIMS Kôkyûroku Bessatsu, 2009
7*2009
Randomized and deterministic algorithms for network coding problems in wireless networks
Z Király, ER Kovács
Information Processing Letters 115 (4), 507-511, 2015
6*2015
A dual approach for dynamic pricing in multidemand markets
K Bérczi, ER Bérczi-Kovács, E Szögi
SIAM Journal on Discrete Mathematics 37 (3), 1771-1787, 2023
52023
A whirling dervish: Polynomial-time algorithm for the regional srlg-disjoint paths problem
B Vass, ER Bérczi-Kovács, Á Barabás, ZL Hajdú, J Tapolcai
IEEE/ACM Transactions on Networking 31 (6), 3051-3062, 2023
52023
Enumerating circular disk failures covering a single node
B Vass, ER Bérczi-Kovács, J Tapolcai
2016 8th International Workshop on Resilient Networks Design and Modeling …, 2016
42016
Receiver heterogeneity helps: Network coding for wireless multi-layer multicast
ER Kovács, MV Pedersen, DE Lucani, FHP Fitzek
2014 International Symposium on Network Coding (NetCod), 1-6, 2014
42014
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20