default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs207.bht:"
@article{DBLP:journals/tcs/Anonymous98a, title = {List of R. V. Books's Publications}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {5--11}, year = {1998}, timestamp = {Wed, 19 Nov 2003 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Anonymous98a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BaierW98, author = {Herbert Baier and Klaus W. Wagner}, title = {Bounding Queries in the Analytic Polynomial-Time Hierarchy}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {89--104}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00057-7}, doi = {10.1016/S0304-3975(98)00057-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BaierW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BalcazarH98, author = {Jos{\'{e}} L. Balc{\'{a}}zar and Montserrat Hermo}, title = {The Structure of Logarithmic Advice Complexity Classes}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {217--244}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00066-8}, doi = {10.1016/S0304-3975(98)00066-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BalcazarH98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Brandenburg98, author = {Franz{-}Josef Brandenburg}, title = {The Ancestor Width of Grammars and Languages}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {25--41}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00054-1}, doi = {10.1016/S0304-3975(98)00054-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Brandenburg98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Cai98, author = {Jin{-}yi Cai}, title = {A Relation of Primal-Dual Lattices and the Complexity of Shortest Lattice Vector Problem}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {105--116}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00058-9}, doi = {10.1016/S0304-3975(98)00058-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Cai98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DuK98, author = {Ding{-}Zhu Du and Ker{-}I Ko}, title = {In Memoriam Ronald V. Book}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {1--3}, year = {1998}, timestamp = {Wed, 19 Nov 2003 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DuK98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DuWK98, author = {Xiufeng Du and Weili Wu and Dean F. Kelley}, title = {Approximations for Subset Interconnection Designs}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {171--180}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00062-0}, doi = {10.1016/S0304-3975(98)00062-0}, timestamp = {Thu, 02 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DuWK98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Gorbunov98, author = {Konstantin Yu. Gorbunov}, title = {On a Complexity of the Formula (\emph{A} vee \emph{B}) ==={\textgreater} \emph{C}}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {2}, pages = {383--386}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00074-7}, doi = {10.1016/S0304-3975(98)00074-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Gorbunov98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Kolmogorov98, author = {Andrei N. Kolmogorov}, title = {On Tables of Random Numbers (Reprinted from "Sankhya: The Indian Journal of Statistics", Series A, Vol. 25 Part 4, 1963)}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {2}, pages = {387--395}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00075-9}, doi = {10.1016/S0304-3975(98)00075-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Kolmogorov98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LinX98, author = {Guo{-}Hui Lin and Guoliang Xue}, title = {\emph{K}-Center and \emph{K}-Median Problems in Graded Distances}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {181--192}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00063-2}, doi = {10.1016/S0304-3975(98)00063-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LinX98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LorentzL98, author = {Amy K. Lorentz and Jack H. Lutz}, title = {Genericity and Randomness over Feasible Probability Measures}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {245--259}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00067-X}, doi = {10.1016/S0304-3975(98)00067-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LorentzL98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MacarieO98, author = {Ioan I. Macarie and Mitsunori Ogihara}, title = {Properties of Probabilistic Pushdown Automata}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {117--130}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00059-0}, doi = {10.1016/S0304-3975(98)00059-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MacarieO98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/McNaughton98a, author = {Robert McNaughton}, title = {Contributions of Ronald V. Book to the Theory of String-Rewriting Systems}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {13--23}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00053-X}, doi = {10.1016/S0304-3975(98)00053-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/McNaughton98a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Muchnik98, author = {Andrei A. Muchnik}, title = {On Common Information}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {2}, pages = {319--328}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00070-X}, doi = {10.1016/S0304-3975(98)00070-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Muchnik98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MuchnikSU98, author = {Andrei A. Muchnik and Alexei L. Semenov and Vladimir A. Uspensky}, title = {Mathematical Metaphysics of Randomness}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {2}, pages = {263--317}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00069-3}, doi = {10.1016/S0304-3975(98)00069-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MuchnikSU98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/NaikRRS98, author = {Ashish V. Naik and John D. Rogers and James S. Royer and Alan L. Selman}, title = {A Hierarchy Based on Output Multiplicity}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {131--157}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00060-7}, doi = {10.1016/S0304-3975(98)00060-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/NaikRRS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Otto98, author = {Friedrich Otto}, title = {Some Undecidability Results Concerning the Property of Preserving Regularity}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {43--72}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00055-3}, doi = {10.1016/S0304-3975(98)00055-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Otto98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SalomaaY98, author = {Kai Salomaa and Sheng Yu}, title = {Synchronization Expressions with Extended Join Operation}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {73--88}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00056-5}, doi = {10.1016/S0304-3975(98)00056-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/SalomaaY98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Vereshchagin98, author = {Nikolai K. Vereshchagin}, title = {Randomized Boolean Decision Trees: Several Remarks}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {2}, pages = {329--342}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00071-1}, doi = {10.1016/S0304-3975(98)00071-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Vereshchagin98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Vollmer98, author = {Heribert Vollmer}, title = {Relating Polynomial Time to Constant Depth}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {159--170}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00061-9}, doi = {10.1016/S0304-3975(98)00061-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Vollmer98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Vyugin98, author = {Vladimir V. V'yugin}, title = {Ergodic Theorems for Individual Random Sequences}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {2}, pages = {343--361}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00072-3}, doi = {10.1016/S0304-3975(98)00072-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Vyugin98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Vyugin98a, author = {Vladimir V. V'yugin}, title = {Non-Stochastic Infinite and Finite Sequences}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {2}, pages = {363--382}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00073-5}, doi = {10.1016/S0304-3975(98)00073-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Vyugin98a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Wan98a, author = {Peng{-}Jun Wan}, title = {Conflict-Free Channel Set Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {193--201}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00064-4}, doi = {10.1016/S0304-3975(98)00064-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Wan98a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/WangG98, author = {Jie Wang and Yaorong Ge}, title = {An Optimization Problem in Virtual Endoscopy}, journal = {Theor. Comput. Sci.}, volume = {207}, number = {1}, pages = {203--216}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)00065-6}, doi = {10.1016/S0304-3975(98)00065-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/WangG98.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.