2 citations · 2 across the 4 of their papers we have counts for
4 papers
Is a LOCAL algorithm computable?
Antonio Cruciani, Avinandan Das, Massimo Equi +4
Common definitions of the "standard" LOCAL model tend to be sloppy and even self-contradictory on one point: do the nodes update their state using an arbitrary function or a comput…
Relative discrepancy of hypergraphs
Diep Luong-Le, Tuan Tran, Dilong Yang
Given -uniform hypergraphs and on vertices with densities and , their relative discrepancy is defined as $\hbox{disc}(G,H)=\max\big||E(G')\cap E(H')|-pq\binom…
Option Pricing with Stochastic Volatility, Equity Premium, and Interest Rates
Nicole Hao, Echo Li, Diep Luong-Le
This paper presents a new model for options pricing. The Black-Scholes-Merton (BSM) model plays an important role in financial options pricing. However, the BSM model assumes that…
The Planar Turán Number of -graphs
David Guan, Ervin Győri, Diep Luong-Le +2
There are two particular -graphs - the 6-cycle graphs with a diagonal. We find the planar Turán number of each of them, i.e. the maximum number of edges in a planar graph …