Search dblp for Publications

export results for "toc:db/journals/tcs/tcs978.bht:"

 download as .bib file

@article{DBLP:journals/tcs/AlbouyFRT23,
  author       = {Timoth{\'{e}} Albouy and
                  Davide Frey and
                  Michel Raynal and
                  Fran{\c{c}}ois Ta{\"{\i}}ani},
  title        = {Asynchronous Byzantine reliable broadcast with a message adversary},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114110},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114110},
  doi          = {10.1016/J.TCS.2023.114110},
  timestamp    = {Fri, 27 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AlbouyFRT23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/AlzamelHILPVW23,
  author       = {Mai Alzamel and
                  Christopher Hampson and
                  Costas S. Iliopoulos and
                  Zara Lim and
                  Solon P. Pissis and
                  Dimitrios Vlachakis and
                  Steven Watts},
  title        = {Maximal degenerate palindromes with gaps and mismatches},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114182},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114182},
  doi          = {10.1016/J.TCS.2023.114182},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AlzamelHILPVW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BlumrosenM23,
  author       = {Liad Blumrosen and
                  Yehonatan Mizrahi},
  title        = {How bad is the merger paradox?},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114157},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114157},
  doi          = {10.1016/J.TCS.2023.114157},
  timestamp    = {Mon, 16 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BlumrosenM23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BonatoMMN23,
  author       = {Anthony Bonato and
                  Trent G. Marbach and
                  Michael Molnar and
                  JD Nir},
  title        = {The one-visibility localization game},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114186},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114186},
  doi          = {10.1016/J.TCS.2023.114186},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BonatoMMN23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BuschCHPPS23,
  author       = {Costas Busch and
                  Bogdan S. Chlebus and
                  Maurice Herlihy and
                  Miroslav Popovic and
                  Pavan Poudel and
                  Gokarna Sharma},
  title        = {Flexible scheduling of transactional memory on trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114184},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114184},
  doi          = {10.1016/J.TCS.2023.114184},
  timestamp    = {Mon, 16 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BuschCHPPS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DahiyaM23,
  author       = {Yogesh Dahiya and
                  Meena Mahajan},
  title        = {On (simple) decision tree rank},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114177},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114177},
  doi          = {10.1016/J.TCS.2023.114177},
  timestamp    = {Mon, 16 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DahiyaM23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GalbyMSST23,
  author       = {Esther Galby and
                  D{\'{a}}niel Marx and
                  Philipp Schepper and
                  Roohani Sharma and
                  Prafullkumar Tale},
  title        = {Parameterized complexity of multicut in weighted trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114174},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114174},
  doi          = {10.1016/J.TCS.2023.114174},
  timestamp    = {Fri, 27 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GalbyMSST23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Horsch23,
  author       = {Florian H{\"{o}}rsch},
  title        = {On orientations maximizing total arc-connectivity},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114176},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114176},
  doi          = {10.1016/J.TCS.2023.114176},
  timestamp    = {Mon, 16 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Horsch23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ItoKMOSSUUYY23,
  author       = {Takehiro Ito and
                  Jun Kawahara and
                  Shin{-}ichi Minato and
                  Yota Otachi and
                  Toshiki Saitoh and
                  Akira Suzuki and
                  Ryuhei Uehara and
                  Takeaki Uno and
                  Katsuhisa Yamanaka and
                  Ryo Yoshinaka},
  title        = {Sorting balls and water: Equivalence and computational complexity},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114158},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114158},
  doi          = {10.1016/J.TCS.2023.114158},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ItoKMOSSUUYY23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/OmeradzicB23,
  author       = {Amir Omeradzic and
                  Hans{-}Georg Beyer},
  title        = {Progress analysis of a multi-recombinative evolution strategy on the
                  highly multimodal Rastrigin function},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114179},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114179},
  doi          = {10.1016/J.TCS.2023.114179},
  timestamp    = {Wed, 01 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/OmeradzicB23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PramanickSPM23,
  author       = {Subhajit Pramanick and
                  Sai Vamshi Samala and
                  Debasish Pattanayak and
                  Partha Sarathi Mandal},
  title        = {Distributed algorithms for filling {MIS} vertices of an arbitrary
                  graph by myopic luminous robots},
  journal      = {Theor. Comput. Sci.},
  volume       = {978},
  pages        = {114187},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.114187},
  doi          = {10.1016/J.TCS.2023.114187},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PramanickSPM23.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.