scispace - formally typeset
S

Stefano Leonardi

Researcher at University of Texas at Dallas

Publications -  347
Citations -  10583

Stefano Leonardi is an academic researcher from University of Texas at Dallas. The author has contributed to research in topics: Turbulence & Approximation algorithm. The author has an hindex of 51, co-authored 326 publications receiving 9493 citations. Previous affiliations of Stefano Leonardi include University of Puerto Rico at Mayagüez & University of Puerto Rico.

Papers
More filters
Journal ArticleDOI

Direct numerical simulations of turbulent channel flow with transverse square bars on one wall

Stefano Leonardi, +4 more
- 25 Sep 2003 - 
TL;DR: In this article, direct numerical simulations have been carried out for a fully developed turbulent channel flow with a smooth upper wall and a lower wall consisting of square bars separated by a rectangular cavity.
Proceedings ArticleDOI

Online team formation in social networks

Aris Anagnostopoulos, +4 more
TL;DR: This paper proposes efficient algorithms that address all requirements of online team formation: these algorithms form teams that always satisfy the required skills, provide approximation guarantees with respect to team communication overhead, and they are online-competitive with Respect to load balancing.
Journal ArticleDOI

Preferential attachment in the growth of social networks: the internet encyclopedia Wikipedia.

Andrea Capocci, +7 more
- 25 Sep 2006 - 
TL;DR: An analysis of the statistical properties and growth of the free on-line encyclopedia Wikipedia is presented, which can be described by local rules such as the preferential attachment mechanism, though users, who are responsible of its evolution, can act globally on the network.
Proceedings ArticleDOI

A large-eddy simulation of wind-plant aerodynamics

Matthew J. Churchfield, +6 more
TL;DR: In this article, the authors present results of a large-eddy simulation of the 48 multi-megawatt turbines composing the Lillgrund wind plant, and they used the OpenFOAM CFD toolbox to create their solver.
Proceedings ArticleDOI

Counting triangles in data streams

Luciana S. Buriol, +4 more
TL;DR: Two space bounded random sampling algorithms that compute an approximation of the number of triangles in an undirected graph given as a stream of edges are presented and they provide a basic tool to analyze the structure of large graphs.