Author:
Bringmann Karl,Panagiotou Konstantinos
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference18 articles.
1. Borodin, A., Munro, I.: The Computational Complexity of Algebraic and Numeric Problems. Elsevier Publishing Company, London (1975)
2. Bringmann, K., Friedrich, T.: Exact and efficient generation of geometric random variates and random graphs. In: Proceedings of 40th International Colloquium on Automata, Languages, and Programming (ICALP’13), pp. 267–278 (2013)
3. Bringmann, K., Green Larsen, K.: Succinct sampling from discrete distributions. In Proceedings of 45th Annual ACM Symposium on Theory of Computing (STOC’13), pp. 775–782 (2013)
4. Chung, Fan, Linyuan, Lu: The average distance in a random graph with given expected degrees. Internet Math. 1(1), 91–113 (2004)
5. Devroye, L.: Nonuniform Random Variate Generation. Springer, New York (1986)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献