( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
State Complexity of Prefix Distance.

, , и . CIAA, том 9223 из Lecture Notes in Computer Science, стр. 238-249. Springer, (2015)

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.

Verena Rappaport

Werner Rappaport

Eduard Rappaport

Hans-Albrecht Rappaport

Josef H Rappaport

 

Другие публикации лиц с тем же именем

The Aquarium Keeper's Problem., , , , , , , и . SODA, стр. 459-464. ACM/SIAM, (1991)State Complexity of Neighbourhoods and Approximate Pattern Matching., , и . DLT, том 9168 из Lecture Notes in Computer Science, стр. 389-400. Springer, (2015)Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences., , и . Graphs Comb., 31 (5): 1637-1648 (2015)An Optimal Algorithm to Compute the Inverse Beacon Attraction Region., , , и . SoCG, том 99 из LIPIcs, стр. 55:1-55:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Tight Bounds for Visibility Matching of f-Equal Width Objects.. JCDCG, том 2866 из Lecture Notes in Computer Science, стр. 246-250. Springer, (2002)Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments., и . WADS, том 5664 из Lecture Notes in Computer Science, стр. 363-374. Springer, (2009)Properties of the voronoi diagram cluster buster., , и . CASCON, стр. 1148-1163. IBM, (1993)Computing the Similarity of two Melodies., , , , , , , и . CCCG, стр. 81-84. (2003)Quasi-Distances and Weighted Finite Automata., , и . The Role of Theory in Computer Science, стр. 135-152. World Scientific, (2017)Decision Trees for Geometric Models., , , , и . SCG, стр. 369-378. ACM, (1993)