Simi Haber

Orcid: 0000-0001-8421-832X

According to our database1, Simi Haber authored at least 16 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Practical Estimation of Ensemble Accuracy.
CoRR, 2023

Constructing cost-effective infrastructure networks.
CoRR, 2023

2022
Mutual Information between Order Book Layers.
Entropy, 2022

2021
Isomorphism for random <i>k</i>-uniform hypergraphs.
Inf. Process. Lett., 2021

Forecasting Quoted Depth With the Limit Order Book.
Frontiers Artif. Intell., 2021

Efficient covering of convex domains by congruent discs.
CoRR, 2021

2019
Volume Prediction With Neural Networks.
Frontiers Artif. Intell., 2019

Optimal shattering of complex networks.
Appl. Netw. Sci., 2019

2017
Efficient Construction of Diamond Structures.
Proceedings of the Progress in Cryptology - INDOCRYPT 2017, 2017

2015
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three.
Random Struct. Algorithms, 2015

Optimal social choice functions: A utilitarian view.
Artif. Intell., 2015

An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers.
Proceedings of the Fields of Logic and Computation II, 2015

2011
The Number of <i>f</i>-Matchings in Almost Every Tree is a Zero Residue.
Electron. J. Comb., 2011

2008
Corrigendum: On fractional K-factors of random graphs.
Random Struct. Algorithms, 2008

The isoperimetric constant of the random graph process.
Random Struct. Algorithms, 2008

2007
On fractional <i>K</i>-factors of random graphs.
Random Struct. Algorithms, 2007


  Loading...