"Information Bounds Are Good for Search Problems on Ordered Data Structures"

Nathan Linial, Michael E. Saks (1983)

> Home

Details and statistics

DOI: 10.1109/SFCS.1983.27

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/LinialS83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/LinialS83
Nathan Linial, Michael E. Saks:
Information Bounds Are Good for Search Problems on Ordered Data Structures. FOCS 1983: 473-475

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.