External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Approximate Counting of k-Paths: Deterministic and in Polynomial Space

Andreas Björklund, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. Approximate Counting of k-Paths: Deterministic and in Polynomial Space. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. Volume 132 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

Authors

Andreas Björklund

This author has not been identified. Look up 'Andreas Björklund' in Google

Daniel Lokshtanov

This author has not been identified. Look up 'Daniel Lokshtanov' in Google

Saket Saurabh 0001

This author has not been identified. Look up 'Saket Saurabh 0001' in Google

Meirav Zehavi

This author has not been identified. Look up 'Meirav Zehavi' in Google
runs on