"Lower Bounds for Set Intersection Queries."

Paul F. Dietz et al. (1995)

> Home

Details and statistics

DOI: 10.1007/BF01293666

access: closed

type: Journal Article

metadata version: 2017-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DietzMRU95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DietzMRU95
Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig:
Lower Bounds for Set Intersection Queries. Algorithmica 14(2): 154-168 (1995)

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.