|
СТ |
Maintaining Biconnected Components of Dynamic Planar Graphs |
1991 |
Galil Z., Italiano G. |
|
|
|
Lecture Notes in Computer Science |
12.09.1991 |
|
СТ |
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem |
1991 |
Galil Z., Margalit O. |
|
|
|
Lecture Notes in Computer Science |
12.09.1991 |
|
СТ |
Data Structures and Algorithms for Disjoint Set Union Problems |
1991 |
Galil Z., Italiano G. |
|
|
|
ACM Computing Surveys |
22.11.1991 |
|
СТ |
On the Power of Multiple Reads in a Chip |
1991 |
Duris P., Galil Z. |
|
|
|
Lecture Notes in Computer Science |
12.09.1991 |
|
СТ |
Faster Tree Pattern Matching |
1994 |
Dubiner M., Galil Z., Magen E. |
|
|
|
J. of the ACM |
14.06.1994 |
|
СТ |
Parallel Detection of All Palindromes in a String |
1994 |
Apostolico A., Breslauer D., Galil Z. |
|
|
|
Lecture Notes in Computer Science |
26.03.1994 |
|
СТ |
Sensing Versus Nonsensing Automata |
1995 |
Duris P., Galil Z. |
Lecture Notes in Computer Science |
|
|
Automata, Languages and Programming |
10.09.1995 |
