RECYCLING RANDOM BITS IN PARALLEL
From MaRDI portal
Publication:4820146
DOI10.1080/10637199608915545zbMATH Open1049.68896OpenAlexW2143158843MaRDI QIDQ4820146FDOQ4820146
Authors: Katalin Friedl, Shi-Chun Tsai 
Publication date: 6 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199608915545
Cites Work
- Eigenvalues and expanders
- Title not available (Why is that?)
- Probabilistic algorithm for testing primality
- Title not available (Why is that?)
- Non-deterministic exponential time has two-prover interactive protocols
- Explicit constructions of linear-sized superconcentrators
- Title not available (Why is that?)
This page was built for publication: RECYCLING RANDOM BITS IN PARALLEL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820146)
