Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Manber, Udi Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 5 of 7 reviews    
  Suffix arrays
Manber U. (ed), Myers G. (ed) SIAM Journal on Computing 22(5): 935-948, 1993.  Type: Article

The authors present algorithms for constructing and querying a data structure, the suffix array, which was introduced in their earlier paper [1], for use in online searches for strings in a large block of text. The suffix array is clos...
...
Sep 1 1994  
  Fast text searching
Wu S., Manber U. (ed) Communications of the ACM 35(10): 83-91, 1992.  Type: Article

The simple string matching problem is to find an exact match for a pattern string in some text corpus. Fast, special-purpose algorithms solve this problem in time O ( n &slash; m ), where n is...
...
Nov 1 1993  
  Using induction to design algorithms
Manber U. (ed) Communications of the ACM 31(11): 1300-1313, 1988.  Type: Article

The author presents a technique that uses mathematical induction to design algorithms. By using induction, he hopes to show a relationship between theorems and algorithm design that students will find intuitive. The author illustrates ...
...
May 1 1989  
  The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
Manber U. (ed), Tompa M. Journal of the ACM 32(3): 720-732, 1985.  Type: Article

Although it is not easy, in general, to prove lower bounds on complexity for some problems like sorting, the very basic technique of decision trees succeeds. This paper uses decision trees in order to investigate the complexity of prob...
...
Sep 1 1986  
  The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem
Manber U. (ed), Tompa M. SIAM Journal on Computing 13(1): 109-115, 1984.  Type: Article

This paper presents the problem of element uniqueness with respect to any fixed undirected graph G on vertex set V. If G is complete, this corresponds to Dobkin and Lipton’s well-known element uniqueness ...
...
Jul 1 1986  

 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy