Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AlmeidaZ07,
  author       = {Jorge Almeida and
                  Marc Zeitoun},
  title        = {An automata-theoretic approach to the word problem for omega -terms
                  over {R}},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {131--169},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.019},
  doi          = {10.1016/J.TCS.2006.10.019},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AlmeidaZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/AvigadY07,
  author       = {Jeremy Avigad and
                  Yimu Yin},
  title        = {Quantifier elimination for the reals with a predicate for the powers
                  of two},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {48--59},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.005},
  doi          = {10.1016/J.TCS.2006.10.005},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AvigadY07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BrandstadtLM07,
  author       = {Andreas Brandst{\"{a}}dt and
                  Van Bang Le and
                  Suhail Mahfud},
  title        = {New applications of clique separator decomposition for the Maximum
                  Weight Stable Set problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {229--239},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.035},
  doi          = {10.1016/J.TCS.2006.10.035},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BrandstadtLM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CatalanoG07,
  author       = {Dario Catalano and
                  Rosario Gennaro},
  title        = {Cramer-Damg{\aa}rd signatures revisited: Efficient flat-tree signatures
                  based on factoring},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {186--200},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.029},
  doi          = {10.1016/J.TCS.2006.10.029},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CatalanoG07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChandranR07,
  author       = {L. Sunil Chandran and
                  L. Shankar Ram},
  title        = {On the relationship between {ATSP} and the cycle cover problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {218--228},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.026},
  doi          = {10.1016/J.TCS.2006.10.026},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChandranR07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChengCY07,
  author       = {Yongxi Cheng and
                  Xi Chen and
                  Yiqun Lisa Yin},
  title        = {On searching a table consistent with division poset},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {240--253},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.027},
  doi          = {10.1016/J.TCS.2006.10.027},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChengCY07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FrosiniN07,
  author       = {Andrea Frosini and
                  Maurice Nivat},
  title        = {Binary matrices under the microscope: {A} tomographical problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {201--217},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.030},
  doi          = {10.1016/J.TCS.2006.10.030},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FrosiniN07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GajardoM07,
  author       = {Anah{\'{\i}} Gajardo and
                  Jacques Mazoyer},
  title        = {One Head Machines from a symbolic approach},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {34--47},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.004},
  doi          = {10.1016/J.TCS.2006.10.004},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GajardoM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GiakoumakisO07,
  author       = {Vassilis Giakoumakis and
                  Stephan Olariu},
  title        = {All minimal prime extensions of hereditary classes of graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {74--93},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.024},
  doi          = {10.1016/J.TCS.2006.10.024},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GiakoumakisO07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GlasserSZ07,
  author       = {Christian Gla{\ss}er and
                  Alan L. Selman and
                  Liyu Zhang},
  title        = {Canonical disjoint NP-pairs of propositional proof systems},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {60--73},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.006},
  doi          = {10.1016/J.TCS.2006.10.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GlasserSZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HanW07,
  author       = {Yo{-}Sub Han and
                  Derick Wood},
  title        = {Obtaining shorter regular expressions from finite-state automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {110--120},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.09.025},
  doi          = {10.1016/J.TCS.2006.09.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HanW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Hsieh07,
  author       = {Sun{-}Yuan Hsieh},
  title        = {Finding maximal leaf-agreement isomorphic descendent subtrees from
                  phylogenetic trees with different species},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {299--308},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.028},
  doi          = {10.1016/J.TCS.2006.10.028},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Hsieh07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KimP07,
  author       = {Jin Wook Kim and
                  Kunsoo Park},
  title        = {An efficient alignment algorithm for masked sequences},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {19--33},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.003},
  doi          = {10.1016/J.TCS.2006.10.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KimP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KubaP07,
  author       = {Markus Kuba and
                  Alois Panholzer},
  title        = {The left-right-imbalance of binary search trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {265--278},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.033},
  doi          = {10.1016/J.TCS.2006.10.033},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KubaP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Leupold07,
  author       = {Peter Leupold},
  title        = {Languages generated by iterated idempotency},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {170--185},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.021},
  doi          = {10.1016/J.TCS.2006.10.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Leupold07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LuTW07,
  author       = {Chi{-}Jen Lu and
                  Shi{-}Chun Tsai and
                  Hsin{-}Lung Wu},
  title        = {Improved hardness amplification in {NP}},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {293--298},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.009},
  doi          = {10.1016/J.TCS.2006.10.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LuTW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NicolasR07,
  author       = {Fran{\c{c}}ois Nicolas and
                  Eric Rivals},
  title        = {Longest common subsequence problem for unoriented and cyclic strings},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {1--18},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.002},
  doi          = {10.1016/J.TCS.2006.10.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NicolasR07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PanC07,
  author       = {Jun{-}Jie Pan and
                  Gerard J. Chang},
  title        = {Induced-path partition on graphs with special blocks},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {121--130},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.020},
  doi          = {10.1016/J.TCS.2006.10.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PanC07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Patt-Shamir07,
  author       = {Boaz Patt{-}Shamir},
  title        = {A note on efficient aggregate queries in sensor networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {254--264},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.032},
  doi          = {10.1016/J.TCS.2006.10.032},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Patt-Shamir07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PelcP07,
  author       = {Andrzej Pelc and
                  David Peleg},
  title        = {Feasibility and complexity of broadcasting with random transmission
                  failures},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {279--292},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.031},
  doi          = {10.1016/J.TCS.2006.10.031},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PelcP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SaundersT07,
  author       = {Shane Saunders and
                  Tadao Takaoka},
  title        = {Solving shortest paths efficiently on nearly acyclic directed graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {370},
  number       = {1-3},
  pages        = {94--109},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.10.008},
  doi          = {10.1016/J.TCS.2006.10.008},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/SaundersT07.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.