@InProceedings{kothari_et_al:LIPIcs.APPROX-RANDOM.2015.915,
  author =	{Kothari, Robin and Racicot-Desloges, David and Santha, Miklos},
  title =	{{Separating Decision Tree Complexity from Subcube Partition Complexity}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)},
  pages =	{915--930},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-89-7},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{40},
  editor =	{Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.915},
  URN =		{urn:nbn:de:0030-drops-53445},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2015.915},
  annote =	{Keywords: Decision tree complexity, query complexity, randomized algorithms, subcube partition complexity}
}