Bruno Becker

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

◀ ▶ joint publications with Stephan Gschwind

> Home > Persons > Bruno Becker

Publications

1996
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/jal/BeckerFGLOW96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/BeckerFGLOW96
Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer:
Enclosing a Set of Objects by Two Minimum Area Rectangles. J. Algorithms 21(3): 520-541 (1996)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/vldb/BeckerGOSW96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/vldb/BeckerGOSW96
Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer:
An Asymptotically Optimal Multiversion B-Tree. VLDB J. 5(4): 264-275 (1996)
1993
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/ssd/BeckerGOSW93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ssd/BeckerGOSW93
Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer:
On Optimal Multiversion Access Structures. SSD 1993: 123-141
1992
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/BeckerFGOTW92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/BeckerFGOTW92
Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer:
Enclosing Many Boxes by an Optimal Pair of Boxes. STACS 1992: 475-486
1991
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/cga/BeckerFGOTW91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cga/BeckerFGOTW91
Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer:
An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. Workshop on Computational Geometry 1991: 13-25

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.