Go to the corresponding LIPIcs Volume Portal 
Lincoln, Andrea ; Vyas, Nikhil
pdfformat: 

@InProceedings{lincoln_et_al:LIPIcs:2020:11696, author = {Andrea Lincoln and Nikhil Vyas}, title = {{Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {11:111:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771344}, ISSN = {18688969}, year = {2020}, volume = {151}, editor = {Thomas Vidick}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11696}, URN = {urn:nbn:de:0030drops116969}, doi = {10.4230/LIPIcs.ITCS.2020.11}, annote = {Keywords: kcycle, Space, Savitch, Sparse Graphs, Max3SAT} }
Keywords:  kcycle, Space, Savitch, Sparse Graphs, Max3SAT  
Seminar:  11th Innovations in Theoretical Computer Science Conference (ITCS 2020)  
Issue Date:  2020  
Date of publication:  10.01.2020 