No coin nor oath required. For personal study only.
Chung, K.-L., On finding medians of weighted discrete points 74 (2000) 103 Chung, K.-L. and W.-M. Yan, On the number of spanning trees of a multi-complete/star related graph 76 (2000) 113 Chung, K.-L. and W.-M. Yan, An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format 79 (2001) 1
📜 SIMILAR VOLUMES
the consecutive ones property for sparse matrices Averbakh, I. and O. Berman, (p -l)/(p + Ij-approximate algorithms for p-travelling salesmen problems on a tree with minmax objective 79 (1997) 63-66 73 (1997) 69-79 Bauer, D., J. van de n Heuvel, A. Morgana a nd E. Schmeichel, The complexity of recog
Index -Volumes 71-80 1-factorization (77) 269 1-Hamiltonian (72) 55 i-triangulated graph (76) 141 k-ary trees (76) 169, (77) 231 k-compaction problem (71) 43 k-median problem (74) 81 k-mutual exclusion (80) 205 k-nearest neighbor query (80) 195 k-selective family (79) 53 k-server problem (74) 73 µCR
## Barendregt, H., Enumerators of lambda terms are reducing constructively Barendsen, E. and Bezem, M., Polymorphic extensions of simple type structures. With an application to a bar recursive minimization Barker, E.J., Back and forth relations for reduced abelian p-groups