The following pages link to (Q4252298):
Displaying 7 items.
- Provable unlinkability against traffic analysis with low message overhead (Q2516530) (← links)
- Very rapidly mixing Markov chains for \(2\Delta\)-colorings and for independent sets in a graph with maximum degree 4 (Q2712575) (← links)
- Reverse Cycle Walking and Its Applications (Q2958143) (← links)
- Delayed path coupling and generating random permutations (Q4521548) (← links)
- Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs (Q4534221) (← links)
- Coupling vs. conductance for the Jerrum-Sinclair chain (Q4761354) (← links)
- Practically Efficient Secure Single-Commodity Multi-market Auctions (Q5857771) (← links)