Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/tcs/tcs287.bht:"
download as .bib file
@article{DBLP:journals/tcs/Akhavi02,
author = {Ali Akhavi},
title = {Random lattices, threshold phenomena and efficient reduction algorithms},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {359--385},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00251-1},
doi = {10.1016/S0304-3975(01)00251-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Akhavi02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmbainisW02,
author = {Andris Ambainis and
John Watrous},
title = {Two-way finite automata with quantum and classical state},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {299--311},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00138-X},
doi = {10.1016/S0304-3975(02)00138-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmbainisW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmosPRS02,
author = {Martyn Amos and
Gheorghe Paun and
Grzegorz Rozenberg and
Arto Salomaa},
title = {Topics in the theory of {DNA} computing},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {3--38},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00134-2},
doi = {10.1016/S0304-3975(02)00134-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmosPRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndersonCNSW02,
author = {Eric Anderson and
Marek Chrobak and
John Noga and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
title = {Solution of a problem in {DNA} computing},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {387--391},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00252-3},
doi = {10.1016/S0304-3975(01)00252-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AndersonCNSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndersonHKRS02,
author = {Eric J. Anderson and
Kirsten Hildrum and
Anna R. Karlin and
April Rasala and
Michael E. Saks},
title = {On list update and work function algorithms},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {393--418},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00253-5},
doi = {10.1016/S0304-3975(01)00253-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AndersonHKRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AzarRSW02,
author = {Yossi Azar and
Oded Regev and
Jir{\'{\i}} Sgall and
Gerhard J. Woeginger},
title = {Off-line temporary tasks assignment},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {419--428},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00254-7},
doi = {10.1016/S0304-3975(01)00254-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AzarRSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BecchettiIM02,
author = {Luca Becchetti and
Miriam Di Ianni and
Alberto Marchetti{-}Spaccamela},
title = {Approximation algorithms for routing and call scheduling in all-optical
chains and rings},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {429--448},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00255-9},
doi = {10.1016/S0304-3975(01)00255-9},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BecchettiIM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeyerSW02,
author = {Hans{-}Georg Beyer and
Hans{-}Paul Schwefel and
Ingo Wegener},
title = {How to analyse evolutionary algorithms},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {101--130},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00137-8},
doi = {10.1016/S0304-3975(02)00137-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeyerSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrennemanC02,
author = {Arwen Brenneman and
Anne Condon},
title = {Strand design for biomolecular computation},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {39--58},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00135-4},
doi = {10.1016/S0304-3975(02)00135-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrennemanC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiksKKP02,
author = {Krzysztof Diks and
Evangelos Kranakis and
Danny Krizanc and
Andrzej Pelc},
title = {The impact of information on broadcasting time in linear radio networks},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {449--471},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00256-0},
doi = {10.1016/S0304-3975(01)00256-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiksKKP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DroriP02,
author = {Limor Drori and
David Peleg},
title = {Faster exact solutions for some NP-hard problems},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {473--499},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00257-2},
doi = {10.1016/S0304-3975(01)00257-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DroriP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DrosteJW02a,
author = {Stefan Droste and
Thomas Jansen and
Ingo Wegener},
title = {Optimization with randomized search heuristics - the {(A)NFL} theorem,
realistic scenarios, and difficult functions},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {131--144},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00094-4},
doi = {10.1016/S0304-3975(02)00094-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DrosteJW02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FinocchiaroP02,
author = {Daniele V. Finocchiaro and
Marco Pellegrini},
title = {On computing the diameter of a point set in high dimensional Euclidean
space},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {501--514},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00258-4},
doi = {10.1016/S0304-3975(01)00258-4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FinocchiaroP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FlajoletHNS02,
author = {Philippe Flajolet and
Kostas P. Hatzis and
Sotiris E. Nikoletseas and
Paul G. Spirakis},
title = {On the robustness of interconnections in random graphs: a symbolic
approach},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {515--534},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00259-6},
doi = {10.1016/S0304-3975(01)00259-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FlajoletHNS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FrankelMY02,
author = {Yair Frankel and
Philip D. MacKenzie and
Moti Yung},
title = {Adaptively secure distributed public-key systems},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {535--561},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00260-2},
doi = {10.1016/S0304-3975(01)00260-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FrankelMY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GaillardGHP02,
author = {Arlette Gaillard and
Heinz Gr{\"{o}}flin and
Alan J. Hoffman and
William R. Pulleyblank},
title = {On the submodular matrix representation of a digraph},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {563--570},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00261-4},
doi = {10.1016/S0304-3975(01)00261-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GaillardGHP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GammermanV02,
author = {Alex Gammerman and
Volodya Vovk},
title = {Prediction algorithms and confidence measures based on algorithmic
randomness theory},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {209--217},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00100-7},
doi = {10.1016/S0304-3975(02)00100-7},
timestamp = {Mon, 07 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GammermanV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HagiyaRKS02,
author = {Masami Hagiya and
John A. Rose and
Ken Komiya and
Kensaku Sakamoto},
title = {Complexity analysis of the {SAT} engine: {DNA} algorithms as probabilistic
algorithms},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {59--71},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00095-6},
doi = {10.1016/S0304-3975(02)00095-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HagiyaRKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeskesBK02,
author = {Tom Heskes and
Bart Bakker and
Bert Kappen},
title = {Approximate algorithms for neural-Bayesian approaches},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {219--238},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00132-9},
doi = {10.1016/S0304-3975(02)00132-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HeskesBK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hirvensalo02,
author = {Mika Hirvensalo},
title = {Computing with quanta - impacts of quantum theory on computation},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {267--298},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00096-8},
doi = {10.1016/S0304-3975(02)00096-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hirvensalo02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LaberMP02,
author = {Eduardo Sany Laber and
Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa},
title = {A strategy for searching with different access costs},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {571--584},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00262-6},
doi = {10.1016/S0304-3975(01)00262-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LaberMP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LegensteinM02,
author = {Robert Legenstein and
Wolfgang Maass},
title = {Neural circuits for pattern recognition with small total wire length},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {239--249},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00097-X},
doi = {10.1016/S0304-3975(02)00097-X},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LegensteinM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MuhlenbeinM02,
author = {Heinz M{\"{u}}hlenbein and
Thilo Mahnig},
title = {Evolutionary computation and Wright's equation},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {145--165},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00098-1},
doi = {10.1016/S0304-3975(02)00098-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MuhlenbeinM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NatschlagerM02,
author = {Thomas Natschl{\"{a}}ger and
Wolfgang Maass},
title = {Spiking neurons and the induction of finite state machines},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {251--265},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00099-3},
doi = {10.1016/S0304-3975(02)00099-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NatschlagerM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NaudtsS02,
author = {Bart Naudts and
Luk Schoofs},
title = {{GA} performance distributions and randomly generated binary constraint
satisfaction problems},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {167--185},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00133-0},
doi = {10.1016/S0304-3975(02)00133-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NaudtsS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Nesetril02,
author = {Jaroslav Nesetril},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {355--357},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00250-X},
doi = {10.1016/S0304-3975(01)00250-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Nesetril02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NesetrilT02,
author = {Jaroslav Nesetril and
Claude Tardif},
title = {Density via duality},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {585--591},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00263-8},
doi = {10.1016/S0304-3975(01)00263-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NesetrilT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NicodemeSF02,
author = {Pierre Nicod{\`{e}}me and
Bruno Salvy and
Philippe Flajolet},
title = {Motif statistics},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {593--617},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00264-X},
doi = {10.1016/S0304-3975(01)00264-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NicodemeSF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Oja02,
author = {Erkki Oja},
title = {Unsupervised learning in neural computation},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {187--207},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00160-3},
doi = {10.1016/S0304-3975(02)00160-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Oja02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PaunR02,
author = {Gheorghe Paun and
Grzegorz Rozenberg},
title = {A guide to membrane computing},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {73--100},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00136-6},
doi = {10.1016/S0304-3975(02)00136-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PaunR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RozenbergEK02,
author = {Grzegorz Rozenberg and
A. E. Eiben and
Joost N. Kok},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {1--2},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00092-0},
doi = {10.1016/S0304-3975(02)00092-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RozenbergEK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Terhal02,
author = {Barbara M. Terhal},
title = {Detecting quantum entanglement},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {313--335},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00139-1},
doi = {10.1016/S0304-3975(02)00139-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Terhal02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Wolf02,
author = {Ronald de Wolf},
title = {Quantum communication and complexity},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {1},
pages = {337--353},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(02)00377-8},
doi = {10.1016/S0304-3975(02)00377-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Wolf02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-03 12:46 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
