#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1998

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

In a mobile wireless ad-hoc network, nodes move about and relay packets destined for other nodes. One of the biggest challenges in this area is the design of scalable routing protocols. Recently, aâ€¦ (More)

- Chung-Min Chen, Christine T. Cheng
- PODS
- 2002

Declustering schemes allocate data blocks among multiple disks to enable parallel retrieval. Given a declustering scheme <i>D</i>, its <i>response time</i> with respect to a query <i>Q</i>,â€¦ (More)

- Christine T. Cheng
- Electr. J. Comb.
- 2006

Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum number of labelsâ€¦ (More)

- Christine T. Cheng, Ravi Jain, Eric van den Berg
- Encyclopedia of Wireless and Mobileâ€¦
- 2008

- Christine T. Cheng, Adrian Dumitrescu, Patrick J. Schroeder
- Third International Conference on Qualityâ€¦
- 2003

In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are specified byâ€¦ (More)

- Chung-Min Chen, Christine T. Cheng
- CIKM
- 2003

Aside from enhancing data availability during disk failures, replication of data is also used to speed up I/O performance of read-intensive applications. There are two issues that need to beâ€¦ (More)

- Christine T. Cheng
- Discrete Applied Mathematics
- 2007

In the test suite generation problem (TSG) for software systems, I is a set of n input parameters where each I âˆˆ I has Îº(I) data values, and O is a collection of subsets of I where the interactionsâ€¦ (More)

- Christine T. Cheng
- Discrete Mathematics
- 2009

A vertex k-coloring of graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map. It is proper-distinguishing if the coloring is both proper andâ€¦ (More)

- Christine T. Cheng
- Algorithmica
- 2009

Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote the ith woman inâ€¦ (More)

- Christine T. Cheng, Eric McDermid
- Algorithms
- 2013

Motivated by the observation that most companies are more likely to consider job applicants suggested by their employees than those who apply on their own, Arcaute and Vassilvitskii modeled a jobâ€¦ (More)