Search CORE

2 research outputs found

Reachability in O(log n) Genus Graphs is in Unambiguous Logspace

Author: Gupta Chetan
Sharma Vimal Raj
Tewari Raghunath
Publication venue: LIPIcs - Leibniz International Proceedings in Informatics. 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Publication date: 01/01/2019
Field of study

Dagstuhl Research Online Publication Server

36th International Symposium on Theoretical Aspects of Computer Science: STACS 2019, March 13-16, 2019, Berlin, Germany

Author: STACS 36. 2019 Berlin
Publication venue: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
Publication date: 01/03/2019
Field of study

Digitale Bibliothek Thüringen

core

core