default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTzvika Hartman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j12]Amir Feder
, Danny Vainstein, Roni Rosenfeld, Tzvika Hartman, Avinatan Hassidim, Yossi Matias:
Active deep learning to detect demographic traits in free-form clinical notes. J. Biomed. Informatics 107: 103436 (2020)- [j11]Tzvika Hartman, Michael D. Howell, Jeff Dean, Shlomo Hoory, Ronit Slyper, Itay Laish, Oren Gilon, Danny Vainstein, Greg Corrado, Katherine Chou, Ming Jack Po, Jutta Williams, Scott Ellis, Gavin Bee, Avinatan Hassidim, Rony Amira, Genady Beryozkin, Idan Szpektor, Yossi Matias:
Customization scenarios for de-identification of clinical notes. BMC Medical Informatics Decis. Mak. 20(1): 14 (2020)
2010 – 2019
- 2019
- [c14]Genady Beryozkin, Yoel Drori, Oren Gilon, Tzvika Hartman, Idan Szpektor:
A Joint Named-Entity Recognizer for Heterogeneous Tag-sets Using a Tag Hierarchy. ACL (1) 2019: 140-150 - [c13]Ido Cohn, Itay Laish, Genady Beryozkin, Gang Li, Izhak Shafran, Idan Szpektor, Tzvika Hartman, Avinatan Hassidim, Yossi Matias:
Audio De-identification - a New Entity Recognition Task. NAACL-HLT (2) 2019: 197-204 - [i3]Ido Cohn, Itay Laish, Genady Beryozkin, Gang Li, Izhak Shafran, Idan Szpektor, Tzvika Hartman, Avinatan Hassidim, Yossi Matias:
Audio De-identification: A New Entity Recognition Task. CoRR abs/1903.07037 (2019) - [i2]Genady Beryozkin, Yoel Drori, Oren Gilon, Tzvika Hartman, Idan Szpektor:
A Joint Named-Entity Recognizer for Heterogeneous Tag-setsUsing a Tag Hierarchy. CoRR abs/1905.09135 (2019) - 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. Biol. 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. Discret. Math. 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. Biol. 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. J. Comput. Biol. 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. J. Comput. Biol. 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. Electron. Colloquium Comput. Complex. TR00 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
