On the public citation graph
Finding hidden cliques in linear time
0 signed · 65 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<457::aid-rsa14>3.0.co;2-wopenalex-snapshot
Finding a large hidden clique in a random graph
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<457::aid-rsa14>3.3.co;2-kopenalex-snapshot
Finding a large hidden clique in a random graph
inferredcites →https://doi.org/10.1002/rsa.3240030402openalex-snapshot
Large Cliques Elude the Metropolis Process
inferredcites →https://doi.org/10.1016/0166-218x(94)00103-kopenalex-snapshot
Expected complexity of graph partitioning problems
inferredcites →https://doi.org/10.1137/090766991openalex-snapshot
How Hard Is It to Approximate the Best Nash Equilibrium?
inferredcites →https://doi.org/10.1137/s009753970240118xopenalex-snapshot
The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2008.1752openalex-snapshot
A new approach to the planted clique problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.21274openalex-snapshot
Almost‐Linear Planted Cliques Elude the Metropolis Process
inferred← citeshttps://doi.org/10.1007/978-3-031-48615-9_11openalex-snapshot
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages
inferred← citeshttps://doi.org/10.1007/s10208-014-9215-yopenalex-snapshot
Finding Hidden Cliques of Size $$\sqrt{N/e}$$ N / e in Nearly Linear Time
inferred← citeshttps://doi.org/10.1007/s10957-015-0777-xopenalex-snapshot
Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation
inferred← citeshttps://doi.org/10.1007/s41109-019-0230-4openalex-snapshot
Toward epidemic thresholds on temporal networks: a review and open questions
inferred← citeshttps://doi.org/10.1007/s43069-020-00020-5openalex-snapshot
Convex Optimization for the Densest Subgraph and Densest Submatrix Problems
inferred← citeshttps://doi.org/10.1016/j.geb.2018.08.001openalex-snapshot
On the hardness of designing public signals
inferred← citeshttps://doi.org/10.1017/9781108616799.014openalex-snapshot
Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits
inferred← citeshttps://doi.org/10.1017/jpr.2018.22openalex-snapshot
Recovering a hidden community beyond the Kesten–Stigum threshold in O (| E |log * | V |) time
inferred← citeshttps://doi.org/10.1017/s096354831300045xopenalex-snapshot
Finding Hidden Cliques in Linear Time with High Probability
inferred← citeshttps://doi.org/10.1017/s0963548317000463openalex-snapshot
A Simple SVD Algorithm for Finding Hidden Partitions
inferred← citeshttps://doi.org/10.1038/s42005-026-02606-7openalex-snapshot
A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
inferred← citeshttps://doi.org/10.1109/focs.2015.91openalex-snapshot
Mixture Selection, Mechanism Design, and Signaling
inferred← citeshttps://doi.org/10.1109/focs.2019.00078openalex-snapshot
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
inferred← citeshttps://doi.org/10.1109/isit.2016.7541628openalex-snapshot
Information limits for recovering a hidden community
inferred← citeshttps://doi.org/10.1109/lra.2022.3155198openalex-snapshot
A Planted Clique Perspective on Hypothesis Pruning
inferred← citeshttps://doi.org/10.1109/tit.2016.2637959openalex-snapshot
On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors
inferred← citeshttps://doi.org/10.1109/tit.2017.2653804openalex-snapshot
Information Limits for Recovering a Hidden Community
inferred← citeshttps://doi.org/10.1137/100791142openalex-snapshot
Relaxation-Based Coarsening and Multiscale Graph Organization
inferred← citeshttps://doi.org/10.1137/19m1249540openalex-snapshot
Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs
inferred← citeshttps://doi.org/10.1145/2488608.2488692openalex-snapshot
Statistical algorithms and a lower bound for detecting planted cliques
inferred← citeshttps://doi.org/10.1145/2940716.2940753openalex-snapshot
Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games
inferred← citeshttps://doi.org/10.1145/3046674openalex-snapshot
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
inferred← citeshttps://doi.org/10.1145/3178538openalex-snapshot
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique
inferred← citeshttps://doi.org/10.1145/3618260.3649751openalex-snapshot
Planted Clique Conjectures Are Equivalent
inferred← citeshttps://doi.org/10.1145/3717823.3718306openalex-snapshot
Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy 𝑘-LIN over Expanders
inferred← citeshttps://doi.org/10.11606/d.45.2022.tde-30012023-194317openalex-snapshot
Uma análise espectral do grafo com clique plantada
inferred← citeshttps://doi.org/10.1214/13-aos1127openalex-snapshot
Optimal detection of sparse principal components in high dimension
inferred← citeshttps://doi.org/10.1214/14-aap1080openalex-snapshot
Community detection in sparse random networks
inferred← citeshttps://doi.org/10.1214/14-aos1208openalex-snapshot
Community detection in dense random networks
inferred← citeshttps://doi.org/10.1214/14-aos1300openalex-snapshot
Computational barriers in minimax submatrix detection
inferred← citeshttps://doi.org/10.1214/15-aos1310openalex-snapshot
Do semidefinite relaxations solve sparse PCA up to the information limit?
inferred← citeshttps://doi.org/10.1214/15-aos1369openalex-snapshot
Statistical and computational trade-offs in estimation of sparse principal components
inferred← citeshttps://doi.org/10.1214/21-aos2123openalex-snapshot
Tensor clustering with planted structures: Statistical optimality and computational limits
inferred← citeshttps://doi.org/10.1214/23-aap2003openalex-snapshot
The landscape of the planted clique problem: Dense subgraphs and the overlap gap property
inferred← citeshttps://doi.org/10.1214/24-aos2412openalex-snapshot
Tensor factor model estimation by iterative projection
inferred← citeshttps://doi.org/10.1214/25-aos2582openalex-snapshot
Analysis of singular subspaces under random perturbations
inferred← citeshttps://doi.org/10.1515/spma-2017-0013openalex-snapshot
A simple spectral algorithm for recovering planted partitions
inferred← citeshttps://doi.org/10.30757/alea.v17-30openalex-snapshot
Finding a planted clique by adaptive probing
inferred← citeshttps://doi.org/10.3390/math14132350openalex-snapshot
The Missing Signal: Gradient Injection Recovers O(n2) Residual Decoding in GNNs
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.34openalex-snapshot
The Cover Number of a Matrix and its Algorithmic Applications
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2021.34openalex-snapshot
Is the Space Complexity of Planted Clique Recovery the Same as That of Detection?
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2023.94openalex-snapshot
Community Detection in Random Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1201.1214openalex-snapshot
Statistical Algorithms and a Lower Bound for Detecting Planted Clique
inferred← citeshttps://doi.org/10.48550/arxiv.1304.7047openalex-snapshot
Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.1402.4194openalex-snapshot
On the Hardness of Signaling
inferred← citeshttps://doi.org/10.48550/arxiv.1406.6625openalex-snapshot
Computational Lower Bounds for Community Detection on Random Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1509.07859openalex-snapshot
Information Limits for Recovering a Hidden Community
inferred← citeshttps://doi.org/10.48550/arxiv.1510.02786openalex-snapshot
Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in $O(|E| \log^*|V|)$ Time
inferred← citeshttps://doi.org/10.48550/arxiv.1805.01209openalex-snapshot
Found Graph Data and Planted Vertex Covers
inferred← citeshttps://doi.org/10.48550/arxiv.1902.06916openalex-snapshot
Universality of Computational Lower Bounds for Submatrix Detection
inferred← citeshttps://doi.org/10.48550/arxiv.1902.07380openalex-snapshot
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness
inferred← citeshttps://doi.org/10.48550/arxiv.1908.06130openalex-snapshot
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12002openalex-snapshot
Finding Planted Cliques in Sublinear Time
inferred← citeshttps://doi.org/10.48550/arxiv.2103.06649openalex-snapshot
Hiding solutions in model RB: Forced instances are almost as hard as unforced ones
inferred← citeshttps://doi.org/10.48550/arxiv.2107.11886openalex-snapshot
Logspace Reducibility From Secret Leakage Planted Clique
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.