@article{MTMT:3150404,
	title = {Fairness in Kademlia with random node joins},
	url = {https://m2.mtmt.hu/api/publication/3150404},
	author = {Novák, Zoltán and Pap, Zoltán},
	journal-iso = {INFOCOMM J},
	journal = {INFOCOMMUNICATIONS JOURNAL},
	volume = {7},
	unique-id = {3150404},
	issn = {2061-2079},
	year = {2015},
	eissn = {2061-2125},
	pages = {19-25}
}

@article{MTMT:2695172,
	title = {The Incremental Maintenance of Transition Tour},
	url = {https://m2.mtmt.hu/api/publication/2695172},
	author = {Németh, Gábor Árpád and Pap, Zoltán},
	doi = {10.3233/FI-2014-972},
	journal-iso = {FUND INFOR},
	journal = {FUNDAMENTA INFORMATICAE},
	volume = {129},
	unique-id = {2695172},
	issn = {0169-2968},
	abstract = {While evolutionary development methodologies have become 
		increasingly prevalent, incremental testing methods are lagging 
		behind. Most traditional test generation algorithms – including 
		the Transition Tour method – rebuild test sequences from scratch 
		even if minimal changes to the system have been made. In the 
		current paper we propose two incremental algorithms to update a 
		Transition Tour test sequence after changes in a deterministic 
		finite state machine model. Our solution uses existing 
		information – the Eulerian graph of a previous version of the 
		system and an Euler tour in it – to update the test cases of the 
		system in response to modification. The first algorithm keeps an 
		Eulerian graph up to date, while the second algorithm maintains 
		an Euler tour in the augmented graph. Analytical and practical 
		analyses show that our algorithms are very efficient in the case 
		of changing specifications. We also demonstrate our methods 
		through an example.},
	year = {2014},
	eissn = {1875-8681},
	pages = {279-300},
	orcid-numbers = {Németh, Gábor Árpád/0000-0003-2554-9860}
}

@inproceedings{MTMT:2695173,
	title = {The Incremental Maintenance of a Checking Sequence},
	url = {https://m2.mtmt.hu/api/publication/2695173},
	author = {Németh, Gábor Árpád and Pap, Zoltán and Kovács, Gábor},
	booktitle = {Proceedings of the Automation and Applied Computer Science Workshop 2013, AACS '13},
	unique-id = {2695173},
	year = {2013},
	pages = {58-69}
}

@article{MTMT:2834556,
	title = {Exploiting interest-based proximity for content recommendation in peer-to-peer networks},
	url = {https://m2.mtmt.hu/api/publication/2834556},
	author = {Novák, Zoltán and Pap, Zoltán},
	doi = {10.1049/iet-com.2011.0193},
	journal-iso = {IET COMMUN},
	journal = {IET COMMUNICATIONS},
	volume = {6},
	unique-id = {2834556},
	issn = {1751-8628},
	year = {2012},
	eissn = {1751-8636},
	pages = {1595-1601}
}

@{MTMT:2664164,
	title = {Protocols in Next Generation Networks},
	url = {https://m2.mtmt.hu/api/publication/2664164},
	author = {Horváth, Róbert Richárd and Kovács, Gábor and Pap, Zoltán},
	booktitle = {Advanced Communication Protocol Technologies},
	unique-id = {2664164},
	year = {2011},
	pages = {207-225}
}

@{MTMT:2664163,
	title = {Convergence of Fixed and Mobile Networks},
	url = {https://m2.mtmt.hu/api/publication/2664163},
	author = {Kovács, Gábor and Németh, Gábor Árpád and Pap, Zoltán},
	booktitle = {Advanced Communication Protocol Technologies},
	doi = {10.4018/978-1-4666-2919-6.ch003},
	unique-id = {2664163},
	year = {2011},
	pages = {226-246},
	orcid-numbers = {Németh, Gábor Árpád/0000-0003-2554-9860}
}

@article{MTMT:2664215,
	title = {Deriving compact test suites for telecommunication software using distance metrics},
	url = {https://m2.mtmt.hu/api/publication/2664215},
	author = {Kovács, Gábor and Németh, Gábor Árpád and Pap, Zoltán and Subramaniam, Mahadevan},
	doi = {10.24138/jcomss.v5i2.205},
	journal-iso = {J COMM SOFTW SYST},
	journal = {JOURNAL OF COMMUNICATIONS SOFTWARE AND SYSTEMS},
	volume = {5},
	unique-id = {2664215},
	issn = {1845-6421},
	abstract = {This paper proposes a string edit distance based test selection method to generate compact test sets for telecommunica- tions software. Following the results of previous research, a trace in a test set is considered to be redundant if its edit distance from others is less than a given parameter. The algorithm first deter- mines the minimum cardinality of the target test set in accordance with the provided parameter, then it selects the test set with the highest sum of internal edit distances. The selection problem is reduced to an assignment problem in bipartite graphs.},
	year = {2009},
	pages = {57-61},
	orcid-numbers = {Németh, Gábor Árpád/0000-0003-2554-9860}
}

@inproceedings{MTMT:2646991,
	title = {Optimal string edit distance based test suite reduction for SDL specifications},
	url = {https://m2.mtmt.hu/api/publication/2646991},
	author = {Kovács, Gábor and Németh, Gábor Árpád and Subramaniam, M and Pap, Zoltán},
	booktitle = {14th International SDL Forum},
	doi = {10.1007/978-3-642-04554-7_6},
	unique-id = {2646991},
	year = {2009},
	pages = {82-97},
	orcid-numbers = {Németh, Gábor Árpád/0000-0003-2554-9860}
}

@inproceedings{MTMT:2647588,
	title = {RESERV: A Distributed, Load Balanced Information System for Grid Applications},
	url = {https://m2.mtmt.hu/api/publication/2647588},
	author = {Vincze, Gábor and Novák, Zoltán and Pap, Zoltán and Vida, Rolland},
	booktitle = {2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID)},
	doi = {10.1109/CCGRID.2008.35},
	unique-id = {2647588},
	abstract = {Resource information systems are a key component of Computational Grids. Centralized information systems hamper scalability and reliability, and thus, completely distributed resource information systems, based on Distributed Hash Tables have been proposed. In some cases resource distribution might be highly uneven, load balancing of data becomes thus a crucial problem. However, current load balancing schemes cannot handle large amounts of data corresponding to a single resource type. In this paper we propose therefore RESERV, a distributed information system for Grid applications with a novel load balancing approach, able to handle extreme load unbalance.},
	year = {2008},
	pages = {596-601}
}

@inproceedings{MTMT:2638182,
	title = {Deriving compact test suites for telecommunication software using distance metrics},
	url = {https://m2.mtmt.hu/api/publication/2638182},
	author = {Kovács, Gábor and Németh, Gábor Árpád and Pap, Zoltán and Subramaniam, Mahadevan},
	booktitle = {International Conference on Software, Telecommunications and Computer Networks (SoftCOM)},
	doi = {10.1109/SOFTCOM.2008.4669517},
	unique-id = {2638182},
	year = {2008},
	pages = {394-398},
	orcid-numbers = {Németh, Gábor Árpád/0000-0003-2554-9860}
}