Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AmbainisK03,
  author       = {Andris Ambainis and
                  Arnolds Kikusts},
  title        = {Exact results for accepting probabilities of quantum automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {3--25},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00393-6},
  doi          = {10.1016/S0304-3975(02)00393-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AmbainisK03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Atserias03,
  author       = {Albert Atserias},
  title        = {Improved bounds on the Weak Pigeonhole Principle and infinitely many
                  primes from weaker axioms},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {27--39},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00394-8},
  doi          = {10.1016/S0304-3975(02)00394-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Atserias03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BarrettHMRRS03,
  author       = {Christopher L. Barrett and
                  Harry B. Hunt III and
                  Madhav V. Marathe and
                  S. S. Ravi and
                  Daniel J. Rosenkrantz and
                  Richard Edwin Stearns},
  title        = {Reachability problems for sequential dynamical systems with threshold
                  functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {41--64},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00395-X},
  doi          = {10.1016/S0304-3975(02)00395-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BarrettHMRRS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Blaser03,
  author       = {Markus Bl{\"{a}}ser},
  title        = {The complexity of bivariate power series arithmetic},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {65--83},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00396-1},
  doi          = {10.1016/S0304-3975(02)00396-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Blaser03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BouajjaniHM03,
  author       = {Ahmed Bouajjani and
                  Peter Habermehl and
                  Richard Mayr},
  title        = {Automatic verification of recursive procedures with one integer parameter},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {85--106},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00397-3},
  doi          = {10.1016/S0304-3975(02)00397-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BouajjaniHM03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CautisMSWY03,
  author       = {Sabin Cautis and
                  Filippo Mignosi and
                  Jeffrey O. Shallit and
                  Ming{-}wei Wang and
                  Soroosh Yazdani},
  title        = {Periodicity, morphisms, and matrices},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {107--121},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00398-5},
  doi          = {10.1016/S0304-3975(02)00398-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CautisMSWY03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Crescenzo03,
  author       = {Giovanni Di Crescenzo},
  title        = {Sharing one secret vs. sharing many secrets},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {123--140},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00399-7},
  doi          = {10.1016/S0304-3975(02)00399-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Crescenzo03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DuriM03,
  author       = {Pavol Duris and
                  J{\'{a}}n Manuch},
  title        = {On the computational complexity of infinite words},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {141--151},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00400-0},
  doi          = {10.1016/S0304-3975(02)00400-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DuriM03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Fournier03a,
  author       = {Herv{\'{e}} Fournier},
  title        = {Quantifier rank for parity of embedded finite models},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {153--169},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00401-2},
  doi          = {10.1016/S0304-3975(02)00401-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Fournier03a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Geffert03,
  author       = {Viliam Geffert},
  title        = {Space hierarchy theorem revised},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {171--187},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00402-4},
  doi          = {10.1016/S0304-3975(02)00402-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Geffert03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GeffertMP03,
  author       = {Viliam Geffert and
                  Carlo Mereghetti and
                  Giovanni Pighizzini},
  title        = {Converting two-way nondeterministic unary automata into simpler automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {189--203},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00403-6},
  doi          = {10.1016/S0304-3975(02)00403-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GeffertMP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HoangT03,
  author       = {Thanh Minh Hoang and
                  Thomas Thierauf},
  title        = {The complexity of the characteristic and the minimal polynomial},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {205--222},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00404-8},
  doi          = {10.1016/S0304-3975(02)00404-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HoangT03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Kari03,
  author       = {Jarkko Kari},
  title        = {Synchronizing finite automata on Eulerian digraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {223--232},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00405-X},
  doi          = {10.1016/S0304-3975(02)00405-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Kari03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KleinK03,
  author       = {Andreas Klein and
                  Martin Kutrib},
  title        = {Fast one-way cellular automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {233--250},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00406-1},
  doi          = {10.1016/S0304-3975(02)00406-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KleinK03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KooLNST03,
  author       = {Chiu{-}Yuen Koo and
                  Tak Wah Lam and
                  Tsuen{-}Wan Ngan and
                  Kunihiko Sadakane and
                  Kar{-}Keung To},
  title        = {On-line scheduling with tight deadlines},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {251--261},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00407-3},
  doi          = {10.1016/S0304-3975(02)00407-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KooLNST03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KralKV03,
  author       = {Daniel Kr{\'{a}}l and
                  Jan Kratochv{\'{\i}}l and
                  Heinz{-}J{\"{u}}rgen Voss},
  title        = {Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {263--278},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00408-5},
  doi          = {10.1016/S0304-3975(02)00408-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KralKV03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KrumkePPS03,
  author       = {Sven Oliver Krumke and
                  Willem de Paepe and
                  Diana Poensgen and
                  Leen Stougie},
  title        = {News from the online traveling repairman},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {279--294},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00409-7},
  doi          = {10.1016/S0304-3975(02)00409-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KrumkePPS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PitermanV03,
  author       = {Nir Piterman and
                  Moshe Y. Vardi},
  title        = {From bidirectionality to alternation},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {295--321},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00410-3},
  doi          = {10.1016/S0304-3975(02)00410-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PitermanV03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Pudlak03,
  author       = {Pavel Pudl{\'{a}}k},
  title        = {On reducibility and symmetry of disjoint {NP} pairs},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {323--339},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00411-5},
  doi          = {10.1016/S0304-3975(02)00411-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Pudlak03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Santocanale03,
  author       = {Luigi Santocanale},
  title        = {On the equational definition of the least prefixed point},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {341--370},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00412-7},
  doi          = {10.1016/S0304-3975(02)00412-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Santocanale03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Sutner03a,
  author       = {Klaus Sutner},
  title        = {The size of power automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {371--386},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00413-9},
  doi          = {10.1016/S0304-3975(02)00413-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Sutner03a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Thimm03,
  author       = {Martin Thimm},
  title        = {On the approximability of the Steiner tree problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {295},
  pages        = {387--402},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00414-0},
  doi          = {10.1016/S0304-3975(02)00414-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Thimm03.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.