Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Lucas Heimberg
@phdthesis{DBLP:phd/basesearch/Heimberg18, author = {Lucas Heimberg}, title = {Complexity of Normal Forms on Structures of Bounded Degree}, school = {{HU} Berlin, Germany}, year = {2018}, url = {http://edoc.hu-berlin.de/18452/19956}, urn = {urn:nbn:de:kobv:11-110-18452/19956-9}, doi = {10.18452/19205}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/phd/basesearch/Heimberg18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1810-12077, author = {Andr{\'{e}} Frochaux and Lucas Heimberg}, title = {An Optimal Construction for the Barthelmann-Schwentick Normal Form on Classes of Structures of Bounded Degree}, journal = {CoRR}, volume = {abs/1810.12077}, year = {2018}, url = {http://arxiv.org/abs/1810.12077}, eprinttype = {arXiv}, eprint = {1810.12077}, timestamp = {Thu, 01 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1810-12077.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/HeimbergKS16, author = {Lucas Heimberg and Dietrich Kuske and Nicole Schweikardt}, editor = {Martin Grohe and Eric Koskinen and Natarajan Shankar}, title = {Hanf normal form for first-order logic with unary counting quantifiers}, booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} '16, New York, NY, USA, July 5-8, 2016}, pages = {277--286}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2933575.2934571}, doi = {10.1145/2933575.2934571}, timestamp = {Wed, 11 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lics/HeimbergKS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HarwathHS15, author = {Frederik Harwath and Lucas Heimberg and Nicole Schweikardt}, title = {Preservation and decomposition theorems for bounded degree structures}, journal = {Log. Methods Comput. Sci.}, volume = {11}, number = {4}, year = {2015}, url = {https://doi.org/10.2168/LMCS-11(4:17)2015}, doi = {10.2168/LMCS-11(4:17)2015}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HarwathHS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csl/HarwathHS14, author = {Frederik Harwath and Lucas Heimberg and Nicole Schweikardt}, editor = {Thomas A. Henzinger and Dale Miller}, title = {Preservation and decomposition theorems for bounded degree structures}, booktitle = {Joint Meeting of the Twenty-Third {EACSL} Annual Conference on Computer Science Logic {(CSL)} and the Twenty-Ninth Annual {ACM/IEEE} Symposium on Logic in Computer Science (LICS), {CSL-LICS} '14, Vienna, Austria, July 14 - 18, 2014}, pages = {49:1--49:10}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2603088.2603130}, doi = {10.1145/2603088.2603130}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/csl/HarwathHS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/HeimbergKS13, author = {Lucas Heimberg and Dietrich Kuske and Nicole Schweikardt}, title = {An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree}, booktitle = {28th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2013, New Orleans, LA, USA, June 25-28, 2013}, pages = {63--72}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/LICS.2013.11}, doi = {10.1109/LICS.2013.11}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lics/HeimbergKS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.