2 citations · 2 across the 4 of their papers we have counts for
6 papers
String Rearrangement Inequalities and a Total Order Between Primitive Words
Ruixi Luo, Taikun Zhu, Kai Jin
We study the following rearrangement problem: Given words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively).…
A Generalization of Self-Improving Algorithms
Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin +1
Ailon et al. [SICOMP'11] proposed self-improving algorithms for sorting and Delaunay triangulation (DT) when the input instances follow some unknown \emph{product…
A note on self-improving sorting with hidden partitions
Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin
We study self-improving sorting with hidden partitions. Our result is an optimal algorithm which runs in expected time O(H(π(I)) + n), where I is the given input which contains n e…
On the Complexity of Computing the Topology of Real Algebraic Space Curves
Kai Jin, Jin-San Cheng
In this paper, we present a deterministic algorithm to find a strong generic position for an algebraic space curve. We modify our existing algorithm for computing the topology of a…
On the power of dominated players in team competitions
Kai Jin, Pingzhong Tang, Shiteng Chen
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The c…
Linear Time Approximation Schemes for Geometric Maximum Coverage
Jian Li, Haitao Wang, Bowei Zhang +1
We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. We want to place m a * b re…