Author:
Clifford Raphaël,Jalsenius Markus,Montanaro Ashley,Sach Benjamin
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. Berger, E.: Dynamic monopolies of constant size. J. Comb. Theory, Ser. B 83, 191–200 (2001)
2. MSRI Publications;T.C. Biedl,2002
3. Chayes, L., Winfield, C.: The density of interfaces: A new first-passage problem. J. Appl. Probab. 30(4), 851–862 (1993)
4. Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: Tetris is hard, even to approximate. In: Computing and Combinatorics, pp. 351–363 (2003)
5. Fleischer, R., Woeginger, G.: An algorithmic analysis of the Honey-Bee game. In: Proc. Fun with Algorithms 2010, pp. 178–189 (2010)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献