ד''ר שחר גולן

אוניברסיטת בן גוריון, המחלקה למדעי המחשב
2004–2009 – Ph.D. בהצטיינות יתרה
כותרת התזה: שיטות אלגבריות לפתרון בעיות סיפוק אילוצים
מנחה: פרופ' דניאל ברנד

2004–2007 – M.Sc. בהצטיינות יתרה

1998–2001 – B.Sc. בהצטיינות יתרה

מחקר ופיתוח, Google
2016–2018
• צוות Growth – פיתוח פלטפורמה ליצירת קמפיינים להגדלת שימוש באפליקציות
• צוות Crisis Response – שיפור חווית החיפוש באמצעות תוסף המספק מידע חי על מקרי חירום

מחקר, Yahoo research labs
2013–2016
• צוות Computational Ads – פיתוח מערכת המלצה לפרסומות בדפי תוכן

מחקר, HP research labs
2010–2013
• צוות IT analytics – פיתוח פתרונות כריית מידע ולמידת מכונה לאוטומציית תהליכי IT

הובלת צוות מחקר, HyperRoll
2002–2006

מהנדס וריפיקציה, Mellanox
2001–2002

רכז ומרצה בקורסים:

·   עיצוב ותכנות מונחי עצמים (תבניות עיצוב)

·   מבני נתונים ב'

Papers in refereed journals

1. Littlewood polynomials with high order zeros. D. Berend and S. Golan. Mathematics of Computation 75 (2006), 1541–1552.

2. Equal moments division of a set. Mathematics of Computation 77 (2008), 1695–1712.

3. Minesweeper on graphs. Applied Mathematics and Computation 217, issue 14 (2011), 6616–6623.

4. Counting solutions to CSP using generating polynomials. D. Berend and S. Golan. Journal of Discrete Algorithms 26 (2014), 89–97.

5. Graph mining for discovering infrastructure patterns in configuration management databases (with O. Barkol, M. Zaki, P. Anchuri). Knowledge and Information Systems 33 (2012), 491–522.

6. Minesweeper strategy for one mine. Applied Mathematics and Computation 232 (2014), 292–302.

7. Littlewood polynomials, spectral-null codes, and equipowerful partitions (with J. Buhler, R. Pratt, S. Wagon). Mathematics of Computation 90 (2021), 1435–1453.

8. GO-MOCE: Greedy order MOCE for Max Sat. D. Berend, S. Golan and Y. Twitto. Discrete Optimization 43 (2022).

9. Using method of conditional expectations to supply an improved starting point for CCLS. D. Berend, S. Golan and Y. Twitto. Journal of Combinatorial Optimization (2022), 1–24.

10. CHAMP: A multipass algorithm for Max Sat based on saver variables. D. Berend, S. Golan and Y. Twitto. Discrete Optimization 47 (2023).

Papers in refereed conference proceedings

11. An O(|V||E|) algorithm for scheduling with AND/OR precedence constraints. P. Carmi, Y. Dinitz, S. Golan, O. Liba and G. Rozenwald. Workshop on Interdisciplinary Applications of Graph Theory.

12. SiSTeR – a new frequent similar tree algorithm. O. Barkol, R. Bergman and S. Golan. KDIR 2011, 238–243.

13. Automatic policy rule extraction for configuration management. R. Banner, O. Barkol, R. Bergman, S. Golan, Y. Carmel, I. Ish-Hurwitz and O. Zilinsky. IEEE POLICY 2011, 125–128.

14. Infrastructure pattern discovery in configuration management databases via large sparse graph mining. O. Barkol, R. Bergman, Y. Felder, S. Golan, A. Sityon, M. Zaki and P. Anchuri. IEEE ICDM 2011, 11–20.

15. Enterprise collective: connecting people via content. O. Barkol, R. Bergman, S. Golan, K. Kasravi and M. Risov. CENT 2012, 17–20.

16. Approximate graph mining with label costs. O. Barkol, M. Zaki, P. Anchuri and M. Shamy. KDD 2013, 518–526.

17. Budget-constrained item cold-start handling in collaborative filtering recommenders via optimal design. O. Anava, S. Golan, N. Golbandi, Z. Karnin, R. Lempel, O. Rokhlenko and O. Somekh. WWW 2015, 45–54.

18. ExcUseMe: asking users to help in item cold-start recommendations. O. Anava, N. Avigdor, M. Aharon, D. Drechsler, S. Golan and O. Somekh. RecSys 2015, 83–90.

19. MaDaScA: instruction of data science to managers. D. Bouhnik and S. Golan. Informing Science & IT Education Conference (InSITE) 2019, 125–140.

20. A novel algorithm for Max Sat calling MOCE to order. D. Berend, S. Golan and Y. Twitto. COCOA 2021, 302–317.

1.     Patent no. US 8,364,697 (2013) B2 (with additional inventors from Hyperroll): A method and system for creation and dynamic updating of best data arrangement in digital data store system

2.     Patent no. US 8,886,679 (2014) B2 (with additional inventors from HP): Mining web applications

3.     Patent no. US 9,361,401 (2016) B2 (with additional inventors from HP): Relevance map linking

4.     Patent no. US 9,405,853 (2016) B2 (with additional inventors from HP): Reading object queries

5.     Patent no. US 9,465,875 (2016) B2 (with additional inventors from HP): Searching based on an identifier of a searcher

6.     Patent no. US 9,910,898 (2018) B2 (with additional inventors from Yahoo): Smart exploration methods for mitigating item cold-start problem in collaborative filtering recommendation systems

7.     Patent no. US 10,402,484 (2019) B2 (with additional inventors from HP): Aligning annotation of fields of documents

8.     Patent no. US 10,540,354 (2020) B2 (with additional inventors from HP): Discovering representative composite CI patterns in an it system

9.     Patent no. US 10,699,198 (2020) B2 (with additional inventors from Yahoo): Method and system for cold-start item recommendation

10.  Patent no. US 11,810,158 (2023) B2 (with additional inventors from Yahoo): Weighted pseudo - random digital content selection

עברית ואנגלית - ברמת שפת אם