CiteSeer.IST HomeCheck: The following citations are predicted to all refer to the same paper. Details
S. Istrail. Polynomial universal traversing sequences for cycles are constructible. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 491--503, Chicago, IL, May 1988.
S. Istrail. Polynomial universal traversing sequences for cycles are constructible. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 491--503, Chicago, IL, May 1988.
S. Istrail. Polynomial universal traversing sequences for cycles are constructible. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 491--503, Chicago, IL, May 1988.
S. Istrail. Polynomial universal traversing sequences for cycles are constructible. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 491--503, Chicago, IL, May 1988.
S. Istrail. Polynomial universal traversing sequences for cycles are constructible. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 491--503, Chicago, IL, May 1988.
S. Istrail, Polynomial universal traversing sequences for cycles are constructible, Proc 20th Annual ACM Symposium on Theory of Computing (STOC), 491-503, 1988.
S. Istrail, Polynomial universal traversing sequences for cycles are constructible, Proc 20th Annual ACM Symposium on Theory of Computing (STOC), 491-503, 1988.