default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimi Haber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Rotem Brand, Reuven Cohen, Baruch Barzel, Simi Haber:
Constructing cost-effective infrastructure networks. CoRR abs/2308.11033 (2023)- [i3]Simi Haber, Yonatan Wexler:
Practical Estimation of Ensemble Accuracy. CoRR abs/2311.10940 (2023) - 2022
- [j11]Daniel Libman, Gil Ariel
, Mary Schaps, Simi Haber:
Mutual Information between Order Book Layers. Entropy 24(3): 343 (2022) - 2021
- [j10]Daniel Libman, Simi Haber, Mary Schaps:
Forecasting Quoted Depth With the Limit Order Book. Frontiers Artif. Intell. 4: 667780 (2021) - [j9]Debsoumya Chakraborti, Alan M. Frieze, Simi Haber, Mihir Hasabnis:
Isomorphism for random k-uniform hypergraphs. Inf. Process. Lett. 166: 106039 (2021) - [i2]Shai Gul, Reuven Cohen, Simi Haber:
Efficient covering of convex domains by congruent discs. CoRR abs/2108.00707 (2021)
2010 – 2019
- 2019
- [j8]Nicole Balashov, Reuven Cohen, Avieli Haber, Michael Krivelevich, Simi Haber:
Optimal shattering of complex networks. Appl. Netw. Sci. 4(1): 99:1-99:9 (2019) - [j7]Daniel Libman, Simi Haber, Mary Schaps:
Volume Prediction With Neural Networks. Frontiers Artif. Intell. 2: 21 (2019) - [i1]Nicole Balashov, Reuven Cohen, Avieli Haber, Michael Krivelevich, Simi Haber:
Optimal shattering of complex networks. CoRR abs/1912.04044 (2019) - 2017
- [c3]Ariel Weizman, Orr Dunkelman, Simi Haber:
Efficient Construction of Diamond Structures. INDOCRYPT 2017: 166-185 - 2015
- [j6]Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, Or Sheffet:
Optimal social choice functions: A utilitarian view. Artif. Intell. 227: 190-213 (2015) - [j5]Alan M. Frieze, Simi Haber:
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three. Random Struct. Algorithms 47(1): 73-98 (2015) - [c2]Simi Haber, Saharon Shelah:
An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers. Fields of Logic and Computation II 2015: 226-236 - 2012
- [c1]Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, Or Sheffet:
Optimal social choice functions: a utilitarian view. EC 2012: 197-214 - 2011
- [j4]Noga Alon, Simi Haber, Michael Krivelevich:
The Number of f-Matchings in Almost Every Tree is a Zero Residue. Electron. J. Comb. 18(1) (2011)
2000 – 2009
- 2008
- [j3]Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky:
The isoperimetric constant of the random graph process. Random Struct. Algorithms 32(1): 101-114 (2008) - [j2]Simi Haber, Michael Krivelevich:
Corrigendum: On fractional K-factors of random graphs. Random Struct. Algorithms 33(4): 533-535 (2008) - 2007
- [j1]Simi Haber, Michael Krivelevich:
On fractional K-factors of random graphs. Random Struct. Algorithms 30(4): 441-463 (2007)
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:16 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:
