Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/Adian05,
  author       = {Sergei I. Adian},
  title        = {Divisibility problem for one relator monoids},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {3--6},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.003},
  doi          = {10.1016/J.TCS.2005.01.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Adian05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/AraujoB05,
  author       = {Isabel M. Ara{\'{u}}jo and
                  V{\'{e}}ronique Bruy{\`{e}}re},
  title        = {Sturmian words and a criterium by Michaux-Villemaire},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {88--102},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.010},
  doi          = {10.1016/J.TCS.2005.01.010},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AraujoB05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BagchiCK05,
  author       = {Amitabha Bagchi and
                  Amitabh Chaudhary and
                  Petr Kolman},
  title        = {Short length Menger's theorem and reliable optical routing},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {2-3},
  pages        = {315--332},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.03.009},
  doi          = {10.1016/J.TCS.2005.03.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BagchiCK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BazganEP05,
  author       = {Cristina Bazgan and
                  Bruno Escoffier and
                  Vangelis Th. Paschos},
  title        = {Completeness in standard and differential approximation classes: Poly-(D)APX-
                  and (D)PTAS-completeness},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {2-3},
  pages        = {272--292},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.03.007},
  doi          = {10.1016/J.TCS.2005.03.007},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BazganEP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChenFG05,
  author       = {Yijia Chen and
                  J{\"{o}}rg Flum and
                  Martin Grohe},
  title        = {Machine-based methods in parameterized complexity theory},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {2-3},
  pages        = {167--199},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.02.003},
  doi          = {10.1016/J.TCS.2005.02.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChenFG05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ConstantinescuI05,
  author       = {Sorin Constantinescu and
                  Lucian Ilie},
  title        = {Generalised fine and Wilf's theorem for arbitrary number of periods},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {49--60},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.007},
  doi          = {10.1016/J.TCS.2005.01.007},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ConstantinescuI05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Currie05,
  author       = {James D. Currie},
  title        = {Pattern avoidance: themes and variations},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {7--18},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.004},
  doi          = {10.1016/J.TCS.2005.01.004},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Currie05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DamaschkeZ05,
  author       = {Peter Damaschke and
                  Zhen Zhou},
  title        = {On queuing lengths in on-line switching},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {2-3},
  pages        = {333--343},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.03.025},
  doi          = {10.1016/J.TCS.2005.03.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DamaschkeZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Elder05,
  author       = {Murray J. Elder},
  title        = {A context-free and a 1-counter geodesic language for a Baumslag-Solitar
                  group},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {2-3},
  pages        = {344--371},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.03.026},
  doi          = {10.1016/J.TCS.2005.03.026},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Elder05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Frid05,
  author       = {Anna E. Frid},
  title        = {Sequences of linear arithmetical complexity},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {68--87},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.009},
  doi          = {10.1016/J.TCS.2005.01.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Frid05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GasieniecKP05,
  author       = {Leszek Gasieniec and
                  Roman M. Kolpakov and
                  Igor Potapov},
  title        = {Space efficient search for maximal repetitions},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {35--48},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.006},
  doi          = {10.1016/J.TCS.2005.01.006},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GasieniecKP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HarjuKR05,
  author       = {Tero Harju and
                  Juhani Karhum{\"{a}}ki and
                  Antonio Restivo},
  title        = {Preface},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {1--2},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.002},
  doi          = {10.1016/J.TCS.2005.01.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HarjuKR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HeJ05,
  author       = {Yong He and
                  Yiwei Jiang},
  title        = {Optimal semi-online preemptive algorithms for machine covering on
                  two uniform machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {2-3},
  pages        = {293--314},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.02.008},
  doi          = {10.1016/J.TCS.2005.02.008},
  timestamp    = {Thu, 28 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/HeJ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HivertNT05,
  author       = {Florent Hivert and
                  Jean{-}Christophe Novelli and
                  Jean{-}Yves Thibon},
  title        = {The algebra of binary search trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {129--165},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.012},
  doi          = {10.1016/J.TCS.2005.01.012},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HivertNT05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Holub05,
  author       = {Stepan Holub},
  title        = {A proof of the extended Duval's conjecture},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {61--67},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.008},
  doi          = {10.1016/J.TCS.2005.01.008},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Holub05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LeveR05,
  author       = {Florence Lev{\'{e}} and
                  Gw{\'{e}}na{\"{e}}l Richomme},
  title        = {On a conjecture about finite fixed points of morphisms},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {103--128},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.011},
  doi          = {10.1016/J.TCS.2005.01.011},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LeveR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LinHH05,
  author       = {Cheng{-}Kuan Lin and
                  Hua{-}Min Huang and
                  Lih{-}Hsing Hsu},
  title        = {The super connectivity of the pancake graphs and the super laceability
                  of the star graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {2-3},
  pages        = {257--271},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.02.007},
  doi          = {10.1016/J.TCS.2005.02.007},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LinHH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Maletti05,
  author       = {Andreas Maletti},
  title        = {{HASSE} diagrams for classes of deterministic bottom-up tree-to-tree-series
                  transformations},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {2-3},
  pages        = {200--240},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.02.005},
  doi          = {10.1016/J.TCS.2005.02.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Maletti05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RampersadSW05,
  author       = {Narad Rampersad and
                  Jeffrey O. Shallit and
                  Ming{-}wei Wang},
  title        = {Avoiding large squares in infinite binary words},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {1},
  pages        = {19--34},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.005},
  doi          = {10.1016/J.TCS.2005.01.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RampersadSW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Zhang05,
  author       = {Shengyu Zhang},
  title        = {On the power of Ambainis lower bounds},
  journal      = {Theor. Comput. Sci.},
  volume       = {339},
  number       = {2-3},
  pages        = {241--256},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.019},
  doi          = {10.1016/J.TCS.2005.01.019},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Zhang05.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.