@InProceedings{anari_et_al:LIPIcs.ITCS.2020.54,
  author =	{Anari, Nima and Vazirani, Vijay V.},
  title =	{{Matching Is as Easy as the Decision Problem, in the NC Model}},
  booktitle =	{11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
  pages =	{54:1--54:25},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-134-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{151},
  editor =	{Vidick, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.54},
  URN =		{urn:nbn:de:0030-drops-117399},
  doi =		{10.4230/LIPIcs.ITCS.2020.54},
  annote =	{Keywords: Parallel Algorithm, Pseudo-Deterministic, Perfect Matching, Tutte Matrix}
}