Near-Linear Query Complexity for Graph Inference (bibtex)
by Sampath Kannan, Claire Mathieu, Hang Zhou
Reference:
Near-Linear Query Complexity for Graph Inference (Sampath Kannan, Claire Mathieu, Hang Zhou), In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, 2015.
Bibtex Entry:
@inproceedings{KannanM015,
	Author = {Sampath Kannan and Claire Mathieu and Hang Zhou},
	Booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
	Date-Added = {2016-01-31 10:14:53 +0000},
	Date-Modified = {2016-01-31 14:52:52 +0000},
	Pages = {773--784},
	Title = {Near-Linear Query Complexity for Graph Inference},
	Year = {2015},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-662-47672-7_63}}
Powered by bibtexbrowser