%0 Conference Paper %1 conf/cp/CohenCGM11 %A Cohen, David A. %A Cooper, Martin C. %A Green, Martin James %A Marx, Dániel %B CP %D 2011 %E Lee, Jimmy Ho-Man %I Springer %K dblp %P 160-171 %T On Guaranteeing Polynomially Bounded Search Tree Size. %U http://dblp.uni-trier.de/db/conf/cp/cp2011.html#CohenCGM11 %V 6876 %@ 978-3-642-23785-0

@inproceedings{conf/cp/CohenCGM11, added-at = {2016-09-07T00:00:00.000+0200}, author = {Cohen, David A. and Cooper, Martin C. and Green, Martin James and Marx, Dániel}, biburl = {https://www.bibsonomy.org/bibtex/2b766ad0c21e4a646f71c8fddc2bd1f79/dblp}, booktitle = {CP}, crossref = {conf/cp/2011}, editor = {Lee, Jimmy Ho-Man}, ee = {http://dx.doi.org/10.1007/978-3-642-23786-7_14}, interhash = {ae71c63a20353135fb620e448fe4a19a}, intrahash = {b766ad0c21e4a646f71c8fddc2bd1f79}, isbn = {978-3-642-23785-0}, keywords = {dblp}, pages = {160-171}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2016-09-08T11:34:41.000+0200}, title = {On Guaranteeing Polynomially Bounded Search Tree Size.}, url = {http://dblp.uni-trier.de/db/conf/cp/cp2011.html#CohenCGM11}, volume = 6876, year = 2011 }