Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The impossibility of low-rank representations for triangle-rich complex networks

C. Seshadhri, A. Sharma, A. Stolman, and A. Goel. (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrew Huvos

Andrew Lee

Andrew Cato

Andrew Singer

Andrew Torda

Other publications of authors with the same name

Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling.A. Stolman, C. Levy, C. Seshadhri, and A. Sharma. SDM, page 388-396. SIAM, (2022)Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs.A. Kumar, C. Seshadhri, and A. Stolman. STOC, page 559-567. ACM, (2019)Fiding forbidden minors in sublinear time: a O(n1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs.A. Kumar, C. Seshadhri, and A. Stolman. CoRR, (2018)The impossibility of low-rank representations for triangle-rich complex networksC. Seshadhri, A. Sharma, A. Stolman, and A. Goel. (2019)Random walks and forbidden minors III: $polyłeft(d^-1\right)$-time partition oracles for minor-free graph classes.A. Kumar, C. Seshadhri, and A. Stolman. FOCS, page 257-268. IEEE, (2021)The impossibility of low rank representations for triangle-rich complex networks.C. Seshadhri, A. Sharma, A. Stolman, and A. Goel. CoRR, (2020)HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs.A. Stolman, and K. Matulef. ASONAM, page 31-39. ACM, (2017)Big Data & Spectral Graph Theory.A. Stolman. University of California, Santa Cruz, USA, (2021)Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs.A. Kumar, C. Seshadhri, and A. Stolman. FOCS, page 509-520. IEEE Computer Society, (2018)HiTA: A RAG-Based Educational Platform that Centers Educators in the Instructional Loop.C. Liu, L. Hoang, A. Stolman, and B. Wu. AIED (2), volume 14830 of Lecture Notes in Computer Science, page 405-412. Springer, (2024)

BibSonomy

Disambiguation of "Stolman, Andrew"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The impossibility of low-rank representations for triangle-rich complex networks

Please choose a person to relate this publication to

Andrew Huvos

Andrew Lee

Andrew Cato

Andrew Singer

Andrew Torda

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Stolman, Andrew"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML The impossibility of low-rank representations for triangle-rich complex networks

Please choose a person to relate this publication to

Andrew Huvos

Andrew Lee

Andrew Cato

Andrew Singer

Andrew Torda

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The impossibility of low-rank representations for triangle-rich complex networks