| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 1 |       | Norbert Blum, Henning Rochow: A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. Inf. Process. Lett. 51(2): 57-60 (1994) |
Selection of 1 from 1 records - Henning Rochow has 1 coauthors
Last update 2012-02-15 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page