Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
TRIANGLE AND FOUR CYCLE COUNTING WITH PREDICTIONS IN GRAPH STREAMS
Justin Y. Chen
, Piotr Indyk
, Shyam Narayanan
,
Ronitt Rubinfeld
, Sandeep Silwal
, Honghao Lin
, David P. Woodruff
, Michael Zhang
,
Tal Wagner
, Talya Eden
Massachusetts Institute of Technology
Carnegie Mellon University
Microsoft USA
Boston University
Research output
:
Contribution to conference
›
Paper
›
peer-review
13
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'TRIANGLE AND FOUR CYCLE COUNTING WITH PREDICTIONS IN GRAPH STREAMS'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Oracle
100%
4-cycle
100%
Cycle Counting
100%
Triangle Cycle
100%
Graph Stream
100%
Streaming Algorithms
66%
Machine Learning Techniques
16%
Number of Triangles
16%
PRESENT Algorithm
16%
Graph Structure
16%
Triangle Counting
16%
Arbitrary Order
16%
Classical Algorithm
16%
Noise Model
16%
Adjacency List
16%
Counting Algorithm
16%
Streaming Model
16%
Applied Machine Learning
16%
Algorithm Improvement
16%
Ordered Models
16%
Multi-pass
16%
Graph Analytics
16%
Random-order Streaming
16%
Multiple Graphs
16%
Computer Science
Data Stream
100%
Machine Learning Technique
50%
Fundamental Problem
50%
Space Complexity
50%
Arbitrary Order
50%
Upper Bound Space
50%
Graph Analytics
50%
Applied Machine Learning
50%
Adjacency List Model
50%
Mathematics
Triangle
100%
Edge
75%
Random Order
50%
Upper Bound
25%
Complexity Space
25%
Adjacency
25%