( en | de | ru )

 

Disambiguation of "Landau, Gad M."

Author of the publication

copydeleteadd this publication to your clipboard
Consensus Optimizing Both Distance Sum and Radius.

, , , , , and . SPIRE, volume 5721 of Lecture Notes in Computer Science, page 234-242. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gad Mansour Ahmed Gad

Atef Gad

Simone Gad

Ahmed Gad

Adel Gad

 

Other publications of authors with the same name

A PTAS for the Square Tiling Problem., , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 118-126. Springer, (2010)Optimal Parallel Suffix-Prefix Matching Algorithm and Applications., , and . SPAA, page 388-398. ACM, (1989)Efficient Special Cases of Pattern Matching with Swaps., , , and . CPM, volume 1448 of Lecture Notes in Computer Science, page 209-220. Springer, (1998)An Algorithm for Approximate Tandem Repeats., and . CPM, volume 684 of Lecture Notes in Computer Science, page 120-133. Springer, (1993)Two Dimensional Pattern Matching in a Digitized Image., and . CPM, volume 684 of Lecture Notes in Computer Science, page 134-151. Springer, (1993)Sparse Normalized Local Alignment., and . CPM, volume 3109 of Lecture Notes in Computer Science, page 333-346. Springer, (2004)Approximating the 2-Interval Pattern Problem., , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 426-437. Springer, (2005)Can dist tables be merged in linear time - An Open Problem.. Stringology, page 1. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2006)Fast parallel and serial approximate string matching, and . Journal of Algorithms, 10 (2): 157--169 (June 1989)Lower Bounds for the Number of Repetitions in 2D Strings., , and . SPIRE, volume 12944 of Lecture Notes in Computer Science, page 179-192. Springer, (2021)