( en | de | ru )

 

Disambiguation of "Melkman, Avraham A."

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Finding a Largest Common Subtree of Bounded Degree.

, , , and . FCT, volume 8070 of Lecture Notes in Computer Science, page 4-15. Springer, (2013)

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.

Avraham Ehrlich

Avraham Milgram

R. A. A. Bowler

°Ake °Akerström

Mohamed A A Anndif

 

Other publications of authors with the same name

A Compression-Boosting Transform for Two-Dimensional Data., , and . AAIM, volume 4041 of Lecture Notes in Computer Science, page 126-137. Springer, (2006)GO for Integration of Expression Data., , , , and . In Silico Biology, 11 (1-2): 11-17 (2012)Singleton and 2-periodic attractors of sign-definite Boolean networks., , and . Inf. Process. Lett., 112 (1-2): 35-38 (2012)An Improved Satisfiability Algorithm for Nested Canalyzing Functions and its Application to Determining a Singleton Attractor of a Boolean Network., and . J. Comput. Biol., 20 (12): 958-969 (2013)Sleeved coclustering., and . KDD, page 635-640. ACM, (2004)Shortest Longest-Path Graph Orientations., , , , , , and . COCOON (1), volume 14422 of Lecture Notes in Computer Science, page 141-154. Springer, (2023)On-line construction of the convex hull of a simple polyline. Information Processing Letters, 25 (1): 11―12 (April 1987)Smooth and adaptive forward erasure correcting., , , and . Comput. Networks, 36 (2/3): 343-355 (2001)On the Compressive Power of Boolean Threshold Autoencoders., , , , and . CoRR, (2020)On the Complexity of Finding a Largest Common Subtree of Bounded Degree., , , and . FCT, volume 8070 of Lecture Notes in Computer Science, page 4-15. Springer, (2013)