A Hybrid Sampling Scheme for Triangle Counting

Finding a minimum circuit in a graph

Alon Itai and Michael Rodeh · 1978

Earlier work this paper cites.

Arboricity and subgraph listing algorithms

Norishige Chiba and Takao Nishizeki · 1985

Earlier work this paper cites.

Finding and counting given length cycles

Noga Alon, Raphael Yuster, and Uri Zwick · 1997

Earlier work this paper cites.

Reductions in streaming algorithms, with an application to counting triangles in graphs

Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar · 2002

Earlier work this paper cites.

Exponential separation of quantum and classical one-way communication complexity

Ziv Bar-Yossef, Thathachar S Jayram, and Iordanis Kerenidis · 2004

Earlier work this paper cites.

New streaming algorithms for counting triangles in graphs

Hossein Jowhari and Mohammad Ghodsi · 2005

Earlier work this paper cites.

Finding, counting and listing all triangles in large graphs, an experimental study

Thomas Schank and Dorothea Wagner · 2005

Earlier work this paper cites.

Counting triangles in data streams

Luciana S Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Christian Sohler · 2006

Earlier work this paper cites.

The one-way communication complexity of the Boolean Hidden Matching Problem

I. Kerenidis and R. Raz · 2006

Earlier work this paper cites.

Exponential separations for one-way quantum communication complexity, with applications to cryptography

Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, and Ronald De Wolf · 2007

Cited alongside, same era.

Main-memory triangle computations for very large (sparse (power-law)) graphs

Matthieu Latapy · 2008

Cited alongside, same era.

The probabilistic method lecture notes, March 2008

Jiří Matoušek and Jan Vondrák · 2008

Cited alongside, same era.

Doulion: counting triangles in massive graphs with a coin

Charalampos E Tsourakakis, U Kang, Gary L Miller, and Christos Faloutsos · 2009

Cited alongside, same era.

Information cost tradeoffs for augmented index and streaming language recognition

Amit Chakrabarti, Graham Cormode, Ranganath Kondapally, and Andrew McGregor · 2010

Cited alongside, same era.

Triangle sparsifiers

Charalampos E Tsourakakis, Mihail N Kolountzakis, and Gary L Miller · 2011

How hard is counting triangles in the streaming model?

Vladimir Braverman, Rafail Ostrovsky, and Dan Vilenchik · 2013

Later among the works it cites.

A space efficient streaming algorithm for triangle counting using the birthday paradox

Madhav Jha, Comandur Seshadhri, and Ali Pinar · 2013

Later among the works it cites.

Triangle counting in dynamic graph streams

Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, and Rasmus Pagh · 2014

Later among the works it cites.

Listing triangles

Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, and Uri Zwick · 2014

Later among the works it cites.

A second look at counting triangles in graph streams

Graham Cormode and Hossein Jowhari · 2014

Later among the works it cites.

Number of triangles in a graph based on number of edges

emab (http://math.stackexchange.com/users/74964/emab) · 2014

Later among the works it cites.