@article{MTMT:34750423,
	title = {High performance Boson sampling simulation via data-flow engines},
	url = {https://m2.mtmt.hu/api/publication/34750423},
	author = {Morse, Gregory and Rybotycki, Tomasz and Kaposi, Ágoston and Kolarovszki, Zoltán and Stojčić, Uroš and Kozsik, Tamás and Mencer, Oskar and Oszmaniec, Michał and Zimborás, Zoltán and Rakyta, Péter},
	doi = {10.1088/1367-2630/ad313b},
	journal-iso = {NEW J PHYS},
	journal = {NEW JOURNAL OF PHYSICS},
	volume = {26},
	unique-id = {34750423},
	issn = {1367-2630},
	abstract = {Boson sampling (BS) is viewed to be an accessible quantum computing paradigm to demonstrate computational advantage compared to classical computers. In this context, the evolution of permanent calculation algorithms attracts a significant attention as the simulation of BS experiments involves the evaluation of vast number of permanents. For this reason, we generalize the Balasubramanian–Bax–Franklin–Glynn permanent formula, aiming to efficiently integrate it into the BS strategy of Clifford and Clifford (2020 Faster classical boson sampling). A reduction in simulation complexity originating from multiplicities in photon occupation was achieved through the incorporation of a n-ary Gray code ordering of the addends during the permanent evaluation. Implementing the devised algorithm on FPGA-based data-flow engines, we leverage the resulting tool to accelerate boson sampling simulations for up to 40 photons. Drawing samples from a 60-mode interferometer, the achieved rate averages around 80 s per sample, employing 4 FPGA chips. The developed design facilitates the simulation of both ideal and lossy boson sampling experiments.},
	year = {2024},
	eissn = {1367-2630},
	orcid-numbers = {Morse, Gregory/0000-0002-0231-6557; Kozsik, Tamás/0000-0003-4484-9172; Rakyta, Péter/0000-0002-3506-558X}
}

@inproceedings{MTMT:34556674,
	title = {On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming},
	url = {https://m2.mtmt.hu/api/publication/34556674},
	author = {Morse, Gregory and Kozsik, Tamás},
	booktitle = {Proceedings of the 7th International Conference on Algorithms, Computing and Systems},
	doi = {10.1145/3631908.3631929},
	unique-id = {34556674},
	abstract = {We present an asymptotic improvement in the number of variables (n + m⌊log 2(k − 1)⌋) required for state-of-the-art formulation of (max-)k-SAT problems when encoded as a quadratic unconstrained binary optimization (QUBO) problem. We further show a variable reduction technique (max-)3-SAT formula which achieves the optimal number of substitution variables. We show optimality empirically by presenting an integer linear programming (ILP) construction for arbitrary Boolean formulas. We show how various goals can be encoded, and this model can be generalized to searching for arbitrary substitution variable functions. Lastly, we show the optimal high-order substitution reduction in cubic QUBO equations which has smaller coefficients than the typical construction used.},
	keywords = {NP-complete; SAT; Max-SAT; ILP; QUBO},
	year = {2024},
	pages = {145–153},
	orcid-numbers = {Morse, Gregory/0000-0002-0231-6557; Kozsik, Tamás/0000-0003-4484-9172}
}

@article{MTMT:34429534,
	title = {Multi-Project Multi-Environment Approach—An Enhancement to Existing DevOps and Continuous Integration and Continuous Deployment Tools},
	url = {https://m2.mtmt.hu/api/publication/34429534},
	author = {Erdenebat, Baasanjargal and Bud, Bayarjargal and Batsuren, Temuulen and Kozsik, Tamás},
	doi = {10.3390/computers12120254},
	journal-iso = {COMPUTERS},
	journal = {COMPUTERS},
	volume = {12},
	unique-id = {34429534},
	abstract = {DevOps methodology and tools, which provide standardized ways for continuous integration (CI) and continuous deployment (CD), are invaluable for efficient software development. Current DevOps solutions, however, lack a useful functionality: they do not support simultaneous project developments and deployment on the same operating infrastructure (e.g., a cluster of Docker containers). In this paper, we propose a novel approach to address this shortcoming by defining a multi-project, multi-environment (MPME) approach. With this approach, a large company can organize many microservice-based projects operating simultaneously on a common code base, using self-hosted Kubernetes clusters, which helps developers and businesses to better focus on the product they are developing, and to reduce efforts on the management of their DevOps infrastructure.},
	year = {2023},
	eissn = {2073-431X},
	pages = {254},
	orcid-numbers = {Kozsik, Tamás/0000-0003-4484-9172}
}

@article{MTMT:34406898,
	title = {Design and Implement an Accurate Automated Static Analysis Checker to Detect Insecure Use of SecurityManager},
	url = {https://m2.mtmt.hu/api/publication/34406898},
	author = {Alqaradaghi, Midya and Nazir, Muhammad Zafar Iqbal and Kozsik, Tamás},
	doi = {10.3390/computers12120247},
	journal-iso = {COMPUTERS},
	journal = {COMPUTERS},
	volume = {12},
	unique-id = {34406898},
	abstract = {Static analysis is a software testing technique that analyzes the code without executing it. It is widely used to detect vulnerabilities, errors, and other issues during software development. Many tools are available for static analysis of Java code, including SpotBugs. Methods that perform a security check must be declared private or final; otherwise, they can be compromised when a malicious subclass overrides the methods and omits the checks. In Java, security checks can be performed using the SecurityManager class. This paper addresses the aforementioned problem by building a new automated checker that raises an issue when this rule is violated. The checker is built under the SpotBugs static analysis tool. We evaluated our approach on both custom test cases and real-world software, and the results revealed that the checker successfully detected related bugs in both with optimal metrics values.},
	year = {2023},
	eissn = {2073-431X},
	pages = {247},
	orcid-numbers = {Nazir, Muhammad Zafar Iqbal/0009-0005-7236-5759; Kozsik, Tamás/0000-0003-4484-9172}
}

@misc{MTMT:34139689,
	title = {High performance Boson Sampling simulation via data-flow engines},
	url = {https://m2.mtmt.hu/api/publication/34139689},
	author = {Morse, Gregory and Tomasz, Rybotycki and Kaposi, Ágoston and Kolarovszki, Zoltán and Uros, Stojic and Kozsik, Tamás and Oskar, Mencer and Michał, Oszmaniec and Zimborás, Zoltán and Rakyta, Péter},
	unique-id = {34139689},
	year = {2023},
	orcid-numbers = {Morse, Gregory/0000-0002-0231-6557; Kozsik, Tamás/0000-0003-4484-9172; Rakyta, Péter/0000-0002-3506-558X}
}

@article{MTMT:34130456,
	title = {Challenges in service discovery for microservices deployed in a Kubernetes cluster – a case study},
	url = {https://m2.mtmt.hu/api/publication/34130456},
	author = {Erdenebat, Baasanjargal and Bud, Bayarjargal and Kozsik, Tamás},
	doi = {10.36244/ICJ.2023.5.11},
	journal-iso = {INFOCOMM J},
	journal = {INFOCOMMUNICATIONS JOURNAL},
	volume = {15},
	unique-id = {34130456},
	issn = {2061-2079},
	abstract = {With Kubernetes emerging as one of the most popular infrastructures in the cloud-native era, the utilization of containerization and tools alongside Kubernetes is steadily gaining traction. The main goal of this paper is to evaluate the service discovery mechanisms and DNS management (CoreDNS) of Kubernetes, and to present a general study of an experiment on service discovery challenges. In large scale Kubernetes clusters, running pods, services, requests, and workloads can be substantial. The increased number of HTTP-requests often result in resource utilization concerns, e.g., spikes of errors [24], [25]. This paper investigates potential optimization strategies for enhancing the performance and scalability of CoreDNS in Kubernetes. We propose a solution to address the concerns related to CoreDNS and provide a detailed explanation of how our implementation enhances service discovery functionality. Experimental results in a real-world case show that our solution for the CoreDNS ensures consistency of the workload. Compared with the default CoreDNS configuration, our customized approach achieves better performance in terms of number of errors for requests, average latency of DNS requests, and resource usage rate.},
	year = {2023},
	eissn = {2061-2125},
	pages = {69-75},
	orcid-numbers = {Kozsik, Tamás/0000-0003-4484-9172}
}

@CONFERENCE{MTMT:34130245,
	title = {Challenges in service discovery for microservices deployed in a kubernetes cluster – a case study},
	url = {https://m2.mtmt.hu/api/publication/34130245},
	author = {Erdenebat, Baasanjargal and Bud, Bayarjargal and Kozsik, Tamás},
	booktitle = {12th International Conference on Applied Informatics (ICAI 2023)},
	unique-id = {34130245},
	year = {2023},
	pages = {1-3},
	orcid-numbers = {Kozsik, Tamás/0000-0003-4484-9172}
}

@CONFERENCE{MTMT:34130204,
	title = {An application for Gaussian Boson Sampling: vibronic spectra of molecules},
	url = {https://m2.mtmt.hu/api/publication/34130204},
	author = {Németh, András and Kozsik, Tamás and Zimborás, Zoltán},
	booktitle = {12th International Conference on Applied Informatics (ICAI 2023)},
	unique-id = {34130204},
	year = {2023},
	pages = {1-3},
	orcid-numbers = {Németh, András/0000-0002-4187-0673; Kozsik, Tamás/0000-0003-4484-9172}
}

@CONFERENCE{MTMT:34130002,
	title = {Improper Input Validation Vulnerability Detection by Static Analysis},
	url = {https://m2.mtmt.hu/api/publication/34130002},
	author = {Alqaradaghi, Midya and Kozsik, Tamás},
	booktitle = {12th International Conference on Applied Informatics (ICAI 2023)},
	unique-id = {34130002},
	year = {2023},
	pages = {1-3},
	orcid-numbers = {Kozsik, Tamás/0000-0003-4484-9172}
}

@article{MTMT:34126738,
	title = {Vibronic spectra of molecules – an experiment with a quantum computer simulator},
	url = {https://m2.mtmt.hu/api/publication/34126738},
	author = {Németh, András and Kozsik, Tamás and Zimborás, Zoltán},
	doi = {10.33039/ami.2023.08.012},
	journal-iso = {ANN MATH INFORM},
	journal = {ANNALES MATHEMATICAE ET INFORMATICAE},
	volume = {58},
	unique-id = {34126738},
	issn = {1787-5021},
	year = {2023},
	eissn = {1787-6117},
	pages = {121-132},
	orcid-numbers = {Németh, András/0000-0002-4187-0673; Kozsik, Tamás/0000-0003-4484-9172}
}