Pseudorandom generators for sliding-window algorithms
From MaRDI portal
Cites work
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- A characterization of constant-time cellular automata computation
- Around probabilistic cellular automata
- Computational Complexity
- Computational Complexity
- Concentration for limited independence via inequalities for the elementary symmetric polynomials
- Derandomization for sliding window algorithms with strict correctness
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension
- Encyclopedia of algorithms. In 3 volumes
- Fast parallel language recognition by cellular automata
- Hitting sets for regular branching programs
- scientific article; zbMATH DE number 1301964 (Why is no real title available?)
- Improved pseudorandom generators for combinatorial rectangles
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata
- Maintaining Stream Statistics over Sliding Windows
- On upper-confidence bound policies for switching bandit problems
- Parallel language recognition in constant time by cellular automata
- Probabilistic automata
- Pseudorandom generators for read-once branching programs, in any order
- Pseudorandom generators for regular branching programs
- Pseudorandom generators for space-bounded computation
- Pseudorandomness
- Pseudorandomness for network algorithms
- Randomized sliding window algorithms for regular languages
- Simple optimal hitting sets for small-success RL
- Sliding window algorithms for regular languages
- Sliding windows over context-free languages
- Stochastic cellular automata: correlations, decidability and simulations
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
- Sublinear-time probabilistic cellular automata
- Tiny families of functions with random properties: A quality-size trade-off for hashing
This page was built for publication: Pseudorandom generators for sliding-window algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6841378)
