UB Paderborn / Katalog / Suche / in CDI

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

Proceedings of the National Academy of Sciences - PNAS, 2020-03, Vol.117 (11), p.5631-5637

2020

Volltextzugriff (PDF)

Link prediction using low-dimensional node embeddings: The measurement problem

Proceedings of the National Academy of Sciences - PNAS, 2024-02, Vol.121 (8), p.e2312527121-e2312527121

2024

Volltextzugriff (PDF)

Community structure and scale-free collections of Erdős-Rényi graphs

Physical review. E, Statistical, nonlinear, and soft matter physics, 2012-05, Vol.85 (5 Pt 2), p.056109-056109, Article 056109

2012

Volltextzugriff (PDF)

Correction to: Avoiding the Global Sort: A Faster Contour Tree Algorithm

Discrete & computational geometry, 2023, Vol.69 (1), p.1-3

2023

Volltextzugriff (PDF)

A Scalable Generative Graph Model with Community Structure

SIAM journal on scientific computing, 2014-01, Vol.36 (5), p.C424-C452

2014

Volltextzugriff (PDF)

Estimating the Longest Increasing Sequence in Polylogarithmic Time

SIAM journal on computing, 2017-01, Vol.46 (2), p.774-823

2017

Volltextzugriff (PDF)

Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter

SIAM journal on computing, 2012-01, Vol.41 (5), p.1285-1298

2012

Volltextzugriff (PDF)

From Sylvester-Gallai Configurations to Rank Bounds: Improved Blackbox Identity Test for Depth-3 Circuits

Journal of the ACM, 2013-10, Vol.60 (5), p.1-33

2013

Volltextzugriff (PDF)

Avoiding the Global Sort: A Faster Contour Tree Algorithm

Discrete & computational geometry, 2017-12, Vol.58 (4), p.946-985

2017

Volltextzugriff (PDF)

An In-Depth Analysis of Stochastic Kronecker Graphs

Journal of the ACM, 2013-04, Vol.60 (2), p.1-32

2013

Volltextzugriff (PDF)

Is Submodularity Testable?

Algorithmica, 2014-05, Vol.69 (1), p.1-25

2014

Volltextzugriff (PDF)

Wedge sampling for computing clustering coefficients and triangle counts on large graphs

Statistical analysis and data mining, 2014-08, Vol.7 (4), p.294-307

2014

Volltextzugriff (PDF)

Random walks and forbidden minors III: \text\left(d\varepsilon ^\right)-time partition oracles for minor-free graph classes

2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, p.257-268

2022

Volltextzugriff (PDF)

Finding cycles and trees in sublinear time

Random structures & algorithms, 2014-09, Vol.45 (2), p.139-184

2014

Volltextzugriff (PDF)

LOCAL MONOTONICITY RECONSTRUCTION

SIAM journal on computing, 2010-01, Vol.39 (7-8), p.2897-2926

2010

Volltextzugriff (PDF)

AN ALMOST OPTIMAL RANK BOUND FOR DEPTH-3 IDENTITIES

SIAM journal on computing, 2011, Vol.40 (1), p.200-224

2011

Volltextzugriff (PDF)

Online Geometric Reconstruction

Journal of the ACM, 2011-07, Vol.58 (4), p.1-32

2011

Volltextzugriff (PDF)

AN EXPANSION TESTER FOR BOUNDED DEGREE GRAPHS

SIAM journal on computing, 2011-01, Vol.40 (3), p.709-720

2011

Volltextzugriff (PDF)

Noise Tolerance of Expanders and Sublinear Expansion Reconstruction

SIAM journal on computing, 2013-01, Vol.42 (1), p.305-323

2013

Volltextzugriff (PDF)

Counting triangles in real-world graph streams: Dealing with repeated edges and time windows

2015 49th Asilomar Conference on Signals, Systems and Computers, 2015, p.1507-1514

2015

Volltextzugriff (PDF)

Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls

SIAM journal on computing, 2014-01, Vol.43 (2), p.617-653

2014

Volltextzugriff (PDF)

An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube

SIAM journal on computing, 2016-01, Vol.45 (2), p.461-472

2016

Volltextzugriff (PDF)

SELF-IMPROVING ALGORITHMS

SIAM journal on computing, 2011-01, Vol.40 (2), p.350-375

2011

Volltextzugriff (PDF)

Influence and dynamic behavior in random boolean networks

Physical review letters, 2011-09, Vol.107 (10), p.108701-108701, Article 108701

2011

Volltextzugriff (PDF)

ESCAPE: Efficiently Counting All 5-Vertex Subgraphs

Proceedings of the 26th International Conference on World Wide Web, 2017, p.1431-1440

2017

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

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

Link prediction using low-dimensional node embeddings: The measurement problem

Community structure and scale-free collections of Erdős-Rényi graphs

Correction to: Avoiding the Global Sort: A Faster Contour Tree Algorithm

A Scalable Generative Graph Model with Community Structure

Estimating the Longest Increasing Sequence in Polylogarithmic Time

Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter

From Sylvester-Gallai Configurations to Rank Bounds: Improved Blackbox Identity Test for Depth-3 Circuits

Avoiding the Global Sort: A Faster Contour Tree Algorithm

An In-Depth Analysis of Stochastic Kronecker Graphs

Is Submodularity Testable?

Wedge sampling for computing clustering coefficients and triangle counts on large graphs

Random walks and forbidden minors III: \text\left(d\varepsilon ^\right)-time partition oracles for minor-free graph classes

Finding cycles and trees in sublinear time

LOCAL MONOTONICITY RECONSTRUCTION

AN ALMOST OPTIMAL RANK BOUND FOR DEPTH-3 IDENTITIES

Online Geometric Reconstruction

AN EXPANSION TESTER FOR BOUNDED DEGREE GRAPHS

Noise Tolerance of Expanders and Sublinear Expansion Reconstruction

Counting triangles in real-world graph streams: Dealing with repeated edges and time windows

Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls

An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube

SELF-IMPROVING ALGORITHMS

Influence and dynamic behavior in random boolean networks

ESCAPE: Efficiently Counting All 5-Vertex Subgraphs

Suchergebnisse filtern