activity
20122023
most citedJoin Processing for Graph Patterns: An Old Dog with New Tricks

6 citations · 7 across the 10 of their papers we have counts for

collaborators

11 papers

math.PR2023

Some new concentration inequalities for the Itô stochastic integral

Nguyen Tien Dung

In this paper, based on the techniques of Malliavin calculus, we provide some new concentration inequalities for the running supremum of the Itô stochastic integral with unbounded…

math.CO2022

Some identities for the Narayana polynomial and its derivatives

Nguyen Tien Dung

In this note, by employing a nice property of semicircular distributions, we derive some identities for the Narayana polynomial and its derivatives.

math.PR2022

Rates of Fisher information convergence in the central limit theorem for nonlinear statistics

Nguyen Tien Dung

We develop a general method to study the Fisher information distance in central limit theorem for nonlinear statistics. We first construct completely new representations for the sc…

math.PR2021

Density estimates for the exponential functionals of fractional Brownian motion

Nguyen Tien Dung, Nguyen Thu Hang, Pham Thi Phuong Thuy

In this note, we investigate the density of the exponential functional of the fractional Brownian motion. Based on the techniques of Malliavin's calculus, we provide a log-normal u…

math.PR2021

On the density of nonlinear statistics

Nguyen Tien Dung

In this note, we revisit a classical problem related to the density of nonlinear statistics. We obtain a new representation of densities and, for the first time, a necessary and su…

math.PR2019

Rates of convergence in the CLT for nonlinear statistics under relaxed moment conditions

Nguyen Tien Dung

This paper is concerned with normal approximation under relaxed moment conditions using Stein's method. We obtain the explicit rates of convergence in the central limit theorem for…

math.PR2019

A variance-sensitive Gaussian concentration inequality

Nguyen Tien Dung

In this note, we obtain a Gaussian concentration inequality for a class of non-Lipschitz functions. In the one-dimensional case, our results supplement those established by Paouris…

cs.DB2015★ 6 cited

Join Processing for Graph Patterns: An Old Dog with New Tricks

Dung Nguyen, Molham Aref, Martin Bravenboer +4

Join optimization has been dominated by Selinger-style, pairwise optimizers for decades. But, Selinger-style algorithms are asymptotically suboptimal for applications in graphic an…

math.RT2013

A cellular basis of the -Brauer algebra related with Murphy bases of the Hecke algebras

Dung Tien Nguyen

A new basis of the -Brauer algebra is introduced, which is a lift of Murphy bases of Hecke algebras of symmetric groups. This basis is a cellular basis in the sense of Graham an…

cs.DB2013

Beyond Worst-Case Analysis for Joins with Minesweeper

Hung Q. Ngo, Dung T. Nguyen, Christopher Ré +1

We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially, `beyond worst-case guarantees') for data…

math.RT2012★ 1 cited

Cellular structure of -Brauer algebras

Dung Tien Nguyen

In this paper we consider the -Brauer algebra over a commutative noetherian domain. We first construct a new basis for -Brauer algebras, and we then prove that it is a ce…