Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Tzvika Hartman
2010 – today
- 2012
[c12]Tzvika Hartman, Avinatan Hassidim, Haim Kaplan, Danny Raz, Michal Segalov: How to split a flow? INFOCOM 2012: 828-836- 2011
- [j10]Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg: Haplotype Inference Constrained by Plausible Haplotype Data. IEEE/ACM Trans. Comput. Biology Bioinform. 8(6): 1692-1699 (2011)
2000 – 2009
- 2009
- [j9]Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau: On the complexity of SNP block partitioning under the perfect phylogeny model. Discrete Mathematics 309(18): 5610-5617 (2009)
- [j8]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat: On the Cost of Interchange Rearrangement in Strings. SIAM J. Comput. 39(4): 1444-1461 (2009)
- [c11]Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg: Haplotype Inference Constrained by Plausible Haplotype Data. CPM 2009: 339-352
- 2008
- [j7]Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. Theor. Comput. Sci. 409(3): 438-449 (2008)
- 2007
- [c10]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat: On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110
- [c9]Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. SPIRE 2007: 50-61
- 2006
- [j6]Tzvika Hartman, Ron Shamir: A simpler and faster 1.5-approximation algorithm for sorting by transpositions. Inf. Comput. 204(2): 275-290 (2006)
- [j5]Isaac Elias, Tzvika Hartman: A 1.375-Approximation Algorithm for Sorting by Transpositions. IEEE/ACM Trans. Comput. Biology Bioinform. 3(4): 369-379 (2006)
- [c8]Tzvika Hartman, Elad Verbin: Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions. SPIRE 2006: 279-290
- [c7]Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau: On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. WABI 2006: 92-102
- 2005
- [j4]Tzvika Hartman, Roded Sharan: A 1.5-approximation algorithm for sorting by transpositions and transreversals. J. Comput. Syst. Sci. 70(3): 300-320 (2005)
- [c6]Isaac Elias, Tzvika Hartman: A 1.375-Approximation Algorithm for Sorting by Transpositions. WABI 2005: 204-215
- 2004
- [j3]Amir Ben-Dor, Tzvika Hartman, Richard M. Karp, Benno Schwikowski, Roded Sharan, Zohar Yakhini: Towards Optimally Multiplexed Applications of Universal Arrays. Journal of Computational Biology 11(2/3): 476-492 (2004)
- [c5]Tzvika Hartman, Roded Sharan: A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals. WABI 2004: 50-61
- 2003
- [j2]Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir: Handling Long Targets and Errors in Sequencing by Hybridization. Journal of Computational Biology 10(3/4): 483-497 (2003)
- [j1]Tzvika Hartman, Ran Raz: On the distribution of the number of roots of polynomials and explicit weak designs. Random Struct. Algorithms 23(3): 235-263 (2003)
- [c4]Tzvika Hartman: A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions. CPM 2003: 156-169
- [c3]Amir Ben-Dor, Tzvika Hartman, Benno Schwikowski, Roded Sharan, Zohar Yakhini: Towards optimally multiplexed applications of universal DNA tag systems. RECOMB 2003: 48-56
- 2002
- [c2]Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir: Handling long targets and errors in sequencing by hybridization. RECOMB 2002: 176-185
- 2000
- [c1]Tzvika Hartman, Ran Raz: On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors. ICALP Satellite Workshops 2000: 3-22
- [i1]Tzvika Hartman, Ran Raz: On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors. Electronic Colloquium on Computational Complexity (ECCC) 7(44) (2000)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:54 CET by the dblp team