BibTeX record conf/stoc/IckingM01

download as .bib file

@inproceedings{DBLP:conf/stoc/IckingM01,
  author       = {Christian Icking and
                  Lihong Ma},
  editor       = {Jeffrey Scott Vitter and
                  Paul G. Spirakis and
                  Mihalis Yannakakis},
  title        = {A tight bound for the complexity of voroni diagrams under polyhedral
                  convex distance functions in 3D},
  booktitle    = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
                  July 6-8, 2001, Heraklion, Crete, Greece},
  pages        = {316--321},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/380752.380815},
  doi          = {10.1145/380752.380815},
  timestamp    = {Tue, 06 Nov 2018 11:07:06 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/IckingM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.