%0 Conference Paper %1 conf/premi/KomorowskiT17 %A Komorowski, Michal %A Trzcinski, Tomasz %B PReMI %D 2017 %E Shankar, B. Uma %E Ghosh, Kuntal %E Mandal, Deba Prasad %E Ray, Shubhra Sankar %E Zhang, David %E Pal, Sankar K. %I Springer %K dblp %P 473-479 %T Random Binary Search Trees for Approximate Nearest Neighbour Search in Binary Space. %U http://dblp.uni-trier.de/db/conf/premi/premi2017.html#KomorowskiT17 %V 10597 %@ 978-3-319-69900-4

@inproceedings{conf/premi/KomorowskiT17, added-at = {2019-09-25T00:00:00.000+0200}, author = {Komorowski, Michal and Trzcinski, Tomasz}, biburl = {https://www.bibsonomy.org/bibtex/2450b28b4c70ec7e0947472254864601e/dblp}, booktitle = {PReMI}, crossref = {conf/premi/2017}, editor = {Shankar, B. Uma and Ghosh, Kuntal and Mandal, Deba Prasad and Ray, Shubhra Sankar and Zhang, David and Pal, Sankar K.}, ee = {https://doi.org/10.1007/978-3-319-69900-4_60}, interhash = {98a08901f2eb83f3a3c920fec5b125aa}, intrahash = {450b28b4c70ec7e0947472254864601e}, isbn = {978-3-319-69900-4}, keywords = {dblp}, pages = {473-479}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-26T14:02:39.000+0200}, title = {Random Binary Search Trees for Approximate Nearest Neighbour Search in Binary Space.}, url = {http://dblp.uni-trier.de/db/conf/premi/premi2017.html#KomorowskiT17}, volume = 10597, year = 2017 }