"Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Haripriyan Hampapuram, Michael L. Fredman (1993)

> Home

Details and statistics

DOI: 10.1109/SFCS.1993.366839

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/HampapuramF93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/HampapuramF93
Haripriyan Hampapuram, Michael L. Fredman:
Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums. FOCS 1993: 480-485

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.