Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs296.bht:"
@article{DBLP:journals/tcs/AichholzerAHK03, author = {Oswin Aichholzer and Franz Aurenhammer and Ferran Hurtado and Hannes Krasser}, title = {Towards compatible triangulations}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {3--13}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00428-0}, doi = {10.1016/S0304-3975(02)00428-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AichholzerAHK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ArenasBCHRS03, author = {Marcelo Arenas and Leopoldo E. Bertossi and Jan Chomicki and Xin He and Vijay Raghavan and Jeremy P. Spinrad}, title = {Scalar aggregation in inconsistent databases}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {3}, pages = {405--434}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00737-5}, doi = {10.1016/S0304-3975(02)00737-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ArenasBCHRS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BesozziMPZ03, author = {Daniela Besozzi and Giancarlo Mauri and Gheorghe Paun and Claudio Zandron}, title = {Gemmating {P} systems: collapsing hierarchies}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {2}, pages = {253--267}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00657-6}, doi = {10.1016/S0304-3975(02)00657-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BesozziMPZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CaiB03, author = {Jin{-}yi Cai and Eric Bach}, title = {On testing for zero polynomials by a set of points with bounded precision}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {15--25}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00429-2}, doi = {10.1016/S0304-3975(02)00429-2}, timestamp = {Wed, 01 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CaiB03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Caucal03a, author = {Didier Caucal}, title = {On the transition graphs of turing machines}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {2}, pages = {195--223}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00655-2}, doi = {10.1016/S0304-3975(02)00655-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Caucal03a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChanLTW03, author = {Wun{-}Tat Chan and Tak Wah Lam and Hing{-}Fung Ting and Prudence W. H. Wong}, title = {On-line stream merging in a general setting}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {27--46}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00430-9}, doi = {10.1016/S0304-3975(02)00430-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChanLTW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CheongSV03, author = {Otfried Cheong and Chan{-}Su Shin and Antoine Vigneron}, title = {Computing farthest neighbors on a convex polytope}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {47--58}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00431-0}, doi = {10.1016/S0304-3975(02)00431-0}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CheongSV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DangIK03, author = {Zhe Dang and Oscar H. Ibarra and Richard A. Kemmerer}, title = {Generalized discrete timed automata: decidable approximations for safety verificatio}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {59--74}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00432-2}, doi = {10.1016/S0304-3975(02)00432-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DangIK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DuncanQVZ03, author = {Rob Duncan and Jianbo Qian and Antoine Vigneron and Binhai Zhu}, title = {Polynomial time algorithms for three-label point labeling}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {75--87}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00433-4}, doi = {10.1016/S0304-3975(02)00433-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DuncanQVZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/EdmondsGLM03, author = {Jeff Edmonds and Jarek Gryz and Dongming Liang and Ren{\'{e}}e J. Miller}, title = {Mining for empty spaces in large data sets}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {3}, pages = {435--452}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00738-7}, doi = {10.1016/S0304-3975(02)00738-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/EdmondsGLM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Fernau03a, author = {Henning Fernau}, title = {Nonterminal complexity of programmed grammars}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {2}, pages = {225--251}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00656-4}, doi = {10.1016/S0304-3975(02)00656-4}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Fernau03a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Frisco03, author = {Pierluigi Frisco}, title = {Direct constructions of universal extended {H} systems}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {2}, pages = {269--293}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00658-8}, doi = {10.1016/S0304-3975(02)00658-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Frisco03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GrahneT03, author = {G{\"{o}}sta Grahne and Alex Thomo}, title = {Algebraic rewritings for optimizing regular path queries}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {3}, pages = {453--471}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00739-9}, doi = {10.1016/S0304-3975(02)00739-9}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GrahneT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HerrmannM03, author = {Francine Herrmann and Maurice Margenstern}, title = {A universal cellular automaton in the hyperbolic plane}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {2}, pages = {327--364}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00660-6}, doi = {10.1016/S0304-3975(02)00660-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HerrmannM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Hesse03, author = {William Hesse}, title = {The dynamic complexity of transitive closure is in DynTC\({}^{\mbox{0}}\)}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {3}, pages = {473--485}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00740-5}, doi = {10.1016/S0304-3975(02)00740-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Hesse03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HsuM03, author = {Wen{-}Lian Hsu and Ross M. McConnell}, title = {{PC} trees and circular-ones arrangements}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {99--116}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00435-8}, doi = {10.1016/S0304-3975(02)00435-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HsuM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KangQSD03, author = {Liying Kang and Hong Qiao and Erfang Shan and Ding{-}Zhu Du}, title = {Lower bounds on the minus domination and k-subdomination numbers}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {89--98}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00434-6}, doi = {10.1016/S0304-3975(02)00434-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KangQSD03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Koucky03, author = {Michal Kouck{\'{y}}}, title = {Log-space constructible universal traversal sequences for cycles of length O(n\({}^{\mbox{4.03}}\))}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {117--144}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00436-X}, doi = {10.1016/S0304-3975(02)00436-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Koucky03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Li03a, author = {Xiang{-}Yang Li}, title = {Generating well-shaped d-dimensional Delaunay Meshes}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {145--165}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00437-1}, doi = {10.1016/S0304-3975(02)00437-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Li03a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Libkin03, author = {Leonid Libkin}, title = {Expressive power of {SQL}}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {3}, pages = {379--404}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00736-3}, doi = {10.1016/S0304-3975(02)00736-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Libkin03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Manthey03, author = {Bodo Manthey}, title = {Non-approximability of weighted multiple sequence alignment}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {179--192}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00439-5}, doi = {10.1016/S0304-3975(02)00439-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Manthey03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Martin-VidePPR03, author = {Carlos Mart{\'{\i}}n{-}Vide and Gheorghe Paun and Juan Pazos and Alfonso Rodr{\'{\i}}guez{-}Pat{\'{o}}n}, title = {Tissue {P} systems}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {2}, pages = {295--326}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00659-X}, doi = {10.1016/S0304-3975(02)00659-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Martin-VidePPR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/NardelliPW03, author = {Enrico Nardelli and Guido Proietti and Peter Widmayer}, title = {Finding the most vital node of a shortest path}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {167--177}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00438-3}, doi = {10.1016/S0304-3975(02)00438-3}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/NardelliPW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Poon03, author = {Chung Keung Poon}, title = {Dynamic orthogonal range queries in {OLAP}}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {3}, pages = {487--510}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00741-7}, doi = {10.1016/S0304-3975(02)00741-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Poon03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SinhaBC03, author = {Rakesh K. Sinha and Randeep Bhatia and Chung{-}Min Chen}, title = {Asymptotically optimal declustering schemes for 2-dim range queries}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {3}, pages = {511--534}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00742-9}, doi = {10.1016/S0304-3975(02)00742-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/SinhaBC03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Sutner03, author = {Klaus Sutner}, title = {Cellular automata and intermediate degrees}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {2}, pages = {365--375}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(02)00661-8}, doi = {10.1016/S0304-3975(02)00661-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Sutner03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Wang03, author = {Jie Wang}, title = {Preface}, journal = {Theor. Comput. Sci.}, volume = {296}, number = {1}, pages = {1--2}, year = {2003}, timestamp = {Wed, 19 Nov 2003 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Wang03.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.