Pei-Chi Wu
- 1. Ellis, M.A., and Stroustrup, B., The Annotated C+ + Reference Manual, Addison-Wesley, 1990. Google Scholar
Digital Library
- 2. Free Software Foundation, GNU C++ Compiler, Version 2.5.8, 1994.Google Scholar
- 3. Hennessy, J., Patterson, D., Computer Architecture: A Quantitative Approach, Morgan Kaufmann Publishers, Inc., 1990, p. 95. Google ScholarDigital Library
- 4. Horowitz, E., Sahni, S., Fundamentals of Data Structures in Pascal, Computer Science Press, 1984, p. 175. Google ScholarDigital Library
- 5. Knuth, D. E., The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addison-Wesley, 1973, p. 460.Google ScholarDigital Library
Index Terms
- Padded string: treating string as sequence of machine words
Recommendations
Inferring an indeterminate string from a prefix graph
An indeterminate string (or, more simply, just a string) x = x 1 . . n ] on an alphabet Σ is a sequence of nonempty subsets of Σ. We say that x i 1 ] and x i 2 ] match (written x i 1 ] x i 2 ] ) if and only if x i 1 ] x i 2 ] . A feasible array is an ...
How many runs can a string contain?
Given a string x=x[1..n], a repetition of period p in x is a substring u^r=x[i+1..i+rp], p=|u|, r>=2, where neither u=x[i+1..i+p] nor x[i+1..i+(r+1)p+1] is a repetition. The maximum number of repetitions in any string x is well known to be @Q(nlogn). A ...
How many double squares can a string contain?
Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 that a string of length n contains at most 2 n distinct squares. Ilie ...
Comments