Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/BoyarP08,
  author       = {Joan Boyar and
                  Ren{\'{e}} Peralta},
  title        = {Tight bounds for the multiplicative complexity of symmetric functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {223--246},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.030},
  doi          = {10.1016/J.TCS.2008.01.030},
  timestamp    = {Fri, 03 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BoyarP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BussH08,
  author       = {Samuel R. Buss and
                  Jan Hoffmann},
  title        = {The NP-hardness of finding a directed acyclic graph for regular resolution},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {271--276},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.039},
  doi          = {10.1016/J.TCS.2008.01.039},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BussH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChS08,
  author       = {Eric Goles Ch. and
                  Luis Salinas},
  title        = {Comparison between parallel and serial dynamics of Boolean networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {247--253},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2007.09.008},
  doi          = {10.1016/J.TCS.2007.09.008},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChandlerCKLP08,
  author       = {David B. Chandler and
                  Maw{-}Shang Chang and
                  Ton Kloks and
                  Jiping Liu and
                  Sheng{-}Lung Peng},
  title        = {Partitioned probe comparability graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {212--222},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.038},
  doi          = {10.1016/J.TCS.2008.01.038},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChandlerCKLP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChenDYF08,
  author       = {Ying{-}You Chen and
                  Dyi{-}Rong Duh and
                  Tai{-}Ling Ye and
                  Jung{-}Sheng Fu},
  title        = {Weak-vertex-pancyclicity of (n, k)-star graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {191--199},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.035},
  doi          = {10.1016/J.TCS.2008.01.035},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChenDYF08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChenMY08,
  author       = {Wenbin Chen and
                  Jiangtao Meng and
                  Dengpan Yin},
  title        = {An improved lower bound for approximating minimum {GCD} multiplier
                  in l\({}_{\mbox{infinity}}\) norm (GCDM\({}_{\mbox{infinity}}\))},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {1--9},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2007.09.030},
  doi          = {10.1016/J.TCS.2007.09.030},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChenMY08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CouceiroP08,
  author       = {Miguel Couceiro and
                  Maurice Pouzet},
  title        = {On a quasi-ordering on Boolean functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {71--87},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.025},
  doi          = {10.1016/J.TCS.2008.01.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CouceiroP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Currie08,
  author       = {James D. Currie},
  title        = {Palindrome positions in ternary square-free words},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {254--257},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2007.09.015},
  doi          = {10.1016/J.TCS.2007.09.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Currie08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DefagoS08,
  author       = {Xavier D{\'{e}}fago and
                  Samia Souissi},
  title        = {Non-uniform circle formation algorithm for oblivious mobile robots
                  with convergence toward uniformity},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {97--112},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.050},
  doi          = {10.1016/J.TCS.2008.01.050},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DefagoS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DukesFMV08,
  author       = {W. M. B. Dukes and
                  Mark F. Flanagan and
                  Toufik Mansour and
                  Vincent Vajnovszki},
  title        = {Combinatorial Gray codes for classes of pattern avoiding permutations},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {35--49},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2007.12.002},
  doi          = {10.1016/J.TCS.2007.12.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DukesFMV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DunneC08,
  author       = {Paul E. Dunne and
                  Yann Chevaleyre},
  title        = {The complexity of deciding reachability properties of distributed
                  negotiation schemes},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {113--144},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.031},
  doi          = {10.1016/J.TCS.2008.01.031},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DunneC08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EscoffierM08,
  author       = {Bruno Escoffier and
                  J{\'{e}}r{\^{o}}me Monnot},
  title        = {A better differential approximation ratio for symmetric {TSP}},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {63--70},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.002},
  doi          = {10.1016/J.TCS.2008.01.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EscoffierM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FennerLL08,
  author       = {Trevor I. Fenner and
                  Mark Levene and
                  George Loizou},
  title        = {Modelling the navigation potential of a web page},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {88--96},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.026},
  doi          = {10.1016/J.TCS.2008.01.026},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FennerLL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HungT08,
  author       = {Regant Y. S. Hung and
                  H. F. Ting},
  title        = {Competitive analysis of most-request-first for scheduling broadcasts
                  with start-up delay},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {200--211},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.036},
  doi          = {10.1016/J.TCS.2008.01.036},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HungT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/IraniL08,
  author       = {Sandy Irani and
                  Vitus J. Leung},
  title        = {Probabilistic analysis for scheduling with conflicts},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {158--179},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.027},
  doi          = {10.1016/J.TCS.2008.01.027},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/IraniL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KariS08,
  author       = {Lila Kari and
                  Petr Sos{\'{\i}}k},
  title        = {On the weight of universal insertion grammars},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {264--270},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.037},
  doi          = {10.1016/J.TCS.2008.01.037},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/KariS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LiZ08,
  author       = {Xueliang Li and
                  Wenli Zhou},
  title        = {The 2nd-order conditional 3-coloring of claw-free graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {151--157},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.034},
  doi          = {10.1016/J.TCS.2008.01.034},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LiZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LiuL08,
  author       = {Guizhen Liu and
                  Ping Li},
  title        = {Paths in circuit graphs of matroids},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {258--263},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.033},
  doi          = {10.1016/J.TCS.2008.01.033},
  timestamp    = {Wed, 25 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LiuL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LiuY08,
  author       = {Longcheng Liu and
                  Enyu Yao},
  title        = {Inverse min-max spanning tree problem under the Weighted sum-type
                  Hamming distance},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {28--34},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2007.12.006},
  doi          = {10.1016/J.TCS.2007.12.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LiuY08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LuZY08,
  author       = {Lingfa Lu and
                  Liqi Zhang and
                  Jinjiang Yuan},
  title        = {The unbounded parallel batch machine scheduling with release dates
                  and rejection to minimize makespan},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {283--289},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.02.015},
  doi          = {10.1016/J.TCS.2008.02.015},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LuZY08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Myung08,
  author       = {Young{-}Soo Myung},
  title        = {On the clique partitioning problem in weighted interval graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {290--293},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.02.016},
  doi          = {10.1016/J.TCS.2008.02.016},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Myung08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Neven08,
  author       = {Gregory Neven},
  title        = {A simple transitive signature scheme for directed trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {277--282},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.042},
  doi          = {10.1016/J.TCS.2008.01.042},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Neven08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SalinasG08,
  author       = {Luis Salinas and
                  Eric Goles Ch.},
  title        = {Covering by squares},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {10--27},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2007.10.044},
  doi          = {10.1016/J.TCS.2007.10.044},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/SalinasG08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ShiehT08,
  author       = {Min{-}Zheng Shieh and
                  Shi{-}Chun Tsai},
  title        = {Jug measuring: Algorithms and complexity},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {50--62},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.003},
  doi          = {10.1016/J.TCS.2008.01.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ShiehT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Verbitsky08,
  author       = {Oleg Verbitsky},
  title        = {On the obfuscation complexity of planar graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {294--300},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.02.032},
  doi          = {10.1016/J.TCS.2008.02.032},
  timestamp    = {Thu, 13 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Verbitsky08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WangPWCFW08,
  author       = {Chen Wang and
                  Myung Ah Park and
                  James Willson and
                  Yongxi Cheng and
                  Andras Farago and
                  Weili Wu},
  title        = {On approximate optimal dual power assignment for biconnectivity and
                  edge-biconnectivity},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {180--190},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.029},
  doi          = {10.1016/J.TCS.2008.01.029},
  timestamp    = {Thu, 02 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WangPWCFW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Yuster08,
  author       = {Raphael Yuster},
  title        = {All-pairs disjoint paths from a common ancestor in O{\textasciitilde}(n\({}^{\mbox{infinit}}\))
                  time},
  journal      = {Theor. Comput. Sci.},
  volume       = {396},
  number       = {1-3},
  pages        = {145--150},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.01.032},
  doi          = {10.1016/J.TCS.2008.01.032},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Yuster08.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.