The following pages link to Tom Verhoeff (Q1111527):
Displaying 16 items.
- Delay-insensitive codes - an overview (Q1111528) (← links)
- (Q1603530) (redirect page) (← links)
- On computing a longest path in a tree (Q1603531) (← links)
- The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations (Q2364644) (← links)
- (Q2735845) (← links)
- (Q2889468) (← links)
- Halting Still Standing – Programs versus Specifications (Q3055749) (← links)
- (Q3343912) (← links)
- An updated table of minimum-distance bounds for binary linear codes (Q3773824) (← links)
- (Q4028338) (← links)
- An updated table of minimum-distance bounds for binary linear codes (Q4202096) (← links)
- (Q4249007) (← links)
- (Q4289325) (← links)
- (Q4602289) (← links)
- Some new binary, quasi-cyclic codes (Q4701176) (← links)
- (Q4998451) (← links)
