default search action
Search dblp for Publications
export results for "toc:db/journals/jea/jea22.bht:"
@article{DBLP:journals/jea/BaierBO17, author = {Uwe Baier and Timo Beller and Enno Ohlebusch}, title = {Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies}, journal = {{ACM} J. Exp. Algorithmics}, volume = {22}, year = {2017}, url = {https://doi.org/10.1145/3035540}, doi = {10.1145/3035540}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/BaierBO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/BuchinBGHS17, author = {Kevin Buchin and Maike Buchin and Joachim Gudmundsson and Michael Horton and Stef Sijben}, title = {Compact Flow Diagrams for State Sequences}, journal = {{ACM} J. Exp. Algorithmics}, volume = {22}, year = {2017}, url = {https://doi.org/10.1145/3150525}, doi = {10.1145/3150525}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/BuchinBGHS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/GogKN17, author = {Simon Gog and Roberto Konow and Gonzalo Navarro}, title = {Practical Compact Indexes for Top-\emph{k} Document Retrieval}, journal = {{ACM} J. Exp. Algorithmics}, volume = {22}, year = {2017}, url = {https://doi.org/10.1145/3043958}, doi = {10.1145/3043958}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/GogKN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/HirvolaT17, author = {Tommi Hirvola and Jorma Tarhio}, title = {Bit-Parallel Approximate Matching of Circular Strings with \emph{k} Mismatches}, journal = {{ACM} J. Exp. Algorithmics}, volume = {22}, year = {2017}, url = {https://doi.org/10.1145/3129536}, doi = {10.1145/3129536}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/HirvolaT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/KerberMN17, author = {Michael Kerber and Dmitriy Morozov and Arnur Nigmetov}, title = {Geometry Helps to Compare Persistence Diagrams}, journal = {{ACM} J. Exp. Algorithmics}, volume = {22}, year = {2017}, url = {https://doi.org/10.1145/3064175}, doi = {10.1145/3064175}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/KerberMN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/KhuongM17, author = {Paul{-}Virak Khuong and Pat Morin}, title = {Array Layouts for Comparison-Based Searching}, journal = {{ACM} J. Exp. Algorithmics}, volume = {22}, year = {2017}, url = {https://doi.org/10.1145/3053370}, doi = {10.1145/3053370}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/KhuongM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/PoloczekW17, author = {Matthias Poloczek and David P. Williamson}, title = {An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem}, journal = {{ACM} J. Exp. Algorithmics}, volume = {22}, year = {2017}, url = {https://doi.org/10.1145/3064174}, doi = {10.1145/3064174}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/PoloczekW17.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.