default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs302.bht:"
@article{DBLP:journals/tcs/BertoniCGL03, author = {Alberto Bertoni and Christian Choffrut and Massimiliano Goldwurm and Violetta Lonati}, title = {On the number of occurrences of a symbol in words of regular languages}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {431--456}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00892-7}, doi = {10.1016/S0304-3975(02)00892-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BertoniCGL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BiedlBDDHV03, author = {Therese Biedl and Jonathan F. Buss and Erik D. Demaine and Martin L. Demaine and Mohammad Taghi Hajiaghayi and Tom{\'{a}}s Vinar}, title = {Palindrome recognition using a multidimensional tape}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {475--480}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(03)00086-0}, doi = {10.1016/S0304-3975(03)00086-0}, timestamp = {Tue, 02 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BiedlBDDHV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BrlekL03, author = {Srecko Brlek and A. Ladouceur}, title = {A note on differentiable palindromes}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {167--178}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00746-6}, doi = {10.1016/S0304-3975(02)00746-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BrlekL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Chen03, author = {Jingchao Chen}, title = {Optimizing stable in-place merging}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {191--210}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00775-2}, doi = {10.1016/S0304-3975(02)00775-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Chen03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ClementiMS03, author = {Andrea E. F. Clementi and Angelo Monti and Riccardo Silvestri}, title = {Distributed broadcast in radio networks of unknown topology}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {337--364}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00851-4}, doi = {10.1016/S0304-3975(02)00851-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ClementiMS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CreignouD03, author = {Nadia Creignou and Herv{\'{e}} Daud{\'{e}}}, title = {Generalized satisfiability problems: minimal elements and phase transitions}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {417--430}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00890-3}, doi = {10.1016/S0304-3975(02)00890-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CreignouD03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CzumajGGKRZ03, author = {Artur Czumaj and Leszek Gasieniec and Daya Ram Gaur and Ramesh Krishnamurti and Wojciech Rytter and Michele Zito}, title = {On polynomial-time approximation algorithms for the variable length scheduling problem}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {489--495}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(03)00141-5}, doi = {10.1016/S0304-3975(03)00141-5}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CzumajGGKRZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Damaschke03, author = {Peter Damaschke}, title = {Nearly optimal strategies for special cases of on-line capital investment}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {35--44}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00727-2}, doi = {10.1016/S0304-3975(02)00727-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Damaschke03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Dang03, author = {Zhe Dang}, title = {Pushdown timed automata: a binary reachability characterization and safety verification}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {93--121}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00743-0}, doi = {10.1016/S0304-3975(02)00743-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Dang03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DomosiNR03, author = {P{\'{a}}l D{\"{o}}m{\"{o}}si and Chrystopher L. Nehaniv and John L. Rhodes}, title = {Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {295--317}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00848-4}, doi = {10.1016/S0304-3975(02)00848-4}, timestamp = {Thu, 29 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/DomosiNR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FishkinZ03, author = {Aleksei V. Fishkin and Guochuan Zhang}, title = {On maximizing the throughput of multiprocessor tasks}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {319--335}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00850-2}, doi = {10.1016/S0304-3975(02)00850-2}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FishkinZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HemaspaandraH03, author = {Lane A. Hemaspaandra and Harald Hempel}, title = {P-immune sets with holes lack self-reducibility properties}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {457--466}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00576-5}, doi = {10.1016/S0304-3975(02)00576-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraH03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Honkala03a, author = {Juha Honkala}, title = {Decidability results for Watson-Crick {D0L} systems with nonregular triggers}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {481--488}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(03)00087-2}, doi = {10.1016/S0304-3975(03)00087-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Honkala03a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Jansen03, author = {Klaus Jansen}, title = {Approximate strong separation with application in fractional graph coloring and preemptive scheduling}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {239--256}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00829-0}, doi = {10.1016/S0304-3975(02)00829-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Jansen03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JiangVL03, author = {Zhuhan Jiang and Olivier Y. de Vel and Bruce E. Litow}, title = {Unification and extension of weighted finite automata applicable to image compression}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {275--294}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00846-0}, doi = {10.1016/S0304-3975(02)00846-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/JiangVL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KarakostasLV03, author = {George Karakostas and Richard J. Lipton and Anastasios Viglas}, title = {On the complexity of intersecting finite state automata and {N} {L} versus {N} {P}}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {257--274}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00830-7}, doi = {10.1016/S0304-3975(02)00830-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KarakostasLV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KimKP03, author = {Dong Kyue Kim and Yoo Ah Kim and Kunsoo Park}, title = {Generalizations of suffix arrays to multi-dimensional matrices}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {223--238}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00828-9}, doi = {10.1016/S0304-3975(02)00828-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KimKP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KimKP03a, author = {Dong Kyue Kim and Yoo Ah Kim and Kunsoo Park}, title = {Generalizations of suffix arrays to multi-dimensional matrices}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {401--416}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00861-7}, doi = {10.1016/S0304-3975(02)00861-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KimKP03a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Mycka03, author = {Jerzy Mycka}, title = {mu -Recursion and infinite limits}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {123--133}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00744-2}, doi = {10.1016/S0304-3975(02)00744-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Mycka03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/NicolaL03, author = {Rocco De Nicola and Anna Labella}, title = {Nondeterministic regular expressions as solutions of equational systems}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {179--189}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00774-0}, doi = {10.1016/S0304-3975(02)00774-0}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/NicolaL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Okhotin03, author = {Alexander Okhotin}, title = {A recognition and parsing algorithm for arbitrary conjunctive grammars}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {365--399}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00853-8}, doi = {10.1016/S0304-3975(02)00853-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Okhotin03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Panholzer03, author = {Alois Panholzer}, title = {Analysis of multiple quickselect variants}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {45--91}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00729-6}, doi = {10.1016/S0304-3975(02)00729-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Panholzer03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Richomme03, author = {Gw{\'{e}}na{\"{e}}l Richomme}, title = {Conjugacy and episturmian morphisms}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {1--34}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00726-0}, doi = {10.1016/S0304-3975(02)00726-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Richomme03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Rytter03, author = {Wojciech Rytter}, title = {Application of Lempel-Ziv factorization to the approximation of grammar-based compression}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {211--222}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00777-6}, doi = {10.1016/S0304-3975(02)00777-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Rytter03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Tantau03, author = {Till Tantau}, title = {Query complexity of membership comparable sets}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {467--474}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(03)00082-3}, doi = {10.1016/S0304-3975(03)00082-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Tantau03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Vagvolgyi03a, author = {S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi}, title = {Term rewriting restricted to ground terms}, journal = {Theor. Comput. Sci.}, volume = {302}, number = {1-3}, pages = {135--165}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00745-4}, doi = {10.1016/S0304-3975(02)00745-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Vagvolgyi03a.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.