( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Learning Algorithm for a Class of Context-Free Languages (Extended Abstract).

, и . ISMIS, стр. 317-324. North-Holland/Elsevier, (1987)

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.

Nina Berman

Judith Berman

Leo Berman

Jakob Berman

David Berman

 

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

Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems., , и . COCOON, том 6196 из Lecture Notes in Computer Science, стр. 226-234. Springer, (2010)Approximating Maximum Independent Set in Bounded Degree Graphs., и . SODA, стр. 365-371. ACM/SIAM, (1994)Improving the performance of k-means clustering through computation skipping and data locality optimizations., , и . Conf. Computing Frontiers, стр. 273-276. ACM, (2012)The Power and Limitations of Uniform Samples in Testing Properties of Figures., , и . Algorithmica, 81 (3): 1247-1266 (2019)A Linear-Time Algorithm for Studying Genetic Variation., и . WABI, том 4175 из Lecture Notes in Computer Science, стр. 344-354. Springer, (2006)HCV Quasispecies Assembly Using Network Flows., , , , , и . ISBRA, том 4983 из Lecture Notes in Computer Science, стр. 159-170. Springer, (2008)Fast Consensus in Networks of Bounded Degree (Extended Abstract)., и . WDAG, том 486 из Lecture Notes in Computer Science, стр. 321-333. Springer, (1990)On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts., , , , и . CPM, том 1264 из Lecture Notes in Computer Science, стр. 40-51. Springer, (1997)Asymptotically Optimal Distributed Consensus (Extended Abstract)., и . ICALP, том 372 из Lecture Notes in Computer Science, стр. 80-94. Springer, (1989)Approximating Transitivity in Directed Networks, , и . CoRR, (2008)