BibTeX record conf/lics/AehligB08

download as .bib file

@inproceedings{DBLP:conf/lics/AehligB08,
  author       = {Klaus Aehlig and
                  Arnold Beckmann},
  title        = {On the Computational Complexity of Cut-Reduction},
  booktitle    = {Proceedings of the Twenty-Third Annual {IEEE} Symposium on Logic in
                  Computer Science, {LICS} 2008, 24-27 June 2008, Pittsburgh, PA, {USA}},
  pages        = {284--293},
  publisher    = {{IEEE} Computer Society},
  year         = {2008},
  url          = {https://doi.org/10.1109/LICS.2008.9},
  doi          = {10.1109/LICS.2008.9},
  timestamp    = {Fri, 24 Mar 2023 00:01:50 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/AehligB08.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.