View Proposal #355
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 355 |
|---|---|
| First Name | Ronald |
| Last Name | Smith |
| Institution | Graceland University |
| Speaker Category | faculty |
| Title of Talk | Beautiful Strings |
| Abstract | Let S and T be strings. S is more beautiful than T if (i) S is longer than T, or (ii) if S and T have the same length, then S > T lexicographically. S derives T, if T is a subsequence (not necessarily a substring) of S. T is unique if each character in T appears exactly once. The "Beautiful Strings Problem" is to find the most beautiful unique string that can be derived from a given string S. This problem appeared on the web and in at least one programming contest last year, with no correct solution known to this author. We give an efficient solution, showing the usefulness of a mathematical approach. |
| Subject area(s) | algorithms |
| Suitable for undergraduates? | Y |
| Day Preference | Either |
| Computer Needed? | N |
| Bringing a laptop? | Y |
| Overhead Needed? | N |
| Software requests | |
| Special Needs | |
| Date Submitted | 08/19/2013 |
| Year | 2013 |