Malay Bhattacharyya, Sanghamitra Bandyopadhyay. Bounds on Quasi-Completeness. In S. Arumugam, W. F. Smyth, editors, Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers. Volume 7643 of Lecture Notes in Computer Science, pages 1-5, Springer, 2012. [doi]
@inproceedings{BhattacharyyaB12,
title = {Bounds on Quasi-Completeness},
author = {Malay Bhattacharyya and Sanghamitra Bandyopadhyay},
year = {2012},
doi = {10.1007/978-3-642-35926-2_1},
url = {http://dx.doi.org/10.1007/978-3-642-35926-2_1},
researchr = {https://researchr.org/publication/BhattacharyyaB12},
cites = {0},
citedby = {0},
pages = {1-5},
booktitle = {Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers},
editor = {S. Arumugam and W. F. Smyth},
volume = {7643},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-35926-2},
}