( en | de | ru )

 

Disambiguation of "Berman, Piotr"

Author of the publication

copydeleteadd this publication to your clipboard
A note on the complexity of reliability in neural networks.

, , and . IEEE Trans. Neural Networks, 3 (6): 998-1002 (1992)

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.

Nina Berman

Judith Berman

Leo Berman

Jakob Berman

David Berman

 

Other publications of authors with the same name

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