![]() | 2009 | |
---|---|---|
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Itai Sharon, Amrita Pati, Victor M. Markowitz, Ron Y. Pinter: A Statistical Framework for the Functional Analysis of Metagenomes. RECOMB 2009: 496-511 |
2008 | ||
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson: Seeded Tree Alignment. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 503-513 (2008) |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan: Improved bounds on sorting by length-weighted reversals. J. Comput. Syst. Sci. 74(5): 744-774 (2008) |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Fanica Gavril, Ron Y. Pinter, Shmuel Zaks: Intersection representations of matrices by subtrees and unicycles on graphs. J. Discrete Algorithms 6(2): 216-228 (2008) |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate labelled subtree homeomorphism. J. Discrete Algorithms 6(3): 480-496 (2008) |
2007 | ||
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson: Seeded Tree Alignment and Planar Tanglegram Layout. WABI 2007: 98-110 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Oleg Rokhlenko, Tomer Shlomi, Roded Sharan, Eytan Ruppin, Ron Y. Pinter: Constraint-based functional similarity of metabolic genes: going beyond network topology. Bioinformatics 23(16): 2139-2146 (2007) |
2006 | ||
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter: On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem. CPM 2006: 141-152 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Oleg Rokhlenko, Tomer Shlomi, Roded Sharan, Eytan Ruppin, Ron Y. Pinter: Flux-Based vs. Topology-Based Similarity of Metabolic Genes. WABI 2006: 274-285 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Eyal Ackerman, Gill Barequet, Ron Y. Pinter: A bijection between permutations and floorplans, and its applications. Discrete Applied Mathematics 154(12): 1674-1684 (2006) |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik: The number of guillotine partitions in d dimensions. Inf. Process. Lett. 98(4): 162-167 (2006) |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Eyal Ackerman, Gill Barequet, Ron Y. Pinter: On the number of rectangulations of a planar point set. J. Comb. Theory, Ser. A 113(6): 1072-1091 (2006) |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson, Ron Y. Pinter, Zohar Yakhini: A High-Throughput Approach for Associating MicroRNAs with Their Activity Conditions. Journal of Computational Biology 13(2): 245-266 (2006) |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter: On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem. Journal of Computational Biology 13(8): 1397-1418 (2006) |
2005 | ||
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Eyal Ackerman, Gill Barequet, Ron Y. Pinter: An Upper Bound on the Number of Rectangulations of a Point Set. COCOON 2005: 554-559 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson, Ron Y. Pinter, Zohar Yakhini: A High-Throughput Approach for Associating microRNAs with Their Activity Conditions. RECOMB 2005: 133-151 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini: Dotted interval graphs and high throughput genotyping. SODA 2005: 339-348 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Dolev Dotan, Ron Y. Pinter: HyperFlow: An Integrated Visual Query and Dataflow Language for End-User Information Analysis. VL/HCC 2005: 27-34 |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Ron Y. Pinter, Oleg Rokhlenko, Esti Yeger Lotem, Michal Ziv-Ukelson: Alignment of metabolic pathways. Bioinformatics 21(16): 3401-3408 (2005) |
2004 | ||
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter: Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. CPM 2004: 32-46 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate Labelled Subtree Homeomorphism. CPM 2004: 59-73 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Eyal Ackerman, Gill Barequet, Ron Y. Pinter: On the number of rectangular partitions. SODA 2004: 736-745 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan: Improved bounds on sorting with length-weighted reversals. SODA 2004: 919-928 |
1999 | ||
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Ron Y. Pinter, Shalom Tsur: Next Generation Information Technologies and Systems, 4th International Workshop, NGITS'99, Zikhron-Yaakov, Israel, July 5-7, 1999 Proceedings Springer 1999 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Reiner Kraft, Gabi Zodik, Daniel Alexander Ford, Ron Y. Pinter, Dirk Nicol, Qi Lu, Matthias Eichstaedt: jCentral: Search the Web for Java. WebNet 1999: 626-631 |
1994 | ||
15 | ![]() ![]() ![]() ![]() ![]() ![]() | David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter: Minimizing Channel Density by Lateral Shifting of Components. SODA 1994: 122-131 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Shlomit S. Pinter, Ron Y. Pinter: Program Optimization and Parallelization Using Idioms. ACM Trans. Program. Lang. Syst. 16(3): 305-327 (1994) |
1991 | ||
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Shlomit S. Pinter, Ron Y. Pinter: Program Optimization and Parallelization Using Idioms. POPL 1991: 79-92 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Ran Canetti, L. Paul Fertig, Saul A. Kravitz, Dalia Malki, Ron Y. Pinter, Sara Porat, Avi Teperman: The parallel C (pC) programming language. IBM Journal of Research and Development 35(5): 727-742 (1991) |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Ron Y. Pinter, Pnina Vortman, Zvi Weiss: Partial Compilation of REXX. IBM Systems Journal 30(3): 312-321 (1991) |
1989 | ||
10 | ![]() ![]() ![]() ![]() ![]() ![]() | David Bernstein, Dina Q. Goldin, Martin Charles Golumbic, Hugo Krawczyk, Yishay Mansour, Itai Nahshon, Ron Y. Pinter: Spill Code Minimization Techniques for Optimizing Compilers. PLDI 1989: 258-263 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Reuven Bar-Yehuda, Jack A. Feldman, Ron Y. Pinter, Shmuel Wimer: Depth-first-search and dynamic programming algorithms for efficient CMOS cell generation. IEEE Trans. on CAD of Integrated Circuits and Systems 8(7): 737-743 (1989) |
1988 | ||
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Ido Dagan, Martin Charles Golumbic, Ron Y. Pinter: Trapezoid graphs and their coloring. Discrete Applied Mathematics 21(1): 35-46 (1988) |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | David Bernstein, Haran Boral, Ron Y. Pinter: Optimal Chaining in Expression Trees. IEEE Trans. Computers 37(11): 1366-1374 (1988) |
1987 | ||
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Shmuel Wimer, Ron Y. Pinter, Jack A. Feldman: Optimal Chaining of CMOS Transistors in a Functional Cell. IEEE Trans. on CAD of Integrated Circuits and Systems 6(5): 795-801 (1987) |
1986 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | David Bernstein, Haran Boral, Ron Y. Pinter: Optimal chaining in expression trees. SIGPLAN Symposium on Compiler Construction 1986: 1-10 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Takao Asano, Tetsuo Asano, Ron Y. Pinter: Polygon Triangulation: Efficiency and Minimality. J. Algorithms 7(2): 221-231 (1986) |
1985 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | David Bernstein, Ron Y. Pinter, Michael Rodeh: Optimal Scheduling of Arithmetic Operations in Parallel with Memory Accesses. POPL 1985: 325-333 |
1983 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Brenda S. Baker, Ron Y. Pinter: An Algorithm for the Optimal Placement and Routing of a Circuit within a Ring of Pads (Extended Abstract) FOCS 1983: 360-370 |
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Charles E. Leiserson, Ron Y. Pinter: Optimal Placement for River Routing. SIAM J. Comput. 12(3): 447-462 (1983) |