| On-line construction of the convex hull of a simple polyline AA Melkman Information Processing Letters 25 (1), 11-12, 1987 | 365 | 1987 |
| Optimal estimation of linear operators in Hilbert spaces from inaccurate data AA Melkman, CA Micchelli SIAM Journal on Numerical Analysis 16 (1), 87-105, 1979 | 204 | 1979 |
| On polygonal chain approximation A Melkman, J O'Rourke Computational Morphology, 87-95, 1988 | 144 | 1988 |
| Processor-Sharing of Two Parallel Lines. AG Konheim, I Meilijson, A Melkman Journal of Applied Probability 18 (4), 952-956, 1981 | 89 | 1981 |
| Finding a Periodic Attractor of a Boolean Network T Akutsu, S Kosub, AA Melkman, T Tamura IEEE/ACM Transactions on Computational Biology and Bioinformatics 9, 1410-1421, 2012 | 55 | 2012 |
| Spline spaces are optimal for L2 n-width AA Melkman, CA Micchelli Illinois J. Math 22 (4), 541-564, 1978 | 41 | 1978 |
| Determining a singleton attractor of an AND/OR Boolean network in O (1.587 n) time AA Melkman, T Tamura, T Akutsu Information Processing Letters 110 (14-15), 565-569, 2010 | 38 | 2010 |
| Biological process linkage networks D Dotan-Cohen, S Letovsky, AA Melkman, S Kasif PloS one 4 (4), e5313, 2009 | 38 | 2009 |
| Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clustering D Dotan-Cohen, S Kasif, AA Melkman Bioinformatics 25 (14), 1789-1795, 2009 | 37 | 2009 |
| On the eigenvalues of non-negative Jacobi matrices S Friedland, AA Melkman Linear Algebra and its Applications 25, 239-253, 1979 | 36 | 1979 |
| Hierarchical tree snipping: clustering guided by prior knowledge D Dotan-Cohen, AA Melkman, S Kasif Bioinformatics 23 (24), 3335-3342, 2007 | 32 | 2007 |
| Subdivision schemes with non-negative masks converge always-unless they obviously cannot? AA Melkman ANNALS OF NUMERICAL MATHEMATICS 4, 451-460, 1997 | 31 | 1997 |
| Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions T Akutsu, AA Melkman, T Tamura, M Yamamoto Journal of Computational Biology 18 (10), 1275-1290, 2011 | 29 | 2011 |
| Identifying a probabilistic boolean threshold network from samples AA Melkman, X Cheng, WK Ching, T Akutsu IEEE transactions on neural networks and learning systems 29 (4), 869-881, 2018 | 25 | 2018 |
| Interpolation by splines satisfying mixed boundary conditions AA Melkman Israel Journal of Mathematics 19, 369-381, 1974 | 25 | 1974 |
| Sleeved coclustering AA Melkman, E Shaham Proceedings of the tenth ACM SIGKDD international conference on Knowledge …, 2004 | 22 | 2004 |
| On Polygonal Chain Approximation," Computational Morphology A Melkman, J O’Rourke North-Holland Amsterdam, Netherlands, 87-95, 1988 | 21 | 1988 |
| The Budan-Fourier theorem for splines AA Melkman Israel Journal of Mathematics 19, 256-263, 1974 | 21 | 1974 |
| n-Widths and optimal interpolation of time-and band-limited functions, in “Optimal Estimation in Approximation Theory”(CA Micchelli and TJ Rivlin, Eds.) AA Melkman Plenum, New York, 1977 | 17* | 1977 |
| -Widths and Optimal Interpolation of Time-and Band-Limited Functions II AA Melkman SIAM journal on mathematical analysis 16, 803-813, 1985 | 15 | 1985 |
