Author:
Dyer Martin,Fenner Trevor,Frieze Alan,Thomason Andrew
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference9 articles.
1. D. Angluin and L. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Journal of Computer and System Sciences
18 (1979), 155–193.
2. R. Blom, Non-public key distribution, in Advances in Cryptology: Proceedings of Eurocrypt 82, Plenum, New York, 1983, pp. 231–236.
3. Lecture Notes in Computer Science;R. Blom,1984
4. B. Bollobós, Random Graphs, Academic Press, London, 1985.
5. P. Erdós, P. Frankl, and Z. Füredi, Families of finite sets in which no set is covered by the union of two others, Journal of Combinatorial Theory, Series A
33 (1982), 158–166.
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献