Search dblp for Publications

export results for "toc:db/journals/ipl/ipl136.bht:"

 download as .bib file

@article{DBLP:journals/ipl/AndreL18,
  author       = {{\'{E}}tienne Andr{\'{e}} and
                  Shang{-}Wei Lin},
  title        = {The language preservation problem is undecidable for parametric event-recording
                  automata},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {17--20},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.013},
  doi          = {10.1016/J.IPL.2018.03.013},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/AndreL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Chen18a,
  author       = {Jing Chen},
  title        = {The pessimistic diagnosability of Split-Star Networks under the {PMC}
                  model},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {80--82},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.008},
  doi          = {10.1016/J.IPL.2018.03.008},
  timestamp    = {Mon, 23 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Chen18a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ChenN18,
  author       = {Meirun Chen and
                  Reza Naserasr},
  title        = {The optimal routing of augmented cubes},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {59--63},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.04.003},
  doi          = {10.1016/J.IPL.2018.04.003},
  timestamp    = {Mon, 23 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ChenN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/DwivediMSD18,
  author       = {Ashutosh Dhar Dwivedi and
                  Pawel Morawiecki and
                  Rajani Singh and
                  Shalini Dhar},
  title        = {Differential-linear and related key cryptanalysis of round-reduced
                  scream},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {5--8},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.010},
  doi          = {10.1016/J.IPL.2018.03.010},
  timestamp    = {Thu, 23 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/DwivediMSD18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/GaoG18,
  author       = {Hang Gao and
                  Wenyu Gao},
  title        = {Maximum matching and kernelization of edge dominating set},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {21--24},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.019},
  doi          = {10.1016/J.IPL.2018.03.019},
  timestamp    = {Mon, 23 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GaoG18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/HoffmannKW18,
  author       = {Stefan Hoffmann and
                  Thomas Kampermann and
                  Egon Wanke},
  title        = {Minimizing the number of max-power users in ad-hoc wireless networks
                  with minimum node degree requirements},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {25--29},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.015},
  doi          = {10.1016/J.IPL.2018.03.015},
  timestamp    = {Sat, 11 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/HoffmannKW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/HuberMSS18,
  author       = {Katharina T. Huber and
                  Vincent Moulton and
                  Marie{-}France Sagot and
                  Blerina Sinaimeri},
  title        = {Geometric medians in reconciliation spaces of phylogenetic trees},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {96--101},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.04.001},
  doi          = {10.1016/J.IPL.2018.04.001},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/HuberMSS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LauriaT18,
  author       = {Massimo Lauria and
                  Neil Thapen},
  title        = {On semantic cutting planes with very small coefficients},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {70--75},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.04.007},
  doi          = {10.1016/J.IPL.2018.04.007},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LauriaT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LiLL18,
  author       = {Xiaomin Li and
                  Lan Lei and
                  Hong{-}Jian Lai},
  title        = {The connectivity of generalized graph products},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {37--40},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.014},
  doi          = {10.1016/J.IPL.2018.03.014},
  timestamp    = {Mon, 23 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LiLL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LinFWCFL18,
  author       = {Mugang Lin and
                  Qilong Feng and
                  Jianxin Wang and
                  Jianer Chen and
                  Bin Fu and
                  Wenjun Li},
  title        = {An improved {FPT} algorithm for Almost Forest Deletion problem},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {30--36},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.016},
  doi          = {10.1016/J.IPL.2018.03.016},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LinFWCFL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LuWXS18,
  author       = {Kejing Lu and
                  Hongya Wang and
                  Yingyuan Xiao and
                  Hui Song},
  title        = {Why locality sensitive hashing works: {A} practical perspective},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {49--58},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.018},
  doi          = {10.1016/J.IPL.2018.03.018},
  timestamp    = {Mon, 23 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LuWXS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LucasG18,
  author       = {Salvador Lucas and
                  Ra{\'{u}}l Guti{\'{e}}rrez},
  title        = {Use of logical models for proving infeasibility in term rewriting},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {90--95},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.04.002},
  doi          = {10.1016/J.IPL.2018.04.002},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/LucasG18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/MaY18,
  author       = {Fei Ma and
                  Bing Yao},
  title        = {The number of spanning trees of a class of self-similar fractal models},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {64--69},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.04.004},
  doi          = {10.1016/J.IPL.2018.04.004},
  timestamp    = {Mon, 23 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/MaY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Meir18,
  author       = {Or Meir},
  title        = {The direct sum of universal relations},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {105--111},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.04.009},
  doi          = {10.1016/J.IPL.2018.04.009},
  timestamp    = {Sat, 11 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Meir18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ShenWF18,
  author       = {Lin{-}Zhi Shen and
                  Jiejing Wen and
                  Fang{-}Wei Fu},
  title        = {A new class of zero-difference balanced functions},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {9--11},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.011},
  doi          = {10.1016/J.IPL.2018.03.011},
  timestamp    = {Mon, 21 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ShenWF18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/SmalT18,
  author       = {Alexander V. Smal and
                  Navid Talebanfard},
  title        = {Prediction from partial information and hindsight, an alternative
                  proof},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {102--104},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.04.011},
  doi          = {10.1016/J.IPL.2018.04.011},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/SmalT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/YangLZZ18,
  author       = {Mengduo Yang and
                  Fanzhang Li and
                  Li Zhang and
                  Zhao Zhang},
  title        = {Deep learning algorithm with visual impression},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {1--4},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.004},
  doi          = {10.1016/J.IPL.2018.03.004},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/YangLZZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/YangLZZ18a,
  author       = {Mengduo Yang and
                  Fanzhang Li and
                  Li Zhang and
                  Zhao Zhang},
  title        = {Lie group impression for deep learning},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {12--16},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.006},
  doi          = {10.1016/J.IPL.2018.03.006},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/YangLZZ18a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Zhang18,
  author       = {Hailiang Zhang},
  title        = {On the largest matching roots of graphs with cut edges},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {41--43},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.02.002},
  doi          = {10.1016/J.IPL.2018.02.002},
  timestamp    = {Sat, 11 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Zhang18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ZhangLLZ18,
  author       = {Xin Zhang and
                  Jingfen Lan and
                  Bi Li and
                  Qiang Zhu},
  title        = {Light paths and edges in families of outer-1-planar graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {83--89},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.04.008},
  doi          = {10.1016/J.IPL.2018.04.008},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ZhangLLZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ZhuD18,
  author       = {Chuangying Zhu and
                  Junping Du},
  title        = {Background feature clustering and its application to social text},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {44--48},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.017},
  doi          = {10.1016/J.IPL.2018.03.017},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ZhuD18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Zunic18,
  author       = {Anastazia Zunic},
  title        = {Shape diameter for object analysis},
  journal      = {Inf. Process. Lett.},
  volume       = {136},
  pages        = {76--79},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ipl.2018.03.012},
  doi          = {10.1016/J.IPL.2018.03.012},
  timestamp    = {Sun, 12 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Zunic18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.