On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jeremiah Blocki, Samson Zhou. On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. In Sarah Meiklejohn, Kazue Sako, editors, Financial Cryptography and Data Security - 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26 - March 2, 2018, Revised Selected Papers. Volume 10957 of Lecture Notes in Computer Science, pages 329-346, Springer, 2018. [doi]

This author has not been identified. Look up 'Jeremiah Blocki' in GoogleThis author has not been identified. Look up 'Samson Zhou' in Google

runs on WebDSL