"Improved bounds for the randomized decision tree Complexity of recursive ..."

Frédéric Magniez et al. (2016)

> Home

Details and statistics

DOI: 10.1002/RSA.20598

access: closed

type: Journal Article

metadata version: 2023-09-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/MagniezNSSTX16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/MagniezNSSTX16
Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao:
Improved bounds for the randomized decision tree Complexity of recursive majority. Random Struct. Algorithms 48(3): 612-638 (2016)

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.