Derandomization with pseudorandomness
From MaRDI portal
Cites work
- A Chernoff Bound for Random Walks on Expander Graphs
- A graph library for Isabelle
- A Perron-Frobenius theorem for deciding matrix growth
- A search for good pseudo-random number generators: survey and empirical studies
- A sparse Johnson-Lindenstrauss transform using fast hashing
- A verified compiler for probability density functions
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
- Algebraically Closed Fields in Isabelle/HOL
- An Elementary Construction of Constant-Degree Expanders
- An embarrassingly parallel optimal-space cardinality estimation algorithm
- Automated tail bound analysis for probabilistic recurrence relations
- Basic Facts about Expander Graphs
- Chernoff-Hoeffding bounds for Markov chains: generalized and simplified
- Chernoff-type bound for finite Markov chains
- Code generation via higher-order rewrite systems
- Coding the Lehmer pseudo-random number generator
- Distinct elements in streams: an algorithm for the (text) book
- Eigenvalues and expanders
- Expander graphs and their applications
- Expander graphs in pure and applied mathematics
- Explicit constructions of linear-sized superconcentrators
- Filling Crosswords is Very Hard
- Finding frequent items in data streams
- Finite fields
- Finite simple groups as expanders
- Formalization of randomized approximation algorithms for frequency moments
- From types to sets by local type definitions in higher-order logic
- Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
- Handbook of finite fields
- scientific article; zbMATH DE number 3864496 (Why is no real title available?)
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 3756556 (Why is no real title available?)
- scientific article; zbMATH DE number 3764843 (Why is no real title available?)
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 2019620 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 7650109 (Why is no real title available?)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Isabelle. A generic theorem prover
- Isabelle/HOL. A proof assistant for higher-order logic
- Markov chains and Markov decision processes in Isabelle/HOL
- Mersenne twister
- New hash functions and their use in authentication and set equality
- On the exact space complexity of sketching and streaming small norms
- Optimal streaming and tracking distinct elements with high probability
- Optimal streaming and tracking distinct elements with high probability
- Probabilistic Algorithms in Finite Fields
- Probabilistic counting algorithms for data base applications
- Probabilistic functions and cryptographic oracles in higher order logic
- Proofs of randomized algorithms in Coq
- Pseudorandomness
- Ramanujan graphs
- Streaming symmetric norms via measure concentration
- Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, M
- The expected eigenvalue distribution of a large regular graph
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The space complexity of approximating the frequency moments
- Theorem Proving in Higher Order Logics
- Verified analysis of random binary tree structures
- Verified tail bounds for randomized programs
This page was built for publication: Derandomization with pseudorandomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6867739)
