@InProceedings{parter:LIPIcs.DISC.2020.38,
  author =	{Parter, Merav},
  title =	{{Distributed Planar Reachability in Nearly Optimal Time}},
  booktitle =	{34th International Symposium on Distributed Computing (DISC 2020)},
  pages =	{38:1--38:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-168-9},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{179},
  editor =	{Attiya, Hagit},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.38},
  URN =		{urn:nbn:de:0030-drops-131160},
  doi =		{10.4230/LIPIcs.DISC.2020.38},
  annote =	{Keywords: Distributed Graph Algorithms, Planar Graphs, Reachability}
}