Pages that link to "Item:Q1259907"

The following pages link to Universal classes of hash functions (Q1259907):

Displaying 50 items.

• A probabilistic distributed algorithm for set intersection and its analysis (Q1088406) (← links)
• NP is as easy as detecting unique solutions (Q1090454) (← links)
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
• The generation of random permutations on the fly (Q1111400) (← links)
• Graph isomorphism is in the low hierarchy (Q1116696) (← links)
• On the power of two-point based sampling (Q1120201) (← links)
• A note on universal classes of hash functions (Q1136228) (← links)
• New hash functions and their use in authentication and set equality (Q1152713) (← links)
• On the theory of average case complexity (Q1190984) (← links)
• Pseudorandom generators for space-bounded computation (Q1204523) (← links)
• The computational complexity of universal hashing (Q1208411) (← links)
• Clocked adversaries for hashing (Q1209734) (← links)
• On hiding information from an oracle (Q1263281) (← links)
• Sorting in linear time? (Q1273863) (← links)
• Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
• \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) (Q1288206) (← links)
• Reliable communication over partially authenticated networks (Q1292432) (← links)
• Finding extremal sets in less than quadratic time (Q1313720) (← links)
• Randomness in interactive proofs (Q1321030) (← links)
• Provably good pattern generators for a random pattern test (Q1322559) (← links)
• \(\text{RL}\subseteq \text{SC}\) (Q1327590) (← links)
• Combinatorial techniques for universal hashing (Q1329163) (← links)
• Algorithms for parallel memory, I: Two-level memories (Q1333432) (← links)
• Locality-preserving hash functions for general purpose parallel computation (Q1333434) (← links)
• Universal hashing and authentication codes (Q1335421) (← links)
• Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
• A theory for memory-based learning (Q1342731) (← links)
• A fast randomized LOGSPACE algorithm for graph connectivity (Q1349893) (← links)
• Linking information reconciliation and privacy amplification (Q1363071) (← links)
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures (Q1364901) (← links)
• Exploiting storage redundancy to speed up randomized shared memory simulations (Q1365933) (← links)
• Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
• Perfect hashing (Q1391123) (← links)
• Approximation algorithms for multiple sequence alignment (Q1391132) (← links)
• Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
• The effect of side-information on smooth entropy. (Q1421491) (← links)
• Non-cryptographic primitive for pseudorandom permutation. (Q1426446) (← links)
• Min-wise independent permutations (Q1577016) (← links)
• Protocols for asymmetric communication channels (Q1604209) (← links)
• Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
• Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
• Evaluating Bernstein-Rabin-Winograd polynomials (Q1727367) (← links)
• On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers (Q1749791) (← links)
• The optimal size of a signature (Q1804953) (← links)
• Proving properties of interactive proofs by a generalized counting technique (Q1825663) (← links)
• Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
• Mathematical problems in cryptology (Q1910812) (← links)
• Simulating BPP using a general weak random source (Q1923854) (← links)
• Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)