Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/ipl/AntoniadisHKS22,
  author       = {Antonios Antoniadis and
                  Ruben Hoeksma and
                  S{\'{a}}ndor Kisfaludi{-}Bak and
                  Kevin Schewior},
  title        = {Online search for a hyperplane in high-dimensional Euclidean space},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106262},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106262},
  doi          = {10.1016/J.IPL.2022.106262},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/AntoniadisHKS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Bhateja22,
  author       = {Puneet Bhateja},
  title        = {Determining asynchronous test equivalence for probabilistic processes},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106269},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106269},
  doi          = {10.1016/J.IPL.2022.106269},
  timestamp    = {Wed, 01 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Bhateja22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BhattacharyaFJ22,
  author       = {Anup Bhattacharya and
                  Yoav Freund and
                  Ragesh Jaiswal},
  title        = {On the \emph{k}-means/median cost function},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106252},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106252},
  doi          = {10.1016/J.IPL.2022.106252},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BhattacharyaFJ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ChenST22,
  author       = {Da{-}Ren Chen and
                  Min{-}Zheng Shieh and
                  Shi{-}Chun Tsai},
  title        = {The complexity of comparing optimal solutions},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106266},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106266},
  doi          = {10.1016/J.IPL.2022.106266},
  timestamp    = {Mon, 13 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ChenST22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/CoutoCJS22,
  author       = {Fernanda Couto and
                  Lu{\'{\i}}s Felipe I. Cunha and
                  Daniel Juventude and
                  Leandro Santiago},
  title        = {Strategies for generating tree spanners: Algorithms, heuristics and
                  optimal graph classes},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106265},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106265},
  doi          = {10.1016/J.IPL.2022.106265},
  timestamp    = {Mon, 13 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CoutoCJS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Deng22,
  author       = {Shichuan Deng},
  title        = {On clustering with discounts},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106272},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106272},
  doi          = {10.1016/J.IPL.2022.106272},
  timestamp    = {Mon, 13 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Deng22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/GadducciS22,
  author       = {Fabio Gadducci and
                  Francesco Santini},
  title        = {Distributivity and residuation for lexicographic orders},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106271},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106271},
  doi          = {10.1016/J.IPL.2022.106271},
  timestamp    = {Mon, 13 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GadducciS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/GaikwadM22,
  author       = {Ajinkya Gaikwad and
                  Soumen Maity},
  title        = {Globally minimal defensive alliances},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106253},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106253},
  doi          = {10.1016/J.IPL.2022.106253},
  timestamp    = {Wed, 01 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GaikwadM22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/IndzhevK22,
  author       = {Emil Indzhev and
                  Stefan Kiefer},
  title        = {On complementing unambiguous automata and graphs with many cliques
                  and cocliques},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106270},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106270},
  doi          = {10.1016/J.IPL.2022.106270},
  timestamp    = {Wed, 01 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/IndzhevK22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/JainPV22,
  author       = {Vishesh Jain and
                  Huy Tuan Pham and
                  Thuy{-}Duong Vuong},
  title        = {Spectral independence, coupling, and the spectral gap of the Glauber
                  dynamics},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106268},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106268},
  doi          = {10.1016/J.IPL.2022.106268},
  timestamp    = {Mon, 13 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/JainPV22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/KrauthgamerS22,
  author       = {Robert Krauthgamer and
                  Shay Sapir},
  title        = {Smoothness of Schatten norms and sliding-window matrix streams},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106254},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106254},
  doi          = {10.1016/J.IPL.2022.106254},
  timestamp    = {Mon, 13 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/KrauthgamerS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LuyKC22,
  author       = {Erkam L{\"{u}}y and
                  Zekeriya Y. Karatas and
                  Olcay Ciftci},
  title        = {Comment on "An enhanced and secured {RSA} public cryptosystem algorithm
                  using Chinese remainder theorem (ESRPKC)"},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106263},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106263},
  doi          = {10.1016/J.IPL.2022.106263},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LuyKC22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/SmythC22,
  author       = {Ben Smyth and
                  Michael R. Clarkson},
  title        = {Surveying definitions of election verifiability},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106267},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106267},
  doi          = {10.1016/J.IPL.2022.106267},
  timestamp    = {Wed, 01 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/SmythC22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Zimmermann22,
  author       = {Martin Zimmermann},
  title        = {Approximating the minimal lookahead needed to win infinite games},
  journal      = {Inf. Process. Lett.},
  volume       = {177},
  pages        = {106264},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ipl.2022.106264},
  doi          = {10.1016/J.IPL.2022.106264},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Zimmermann22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.