default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZohar Nussinov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Tianle Pu, Changjun Fan, Mutian Shen, Yizhou Lu, Li Zeng, Zohar Nussinov, Chao Chen, Zhong Liu:
Transform then Explore: a Simple and Effective Technique for Exploratory Combinatorial Optimization with Reinforcement Learning. CoRR abs/2404.04661 (2024)- 2020
- [i12]Raj Kishore, S. Swayamjyoti, Shreeja Das, Ajay Kumar Gogineni, Zohar Nussinov, D. Solenov, Kisor K. Sahu:
Visual Machine Learning: Insight through Eigenvectors, Chladni patterns and community detection in 2D particulate structures. CoRR abs/2001.00345 (2020) - [i11]Brendon Lutnick, Wen Dong, Zohar Nussinov, Pinaki Sarder:
Unsupervised Community Detection with a Potts Model Hamiltonian, an Efficient Algorithmic Solution, and Applications in Digital Pathology. CoRR abs/2002.01599 (2020) - [i10]Raj Kishore, Zohar Nussinov, Kisor Kumar Sahu:
A new nature inspired modularity function adapted for unsupervised learning involving spatially embedded networks: A comparative analysis. CoRR abs/2007.09330 (2020)
2010 – 2019
- 2015
- [j1]Richard K. Darst, David R. Reichman, Peter Ronhovde, Zohar Nussinov:
Algorithm independent bounds on community detection problems and associated transitions in stochastic block model graphs. J. Complex Networks 3(3): 333-360 (2015) - [i9]Zohar Nussinov, Peter Ronhovde, Dandan Hu, Saurish Chakrabarty, M. Sahu, Bo Sun, Nicholas A. Mauro, Kisor K. Sahu:
Inference of hidden structures in complex physical systems by multi-scale clustering. CoRR abs/1503.01626 (2015) - 2014
- [i8]Bo Sun, Blake Leonard, Peter Ronhovde, Zohar Nussinov:
An interacting replica approach applied to the traveling salesman problem. CoRR abs/1406.7282 (2014) - 2013
- [i7]Richard K. Darst, David R. Reichman, Peter Ronhovde, Zohar Nussinov:
An edge density definition of overlapping and weighted graph communities. CoRR abs/1301.3120 (2013) - [i6]Richard K. Darst, David R. Reichman, Peter Ronhovde, Zohar Nussinov:
Algorithm independent bounds on community detection problems and associated transitions in stochastic block model graphs. CoRR abs/1306.5794 (2013) - [i5]Richard K. Darst, Zohar Nussinov, Santo Fortunato:
Improving the performance of algorithms to find communities in networks. CoRR abs/1311.3984 (2013) - 2012
- [i4]Dandan Hu, Pinaki Sarder, Peter Ronhovde, Sharon Bloch, Samuel Achilefu, Zohar Nussinov:
Segmenting Intracellular Distribution Images Derived by Fluorescent Dyes Using a Potts Model Hamiltonian. CoRR abs/1208.4662 (2012) - [i3]Peter Ronhovde, Zohar Nussinov:
Local multiresolution order in community detection. CoRR abs/1208.5052 (2012) - 2011
- [i2]Dandan Hu, Peter Ronhovde, Zohar Nussinov:
A Replica Inference Approach to Unsupervised Multi-Scale Image Segmentation. CoRR abs/1106.5793 (2011)
2000 – 2009
- 2002
- [i1]Vladimir Gudkov, Shmuel Nussinov, Zohar Nussinov:
A Novel Approach Applied to the Largest Clique Problem. CoRR cond-mat/0209419 (2002)
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-12-17 21:53 CET 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:
