A new hierarchical splitting scheme recovers random 3-uniform hypergraphs with O(m log n) queries and O(m^{5/3} log n) decoding time for θ > 2/3.
SIAM review , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The paper examines denial-of-service risks to multi-round transaction simulation arising from inter-transaction dependencies in smart-contract state.
citing papers explorer
-
A Fast Hierarchical Splitting Approach for Non-Adaptive Learning of Random Hypergraphs
A new hierarchical splitting scheme recovers random 3-uniform hypergraphs with O(m log n) queries and O(m^{5/3} log n) decoding time for θ > 2/3.
-
Position Paper: Denial-of-Service against Multi-Round Transaction Simulation
The paper examines denial-of-service risks to multi-round transaction simulation arising from inter-transaction dependencies in smart-contract state.