"A Lower Bound for the Complexity of the Union-Split-Find Problem."

Kurt Mehlhorn, Stefan Näher, Helmut Alt (1987)

> Home

Details and statistics

DOI: 10.1007/3-540-18088-5_41

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/MehlhornNA87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/MehlhornNA87
Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP 1987: 479-488

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.