On the public citation graph
Locally Decodable Codes
0 signed · 173 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.1006/jcss.1999.1689openalex-snapshot
Protecting Data Privacy in Private Information Retrieval Schemes
inferredcites →https://doi.org/10.1007/11523468_115openalex-snapshot
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
inferredcites →https://doi.org/10.1007/11523468_65openalex-snapshot
Single-Database Private Information Retrieval with Constant Communication Rate
inferredcites →https://doi.org/10.1007/3-540-63165-8_196openalex-snapshot
Upper bound on the communication complexity of private information retrieval
inferredcites →https://doi.org/10.1007/978-3-642-15369-3_57openalex-snapshot
A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field
inferredcites →https://doi.org/10.1007/bf01263424openalex-snapshot
Representing Boolean functions as polynomials modulo composite numbers
inferredcites →https://doi.org/10.1007/bf02579382openalex-snapshot
Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory
inferredcites →https://doi.org/10.1007/pl00001597openalex-snapshot
A lower bound on the mod 6 degree of the OR function
inferredcites →https://doi.org/10.1007/s001450010008openalex-snapshot
Universal Service-Providers for Private Information Retrieval
inferredcites →https://doi.org/10.1007/s00493-003-0025-0openalex-snapshot
Improved Low-Degree Testing and its Applications
inferredcites →https://doi.org/10.1007/s004930070032openalex-snapshot
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs
inferredcites →https://doi.org/10.1007/s004939970007openalex-snapshot
Bounds on Pairs of Families with Restricted Intersections
inferredcites →https://doi.org/10.1016/0020-0190(92)90195-2openalex-snapshot
Highly resilient correctors for polynomials
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.007openalex-snapshot
Exponential lower bound for 2-query locally decodable codes via a quantum argument
inferredcites →https://doi.org/10.1016/j.jcss.2005.03.002openalex-snapshot
General constructions for information-theoretic private information retrieval
inferredcites →https://doi.org/10.1016/s0196-6774(02)00204-3openalex-snapshot
Constructing set systems with prescribed intersection sizes
inferredcites →https://doi.org/10.1017/cbo9781139165464openalex-snapshot
A Computational Introduction to Number Theory and Algebra
inferredcites →https://doi.org/10.1109/18.782097openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometry codes
inferredcites →https://doi.org/10.1109/ccc.2008.7openalex-snapshot
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
inferredcites →https://doi.org/10.1109/ccc.2011.38openalex-snapshot
Noisy Interpolation of Sparse Polynomials, and Applications
inferredcites →https://doi.org/10.1109/tit.2003.813559openalex-snapshot
Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
inferredcites →https://doi.org/10.1109/tit.2007.911222openalex-snapshot
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
inferredcites →https://doi.org/10.1137/05063605xopenalex-snapshot
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1145/1326554.1326555openalex-snapshot
Towards 3-query locally decodable codes of subexponential length
inferredcites →https://doi.org/10.1145/1721654.1721674openalex-snapshot
Private information retrieval
inferredcites →https://doi.org/10.1145/1993636.1993705openalex-snapshot
Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
inferredcites →https://doi.org/10.1587/transinf.e93.d.263openalex-snapshot
Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length
inferredcites →https://doi.org/10.2140/apde.2008.1.375openalex-snapshot
Improved lower bound on the size of Kakeya sets over finite fields
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-1-4939-2864-4_708openalex-snapshot
Locally Decodable Codes
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_12openalex-snapshot
Sublinear Graph Augmentation for Fast Query Implementation
inferred← citeshttps://doi.org/10.1007/978-3-030-65729-1_5openalex-snapshot
Secure MBR Array Codes in the Presence of Special Type Eavesdropper
inferred← citeshttps://doi.org/10.1007/978-3-031-14791-3_3openalex-snapshot
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_26openalex-snapshot
Locally Verifiable Signature and Key Aggregation
inferred← citeshttps://doi.org/10.1007/978-3-031-38545-2_6openalex-snapshot
Succinct Arguments for RAM Programs via Projection Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-91134-7_13openalex-snapshot
Zero-Knowledge RAM: Doubly Efficient and Black-Box
inferred← citeshttps://doi.org/10.1007/978-3-032-08124-7_19openalex-snapshot
A New Code-Based Formulation of the Fuzzy Vault Scheme
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_19openalex-snapshot
Scalable Multi-server Private Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-032-25330-9_3openalex-snapshot
Two-Server Private Information Retrieval in Sublinear Time and Quasilinear Space
inferred← citeshttps://doi.org/10.1007/978-3-319-12280-9_15openalex-snapshot
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
inferred← citeshttps://doi.org/10.1007/978-3-319-17470-9_14openalex-snapshot
Locally Decodable Codes for Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_35openalex-snapshot
Limits on the Rate of Locally Testable Affine-Invariant Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_708-1openalex-snapshot
Locally Decodable Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_21openalex-snapshot
Locally Updatable and Locally Decodable Codes
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_18openalex-snapshot
Locally Decodable and Updatable Non-malleable Codes and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-49099-0_14openalex-snapshot
Information-Theoretic Local Non-malleable Codes and Their Applications
inferred← citeshttps://doi.org/10.1007/978-981-95-5116-3_7openalex-snapshot
List-Decodable Byzantine Robust PIR: Lower Communication Complexity, Higher Byzantine Tolerance, Smaller List Size
inferred← citeshttps://doi.org/10.1007/s00145-018-9306-zopenalex-snapshot
Locally Decodable and Updatable Non-malleable Codes and Their Applications
inferred← citeshttps://doi.org/10.1007/s10623-018-0552-8openalex-snapshot
Lifted projective Reed–Solomon codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01510-xopenalex-snapshot
Algebraic hierarchical locally recoverable codes with nested affine subspace recovery
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.03.005openalex-snapshot
Enumerative coding for line polar Grassmannians with applications to codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.07.005openalex-snapshot
Locally recoverable codes from rational maps
inferred← citeshttps://doi.org/10.1016/j.ffa.2019.06.001openalex-snapshot
Conical Kakeya and Nikodym sets in finite fields
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.008openalex-snapshot
A novel elementary construction of matching vectors
inferred← citeshttps://doi.org/10.1017/fms.2014.1openalex-snapshot
SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY
inferred← citeshttps://doi.org/10.1017/fms.2021.1openalex-snapshot
High-entropy dual functions over finite fields and locally decodable codes
inferred← citeshttps://doi.org/10.1093/imrn/rny238openalex-snapshot
Gaussian Width Bounds with Applications to Arithmetic Progressions in Random Settings
inferred← citeshttps://doi.org/10.1109/5gwf.2018.8517057openalex-snapshot
Adaptive Multiplicity Codes based PIR Protocol for Multi-Cloud Plateform Services
inferred← citeshttps://doi.org/10.1109/allerton.2017.8262862openalex-snapshot
Maximally recoverable codes: The bounded case
inferred← citeshttps://doi.org/10.1109/bmsb.2016.7521914openalex-snapshot
On locality of Generalized Reed-Muller codes over the broadcast erasure channel
inferred← citeshttps://doi.org/10.1109/ccc.2011.38openalex-snapshot
Noisy Interpolation of Sparse Polynomials, and Applications
inferred← citeshttps://doi.org/10.1109/ccc.2012.23openalex-snapshot
Share Conversion and Private Information Retrieval
inferred← citeshttps://doi.org/10.1109/ent-mipt.2018.00018openalex-snapshot
On the Maximal Code Length of Optimal Linear LRC Codes with Availability
inferred← citeshttps://doi.org/10.1109/focs.2019.00067openalex-snapshot
Efficient Construction of Rigid Matrices Using an NP Oracle
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00102openalex-snapshot
Nearly Optimal Pseudorandomness From Hardness
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00077openalex-snapshot
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00020openalex-snapshot
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00039openalex-snapshot
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography
inferred← citeshttps://doi.org/10.1109/iaeac47372.2019.8997905openalex-snapshot
Revisiting the Reed-Muller Locally Correctable Codes
inferred← citeshttps://doi.org/10.1109/icassp49660.2025.10888126openalex-snapshot
Locally Correctable Lattices
inferred← citeshttps://doi.org/10.1109/icme.2015.7177458openalex-snapshot
Unequal error protection for scalable video storage in the cloud
inferred← citeshttps://doi.org/10.1109/infocom52122.2024.10621274openalex-snapshot
Periscoping: Private Key Distribution for Large-Scale Mixnets
inferred← citeshttps://doi.org/10.1109/isit.2014.6875377openalex-snapshot
Correcting on curves and highly sound locally correctable codes of high rate
inferred← citeshttps://doi.org/10.1109/isit.2016.7541611openalex-snapshot
New proofs of retrievability using locally decodable codes
inferred← citeshttps://doi.org/10.1109/isit.2017.8006508openalex-snapshot
Nearly Optimal Constructions of PIR and Batch Codes
inferred← citeshttps://doi.org/10.1109/isit.2017.8006683openalex-snapshot
Bounds and constructions of codes with all-symbol locality and availability
inferred← citeshttps://doi.org/10.1109/isit.2018.8437308openalex-snapshot
Further Progress on the GM-MDS Conjecture for Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/isit.2018.8437738openalex-snapshot
On Distance Properties of $(r, t,x)$-LRC Codes
inferred← citeshttps://doi.org/10.1109/isit.2019.8849322openalex-snapshot
Relaxed Locally Correctable Codes in Computationally Bounded Channels
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518056openalex-snapshot
A locality-based lens for coded computation
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518249openalex-snapshot
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206655openalex-snapshot
Computationally Relaxed Locally Decodable Codes, Revisited
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195436openalex-snapshot
Amortized Locally Decodable Codes
inferred← citeshttps://doi.org/10.1109/istc.2016.7593072openalex-snapshot
Iterative erasure correcting algorithm for q-ary reed-muller codes based on local correctability
inferred← citeshttps://doi.org/10.1109/itw.2017.8277989openalex-snapshot
On one generalization of LRC codes with availability
inferred← citeshttps://doi.org/10.1109/itw44776.2019.8988956openalex-snapshot
On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes
inferred← citeshttps://doi.org/10.1109/itw46852.2021.9457625openalex-snapshot
On Lifted Multiplicity Codes
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611491openalex-snapshot
Local Correctabilities and Dual Codes of Symmetric Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/jproc.2010.2096170openalex-snapshot
A Survey on Network Codes for Distributed Storage
inferred← citeshttps://doi.org/10.1109/jsait.2021.3053579openalex-snapshot
Single-Server Private Information Retrieval Schemes are Equivalent to Locally Recoverable Coding Schemes
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2900039openalex-snapshot
New Locally Correctable Codes Based on Projective Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2020.2981324openalex-snapshot
Symmetric Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2208937openalex-snapshot
On the Locality of Codeword Symbols
inferred← citeshttps://doi.org/10.1109/tit.2013.2257918openalex-snapshot
Upper Bounds on Matching Families in $\BBZ_{pq}^{n}$
inferred← citeshttps://doi.org/10.1109/tit.2014.2332338openalex-snapshot
Explicit Maximally Recoverable Codes With Locality
inferred← citeshttps://doi.org/10.1109/tit.2014.2352638openalex-snapshot
A Coding-Theoretic Application of Baranyai’s Theorem
inferred← citeshttps://doi.org/10.1109/tit.2014.2385080openalex-snapshot
Entanglement-Assisted Zero-Error Source-Channel Coding
inferred← citeshttps://doi.org/10.1109/tit.2015.2466601openalex-snapshot
SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits
inferred← citeshttps://doi.org/10.1109/tit.2016.2518663openalex-snapshot
Bounds on the Parameters of Locally Recoverable Codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2664867openalex-snapshot
Switch Codes: Codes for Fully Parallel Reconstruction
inferred← citeshttps://doi.org/10.1109/tit.2018.2809788openalex-snapshot
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
inferred← citeshttps://doi.org/10.1109/tit.2018.2861747openalex-snapshot
Private Information Retrieval From Transversal Designs
inferred← citeshttps://doi.org/10.1109/tit.2019.2897705openalex-snapshot
New Bounds and Generalizations of Locally Recoverable Codes With Availability
inferred← citeshttps://doi.org/10.1109/tit.2019.2939135openalex-snapshot
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex
inferred← citeshttps://doi.org/10.1109/tit.2019.2946627openalex-snapshot
Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields
inferred← citeshttps://doi.org/10.1109/tit.2020.2990981openalex-snapshot
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities
inferred← citeshttps://doi.org/10.1109/tit.2020.2999909openalex-snapshot
Local Decode and Update for Big Data Compression
inferred← citeshttps://doi.org/10.1109/tit.2020.3004749openalex-snapshot
Reed–Muller Codes: Theory and Algorithms
inferred← citeshttps://doi.org/10.1109/tit.2020.3014973openalex-snapshot
On the Capacity of Locally Decodable Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.3020752openalex-snapshot
Weighted Lifted Codes: Local Correctabilities and Application to Robust Private Information Retrieval
inferred← citeshttps://doi.org/10.1109/tit.2020.3023016openalex-snapshot
The Capacity of Private Information Retrieval From Uncoded Storage Constrained Databases
inferred← citeshttps://doi.org/10.1109/tit.2021.3076396openalex-snapshot
Relaxed Locally Correctable Codes in Computationally Bounded Channels
inferred← citeshttps://doi.org/10.1109/tit.2021.3085363openalex-snapshot
Asymmetric Leaky Private Information Retrieval
inferred← citeshttps://doi.org/10.1109/tit.2021.3116520openalex-snapshot
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3144034openalex-snapshot
Binary Locally Repairable Codes With Large Availability and its Application to Private Information Retrieval
inferred← citeshttps://doi.org/10.1109/tit.2022.3158762openalex-snapshot
On the Generalized Covering Radii of Reed-Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3328434openalex-snapshot
On Extremal Rates of Storage Over Graphs
inferred← citeshttps://doi.org/10.1109/tit.2024.3425808openalex-snapshot
Access-Redundancy Tradeoffs in Quantized Linear Computations
inferred← citeshttps://doi.org/10.1109/tit.2025.3565558openalex-snapshot
A Locality-Based Lens for Coded Computation
inferred← citeshttps://doi.org/10.1109/tit.2026.3717689openalex-snapshot
Compression With Privacy-Preserving Random Access
inferred← citeshttps://doi.org/10.1109/tmm.2017.2751147openalex-snapshot
Unequal Error Protection for Scalable Video Storage in the Cloud
inferred← citeshttps://doi.org/10.1109/vtcfall.2019.8891349openalex-snapshot
On the Secrecy Capacity of Distributed Storage with Locality and Availability
inferred← citeshttps://doi.org/10.1137/130932296openalex-snapshot
New Bounds for Matching Vector Families
inferred← citeshttps://doi.org/10.1137/19m124647xopenalex-snapshot
Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs
inferred← citeshttps://doi.org/10.1137/19m1307834openalex-snapshot
On the Power of Relaxed Local Decoding Algorithms
inferred← citeshttps://doi.org/10.1137/20m1322297openalex-snapshot
Efficient Construction of Rigid Matrices Using an NP Oracle
inferred← citeshttps://doi.org/10.1137/20m135515xopenalex-snapshot
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
inferred← citeshttps://doi.org/10.1137/21m1422781openalex-snapshot
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
inferred← citeshttps://doi.org/10.1137/23m1596910openalex-snapshot
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation
inferred← citeshttps://doi.org/10.1137/24m1687169openalex-snapshot
Relaxed Local Correctability from Local Testing
inferred← citeshttps://doi.org/10.1142/s0129054117500125openalex-snapshot
Identifying Generalized Reed-Muller Codewords by Quantum Queries
inferred← citeshttps://doi.org/10.1145/2213977.2214008openalex-snapshot
From irreducible representations to locally decodable codes
inferred← citeshttps://doi.org/10.1145/2746539.2746546openalex-snapshot
2-Server PIR with Sub-Polynomial Communication
inferred← citeshttps://doi.org/10.1145/3016802openalex-snapshot
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs
inferred← citeshttps://doi.org/10.1145/3350755.3400250openalex-snapshot
Simple Local Computation Algorithms for the General Lovász Local Lemma
inferred← citeshttps://doi.org/10.1145/3488932.3497773openalex-snapshot
Byzantine-Robust Private Information Retrieval with Low Communication and Efficient Decoding
inferred← citeshttps://doi.org/10.1145/3490486.3538334openalex-snapshot
Optimal Multi-Dimensional Mechanisms are not Locally-Implementable
inferred← citeshttps://doi.org/10.1145/3555307openalex-snapshot
Nearly Optimal Pseudorandomness from Hardness
inferred← citeshttps://doi.org/10.1145/3618260.3649611openalex-snapshot
Relaxed Local Correctability from Local Testing
inferred← citeshttps://doi.org/10.1145/3618260.3649640openalex-snapshot
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
inferred← citeshttps://doi.org/10.1145/3688824openalex-snapshot
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
inferred← citeshttps://doi.org/10.1145/3717823.3718132openalex-snapshot
Time and Space Efficient Deterministic Decoders
inferred← citeshttps://doi.org/10.1145/3717823.3718188openalex-snapshot
Tensor Concentration Inequalities: A Geometric Approach
inferred← citeshttps://doi.org/10.1145/3767145.3767151openalex-snapshot
SIGACT News Complexity Theory Column 126 Locally Decodable Codes for Insertions and Deletions
inferred← citeshttps://doi.org/10.1145/3798129.3800850openalex-snapshot
Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes
inferred← citeshttps://doi.org/10.12794/metadc2257455openalex-snapshot
Conditional Disclosure of Secrets and Storage over Graphs
inferred← citeshttps://doi.org/10.1515/jmc-2018-0012openalex-snapshot
Multi-prover proof of retrievability
inferred← citeshttps://doi.org/10.2139/ssrn.6218183openalex-snapshot
Usable String Matching by Humans through Overlaid Presentation: Turning Syntactic Tasks into Perceptual Tasks
inferred← citeshttps://doi.org/10.31799/1684-8853-2021-1-38-44openalex-snapshot
Minimum-storage regenerating codes resistant to special adversary
inferred← citeshttps://doi.org/10.3934/amc.2017041openalex-snapshot
Relative generalized Hamming weights of q-ary Reed-Muller codes
inferred← citeshttps://doi.org/10.3934/era.2012.19.120openalex-snapshot
Locally decodable codes and the failure of cotype for projective tensor products
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2017.43openalex-snapshot
Locality via Partially Lifted Codes
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.44openalex-snapshot
LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation
inferred← citeshttps://doi.org/10.48550/arxiv.1210.5677openalex-snapshot
Local Correction with Constant Error Rate
inferred← citeshttps://doi.org/10.48550/arxiv.1407.6185openalex-snapshot
Relative generalized Hamming weights of q-ary Reed-Muller codes
inferred← citeshttps://doi.org/10.48550/arxiv.1809.09044openalex-snapshot
Fraud and Data Availability Proofs: Maximising Light Client Security and Scaling Blockchains with Dishonest Majorities
inferred← citeshttps://doi.org/10.70675/30e2ea2cz3cc5z4819zb918zf8338041000dopenalex-snapshot
Codes with locality : constructions and applications to cryptographic protocols
inferred← citeshttps://doi.org/10.70675/c4a406f5zf343z4b99za078z059ecd965c6bopenalex-snapshot
Some applications of the geometry of toric surfaces over a finite field for arithmetic and information theory
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.