"Three-wise independent random walks can be slightly unbounded."

Shyam Narayanan (2022)

> Home

Details and statistics

DOI: 10.1002/RSA.21075

access: closed

type: Journal Article

metadata version: 2022-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/Narayanan22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/Narayanan22
Shyam Narayanan:
Three-wise independent random walks can be slightly unbounded. Random Struct. Algorithms 61(3): 573-598 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.