Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs384.bht:"
@article{DBLP:journals/tcs/ArpeR07, author = {Jan Arpe and R{\"{u}}diger Reischuk}, title = {Learning juntas in the presence of noise}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {2--21}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.014}, doi = {10.1016/J.TCS.2007.05.014}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ArpeR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BermondBC07, author = {Jean{-}Claude Bermond and Laurent Braud and David Coudert}, title = {Traffic grooming on the path}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {139--151}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.028}, doi = {10.1016/J.TCS.2007.04.028}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BermondBC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CaiC07, author = {Jin{-}yi Cai and Vinay Choudhary}, title = {Valiant's Holant Theorem and matchgate tensors}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {22--32}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.015}, doi = {10.1016/J.TCS.2007.05.015}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CaiC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CaragiannisFKP07, author = {Ioannis Caragiannis and Aleksei V. Fishkin and Christos Kaklamanis and Evi Papaioannou}, title = {A tight bound for online colouring of disk graphs}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {152--160}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.025}, doi = {10.1016/J.TCS.2007.04.025}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CaragiannisFKP07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ClementiILMRS07, author = {Andrea E. F. Clementi and Miriam Di Ianni and Massimo Lauria and Angelo Monti and Gianluca Rossi and Riccardo Silvestri}, title = {On the bounded-hop {MST} problem on random Euclidean instances}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {161--167}, year = {2007}, timestamp = {Fri, 21 Sep 2007 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ClementiILMRS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CooperL07, author = {S. Barry Cooper and Angsheng Li}, title = {Preface: Theory and applications of models of computation}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {1}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.013}, doi = {10.1016/J.TCS.2007.05.013}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CooperL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DinitzS07, author = {Yefim Dinitz and Noam Solomon}, title = {Two absolute bounds for distributed bit complexity}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {168--183}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.027}, doi = {10.1016/J.TCS.2007.04.027}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DinitzS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HellersteinS07, author = {Lisa Hellerstein and Rocco A. Servedio}, title = {On {PAC} learning algorithms for rich Boolean function classes}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {66--76}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.018}, doi = {10.1016/J.TCS.2007.05.018}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HellersteinS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HinkelmannJ07, author = {Markus Hinkelmann and Andreas Jakoby}, title = {Communications in unknown networks: Preserving the secret of topology}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {184--200}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.031}, doi = {10.1016/J.TCS.2007.04.031}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HinkelmannJ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Hutter07, author = {Marcus Hutter}, title = {On universal prediction and Bayesian confirmation}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {33--48}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.016}, doi = {10.1016/J.TCS.2007.05.016}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Hutter07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JainNS07, author = {Sanjay Jain and Jochen Nessel and Frank Stephan}, title = {Invertible classes}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {49--65}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.017}, doi = {10.1016/J.TCS.2007.05.017}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/JainNS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KlasingMRS07, author = {Ralf Klasing and Euripides Markou and Tomasz Radzik and Fabiano Sarracco}, title = {Hardness and approximation results for Black Hole Search in arbitrary networks}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {201--221}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.024}, doi = {10.1016/J.TCS.2007.04.024}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KlasingMRS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MuchnikSUVV07, author = {Andrej Muchnik and Alexander Shen and Mikhail Ustinov and Nikolai K. Vereshchagin and Michael V. Vyugin}, title = {Non-reducible descriptions for conditional Kolmogorov complexity}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {77--86}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.019}, doi = {10.1016/J.TCS.2007.05.019}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MuchnikSUVV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PelcPR07, author = {Andrzej Pelc and David Peleg and Michel Raynal}, title = {Preface}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {137--138}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.022}, doi = {10.1016/J.TCS.2007.04.022}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/PelcPR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Prencipe07, author = {Giuseppe Prencipe}, title = {Impossibility of gathering by a set of autonomous mobile robots}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {222--231}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.023}, doi = {10.1016/J.TCS.2007.04.023}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Prencipe07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SantoroW07, author = {Nicola Santoro and Peter Widmayer}, title = {Agreement in synchronous networks with ubiquitous faults}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {232--249}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.036}, doi = {10.1016/J.TCS.2007.04.036}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/SantoroW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ShalomZ07, author = {Mordechai Shalom and Shmuel Zaks}, title = {Minimization of the number of ADMs in {SONET} rings with maximum throughput with implications to the traffic grooming problem}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {250--262}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.021}, doi = {10.1016/J.TCS.2007.04.021}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ShalomZ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Sun07, author = {Xiaoming Sun}, title = {Block sensitivity of weakly symmetric functions}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {87--91}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.020}, doi = {10.1016/J.TCS.2007.05.020}, timestamp = {Wed, 26 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Sun07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Tan07, author = {Xuehou Tan}, title = {A linear-time 2-approximation algorithm for the watchman route problem for simple polygons}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {92--103}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.021}, doi = {10.1016/J.TCS.2007.05.021}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Tan07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Urquhart07, author = {Alasdair Urquhart}, title = {Width versus size in resolution proofs}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {104--110}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.022}, doi = {10.1016/J.TCS.2007.05.022}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Urquhart07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/WangL07, author = {Rui Wang and Francis C. M. Lau}, title = {Optimal gossiping in square 2D meshes}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {2-3}, pages = {263--286}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.04.032}, doi = {10.1016/J.TCS.2007.04.032}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/WangL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/XiaZZ07, author = {Mingji Xia and Peng Zhang and Wenbo Zhao}, title = {Computational complexity of counting problems on 3-regular planar graphs}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {111--125}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.023}, doi = {10.1016/J.TCS.2007.05.023}, timestamp = {Thu, 07 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/XiaZZ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Zhang07, author = {Peng Zhang}, title = {A new approximation algorithm for the k-facility location problem}, journal = {Theor. Comput. Sci.}, volume = {384}, number = {1}, pages = {126--135}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.05.024}, doi = {10.1016/J.TCS.2007.05.024}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Zhang07.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.