2 citations · 6 across the 10 of their papers we have counts for
12 papers
An Empirical Study of Bugs in Quantum Machine Learning Frameworks
Pengzhan Zhao, Xiongfei Wu, Junjie Luo +2
Quantum computing has emerged as a promising domain for the machine learning (ML) area, offering significant computational advantages over classical counterparts. With the growing…
Formalization of Quantum Intermediate Representations for Code Safety
Junjie Luo, Jianjun Zhao
Quantum Intermediate Representation (QIR) is a Microsoft-developed, LLVM-based intermediate representation for quantum program compilers. QIR aims to provide a general solution for…
Fair and Efficient Multi-Resource Allocation for Cloud Computing
Xiaohui Bei, Zihao Li, Junjie Luo
We study the problem of allocating multiple types of resources to agents with Leontief preferences. The classic Dominant Resource Fairness (DRF) mechanism satisfies several desired…
Multivariate Algorithmics for Eliminating Envy by Donating Goods
Niclas Boehmer, Robert Bredereck, Klaus Heeger +2
Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been implemented the preferences of…
A Comprehensive Study of Bug Fixes in Quantum Programs
Junjie Luo, Pengzhan Zhao, Zhongtao Miao +2
As quantum programming evolves, more and more quantum programming languages are being developed. As a result, debugging and testing quantum programs have become increasingly import…
On Improving Resource Allocations by Sharing
Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo +2
Given an initial resource allocation, where some agents may envy others or where a different distribution of resources might lead to higher social welfare, our goal is to improve t…
Fine-Grained View on Bribery for Group Identification
Niclas Boehmer, Robert Bredereck, Dušan Knop +1
Given a set of agents qualifying or disqualifying each other, group identification is the task of identifying a socially qualified subgroup of agents. Social qualification depends…
Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable
Niclas Boehmer, Robert Bredereck, Dušan Knop +1
We study a variant of Set Cover where each element of the universe has some demand that determines how many times the element needs to be covered. Moreover, we examine two generali…
A Fast Exact Algorithm for Airplane Refueling Problem
Jianshu Li, Xiaoyin Hu, Junjie Luo +1
We consider the airplane refueling problem, where we have a fleet of airplanes that can refuel each other. Each airplane is characterized by specific fuel tank volume and fuel cons…
Adapting Stable Matchings to Evolving Preferences
Robert Bredereck, Jiehua Chen, Dušan Knop +2
Adaptivity to changing environments and constraints is key to success in modern society. We address this by proposing "incrementalized versions" of Stable Marriage and Stable Roomm…
Parameterized Dynamic Cluster Editing
Junjie Luo, Hendrik Molter, André Nichterlein +1
We introduce a dynamic version of the NP-hard graph problem Cluster Editing. The essential point here is to take into account dynamically evolving input graphs: Having a cluster gr…
A Parameterized Complexity View on Collapsing k-Cores
Junjie Luo, Hendrik Molter, Ondrej Suchy
We study the NP-hard graph problem Collapsed k-Core where, given an undirected graph G and integers b, x, and k, we are asked to remove b vertices such that the k-core of remaining…