The following pages link to Khodakhast Bibak (Q269730):
Displaying 24 items.
- MMH* with arbitrary modulus is always almost-universal (Q269733) (← links)
- Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT (Q314896) (← links)
- Restricted linear congruences (Q331108) (← links)
- On the determinant of bipartite graphs (Q389461) (← links)
- Determinants of grids, tori, cylinders and Möbius ladders (Q392635) (← links)
- (Q534059) (redirect page) (← links)
- Degree-equipartite graphs (Q534061) (← links)
- The number of spanning trees in some classes of graphs (Q691272) (← links)
- Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes (Q1650802) (← links)
- Quantum key distribution using universal hash functions over finite fields (Q2107057) (← links)
- The Modular Subset-Sum Problem and the size of deletion correcting codes (Q2161417) (← links)
- Deletion correcting codes meet the Littlewood-Offord problem (Q2205891) (← links)
- Order-restricted linear congruences (Q2280006) (← links)
- A generalization of Schönemann's theorem via a graph theoretic method (Q2324495) (← links)
- On the Erdős-Gyárfás conjecture in claw-free graphs (Q2509554) (← links)
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security (Q2690521) (← links)
- On a restricted linear congruence (Q2833088) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs (Q2976514) (← links)
- On Fully Split Lacunary Polynomials in Finite Fields (Q3100567) (← links)
- (Q3550099) (← links)
- (Q3551162) (← links)
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes (Q4640336) (← links)
- Restricted Congruences in Computing (Q5073503) (← links)
