On the public citation graph
Proceedings of the twentieth annual ACM symposium on Theory of computing
0 signed · 28 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.1007/978-3-319-04126-1_9openalex-snapshot
Choosing and Working of an Anonymous Leader
inferred← citeshttps://doi.org/10.1007/978-3-642-24209-0_23openalex-snapshot
Scalar Product-Based Distributed Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_33openalex-snapshot
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
inferred← citeshttps://doi.org/10.1016/b978-0-443-34717-7.00017-9openalex-snapshot
The third wave of technological advancements in blockchain: Exploring the application of zero-knowledge proofs technology
inferred← citeshttps://doi.org/10.1016/j.comcom.2017.12.004openalex-snapshot
The show must go on: Fundamental data plane connectivity services for dependable SDNs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2018.08.002openalex-snapshot
Scheduling in distributed systems: A cloud computing perspective
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.023openalex-snapshot
Fast approximation for computing the fractional arboricity and extraction of communities of a graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.09.002openalex-snapshot
Line segment covering of cells in arrangements
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.12.001openalex-snapshot
On the realisability of double-cross matrices by polylines in the plane
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.12.001openalex-snapshot
On the parameterized complexity of clustering problems for incomplete data
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.004openalex-snapshot
An O(logn) query time algorithm for reducing ϵ-NN to (c,r)-NN
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.12.015openalex-snapshot
Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
inferred← citeshttps://doi.org/10.1016/j.xgen.2025.100769openalex-snapshot
Secure and federated quantitative trait loci mapping with privateQTL
inferred← citeshttps://doi.org/10.1103/physreva.100.012302openalex-snapshot
One-out-of- m spacetime-constrained oblivious transfer
inferred← citeshttps://doi.org/10.1103/physreva.101.032332openalex-snapshot
Verifiable hybrid secret sharing with few qubits
inferred← citeshttps://doi.org/10.1103/physreva.102.022405openalex-snapshot
Secure multiparty quantum computation with few qubits
inferred← citeshttps://doi.org/10.1103/physreva.98.032327openalex-snapshot
Practical and unconditionally secure spacetime-constrained oblivious transfer
inferred← citeshttps://doi.org/10.1103/physrevlett.113.100401openalex-snapshot
When Are Popescu-Rohrlich Boxes and Random Access Codes Equivalent?
inferred← citeshttps://doi.org/10.1103/physrevlett.117.140506openalex-snapshot
24-Hour Relativistic Bit Commitment
inferred← citeshttps://doi.org/10.1103/revmodphys.92.025002openalex-snapshot
Secure quantum key distribution with realistic devices
inferred← citeshttps://doi.org/10.1117/12.3014000openalex-snapshot
Security games with malicious adversaries in the clouds: status update
inferred← citeshttps://doi.org/10.1126/science.aab3326openalex-snapshot
Simple universal models capture all classical spin physics
inferred← citeshttps://doi.org/10.1145/3476446.3536173openalex-snapshot
Sparse Polynomial Interpolation and Division in Soft-linear Time
inferred← citeshttps://doi.org/10.1145/354876.354877openalex-snapshot
Xor-trees for efficient anonymous multicast and reception
inferred← citeshttps://doi.org/10.3390/cryptography6020018openalex-snapshot
A Review of Blockchain in Fintech: Taxonomy, Challenges, and Future Directions
inferred← citeshttps://doi.org/10.56553/popets-2024-0026openalex-snapshot
SocIoTy: Practical Cryptography in Smart Home Contexts
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.