Robert Wilber
From MaRDI portal
Person:916394
Available identifiers
zbMath Open wilber.robertMaRDI QIDQ916394
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| On the time-space complexity of reachability queries for preprocessed graphs | 1990-01-01 | Paper |
| Lower Bounds for Accessing Binary Search Trees with Rotations | 1989-01-01 | Paper |
| The concave least-weight subsequence problem revisited | 1988-01-01 | Paper |
| White pebbles help | 1988-01-01 | Paper |
| Geometric applications of a matrix-searching algorithm | 1987-01-01 | Paper |
Research outcomes over time
This page was built for person: Robert Wilber
