The following pages link to Mark N. Wegman (Q1144942):
Displayed 8 items.
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (Q1144943) (← links)
- New hash functions and their use in authentication and set equality (Q1152713) (← links)
- Universal classes of hash functions (Q1259907) (← links)
- A fast and usually linear algorithm for global flow analysis (abstract only) (Q4080719) (← links)
- A Fast and Usually Linear Algorithm for Global Flow Analysis (Q4091443) (← links)
- (Q4133097) (← links)
- (Q4162697) (← links)
- Exact and approximate membership testers (Q5402541) (← links)