default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvraham A. Melkman
Person information
- affiliation: Ben-Gurion University, Beersheba, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Avraham A. Melkman
, Sini Guo, Wai-Ki Ching, Pengyu Liu, Tatsuya Akutsu:
On the Compressive Power of Boolean Threshold Autoencoders. IEEE Trans. Neural Networks Learn. Syst. 34(2): 921-931 (2023)- [c4]Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov:
Shortest Longest-Path Graph Orientations. COCOON (1) 2023: 141-154 - [i3]Tatsuya Akutsu, Avraham A. Melkman, Atsuhiro Takasu:
On the Trade-off between the Number of Nodes and the Number of Trees in a Random Forest. CoRR abs/2312.11540 (2023) - 2021
- [i2]Tatsuya Akutsu, Avraham A. Melkman:
On the Size and Width of the Decoder of a Boolean Threshold Autoencoder. CoRR abs/2112.10933 (2021) - 2020
- [j19]Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura:
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree. Int. J. Found. Comput. Sci. 31(2): 253-273 (2020) - [j18]Pengyu Liu, Avraham A. Melkman, Tatsuya Akutsu:
Extracting boolean and probabilistic rules from trained neural networks. Neural Networks 126: 300-311 (2020) - [i1]Avraham A. Melkman, Sini Guo, Wai-Ki Ching, Pengyu Liu, Tatsuya Akutsu:
On the Compressive Power of Boolean Threshold Autoencoders. CoRR abs/2004.09735 (2020)
2010 – 2019
- 2019
- [j17]Tatsuya Akutsu, Avraham A. Melkman:
Identification of the Structure of a Probabilistic Boolean Network From Samples Including Frequencies of Outcomes. IEEE Trans. Neural Networks Learn. Syst. 30(8): 2383-2396 (2019) - 2018
- [j16]Avraham A. Melkman, Xiaoqing Cheng, Wai-Ki Ching, Tatsuya Akutsu:
Identifying a Probabilistic Boolean Threshold Network From Samples. IEEE Trans. Neural Networks Learn. Syst. 29(4): 869-881 (2018) - 2015
- [j15]Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu:
On the complexity of finding a largest common subtree of bounded degree. Theor. Comput. Sci. 590: 2-16 (2015) - 2013
- [j14]Avraham A. Melkman, Tatsuya Akutsu:
An Improved Satisfiability Algorithm for Nested Canalyzing Functions and its Application to Determining a Singleton Attractor of a Boolean Network. J. Comput. Biol. 20(12): 958-969 (2013) - [c3]Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu:
On the Complexity of Finding a Largest Common Subtree of Bounded Degree. FCT 2013: 4-15 - 2012
- [j13]Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura:
Singleton and 2-periodic attractors of sign-definite Boolean networks. Inf. Process. Lett. 112(1-2): 35-38 (2012) - [j12]Dikla Dotan-Cohen, Dana Moonshine, Moshe Natan, Yonat Shemer-Avni, Avraham A. Melkman:
GO for Integration of Expression Data. Silico Biol. 11(1-2): 11-17 (2012) - [j11]Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura:
Finding a Periodic Attractor of a Boolean Network. IEEE ACM Trans. Comput. Biol. Bioinform. 9(5): 1410-1421 (2012) - 2011
- [j10]Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto:
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions. J. Comput. Biol. 18(10): 1275-1290 (2011) - 2010
- [j9]Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu:
Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time. Inf. Process. Lett. 110(14-15): 565-569 (2010)
2000 – 2009
- 2009
- [j8]Dikla Dotan-Cohen, Simon Kasif, Avraham A. Melkman:
Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clustering. Bioinform. 25(14): 1789-1795 (2009) - 2007
- [j7]Dikla Dotan-Cohen, Avraham A. Melkman, Simon Kasif:
Hierarchical tree snipping: clustering guided by prior knowledge. Bioinform. 23(24): 3335-3342 (2007) - 2006
- [c2]Qiaofeng Yang, Stefano Lonardi, Avraham A. Melkman:
A Compression-Boosting Transform for Two-Dimensional Data. AAIM 2006: 126-137 - 2004
- [c1]Avraham A. Melkman, Eran Shaham:
Sleeved coclustering. KDD 2004: 635-640 - 2001
- [j6]Shlomi Dolev, Boris Fitingof, Avraham A. Melkman, Olga Tubman:
Smooth and adaptive forward erasure correcting. Comput. Networks 36(2/3): 343-355 (2001)
1990 – 1999
- 1997
- [j5]Avraham A. Melkman, Solomon Eyal Shimony:
A Note on Approximate Inclusion-exclusion. Discret. Appl. Math. 73(1): 23-26 (1997) - 1996
- [j4]Avraham A. Melkman, Solomon Eyal Shimony:
Algorithms for Parsimonious Complete Sets in Directed Graphs. Inf. Process. Lett. 59(6): 335-339 (1996) - 1995
- [j3]David Leiser, Yoella Bereby, Avraham A. Melkman:
A comparison of display methods for spatial point layout. Behav. Inf. Technol. 14(3): 135-142 (1995)
1980 – 1989
- 1987
- [j2]Avraham A. Melkman:
On-Line Construction of the Convex Hull of a Simple Polyline. Inf. Process. Lett. 25(1): 11-12 (1987)
1970 – 1979
- 1978
- [j1]Ian F. Blake, Avraham A. Melkman:
On an inverse for sections of a binomial matrix. Discret. Math. 23(2): 97-104 (1978)
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-08-05 20:21 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:
