BibTeX records: Marcin Kubica

download as .bib file

@article{DBLP:journals/access/OparaKK23,
  author       = {Adam Opara and
                  Marcin Kubica and
                  Dariusz Kania},
  title        = {Decomposition Approaches for Power Reduction},
  journal      = {{IEEE} Access},
  volume       = {11},
  pages        = {29417--29429},
  year         = {2023},
  url          = {https://doi.org/10.1109/ACCESS.2023.3260970},
  doi          = {10.1109/ACCESS.2023.3260970},
  timestamp    = {Sun, 16 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/access/OparaKK23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:series/lnee/KubicaOK21,
  author       = {Marcin Kubica and
                  Adam Opara and
                  Dariusz Kania},
  title        = {Technology Mapping for LUT-Based {FPGA}},
  series       = {Lecture Notes in Electrical Engineering},
  volume       = {713},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-60488-2},
  doi          = {10.1007/978-3-030-60488-2},
  isbn         = {978-3-030-60487-5},
  timestamp    = {Fri, 13 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/series/lnee/KubicaOK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KociumakaKRRW20,
  author       = {Tomasz Kociumaka and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {A Linear-Time Algorithm for Seeds Computation},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {16},
  number       = {2},
  pages        = {27:1--27:23},
  year         = {2020},
  url          = {https://doi.org/10.1145/3386369},
  doi          = {10.1145/3386369},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/KociumakaKRRW20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/KubicaKK19,
  author       = {Marcin Kubica and
                  Dariusz Kania and
                  J{\'{o}}zef Kulisz},
  title        = {A Technology Mapping of FSMs Based on a Graph of Excitations and Outputs},
  journal      = {{IEEE} Access},
  volume       = {7},
  pages        = {16123--16131},
  year         = {2019},
  url          = {https://doi.org/10.1109/ACCESS.2019.2895206},
  doi          = {10.1109/ACCESS.2019.2895206},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/access/KubicaKK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/OparaKK19,
  author       = {Adam Opara and
                  Marcin Kubica and
                  Dariusz Kania},
  title        = {Methods of Improving Time Efficiency of Decomposition Dedicated at
                  {FPGA} Structures and Using {BDD} in the Process of Cyber-Physical
                  Synthesis},
  journal      = {{IEEE} Access},
  volume       = {7},
  pages        = {20619--20631},
  year         = {2019},
  url          = {https://doi.org/10.1109/ACCESS.2019.2898230},
  doi          = {10.1109/ACCESS.2019.2898230},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/access/OparaKK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/integration/OparaKK18,
  author       = {Adam Opara and
                  Marcin Kubica and
                  Dariusz Kania},
  title        = {Strategy of logic synthesis using {MTBDD} dedicated to {FPGA}},
  journal      = {Integr.},
  volume       = {62},
  pages        = {142--158},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.vlsi.2018.02.009},
  doi          = {10.1016/J.VLSI.2018.02.009},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/integration/OparaKK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amcs/KubicaK17,
  author       = {Marcin Kubica and
                  Dariusz Kania},
  title        = {Area-oriented technology mapping for LUT-based logic blocks},
  journal      = {Int. J. Appl. Math. Comput. Sci.},
  volume       = {27},
  number       = {1},
  pages        = {207},
  year         = {2017},
  url          = {https://doi.org/10.1515/amcs-2017-0015},
  doi          = {10.1515/AMCS-2017-0015},
  timestamp    = {Wed, 11 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amcs/KubicaK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mam/KubicaOK17,
  author       = {Marcin Kubica and
                  Adam Opara and
                  Dariusz Kania},
  title        = {Logic synthesis for FPGAs based on cutting of {BDD}},
  journal      = {Microprocess. Microsystems},
  volume       = {52},
  pages        = {173--187},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.micpro.2017.06.010},
  doi          = {10.1016/J.MICPRO.2017.06.010},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mam/KubicaOK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CyganKRRW16,
  author       = {Marek Cygan and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {Polynomial-time approximation algorithms for weighted {LCS} problem},
  journal      = {Discret. Appl. Math.},
  volume       = {204},
  pages        = {38--48},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.dam.2015.11.011},
  doi          = {10.1016/J.DAM.2015.11.011},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CyganKRRW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrochemoreIKKLP16,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Tomasz Kociumaka and
                  Marcin Kubica and
                  Alessio Langiu and
                  Solon P. Pissis and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {Order-preserving indexing},
  journal      = {Theor. Comput. Sci.},
  volume       = {638},
  pages        = {122--135},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.06.050},
  doi          = {10.1016/J.TCS.2015.06.050},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CrochemoreIKKLP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreIKKLR15,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Tomasz Kociumaka and
                  Marcin Kubica and
                  Alessio Langiu and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Bartosz Szreder and
                  Tomasz Walen},
  title        = {A note on the longest common compatible prefix problem for partial
                  words},
  journal      = {J. Discrete Algorithms},
  volume       = {34},
  pages        = {49--53},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2015.05.003},
  doi          = {10.1016/J.JDA.2015.05.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/CrochemoreIKKLR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CrochemoreIKRRSW14,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Krzysztof Stencel and
                  Tomasz Walen},
  title        = {New simple efficient algorithms computing powers and runs in strings},
  journal      = {Discret. Appl. Math.},
  volume       = {163},
  pages        = {258--267},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.dam.2013.05.009},
  doi          = {10.1016/J.DAM.2013.05.009},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CrochemoreIKRRSW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrochemoreIKRRW14,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {Extracting powers and periods in a word from its runs structure},
  journal      = {Theor. Comput. Sci.},
  volume       = {521},
  pages        = {29--41},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.018},
  doi          = {10.1016/J.TCS.2013.11.018},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CrochemoreIKRRW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CrochemoreIIKRW13,
  author       = {Maxime Crochemore and
                  Lucian Ilie and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {Computing the Longest Previous Factor},
  journal      = {Eur. J. Comb.},
  volume       = {34},
  number       = {1},
  pages        = {15--26},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ejc.2012.07.011},
  doi          = {10.1016/J.EJC.2012.07.011},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/CrochemoreIIKRW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KubicaRRW13,
  author       = {Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {On the maximum number of cubic subwords in a word},
  journal      = {Eur. J. Comb.},
  volume       = {34},
  number       = {1},
  pages        = {27--37},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ejc.2012.07.012},
  doi          = {10.1016/J.EJC.2012.07.012},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/KubicaRRW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrochemoreIKKPRRTW13,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Tomasz Kociumaka and
                  Marcin Kubica and
                  Jakub Pachocki and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Wojciech Tyczynski and
                  Tomasz Walen},
  title        = {A note on efficient computation of all Abelian periods in a string},
  journal      = {Inf. Process. Lett.},
  volume       = {113},
  number       = {3},
  pages        = {74--77},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ipl.2012.11.001},
  doi          = {10.1016/J.IPL.2012.11.001},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CrochemoreIKKPRRTW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KubicaKRRW13,
  author       = {Marcin Kubica and
                  Tomasz Kulczynski and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {A linear time algorithm for consecutive permutation pattern matching},
  journal      = {Inf. Process. Lett.},
  volume       = {113},
  number       = {12},
  pages        = {430--433},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ipl.2013.03.015},
  doi          = {10.1016/J.IPL.2013.03.015},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/KubicaKRRW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChristouCIKPRRSW13,
  author       = {Michalis Christou and
                  Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Solon P. Pissis and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Bartosz Szreder and
                  Tomasz Walen},
  title        = {Efficient seed computation revisited},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {171--181},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2011.12.078},
  doi          = {10.1016/J.TCS.2011.12.078},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChristouCIKPRRSW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/CrochemoreIKKLPRRW13,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Tomasz Kociumaka and
                  Marcin Kubica and
                  Alessio Langiu and
                  Solon P. Pissis and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Oren Kurland and
                  Moshe Lewenstein and
                  Ely Porat},
  title        = {Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes},
  booktitle    = {String Processing and Information Retrieval - 20th International Symposium,
                  {SPIRE} 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8214},
  pages        = {84--95},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-319-02432-5\_13},
  doi          = {10.1007/978-3-319-02432-5\_13},
  timestamp    = {Tue, 14 May 2019 10:00:55 +0200},
  biburl       = {https://dblp.org/rec/conf/spire/CrochemoreIKKLPRRW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-6872,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Tomasz Kociumaka and
                  Marcin Kubica and
                  Alessio Langiu and
                  Solon P. Pissis and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {Order-Preserving Suffix Trees and Their Algorithmic Applications},
  journal      = {CoRR},
  volume       = {abs/1303.6872},
  year         = {2013},
  url          = {http://arxiv.org/abs/1303.6872},
  eprinttype    = {arXiv},
  eprint       = {1303.6872},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1303-6872.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CrochemoreIKKLRRSW13,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Tomasz Kociumaka and
                  Marcin Kubica and
                  Alessio Langiu and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Bartosz Szreder and
                  Tomasz Walen},
  title        = {A Note on the Longest Common Compatible Prefix Problem for Partial
                  Words},
  journal      = {CoRR},
  volume       = {abs/1312.2381},
  year         = {2013},
  url          = {http://arxiv.org/abs/1312.2381},
  eprinttype    = {arXiv},
  eprint       = {1312.2381},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CrochemoreIKKLRRSW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CrochemoreIKRRW12,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {The maximal number of cubic runs in a word},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {78},
  number       = {6},
  pages        = {1828--1836},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jcss.2011.12.005},
  doi          = {10.1016/J.JCSS.2011.12.005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/CrochemoreIKRRW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreIKRW12,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {Efficient algorithms for three variants of the {LPF} table},
  journal      = {J. Discrete Algorithms},
  volume       = {11},
  pages        = {51--61},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2011.02.002},
  doi          = {10.1016/J.JDA.2011.02.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/CrochemoreIKRW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreKRRW12,
  author       = {Maxime Crochemore and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {On the maximal sum of exponents of runs in a string},
  journal      = {J. Discrete Algorithms},
  volume       = {14},
  pages        = {29--36},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2011.12.016},
  doi          = {10.1016/J.JDA.2011.12.016},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/CrochemoreKRRW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrochemoreIKRTW12,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  M. Sohel Rahman and
                  German Tischler and
                  Tomasz Walen},
  title        = {Improved algorithms for the range next value problem and applications},
  journal      = {Theor. Comput. Sci.},
  volume       = {434},
  pages        = {23--34},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.015},
  doi          = {10.1016/J.TCS.2012.02.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CrochemoreIKRTW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CrochemoreIKKRRTW12,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Tomasz Kociumaka and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Wojciech Tyczynski and
                  Tomasz Walen},
  editor       = {Juha K{\"{a}}rkk{\"{a}}inen and
                  Jens Stoye},
  title        = {The Maximum Number of Squares in a Tree},
  booktitle    = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
                  Helsinki, Finland, July 3-5, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7354},
  pages        = {27--40},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31265-6\_3},
  doi          = {10.1007/978-3-642-31265-6\_3},
  timestamp    = {Tue, 21 Mar 2023 21:02:12 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/CrochemoreIKKRRTW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KociumakaKRRW12,
  author       = {Tomasz Kociumaka and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Yuval Rabani},
  title        = {A linear time algorithm for seeds computation},
  booktitle    = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages        = {1095--1112},
  publisher    = {{SIAM}},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611973099.86},
  doi          = {10.1137/1.9781611973099.86},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/KociumakaKRRW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-3313,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Tomasz Kociumaka and
                  Marcin Kubica and
                  Jakub Pachocki and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Wojciech Tyczynski and
                  Tomasz Walen},
  title        = {A Note on Efficient Computation of All Abelian Periods in a String},
  journal      = {CoRR},
  volume       = {abs/1208.3313},
  year         = {2012},
  url          = {http://arxiv.org/abs/1208.3313},
  eprinttype    = {arXiv},
  eprint       = {1208.3313},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1208-3313.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KubicaRVW11,
  author       = {Marcin Kubica and
                  Romeo Rizzi and
                  St{\'{e}}phane Vialette and
                  Tomasz Walen},
  title        = {Approximation of {RNA} multiple structural alignment},
  journal      = {J. Discrete Algorithms},
  volume       = {9},
  number       = {4},
  pages        = {365--376},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.jda.2010.03.002},
  doi          = {10.1016/J.JDA.2010.03.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/KubicaRVW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ChristouCIKPRRSW11,
  author       = {Michalis Christou and
                  Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Solon P. Pissis and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Bartosz Szreder and
                  Tomasz Walen},
  editor       = {Raffaele Giancarlo and
                  Giovanni Manzini},
  title        = {Efficient Seeds Computation Revisited},
  booktitle    = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
                  Palermo, Italy, June 27-29, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6661},
  pages        = {350--363},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-21458-5\_30},
  doi          = {10.1007/978-3-642-21458-5\_30},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/ChristouCIKPRRSW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CyganKRRW11,
  author       = {Marek Cygan and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Raffaele Giancarlo and
                  Giovanni Manzini},
  title        = {Polynomial-Time Approximation Algorithms for Weighted {LCS} Problem},
  booktitle    = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
                  Palermo, Italy, June 27-29, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6661},
  pages        = {455--466},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-21458-5\_38},
  doi          = {10.1007/978-3-642-21458-5\_38},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/CyganKRRW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-3153,
  author       = {Michalis Christou and
                  Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Solon P. Pissis and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Bartosz Szreder and
                  Tomasz Walen},
  title        = {Efficient Seeds Computation Revisited},
  journal      = {CoRR},
  volume       = {abs/1104.3153},
  year         = {2011},
  url          = {http://arxiv.org/abs/1104.3153},
  eprinttype    = {arXiv},
  eprint       = {1104.3153},
  timestamp    = {Sat, 23 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-3153.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-2422,
  author       = {Tomasz Kociumaka and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {A Linear Time Algorithm for Seeds Computation},
  journal      = {CoRR},
  volume       = {abs/1107.2422},
  year         = {2011},
  url          = {http://arxiv.org/abs/1107.2422},
  eprinttype    = {arXiv},
  eprint       = {1107.2422},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-2422.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/CrochemoreKWIR10,
  author       = {Maxime Crochemore and
                  Marcin Kubica and
                  Tomasz Walen and
                  Costas S. Iliopoulos and
                  M. Sohel Rahman},
  title        = {Finding Patterns In Given Intervals},
  journal      = {Fundam. Informaticae},
  volume       = {101},
  number       = {3},
  pages        = {173--186},
  year         = {2010},
  url          = {https://doi.org/10.3233/FI-2010-283},
  doi          = {10.3233/FI-2010-283},
  timestamp    = {Fri, 25 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/fuin/CrochemoreKWIR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CrochemoreCIKRRW10,
  author       = {Maxime Crochemore and
                  Marek Cygan and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Amihood Amir and
                  Laxmi Parida},
  title        = {Algorithms for Three Versions of the Shortest Common Superstring Problem},
  booktitle    = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
                  New York, NY, USA, June 21-23, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6129},
  pages        = {299--309},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13509-5\_27},
  doi          = {10.1007/978-3-642-13509-5\_27},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/CrochemoreCIKRRW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/CrochemoreKRRW10,
  author       = {Maxime Crochemore and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Costas S. Iliopoulos and
                  William F. Smyth},
  title        = {On the Maximal Sum of Exponents of Runsin a String},
  booktitle    = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
                  London, UK, July 26-28, 2010, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {6460},
  pages        = {10--19},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-19222-7\_2},
  doi          = {10.1007/978-3-642-19222-7\_2},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/CrochemoreKRRW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/CrochemoreIKRRW10,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Adrian{-}Horia Dediu and
                  Henning Fernau and
                  Carlos Mart{\'{\i}}n{-}Vide},
  title        = {On the Maximal Number of Cubic Runs in a String},
  booktitle    = {Language and Automata Theory and Applications, 4th International Conference,
                  {LATA} 2010, Trier, Germany, May 24-28, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6031},
  pages        = {227--238},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13089-2\_19},
  doi          = {10.1007/978-3-642-13089-2\_19},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/lata/CrochemoreIKRRW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/CrochemoreIKRW10,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Jan van Leeuwen and
                  Anca Muscholl and
                  David Peleg and
                  Jaroslav Pokorn{\'{y}} and
                  Bernhard Rumpe},
  title        = {Efficient Algorithms for Two Extensions of {LPF} Table: The Power
                  of Suffix Arrays},
  booktitle    = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
                  on Current Trends in Theory and Practice of Computer Science, Spindleruv
                  Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5901},
  pages        = {296--307},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-11266-9\_25},
  doi          = {10.1007/978-3-642-11266-9\_25},
  timestamp    = {Sat, 30 Sep 2023 09:57:10 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/CrochemoreIKRW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/CrochemoreIKRRW10,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Edgar Ch{\'{a}}vez and
                  Stefano Lonardi},
  title        = {Extracting Powers and Periods in a String from Its Runs Structure},
  booktitle    = {String Processing and Information Retrieval - 17th International Symposium,
                  {SPIRE} 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6393},
  pages        = {258--269},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-16321-0\_27},
  doi          = {10.1007/978-3-642-16321-0\_27},
  timestamp    = {Sat, 05 Sep 2020 18:08:29 +0200},
  biburl       = {https://dblp.org/rec/conf/spire/CrochemoreIKRRW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/CrochemoreIKRRSW10,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Krzysztof Stencel and
                  Tomasz Walen},
  editor       = {Jan Holub and
                  Jan Zd{\'{a}}rek},
  title        = {New Simple Efficient Algorithms Computing Powers and Runs in Strings},
  booktitle    = {Proceedings of the Prague Stringology Conference 2010, Prague, Czech
                  Republic, August 30 - September 1, 2010},
  pages        = {138--149},
  publisher    = {Prague Stringology Club, Department of Theoretical Computer Science,
                  Faculty of Information Technology, Czech Technical University in Prague},
  year         = {2010},
  url          = {http://www.stringology.org/event/2010/p12.html},
  timestamp    = {Wed, 10 Feb 2021 08:42:22 +0100},
  biburl       = {https://dblp.org/rec/conf/stringology/CrochemoreIKRRSW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-4866,
  author       = {Maxime Crochemore and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {On the maximal sum of exponents of runs in a string},
  journal      = {CoRR},
  volume       = {abs/1003.4866},
  year         = {2010},
  url          = {http://arxiv.org/abs/1003.4866},
  eprinttype    = {arXiv},
  eprint       = {1003.4866},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1003-4866.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/CrochemoreIIKRW09,
  author       = {Maxime Crochemore and
                  Lucian Ilie and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Jir{\'{\i}} Fiala and
                  Jan Kratochv{\'{\i}}l and
                  Mirka Miller},
  title        = {{LPF} Computation Revisited},
  booktitle    = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
                  Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
                  Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5874},
  pages        = {158--169},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10217-2\_18},
  doi          = {10.1007/978-3-642-10217-2\_18},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/CrochemoreIIKRW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/KubicaRRW09,
  author       = {Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  editor       = {Jir{\'{\i}} Fiala and
                  Jan Kratochv{\'{\i}}l and
                  Mirka Miller},
  title        = {On the Maximal Number of Cubic Subwords in a String},
  booktitle    = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
                  Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
                  Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5874},
  pages        = {345--355},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10217-2\_34},
  doi          = {10.1007/978-3-642-10217-2\_34},
  timestamp    = {Sun, 04 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/KubicaRRW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-2157,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {On the maximal number of highly periodic runs in a string},
  journal      = {CoRR},
  volume       = {abs/0907.2157},
  year         = {2009},
  url          = {http://arxiv.org/abs/0907.2157},
  eprinttype    = {arXiv},
  eprint       = {0907.2157},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0907-2157.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-1370,
  author       = {Marcin Kubica and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {On the maximal number of cubic subwords in a string},
  journal      = {CoRR},
  volume       = {abs/0911.1370},
  year         = {2009},
  url          = {http://arxiv.org/abs/0911.1370},
  eprinttype    = {arXiv},
  eprint       = {0911.1370},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0911-1370.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/IliopoulosCKRW08,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  Mohammad Sohel Rahman and
                  Tomasz Walen},
  editor       = {Susanne Albers and
                  Pascal Weil},
  title        = {Improved Algorithms for the Range Next Value Problem and Applications},
  booktitle    = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
                  Science, Bordeaux, France, February 21-23, 2008, Proceedings},
  series       = {LIPIcs},
  volume       = {1},
  pages        = {205--216},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year         = {2008},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2008.1359},
  doi          = {10.4230/LIPICS.STACS.2008.1359},
  timestamp    = {Tue, 22 Jun 2021 15:44:08 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/IliopoulosCKRW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BeregKWZ07,
  author       = {Sergey Bereg and
                  Marcin Kubica and
                  Tomasz Walen and
                  Binhai Zhu},
  title        = {{RNA} multiple structural alignment with longest common subsequences},
  journal      = {J. Comb. Optim.},
  volume       = {13},
  number       = {2},
  pages        = {179--188},
  year         = {2007},
  url          = {https://doi.org/10.1007/s10878-006-9020-x},
  doi          = {10.1007/S10878-006-9020-X},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/BeregKWZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/IliopoulosKRW07,
  author       = {Costas S. Iliopoulos and
                  Marcin Kubica and
                  M. Sohel Rahman and
                  Tomasz Walen},
  editor       = {Bin Ma and
                  Kaizhong Zhang},
  title        = {Algorithms for Computing the Longest Parameterized Common Subsequence},
  booktitle    = {Combinatorial Pattern Matching, 18th Annual Symposium, {CPM} 2007,
                  London, Canada, July 9-11, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4580},
  pages        = {265--273},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-73437-6\_27},
  doi          = {10.1007/978-3-540-73437-6\_27},
  timestamp    = {Mon, 13 Mar 2023 16:58:28 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/IliopoulosKRW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KubicaRVW06,
  author       = {Marcin Kubica and
                  Romeo Rizzi and
                  St{\'{e}}phane Vialette and
                  Tomasz Walen},
  editor       = {Moshe Lewenstein and
                  Gabriel Valiente},
  title        = {Approximation of {RNA} Multiple Structural Alignment},
  booktitle    = {Combinatorial Pattern Matching, 17th Annual Symposium, {CPM} 2006,
                  Barcelona, Spain, July 5-7, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4009},
  pages        = {211--222},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11780441\_20},
  doi          = {10.1007/11780441\_20},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/KubicaRVW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fase/Kubica03,
  author       = {Marcin Kubica},
  editor       = {Mauro Pezz{\`{e}}},
  title        = {A Temporal Approach to Specification and Verification of Pointer Data-Structures},
  booktitle    = {Fundamental Approaches to Software Engineering, 6th International
                  Conference, {FASE} 2003, Held as Part of the Joint European Conferences
                  on Theory and Practice of Software, {ETAPS} 2003, Warsaw, Poland,
                  April 7-11, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2621},
  pages        = {231--245},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/3-540-36578-8\_17},
  doi          = {10.1007/3-540-36578-8\_17},
  timestamp    = {Sun, 02 Oct 2022 16:01:12 +0200},
  biburl       = {https://dblp.org/rec/conf/fase/Kubica03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asian/IglewskiKM95,
  author       = {Michal Iglewski and
                  Marcin Kubica and
                  Jan Madey},
  editor       = {Kanchana Kanchanasut and
                  Jean{-}Jacques L{\'{e}}vy},
  title        = {Trace Specifications of Non-Deterministic Multi-Object Modules},
  booktitle    = {Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science
                  Conference, {ACSC} '95, Pathumthani, Thailand, December 11-13, 1995,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1023},
  pages        = {381--395},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-60688-2\_57},
  doi          = {10.1007/3-540-60688-2\_57},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/asian/IglewskiKM95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hybrid/EngelKMPRS92,
  author       = {Marcin Engel and
                  Marcin Kubica and
                  Jan Madey and
                  David Lorge Parnas and
                  Anders P. Ravn and
                  A. John van Schouwen},
  editor       = {Robert L. Grossman and
                  Anil Nerode and
                  Anders P. Ravn and
                  Hans Rischel},
  title        = {A Formal Approach to Computer Systems Requirements Documentation},
  booktitle    = {Hybrid Systems},
  series       = {Lecture Notes in Computer Science},
  volume       = {736},
  pages        = {452--474},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-57318-6\_40},
  doi          = {10.1007/3-540-57318-6\_40},
  timestamp    = {Fri, 17 Jul 2020 16:12:46 +0200},
  biburl       = {https://dblp.org/rec/conf/hybrid/EngelKMPRS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics