Local access to huge random objects through partial sampling
© Amartya Shankha Biswas, Ronitt Rubinfeld, and Anak Yodpinyanee. Consider an algorithm performing a computation on a huge random object (for example a random graph or a "long" random walk). Is it necessary to generate the entire object prior to the computation, or is it possible to provid...
Main Authors: | Yodpinyanee, Anak (Author), Rubinfeld, Ronitt (Author), Biswas, Amartya Shankha (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2021-11-09T18:52:43Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
by: Aliakbarpour, Maryam, et al.
Published: (2018) -
Local-access generators for basic random graph models
by: Biswas, Amartya Shankha
Published: (2018) -
Local Computation Algorithms for Graphs of Non-constant Degrees
by: Levi, Reut, et al.
Published: (2021) -
Local Computation Algorithms for Graphs of Non-constant Degrees
by: Levi, Reut, et al.
Published: (2022) -
On the Implementation of Huge Random Objects
by: Goldreich, Oded, et al.
Published: (2011)