| |
Galil, Zvi |
 |
|
| |
|
Date Reviewed |
|
 |
|
|
|
| |
1 - 5
of 12 reviews |
|
|
|
|
|
|
| |
A constant-time optimal parallel string-matching algorithm
Galil Z. Journal of the ACM 42(4): 908-918, 1995. Type: Article
Given two strings, the pattern of size m and the text of size n, the pattern matching problem is to find all the occurrences of the pattern in the text. The paper provides a constant parallel-time ...... |
Nov 1 1996 |
|
|
|
|
|
| |
Maintaining the 3-edge-connected components of a graph on-line
Galil Z., Italiano G. SIAM Journal on Computing 22(1): 11-28, 1993. Type: Article
Online algorithms that maintain the 3-edge-connected components of an undirected graph G under edge and vertex insertion (but not deletion) are presented. (Two vertices x and y...... |
Apr 1 1994 |
|
|
|
|
|
| |
On the space complexity of some algorithms for sequence comparison
Rabani Y., Galil Z. Theoretical Computer Science 95(2): 231-244, 1992. Type: Article
Computation of the modified edit distance between two given strings over a given alphabet is an important problem; time-efficient and space-efficient algorithms are called for in many applications in real life. Space complexity is more...... |
Feb 1 1994 |
|
|
|
|
|
| |
On the exact complexity of string matching
Galil Z., Giancarlo R. SIAM Journal on Computing 21(3): 407-437, 1992. Type: Article
A new online O ( n ) algorithm for identifying all the occurrences of a given pattern p = p [ 1 , m ] in a given text string t = t [ 1 , n ] ...... |
Mar 1 1993 |
|
|
|
|
|
| |
An almost linear-time algorithm for the dense subset-sum problem
Galil Z., Margalit O. SIAM Journal on Computing 20(6): 1157-1189, 1991. Type: Article
The subset-sum problem discussed in this paper is as follows: Given a set A of m distinct integers in the interval [ 1 , l ] and an integer N, find a subset ... |
Mar 1 1993 |
|
|
|
|
|
|
|
|
| |
|
|
