1. 2018
  2. Published

    At the roots of dictionary compression: String attractors. / Kempa, Dominik; Prezza, Nicola.

    Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, 2018. p. 827-40.

    Research output: Research - peer-reviewArticle in proceedings – Annual report year: 2018

  3. Published

    A Verified Simple Prover for First-Order Logic. / Villadsen, Jørgen; Schlichtkrull, Anders; From, Andreas Halkjær.

    Proceedings of the 6th Workshop on Practical Aspects of Automated Reasoning (PAAR). ed. / Boris Konev; Josef Urban; Philipp Rümmer. CEUR-WS, 2018. p. 88—104.

    Research output: Research - peer-reviewArticle in proceedings – Annual report year: 2018

  4. Published

    Bounded diameter arboricity. / Merker, Martin; Postle, Luke.

    In: Journal of Graph Theory, 2018.

    Research output: Research - peer-reviewJournal article – Annual report year: 2018

  5. Published

    C*-Algebras and Their Automorphism Groups. / Eilers, Søren (Editor); Olesen, Dorte (Editor).

    2 ed. Academic Press, 2018. 538 p.

    Research output: Research - peer-reviewBook – Annual report year: 2018

  6. Published

    Compressed and efficient algorithms and data structures for strings. / Ettienne, Mikko Berggren.

    DTU Compute, 2018. 100 p.

    Research output: ResearchPh.D. thesis – Annual report year: 2018

  7. Published

    Compressed and Practical Data Structures for Strings. / Christiansen, Anders Roy; Bille, Philip (Main supervisor); Gørtz, Inge Li (Supervisor).

    DTU Compute, 2018. 149 p.

    Research output: ResearchPh.D. thesis – Annual report year: 2018

  8. Published

    Compressed Communication Complexity of Longest Common Prefixes. / Bille, Philip; Berggreen Ettienne, Mikko; Grossi, Roberto; Gørtz, Inge Li; Rotenberg, Eva.

    String Processing and Information Retrieval. Springer, 2018. p. 74-87.

    Research output: Research - peer-reviewArticle in proceedings – Annual report year: 2018

  9. Published

    Compressed Indexing with Signature Grammars. / Christiansen, Anders Roy; Ettienne, Mikko Berggren.

    LATIN 2018: Theoretical Informatics. ed. / Michael A. Bender; Martin Farach-Colton; Miguel A. Mosteiro. Vol. 10807 Springer, 2018. p. 331-345.

    Research output: Research - peer-reviewArticle in proceedings – Annual report year: 2018

  10. Published

    Density of Chromatic Roots in Minor-Closed Graph Families. / Perrett, Thomas J.; Thomassen, Carsten.

    In: Combinatorics, Probability & Computing, Vol. 27, No. 6, 2018, p. 988-998.

    Research output: Research - peer-reviewJournal article – Annual report year: 2018

  11. Published

    Density of Real Zeros of the Tutte Polynomial. / Ok, Seongmin; Perrett, Thomas.

    In: Combinatorics, Probability & Computing, Vol. 27, No. 3, 2018, p. 398-410.

    Research output: Research - peer-reviewJournal article – Annual report year: 2018

Previous 1 2 3 4 5 6 7 8 ...33 Next
Download list:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word