|
| Books 1 - 10 of 32 | Previous | Next |
|
 | | The power of triangulation: Applications to problems of visibility and internal distance
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, 22 Pages, Published 1982 by Carnegie-Mellon University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Computing on a free tree via complexity-preserving mappings (Technical report. Princeton University. Dept. of Computer Science)
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, Published 1987 by Princeton University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | An optimal algorithm for intersecting line segments in the plane (Report)
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, 70 Pages, Published 1988 by Dept. of Computer Science, University of Illinois at Urbana-Champaign
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Fractional cascading ([Report]. Digital Equipment Corporation. Systems Research Center)
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, 58 Pages, Published 1986 by Systems Research Center of Digital Equipment Corp
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Intersection of convex objects in two and three dimensions (Technical report. Princeton University. Dept. of Computer Science)
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, 25 Pages, Published 1986 by Princeton University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | How to divide a polygon fairly
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, 23 Pages, Published 1982 by Carnegie-Mellon University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | On a circle placement problem (Technical report / Brown University, Dept. of Computer Science)
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, 27 Pages, Published 1984 by Brown University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Optimal solutions for a class of point retrieval problems (Technical report / Brown University, Dept. of Computer Science)
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, 15 Pages, Published 1984 by Brown University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Some techniques for geometric searching with implicit set representations (Technical report. Princeton University. Dept. of Computer Science)
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, Published 1987 by Princeton University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Lower bounds on the complexity of multidimensional searching (Technical report. Princeton University. Department of Computer Science)
by <<b>bb>><b>Bb>b>bb>> <<b>bb>><b>Chazelleb>b>bb>>
Unknown Binding, 34 Pages, Published 1986 by Princeton University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |
|
| Books 1 - 10 of 32 | Previous | Next |