Zobrazeno 1 - 10
of 67
pro vyhledávání: '"MUSSER, DAVID A."'
Autor:
Musser, David R., Nishanov, Gor V.
A string matching -- and more generally, sequence matching -- algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of comparisons (2n), and sublinear average-case behavior that is better than
Externí odkaz:
http://arxiv.org/abs/0810.0264
Publikováno v:
In Information and Software Technology 2002 44(13):797-810
Publikováno v:
Communications of the ACM; Dec1978, Vol. 21 Issue 12, p1048-1064, 17p, 9 Diagrams
Autor:
Vargun, Aytekin, Musser, David R.
Publikováno v:
Proceedings of the 2008 ACM Symposium: Applied Computing; 3/16/2008, p376-383, 8p
Autor:
Changqing Wang1 cwang@gte.com., Musser, David R.2 musser@cs.rpi.edu.
Publikováno v:
IEEE Transactions on Software Engineering. May97, Vol. 23 Issue 5, p314-323. 10p.
Autor:
Musser, David R.1
Publikováno v:
IEEE Transactions on Software Engineering. Jan80, Vol. 6 Issue 1, p24-32. 9p.
Publikováno v:
Proceedings of the 2nd International Conference: Software Engineering; 10/13/1976, p414-420, 7p
Publikováno v:
SYMSAC: Symposium on Symbolic & Algebraic Manipulation; Jan1981, p188-194, 7p