@InProceedings{pemmaraju_et_al:LIPIcs.OPODIS.2016.9,
  author =	{Pemmaraju, Sriram and Riaz, Talal},
  title =	{{Using Read-k Inequalities to Analyze a Distributed MIS Algorithm}},
  booktitle =	{20th International Conference on Principles of Distributed Systems (OPODIS 2016)},
  pages =	{9:1--9:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-031-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{70},
  editor =	{Fatourou, Panagiota and Jim\'{e}nez, Ernesto and Pedone, Fernando},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2016.9},
  URN =		{urn:nbn:de:0030-drops-70784},
  doi =		{10.4230/LIPIcs.OPODIS.2016.9},
  annote =	{Keywords: Bounded Arboricity Graphs, CONGEST model, Luby’s Algorithm, Maximal Independent Set, Read-k Inequality}
}