Author:
Kaklamanis C.,Persiano G.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference10 articles.
1. D. Angluin and L. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings.J. Comput. System Sci. 18(2) (1979), 155?193.
2. S. Bhatt and Jin-Yi Cai. Take a walk, Grow a tree.Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pp. 458?469, 1988.
3. S. Bhatt, D. Greenberg, T. Leighton, and Pangfeng Liu. Tight bounds for on-line tree embeddings.Proceedings of the 2nd SIAM Symposium on Discrete Algorithms, pp. 344?350, 1991.
4. D. Hilbert. Ueber die stitige Abbidungen einen Linie auf ein Flachenstiick.Math. Ann. 38 (1891), 459?480.
5. R. Karp and Yanjun Zhang. A randomized parallel branch-and-bound procedure.Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 290?300, 1988.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Space-efficient parallel algorithms for combinatorial search problems;Journal of Parallel and Distributed Computing;2015-02
2. Space-Efficient Parallel Algorithms for Combinatorial Search Problems;Mathematical Foundations of Computer Science 2013;2013
3. Refinement Trees and Space-Filling Curves;Texts in Computational Science and Engineering;2012-08-01
4. Space-Filling Curves in 3D;Texts in Computational Science and Engineering;2012-08-01
5. Further Space-Filling Curves;Texts in Computational Science and Engineering;2012-08-01