• Triangle Counting and Vertex Similarity
  Canadian Mathematical Society, December 2011, Toronto
  Invited Speaker, abstract
  
  Open publication

• High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
  15th International Conference on Random Structures and Algorithms RSA 2011 , Atlanta
  
  Open publication

• Counting Triangles in Real-World Networks
  SIAM Conference on Computational Science and Engineering (CSE11), Reno
  Invited Speaker
  Links for the 1st and the 2nd symposium related to Spectral Graph Theory
  
  Open publication

• Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Analysis (pptx)
  SODA 2011, San Francisco
  
  Open publication

• Approximate Dynamic Programming and Denoising aCGH data (pptx)
  Machine Learning Seminar 2011, CMU
  

• Efficient Triangle Counting via Degree-based Partitioning (pptx)
  Machine Learning Seminar 2011, CMU
  

• Approximate Dynamic Programming and Denoising aCGH data (pptx)
  ACO Seminar 2011, CMU
  

• Efficient Triangle Counting via Degree-based Partitioning (pptx)
  ACO Seminar 2011, CMU
  

• Efficient Triangle Counting via Degree-based Partitioning (pptx,ppt)
  WAW 2010, Stanford University
  

• The Determinant of Random Bernoulli Matrices (Notes)
  Nov. 2010, Discrete Math 21-701 CMU
  

• Approximate Dynamic Programming (pdf)
  CMU
  

• Unmixing of Tumor States in aCGH data (ppt)
  CMU
  

• Data Mining with MapReduce: Graph and Tensor Algorithms with Applications
  Master Thesis, CMU
  
  Open publication

• MACH: Fast Randomized Tensor Decompositions ( ppt )
  SDM 2010, Columbus OH
  
  Open publication

• Algorithms for Denoising aCGH Data ( ppt )
  MLD Speaking Skills, Pittsburgh
  

• Welcome Talk (MLD Open House) ( ppt )
  MLD Open House, Pittsburgh
  
  Open publication

• Spectral Counting of Triangles in Power-Law Networks via Element-Wise Sparsification
  ASONAM 2009, Athens
  

• DOULION: Counting Triangles in Massive Graphs with a Coin
  KDD 2009, Paris
  
  Presentation
  

• Approximate Triangle Counting
  Poster Presentation, Machine Learning Summer School 2009, Chicago
  

• Spectral Graph Theory (Basics)
  CMU and KDD 2009, Paris
  
  Open publication

• On Polygonal Numbers and Fermat's Conjecture
  Additive Number Theory, CMU
  

• Graph Mining (link)
  Guest Lecture 15-826 Multimedia Databases and Data Mining (CMU)
  
  Open publication

• Fast Counting of Triangles in Large Real Networks without counting: Algorithms and Laws (pps)
  In International Conference Data Mining (ICDM 2008)
  

• Fast Counting of triangles in large networks: Algorithms and laws (ppt)
  Invited Talk at the Theory Seminar of Rensselaer Polytechnic Institute
  Host: Petros Drineas
  

• Two heads better than one: pattern discovery in time-evolving multi-aspect data (ppt)
  In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2008)