default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShahar Golan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Daniel Berend, Shahar Golan, Yochai Twitto
:
CHAMP: A multipass algorithm for Max Sat based on saver variables. Discret. Optim. 47: 100760 (2023)- 2022
- [j9]Daniel Berend, Shahar Golan, Yochai Twitto:
GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat. Discret. Optim. 43: 100685 (2022) - [j8]Daniel Berend, Shahar Golan, Yochai Twitto:
Using the method of conditional expectations to supply an improved starting point for CCLS. J. Comb. Optim. 44(5): 3711-3734 (2022) - 2021
- [j7]Joe Buhler, Shahar Golan, Rob Pratt, Stan Wagon:
Littlewood polynomials, spectral-null codes, and equipowerful partitions. Math. Comput. 90(329): 1435-1453 (2021) - [c7]Daniel Berend, Shahar Golan, Yochai Twitto:
A Novel Algorithm for Max Sat Calling MOCE to Order. COCOA 2021: 302-317
2010 – 2019
- 2015
- [c6]Michal Aharon, Oren Anava, Noa Avigdor-Elgrabli, Dana Drachsler-Cohen, Shahar Golan, Oren Somekh:
ExcUseMe: Asking Users to Help in Item Cold-Start Recommendations. RecSys 2015: 83-90 - [c5]Oren Anava, Shahar Golan, Nadav Golbandi, Zohar Shay Karnin, Ronny Lempel, Oleg Rokhlenko, Oren Somekh:
Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design. WWW 2015: 45-54 - 2014
- [j6]Shahar Golan:
Minesweeper strategy for one mine. Appl. Math. Comput. 232: 292-302 (2014) - [j5]Daniel Berend, Shahar Golan:
Counting solutions to CSP using generating polynomials. J. Discrete Algorithms 26: 89-97 (2014) - [i1]Oren Anava, Shahar Golan, Nadav Golbandi, Zohar Shay Karnin, Ronny Lempel, Oleg Rokhlenko, Oren Somekh:
Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design. CoRR abs/1406.2431 (2014) - 2013
- [c4]Pranay Anchuri, Mohammed J. Zaki, Omer Barkol, Shahar Golan, Moshe Shamy:
Approximate graph mining with label costs. KDD 2013: 518-526 - 2012
- [j4]Pranay Anchuri, Mohammed J. Zaki, Omer Barkol, Ruth Bergman, Yifat Felder, Shahar Golan, Arik Sityon:
Graph mining for discovering infrastructure patterns in configuration management databases. Knowl. Inf. Syst. 33(3): 491-522 (2012) - 2011
- [j3]Shahar Golan:
Minesweeper on graphs. Appl. Math. Comput. 217(14): 6616-6623 (2011) - [c3]Omer Barkol, Ruth Bergman, Shahar Golan:
A New Frequent Similar Tree Algorithm Motivated by Dom Mining - Using RTDM and its New Variant - SiSTeR. KDIR 2011: 238-243 - [c2]Pranay Anchuri, Mohammed J. Zaki, Omer Barkol, Ruth Bergman, Yifat Felder, Shahar Golan, Arik Sityon:
Infrastructure Pattern Discovery in Configuration Management Databases via Large Sparse Graph Mining. ICDM 2011: 11-20 - [c1]Ron Banner, Omer Barkol, Ruth Bergman, Shahar Golan, Yuval Carmel, Ido Ish-Hurwitz, Oded Zilinsky:
Automatic Policy Rule Extraction for Configuration Management. POLICY 2011: 125-128
2000 – 2009
- 2008
- [j2]Shahar Golan:
Equal moments division of a set. Math. Comput. 77(263): 1695-1712 (2008) - 2006
- [j1]Daniel Berend, Shahar Golan:
Littlewood polynomials with high order zeros. Math. Comput. 75(255): 1541-1552 (2006)
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-25 05:48 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:
