The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tzvika Hartman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tzvika Hartman
    A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions. [Citation Graph (0, 0)][DBLP]
    CPM, 2003, pp:156-169 [Conf]
  2. Tzvika Hartman, Ran Raz
    On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:3-22 [Conf]
  3. Amir Ben-Dor, Tzvika Hartman, Benno Schwikowski, Roded Sharan, Zohar Yakhini
    Towards optimally multiplexed applications of universal DNA tag systems. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2003, pp:48-56 [Conf]
  4. Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir
    Handling long targets and errors in sequencing by hybridization. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2002, pp:176-185 [Conf]
  5. Tzvika Hartman, Elad Verbin
    Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2006, pp:279-290 [Conf]
  6. Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau
    On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:92-102 [Conf]
  7. Tzvika Hartman, Roded Sharan
    A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:50-61 [Conf]
  8. Isaac Elias, Tzvika Hartman
    A 1.375-Approximation Algorithm for Sorting by Transpositions. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:204-215 [Conf]
  9. Tzvika Hartman, Ran Raz
    On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:44, pp:- [Journal]
  10. Tzvika Hartman, Ron Shamir
    A simpler and faster 1.5-approximation algorithm for sorting by transpositions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:2, pp:275-290 [Journal]
  11. Amir Ben-Dor, Tzvika Hartman, Richard M. Karp, Benno Schwikowski, Roded Sharan, Zohar Yakhini
    Towards Optimally Multiplexed Applications of Universal Arrays. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:2/3, pp:476-492 [Journal]
  12. Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir
    Handling Long Targets and Errors in Sequencing by Hybridization. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:3/4, pp:483-497 [Journal]
  13. Tzvika Hartman, Roded Sharan
    A 1.5-approximation algorithm for sorting by transpositions and transreversals. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:3, pp:300-320 [Journal]
  14. Tzvika Hartman, Ran Raz
    On the distribution of the number of roots of polynomials and explicit weak designs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:3, pp:235-263 [Journal]
  15. Isaac Elias, Tzvika Hartman
    A 1.375-Approximation Algorithm for Sorting by Transpositions. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:4, pp:369-379 [Journal]
  16. Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat
    On the Cost of Interchange Rearrangement in Strings. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:99-110 [Conf]
  17. Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur
    Generalized LCS. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:50-61 [Conf]

  18. Haplotype Inference Constrained by Plausible Haplotype Data. [Citation Graph (, )][DBLP]


  19. On the complexity of SNP block partitioning under the perfect phylogeny model. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002