Selected combinatorial research problems.

Authors:
Vaclav Chvatal;David A. Klarner;Donald E. Knuth
Affiliations:
-;-;-
Venue:
Selected combinatorial research problems.
Year:
1972

Citing 0
Cited 18

New algorithms for comparing symbol sequences

ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Hardware Algorithms for Determining Similarity Between two Strings

IEEE Transactions on Computers
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences

Communications of the ACM
A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Backtrack programming techniques

Communications of the ACM
Parallel Algorithms for the Longest Common Subsequence Problem

IEEE Transactions on Parallel and Distributed Systems
Finding an Optimal Path without Growing the Tree

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Finding an optimal path without growing the tree

Journal of Algorithms
A learning algorithm for the longest common subsequence problem

Journal of Experimental Algorithmics (JEA)
Klarner systems and tiling boxes with polyominoes

Journal of Combinatorial Theory Series A
A fast algorithm for computing a longest common increasing subsequence

Information Processing Letters
Finite automata for generalized approach to backward pattern matching

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Fast plagiarism detection by sentence hashing

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Robust plagiary detection using semantic compression augmented SHAPD

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I

Quantified Score

Hi-index	0.05

Visualization

Abstract

Thirty-seven research problems are described, covering a wide range of combinatorial topics. Unlike Hilbert''s problems, most of these are not especially famous and they might be "do-able" in the next few years. (Problems 1-16 were contributed by Klarner, 17-26 by Chvatal, 27-37 by Knuth. All cash awards are Chvatal''s responsibility.)