Levi, Reut Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Medina, Moti Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://drops.dagstuhl.de/opus/volltexte/2017/7424/ (出版社版)
http://drops.dagstuhl.de/doku/urheberrecht1.html (著作権譲渡合意書)
Even, G., Levi, R., Medina, M., & Rosén, A. (2017). Sublinear Random Access Generators for Preferential Attachment Graphs. In I., Chatzigiannakis, P., Indyk, F., Kuhn, & A., Muscholl (Eds.), 44th International Colloquium on Automata, Languages, and Programming (pp. 1-15). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2017.6.