On the public citation graph
Proceedings of the forty-fourth annual ACM symposium on Theory of computing
0 signed · 50 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70040openalex-snapshot
Dynamic Algorithms for Approximate Steiner Trees
inferred← citeshttps://doi.org/10.1002/rsa.21279openalex-snapshot
Detection of Dense Subhypergraphs by Low‐Degree Polynomials
inferred← citeshttps://doi.org/10.1007/978-981-97-9286-3_2openalex-snapshot
Multidimensional Mechanism Design via AI-Driven Approaches
inferred← citeshttps://doi.org/10.1007/s11425-024-2384-xopenalex-snapshot
Random Turán and counting results for general position sets over finite fields
inferred← citeshttps://doi.org/10.1016/j.acha.2015.05.002openalex-snapshot
Sparse high-dimensional FFT based on rank-1 lattice sampling
inferred← citeshttps://doi.org/10.1016/j.acha.2024.101686openalex-snapshot
Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time
inferred← citeshttps://doi.org/10.1016/j.automatica.2017.04.018openalex-snapshot
A complete greedy algorithm for infinite-horizon sensor scheduling
inferred← citeshttps://doi.org/10.1016/j.cnsns.2023.107140openalex-snapshot
Segregation patterns for non-homogeneous locations in Schellings model
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101879openalex-snapshot
On interval decomposability of 2D persistence modules
inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110735openalex-snapshot
The impact of message losses and retransmissions on quantum cryptographic protocols
inferred← citeshttps://doi.org/10.1016/j.conengprac.2020.104350openalex-snapshot
Implementing homomorphic encryption based secure feedback control
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.005openalex-snapshot
A new model and algorithms in firefighting theory
inferred← citeshttps://doi.org/10.1016/j.geb.2018.03.003openalex-snapshot
Welfare maximization with production costs: A primal dual approach
inferred← citeshttps://doi.org/10.1016/j.heliyon.2024.e34458openalex-snapshot
Secure multiparty computation protocol based on homomorphic encryption and its application in blockchain
inferred← citeshttps://doi.org/10.1016/j.ifacol.2023.10.1217openalex-snapshot
Efficient Least-Squares State Estimation Using Uniform Sampling
inferred← citeshttps://doi.org/10.1016/j.ins.2015.07.021openalex-snapshot
The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.08.004openalex-snapshot
VNP = VP in the multilinear world
inferred← citeshttps://doi.org/10.1016/j.is.2024.102379openalex-snapshot
The rise of nonnegative matrix factorization: Algorithms and applications
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.08.003openalex-snapshot
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents
inferred← citeshttps://doi.org/10.1016/j.jksuci.2023.101794openalex-snapshot
Multi-key homomorphic encryption with tightened RGSW ciphertexts without relinearization for ciphertexts product
inferred← citeshttps://doi.org/10.1016/j.laa.2015.07.020openalex-snapshot
Generic properties and a criterion of an operator norm
inferred← citeshttps://doi.org/10.1016/j.laa.2016.12.023openalex-snapshot
On the linear extension complexity of regular n-gons
inferred← citeshttps://doi.org/10.1016/j.orl.2015.11.012openalex-snapshot
Rational and real positive semidefinite rank can be different
inferred← citeshttps://doi.org/10.1016/j.orl.2020.07.013openalex-snapshot
Polynomial size IP formulations of knapsack may require exponentially large coefficients
inferred← citeshttps://doi.org/10.1016/j.orl.2023.11.007openalex-snapshot
Towards optimal running times for optimal transport
inferred← citeshttps://doi.org/10.1016/j.orl.2025.107257openalex-snapshot
Single sample prophet inequality for uniform matroids of rank 2
inferred← citeshttps://doi.org/10.1016/j.patter.2022.100487openalex-snapshot
Privacy-preserving federated neural network learning for disease-associated cell classification
inferred← citeshttps://doi.org/10.1016/j.physa.2016.09.038openalex-snapshot
A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes
inferred← citeshttps://doi.org/10.1016/j.shpsa.2022.05.007openalex-snapshot
Operational theories as structural realism
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.001openalex-snapshot
A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle
inferred← citeshttps://doi.org/10.1080/03081087.2024.2391807openalex-snapshot
Correction of ‘ J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588 ’
inferred← citeshttps://doi.org/10.1080/23311916.2017.1295783openalex-snapshot
Privacy preserving, verifiable and efficient outsourcing algorithm for matrix multiplication to a malicious cloud server
inferred← citeshttps://doi.org/10.1093/comjnl/bxac126openalex-snapshot
Threshold Homomorphic Encryption From Provably Secure NTRU
inferred← citeshttps://doi.org/10.1103/physrevresearch.4.013159openalex-snapshot
Ab initio experimental violation of Bell inequalities
inferred← citeshttps://doi.org/10.1103/physrevx.6.011020openalex-snapshot
Source-Independent Quantum Random Number Generation
inferred← citeshttps://doi.org/10.1109/asianhost63913.2024.10838482openalex-snapshot
Exact Template Attacks with Spectral Computation
inferred← citeshttps://doi.org/10.1145/3357713.3384248openalex-snapshot
Automating cutting planes is NP-hard
inferred← citeshttps://doi.org/10.1145/3357713.3384268openalex-snapshot
Faster parallel algorithm for approximate shortest path
inferred← citeshttps://doi.org/10.1145/3406325.3451086openalex-snapshot
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
inferred← citeshttps://doi.org/10.1145/3428336openalex-snapshot
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
inferred← citeshttps://doi.org/10.1145/3700792openalex-snapshot
A Survey on Securing Image-Centric Edge Intelligence
inferred← citeshttps://doi.org/10.1145/3723351openalex-snapshot
Threshold Policies with Tight Guarantees for Online Selection with Convex Costs
inferred← citeshttps://doi.org/10.1145/3736252.3742493openalex-snapshot
Clock Auctions: Allocation-Based Characterization, Computational Complexity, and Economic Efficiency
inferred← citeshttps://doi.org/10.1186/s12920-017-0276-zopenalex-snapshot
Private queries on encrypted genomic data
inferred← citeshttps://doi.org/10.1186/s13059-016-0903-6openalex-snapshot
Multiple testing correction in linear mixed models
inferred← citeshttps://doi.org/10.1257/jel.20221319openalex-snapshot
Agent-Based Modeling in Economics and Finance: Past, Present, and Future
inferred← citeshttps://doi.org/10.22364/bjmc.2016.4.4.10openalex-snapshot
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
inferred← citeshttps://doi.org/10.3389/fams.2016.00001openalex-snapshot
Efficient Spectral Estimation by MUSIC and ESPRIT with Application to Sparse FFT
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.