295 citations · 710 across the 81 of their papers we have counts for
86 papers
A -Invariant Erdős--Hanani Theorem with Applications to Optical Orthogonal and Constant-Weight Codes
Yeow Meng Chee
Let be fixed integers, and let be a permutation group on a set of points. A -invariant packing is free if every block has distinct images under . We…
Chouinard's Conjecture for Graphical t-Designs
Yeow Meng Chee
A -wise balanced design on the edge set of a complete graph is graphical if its block multiset is invariant under the induced action of the symmetric group on the vertices. Chou…
On -edge-balanced graphs
Yeow Meng Chee
A graph on vertices with edges is -edge-balanced if every graph on vertices with edges is contained in exactly the same number of subgraphs of isomorph…
Sequence Reconstruction for Sticky Insertion/Deletion Channels
Van Long Phuoc Pham, Yeow Meng Chee, Kui Cai +1
The sequence reconstruction problem for insertion/deletion channels has attracted significant attention owing to their applications recently in some emerging data storage systems,…
Modeling Concurrency Control as a Learnable Function
Hexiang Pan, Shaofeng Cai, Tien Tuan Anh Dinh +4
Concurrency control (CC) algorithms are important in modern transactional databases, as they enable high performance by executing transactions concurrently while ensuring correctne…
Constructions of Covering Sequences and Arrays
Yeow Meng Chee, Tuvi Etzion, Hoang Ta +1
An -covering sequence is a cyclic sequence whose consecutive -tuples form a code of length and covering radius . Using several construction methods improvements of…