English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Sublinear Random Access Generators for Preferential Attachment Graphs

MPS-Authors
/persons/resource/persons199710

Levi,  Reut
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons185330

Medina,  Moti
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/21.11116/0000-0002-E7E7-5
Abstract
There is no abstract available