Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

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

> Home

Details and statistics

DOI: 10.1137/0217070

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/MehlhornNA88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/MehlhornNA88
Kurt Mehlhorn, Stefan Näher, Helmut Alt:
A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. 17(6): 1093-1102 (1988)

a service of

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.