The following pages link to Udi Manber (Q750151):
Displaying 17 items.
- An algorithm for string matching with a sequence of don't cares (Q750152) (← links)
- A probabilistic lower bound for checking disjointness of sets (Q794167) (← links)
- Recognizing breadth-first search trees in linear time (Q911287) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- A probabilistic distributed algorithm for set intersection and its analysis (Q1088406) (← links)
- On non-intersecting Eulerian circuits (Q1090338) (← links)
- Two algorithms for barrier synchronization (Q1114381) (← links)
- The complexity of controlled selection (Q1173958) (← links)
- Path-matching problems (Q1193516) (← links)
- An algorithm for min-cost edge-disjoint cycles and its applications (Q1200787) (← links)
- An algorithm for approximate membership checking with application to password security (Q1327313) (← links)
- (Q1907028) (redirect page) (← links)
- A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
- (Q3138909) (← links)
- Suffix Arrays: A New Method for On-Line String Searches (Q3142586) (← links)
- The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem (Q3323288) (← links)
- A Subquadratic Algorithm for Approximate Regular Expression Matching (Q4857536) (← links)
