Sampath Kannan, Claire Mathieu, Hang Zhou
Near-Linear Query Complexity for Graph Inference
ICALP, 2015.
@inproceedings{ICALP-v1-2015-KannanM0, author = "Sampath Kannan and Claire Mathieu and Hang Zhou", booktitle = "{Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Part I}", doi = "10.1007/978-3-662-47672-7_63", isbn = "978-3-662-47671-0", pages = "773--784", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Near-Linear Query Complexity for Graph Inference}", volume = 9134, year = 2015, }