Finally, I would like to thank Westinghouse and the Science Service for the financial support for college they have given me based on the results presented here.  ...  Acknowledgment I am grateful to Gary Knott who introduced me to this problem and has been encouraging me to write this paper for the past three years.  ...  Conclusion We have demonstrated that a tagless variation on the Deutsch-Schorr-Waite algorithm exists which has O(1) space, but O(n log n) (worst case O(n2)) time.  ...