Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/itc/GaedeMU86
%A Gaede, Rhonda Kay
%A Mercer, M. Ray
%A Underwood, Bill
%B ITC
%D 1986
%I IEEE Computer Society
%K dblp
%P 498-505
%T Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm.
%U http://dblp.uni-trier.de/db/conf/itc/itc1986.html#GaedeMU86
@inproceedings{conf/itc/GaedeMU86,
added-at = {2002-10-22T00:00:00.000+0200},
author = {Gaede, Rhonda Kay and Mercer, M. Ray and Underwood, Bill},
biburl = {https://www.bibsonomy.org/bibtex/25aa5e7c713b221da4b2b871e100305f1/dblp},
booktitle = {ITC},
crossref = {conf/itc/1986},
date = {2002-10-22},
description = {dblp},
interhash = {5d96397b0b6d4629534346dba940fe5e},
intrahash = {5aa5e7c713b221da4b2b871e100305f1},
keywords = {dblp},
pages = {498-505},
publisher = {IEEE Computer Society},
timestamp = {2002-10-22T00:00:00.000+0200},
title = {Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm.},
url = {http://dblp.uni-trier.de/db/conf/itc/itc1986.html#GaedeMU86},
year = 1986
}