1 Hit in 3.0 sec

Two tagless variations on the Deutsch-Schorr-waite algorithm

Mark C. Hamburg
1986 Information Processing Letters  
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.  ... 
doi:10.1016/0020-0190(86)90024-4 fatcat:qpfjcmgjwvcfnarsnbdackzcdi