Pages that link to "Item:Q1208411"
From MaRDI portal
The following pages link to The computational complexity of universal hashing (Q1208411):
Displayed 8 items.
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← links)
- Pseudorandom generators for space-bounded computation (Q1204523) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Authenticating ad hoc networks by comparison of short digests (Q2482445) (← links)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
- : Increasing the Security and Efficiency of (Q5458602) (← links)
- Trade-offs between communication throughput and parallel time (Q5906374) (← links)