@InProceedings{dahiya_et_al:LIPIcs.FSTTCS.2021.15,
  author =	{Dahiya, Yogesh and Mahajan, Meena},
  title =	{{On (Simple) Decision Tree Rank}},
  booktitle =	{41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)},
  pages =	{15:1--15:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-215-0},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{213},
  editor =	{Boja\'{n}czyk, Miko{\l}aj and Chekuri, Chandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.15},
  URN =		{urn:nbn:de:0030-drops-155263},
  doi =		{10.4230/LIPIcs.FSTTCS.2021.15},
  annote =	{Keywords: Boolean functions, Decision trees, certificate complexity, rank}
}