Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ijfcs/ijfcs29.bht:"
download as .bib file
@article{DBLP:journals/ijfcs/AbdollahyanES18,
author = {Maryam Abdollahyan and
Greg Elgar and
Fabrizio Smeraldi},
title = {Identifying Potential Regulatory Elements by Transcription Factor
Binding Site Alignment Using Partial Order Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {8},
pages = {1345--1354},
year = {2018},
url = {https://doi.org/10.1142/S0129054118430074},
doi = {10.1142/S0129054118430074},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/AbdollahyanES18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AdamczykACR18,
author = {Michal Adamczyk and
Mai Alzamel and
Panagiotis Charalampopoulos and
Jakub Radoszewski},
title = {Palindromic Decompositions with Gaps and Errors},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {8},
pages = {1311--1329},
year = {2018},
url = {https://doi.org/10.1142/S0129054118430050},
doi = {10.1142/S0129054118430050},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/AdamczykACR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AlnasirS18,
author = {Jamie J. Alnasir and
Hugh P. Shanahan},
title = {Transcriptomics: Quantifying Non-Uniform Read Distribution Using MapReduce},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {8},
pages = {1355--1372},
year = {2018},
url = {https://doi.org/10.1142/S0129054118430086},
doi = {10.1142/S0129054118430086},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/AlnasirS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AydinianCDL18,
author = {Harout K. Aydinian and
Ferdinando Cicalese and
Christian Deppe and
Vladimir S. Lebedev},
title = {A Combinatorial Model of Two-Sided Search},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {481--504},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410022},
doi = {10.1142/S0129054118410022},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/AydinianCDL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BannaiGIKKPS18,
author = {Hideo Bannai and
Travis Gagie and
Shunsuke Inenaga and
Juha K{\"{a}}rkk{\"{a}}inen and
Dominik Kempa and
Marcin Piatkowski and
Shiho Sugimoto},
title = {Diverse Palindromic Factorization is NP-Complete},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {143--164},
year = {2018},
url = {https://doi.org/10.1142/S0129054118400014},
doi = {10.1142/S0129054118400014},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BannaiGIKKPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BartonLP18,
author = {Carl Barton and
Chang Liu and
Solon P. Pissis},
title = {Fast Average-Case Pattern Matching on Weighted Sequences},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {8},
pages = {1331--1343},
year = {2018},
url = {https://doi.org/10.1142/S0129054118430062},
doi = {10.1142/S0129054118430062},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/BartonLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Baygi18,
author = {Mostafa Nouri Baygi},
title = {The Computational Complexity of and Approximation Algorithms for Variants
of the Component Selection Problem},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1231--1245},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500314},
doi = {10.1142/S0129054118500314},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Baygi18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Bedon18,
author = {Nicolas Bedon},
title = {Complementation of Branching Automata for Scattered and Countable
N-Free Posets},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {769--799},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420042},
doi = {10.1142/S0129054118420042},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/Bedon18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BelazzouguiGMPP18,
author = {Djamal Belazzougui and
Travis Gagie and
Veli M{\"{a}}kinen and
Marco Previtali and
Simon J. Puglisi},
title = {Bidirectional Variable-Order de Bruijn Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {8},
pages = {1279--1295},
year = {2018},
url = {https://doi.org/10.1142/S0129054118430037},
doi = {10.1142/S0129054118430037},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BelazzouguiGMPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BeraMS18,
author = {Somnath Bera and
Kalpana Mahalingam and
K. G. Subramanian},
title = {Properties of Parikh Matrices of Binary Words Obtained by an Extension
of a Restricted Shuffle Operator},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {3},
pages = {403--414},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500119},
doi = {10.1142/S0129054118500119},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BeraMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BerberlerY18,
author = {Zeynep Nihan Berberler and
Esin Yigit},
title = {Link Vulnerability in Networks},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {3},
pages = {447--456},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500144},
doi = {10.1142/S0129054118500144},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/BerberlerY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BerwangerB18,
author = {Dietmar Berwanger and
Marie van den Bogaard},
title = {Consensus Game Acceptors and Iterated Transductions},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {165--186},
year = {2018},
url = {https://doi.org/10.1142/S0129054118400026},
doi = {10.1142/S0129054118400026},
timestamp = {Wed, 18 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BerwangerB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BianchiBBKP18,
author = {Maria Paola Bianchi and
Hans{-}Joachim B{\"{o}}ckenhauer and
Tatjana Br{\"{u}}lisauer and
Dennis Komm and
Beatrice Palano},
title = {Online Minimum Spanning Tree with Advice},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {505--527},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410034},
doi = {10.1142/S0129054118410034},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/BianchiBBKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BianchiHK18,
author = {Maria Paola Bianchi and
Juraj Hromkovic and
Ivan Kov{\'{a}}c},
title = {On the Size of Two-Way Reasonable Automata for the Liveness Problem},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {187--212},
year = {2018},
url = {https://doi.org/10.1142/S0129054118400038},
doi = {10.1142/S0129054118400038},
timestamp = {Wed, 18 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BianchiHK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BibakKVT18,
author = {Khodakhast Bibak and
Bruce M. Kapron and
Srinivasan Venkatesh and
L{\'{a}}szl{\'{o}} T{\'{o}}th},
title = {On an Almost-Universal Hash Function Family with Applications to Authentication
and Secrecy Codes},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {3},
pages = {357--376},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500089},
doi = {10.1142/S0129054118500089},
timestamp = {Fri, 14 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BibakKVT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BournezKP18,
author = {Olivier Bournez and
Oleksiy Kurganskyy and
Igor Potapov},
title = {Reachability Problems for One-Dimensional Piecewise Affine Maps},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {529--549},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410046},
doi = {10.1142/S0129054118410046},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/BournezKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BucciR18,
author = {Michelangelo Bucci and
Gw{\'{e}}na{\"{e}}l Richomme},
title = {Greedy Palindromic Lengths},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {3},
pages = {331--356},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500077},
doi = {10.1142/S0129054118500077},
timestamp = {Thu, 17 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BucciR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BurjonsHKKMU18,
author = {Elisabet Burjons and
Juraj Hromkovic and
Rastislav Kr{\'{a}}lovic and
Richard Kr{\'{a}}lovic and
Xavier Mu{\~{n}}oz and
Walter Unger},
title = {Online Graph Coloring Against a Randomized Adversary},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {551--569},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410058},
doi = {10.1142/S0129054118410058},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/BurjonsHKKMU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/CharlierS18,
author = {{\'{E}}milie Charlier and
Wolfgang Steiner},
title = {Permutations and Negative Beta-Shifts},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {721--740},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420029},
doi = {10.1142/S0129054118420029},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/CharlierS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ChauveCP18,
author = {C{\'{e}}dric Chauve and
Julien Courtiel and
Yann Ponty},
title = {Counting, Generating, Analyzing and Sampling Tree Alignments},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {741--767},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420030},
doi = {10.1142/S0129054118420030},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/ChauveCP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ChungK18,
author = {HeeWon Chung and
Myungsun Kim},
title = {Encoding of Rational Numbers and Their Homomorphic Computations for
FHE-Based Applications},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {6},
pages = {1023--1044},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500193},
doi = {10.1142/S0129054118500193},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/ChungK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/CiftciA18,
author = {Canan {\c{C}}ift{\c{c}}i and
Aysun Ayta{\c{c}}},
title = {Exponential Independence Number of Some Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1151--1164},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500260},
doi = {10.1142/S0129054118500260},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/CiftciA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/CzybaTS18,
author = {Christopher Czyba and
Wolfgang Thomas and
Christopher Spinrath},
title = {Finite Automata Over Infinite Alphabets: Two Models with Transitions
for Local Change},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {213--232},
year = {2018},
url = {https://doi.org/10.1142/S012905411840004X},
doi = {10.1142/S012905411840004X},
timestamp = {Wed, 18 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/CzybaTS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DarmannDD18,
author = {Andreas Darmann and
Janosch D{\"{o}}cker and
Britta Dorn},
title = {The Monotone Satisfiability Problem with Bounded Variable Appearances},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {6},
pages = {979--993},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500168},
doi = {10.1142/S0129054118500168},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/DarmannDD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DartoisJR18,
author = {Luc Dartois and
Isma{\"{e}}l Jecker and
Pierre{-}Alain Reynier},
title = {Aperiodic String Transducers},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {801--824},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420054},
doi = {10.1142/S0129054118420054},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/DartoisJR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DerakhshanH18,
author = {Parisa Derakhshan and
Walter Hussak},
title = {Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {3},
pages = {377--390},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500090},
doi = {10.1142/S0129054118500090},
timestamp = {Thu, 17 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/DerakhshanH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/EndrullisKKS18,
author = {J{\"{o}}rg Endrullis and
Juhani Karhum{\"{a}}ki and
Jan Willem Klop and
Aleksi Saarela},
title = {Degrees of Infinite Words, Polynomials and Atoms},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {825--843},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420066},
doi = {10.1142/S0129054118420066},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/EndrullisKKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/EremondiIM18,
author = {Joey Eremondi and
Oscar H. Ibarra and
Ian McQuillan},
title = {On the Density of Context-Free and Counter Languages},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {233--250},
year = {2018},
url = {https://doi.org/10.1142/S0129054118400051},
doi = {10.1142/S0129054118400051},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/EremondiIM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GasnikovS18,
author = {Daniil Gasnikov and
Arseny M. Shur},
title = {Square-Free Partial Words with Many Wildcards},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {845--860},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420078},
doi = {10.1142/S0129054118420078},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/GasnikovS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GazdaW18,
author = {Maciej Gazda and
Tim A. C. Willemse},
title = {Cooking Your Own Parity Game Preorders Through Matching Plays},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {571--590},
year = {2018},
url = {https://doi.org/10.1142/S012905411841006X},
doi = {10.1142/S012905411841006X},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/GazdaW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GehrkeJKS18,
author = {Jan Clemens Gehrke and
Klaus Jansen and
Stefan E. J. Kraft and
Jakob Schikowski},
title = {A {PTAS} for Scheduling Unrelated Machines of Few Different Types},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {591--621},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410071},
doi = {10.1142/S0129054118410071},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/GehrkeJKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GuelloumaC18,
author = {Younes Guellouma and
Hadda Cherroun},
title = {From Tree Automata to Rational Tree Expressions},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {6},
pages = {1045--1062},
year = {2018},
url = {https://doi.org/10.1142/S012905411850020X},
doi = {10.1142/S012905411850020X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/GuelloumaC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HolzerJK18,
author = {Markus Holzer and
Sebastian Jakobi and
Martin Kutrib},
title = {Minimal Reversible Deterministic Finite Automata},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {251--270},
year = {2018},
url = {https://doi.org/10.1142/S0129054118400063},
doi = {10.1142/S0129054118400063},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HolzerJK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HyyroI18,
author = {Heikki Hyyr{\"{o}} and
Shunsuke Inenaga},
title = {Dynamic RLE-Compressed Edit Distance Tables Under General Weighted
Cost Functions},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {623--645},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410083},
doi = {10.1142/S0129054118410083},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/HyyroI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/IliopoulosVS18,
author = {Costas S. Iliopoulos and
Fatima Vayani},
title = {Preface},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {8},
pages = {1247--1248},
year = {2018},
url = {https://doi.org/10.1142/S0129054118020045},
doi = {10.1142/S0129054118020045},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/IliopoulosVS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/JeckerF18,
author = {Isma{\"{e}}l Jecker and
Emmanuel Filiot},
title = {Multi-Sequential Word Relations},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {271--296},
year = {2018},
url = {https://doi.org/10.1142/S0129054118400075},
doi = {10.1142/S0129054118400075},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/JeckerF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/JirasekJS18,
author = {Jozef Jir{\'{a}}sek Jr. and
Galina Jir{\'{a}}skov{\'{a}} and
Juraj Sebej},
title = {Operations on Unambiguous Finite Automata},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {861--876},
year = {2018},
url = {https://doi.org/10.1142/S012905411842008X},
doi = {10.1142/S012905411842008X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/JirasekJS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KariOALBDPRT18,
author = {Jarkko Kari and
Alexander Okhotin},
title = {Preface},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {457--459},
year = {2018},
url = {https://doi.org/10.1142/S0129054118020021},
doi = {10.1142/S0129054118020021},
timestamp = {Fri, 15 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/KariOALBDPRT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KariOALBDPRT18a,
author = {Patrizio Angelini and
Giordano Da Lozzo and
Marco Di Bartolomeo and
Valentino Di Donato and
Maurizio Patrignani and
Vincenzo Roselli and
Ioannis G. Tollis},
title = {Algorithms and Bounds for L-Drawings of Directed Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {461--480},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410010},
doi = {10.1142/S0129054118410010},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KariOALBDPRT18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KavandM18,
author = {Pardis Kavand and
Ali Mohades},
title = {A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {3},
pages = {391--402},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500107},
doi = {10.1142/S0129054118500107},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KavandM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Kedad-SidhoumMM18,
author = {Safia Kedad{-}Sidhoum and
Florence Monna and
Gr{\'{e}}gory Mouni{\'{e}} and
Denis Trystram},
title = {A Family of Scheduling Algorithms for Hybrid Parallel Platforms},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {1},
pages = {63--90},
year = {2018},
url = {https://doi.org/10.1142/S012905411850003X},
doi = {10.1142/S012905411850003X},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Kedad-SidhoumMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KlimannPS18,
author = {Ines Klimann and
Matthieu Picantin and
Dmytro Savchuk},
title = {A Connected 3-State Reversible Mealy Automaton Cannot Generate an
Infinite Burnside Group},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {297--314},
year = {2018},
url = {https://doi.org/10.1142/S0129054118400087},
doi = {10.1142/S0129054118400087},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KlimannPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Koga18,
author = {Toshihiro Koga},
title = {Context-Freeness of Parsing Expression Languages is Undecidable},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1203--1213},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500296},
doi = {10.1142/S0129054118500296},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Koga18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KravchenkoNR18,
author = {Dmitry Kravchenko and
Nikolajs Nahimovs and
Alexander Rivosh},
title = {Grover's Search with Faults on Some Marked Elements},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {647--662},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410095},
doi = {10.1142/S0129054118410095},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KravchenkoNR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KurkcuA18,
author = {{\"{O}}m{\"{u}}r Kivan{\c{c}} K{\"{u}}rk{\c{c}}{\"{u}} and
Ersin Aslan},
title = {A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering
Number in Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1119--1142},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500247},
doi = {10.1142/S0129054118500247},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/KurkcuA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KweeO18,
author = {Kent Kwee and
Friedrich Otto},
title = {Nondeterministic Ordered Restarting Automata},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {663--685},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410101},
doi = {10.1142/S0129054118410101},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/KweeO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/LinLW18,
author = {Nianfeng Lin and
Damei L{\"{u}} and
Jinhua Wang},
title = {L(2, 1)-Edge-Labelings of the Edge-Path-Replacement of a Graph},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {1},
pages = {91--100},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500041},
doi = {10.1142/S0129054118500041},
timestamp = {Wed, 18 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/LinLW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/LiuC18,
author = {Yu{-}Liang Liu and
Jou{-}Ming Chang},
title = {Realizing Exchanged Crossed Cube Communication Patterns on Linear
Array {WDM} Optical Networks},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {6},
pages = {1003--1021},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500181},
doi = {10.1142/S0129054118500181},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/LiuC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Lopez-OrtizPR18,
author = {Alejandro L{\'{o}}pez{-}Ortiz and
Cynthia B. P{\'{e}}rez and
Jazm{\'{\i}}n Romero},
title = {Arbitrary Overlap Constraints in Graph Packing Problems},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {1},
pages = {101--122},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500053},
doi = {10.1142/S0129054118500053},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/Lopez-OrtizPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Luck18,
author = {Martin L{\"{u}}ck},
title = {Quirky Quantifiers: Optimal Models and Complexity of Computation Tree
Logic},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {1},
pages = {17--62},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500028},
doi = {10.1142/S0129054118500028},
timestamp = {Wed, 18 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Luck18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Maletti18,
author = {Andreas Maletti},
title = {Compositions of Tree-to-Tree Statistical Machine Translation Models},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {877--892},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420091},
doi = {10.1142/S0129054118420091},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/Maletti18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ManeaNS18,
author = {Florin Manea and
Dirk Nowotka and
Markus L. Schmid},
title = {On the Complexity of Solving Restricted Word Equations},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {893--909},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420108},
doi = {10.1142/S0129054118420108},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/ManeaNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/MasseBRBDD0P18,
author = {Alexandre Blondin Mass{\'{e}} and
Srecko Brlek and
Christophe Reutenauer},
title = {Preface},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {701--704},
year = {2018},
url = {https://doi.org/10.1142/S0129054118020033},
doi = {10.1142/S0129054118020033},
timestamp = {Fri, 15 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/MasseBRBDD0P18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/MasseBRBDD0P18a,
author = {Val{\'{e}}rie Berth{\'{e}} and
Francesco Dolce and
Fabien Durand and
Julien Leroy and
Dominique Perrin},
title = {Rigidity and Substitutive Dendric Words},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {705--720},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420017},
doi = {10.1142/S0129054118420017},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/MasseBRBDD0P18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/MichalewskiS18,
author = {Henryk Michalewski and
Michal Skrzypczak},
title = {On the Strength of Unambiguous Tree Automata},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {911--933},
year = {2018},
url = {https://doi.org/10.1142/S012905411842011X},
doi = {10.1142/S012905411842011X},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/MichalewskiS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/MignotSZ18,
author = {Ludovic Mignot and
Nadia Ouali Sebti and
Djelloul Ziadi},
title = {An Efficient Algorithm for the Construction of the Equation Tree Automaton},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {6},
pages = {951--978},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500156},
doi = {10.1142/S0129054118500156},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/MignotSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/NahimovsR18,
author = {Nikolajs Nahimovs and
Alexander Rivosh},
title = {Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {687--700},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410113},
doi = {10.1142/S0129054118410113},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/NahimovsR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Nakanishi18,
author = {Masaki Nakanishi},
title = {Quantum Pushdown Automata with Garbage Tape},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {3},
pages = {425--446},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500132},
doi = {10.1142/S0129054118500132},
timestamp = {Thu, 17 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Nakanishi18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/NgRS18,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
title = {State Complexity of Neighbourhoods and Approximate Pattern Matching},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {315--329},
year = {2018},
url = {https://doi.org/10.1142/S0129054118400099},
doi = {10.1142/S0129054118400099},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/NgRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/NowotkaS18,
author = {Dirk Nowotka and
Aleksi Saarela},
title = {One-Variable Word Equations and Three-Variable Constant-Free Word
Equations},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {5},
pages = {935--950},
year = {2018},
url = {https://doi.org/10.1142/S0129054118420121},
doi = {10.1142/S0129054118420121},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/NowotkaS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/OzelimC18,
author = {Luan Carlos de Sena Monteiro Ozelim and
Andr{\'{e}} Lu{\'{\i}}s Brasil Cavalcante},
title = {The Iota-Delta Function as an Alternative to Boolean Formalism},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {3},
pages = {415--424},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500120},
doi = {10.1142/S0129054118500120},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/OzelimC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/PoovanandranT18,
author = {Ghajendran Poovanandran and
Wen Chean Teh},
title = {On M-Equivalence and Strong M-Equivalence for Parikh Matrices},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {1},
pages = {123--138},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500065},
doi = {10.1142/S0129054118500065},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/PoovanandranT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/PotapovS18,
author = {Igor Potapov and
Pavel Semukhin},
title = {Preface},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {139--142},
year = {2018},
url = {https://doi.org/10.1142/S0129054118010013},
doi = {10.1142/S0129054118010013},
timestamp = {Wed, 18 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/PotapovS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/PoyiasPR18,
author = {Andreas Poyias and
Simon J. Puglisi and
Rajeev Raman},
title = {m-Bonsai: {A} Practical Compact Dynamic Trie},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {8},
pages = {1257--1278},
year = {2018},
url = {https://doi.org/10.1142/S0129054118430025},
doi = {10.1142/S0129054118430025},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/PoyiasPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/RoayaeiR18,
author = {Mehdy Roayaei and
Mohammadreza Razzazi},
title = {Parameterized Complexity of Directed Steiner Network with Respect
to Shared Vertices and Arcs},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1215--1230},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500302},
doi = {10.1142/S0129054118500302},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/RoayaeiR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Salikhov18,
author = {Kamil Salikhov},
title = {Improved Compression of {DNA} Sequencing Data with Cascading Bloom
Filters},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {8},
pages = {1249--1255},
year = {2018},
url = {https://doi.org/10.1142/S0129054118430013},
doi = {10.1142/S0129054118430013},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/Salikhov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ShiZQS18,
author = {Minjia Shi and
Hongwei Zhu and
Liqin Qian and
Patrick Sol{\'{e}}},
title = {On Self-Dual Four Circulant Codes},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1143--1150},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500259},
doi = {10.1142/S0129054118500259},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/ShiZQS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Teh18,
author = {Wen Chean Teh},
title = {Compositions of Functions and Permutations Specified by Minimal Reaction
Systems},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1165--1179},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500272},
doi = {10.1142/S0129054118500272},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Teh18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/TeixeiraFF18,
author = {Andreia Sofia Teixeira and
Francisco Fernandes and
Alexandre P. Francisco},
title = {SpliceTAPyR - An Efficient Method for Transcriptome Alignment},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {8},
pages = {1297--1310},
year = {2018},
url = {https://doi.org/10.1142/S0129054118430049},
doi = {10.1142/S0129054118430049},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/TeixeiraFF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Vorel18,
author = {Vojtech Vorel},
title = {On Basic Properties of Jumping Finite Automata},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {1},
pages = {1--16},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500016},
doi = {10.1142/S0129054118500016},
timestamp = {Wed, 18 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Vorel18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/WangGD18,
author = {Hong Wang and
Jie Guan and
Lin Ding},
title = {On Equivalence Relations of State Diagram of Cascade Connection of
an {LFSR} into an {NFSR}},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1107--1117},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500235},
doi = {10.1142/S0129054118500235},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/WangGD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/YanZYYK18,
author = {Shuo Yan and
Yun{-}Yong Zhang and
Binfeng Yan and
Lin Yan and
Jinfeng Kou},
title = {Data Associations Between Two Hierarchy Trees},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1181--1201},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500284},
doi = {10.1142/S0129054118500284},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/YanZYYK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ZhangZ18,
author = {Meng Zhang and
Yi Zhang},
title = {Space-Efficient Representations for Glushkov Automata},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {7},
pages = {1089--1105},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500223},
doi = {10.1142/S0129054118500223},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/ZhangZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ZhaoYZX18,
author = {Shuli Zhao and
Weihua Yang and
Shurong Zhang and
Liqiong Xu},
title = {Component Edge Connectivity of Hypercubes},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {6},
pages = {995--1001},
year = {2018},
url = {https://doi.org/10.1142/S012905411850017X},
doi = {10.1142/S012905411850017X},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/ZhaoYZX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ZhouGCZ18,
author = {Caixue Zhou and
Guangyong Gao and
Zongmin Cui and
Zhiqiang Zhao},
title = {Certificate-Based Generalized Ring Signcryption Scheme},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {6},
pages = {1063--1088},
year = {2018},
url = {https://doi.org/10.1142/S0129054118500211},
doi = {10.1142/S0129054118500211},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/ZhouGCZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-28 07:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
