default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 287
Volume 287, Number 1, September 2002
- Grzegorz Rozenberg, A. E. Eiben, Joost N. Kok:
Preface. 1-2 - Martyn Amos
, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Topics in the theory of DNA computing. 3-38 - Arwen Brenneman, Anne Condon:
Strand design for biomolecular computation. 39-58 - Masami Hagiya, John A. Rose, Ken Komiya, Kensaku Sakamoto:
Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms. 59-71 - Gheorghe Paun, Grzegorz Rozenberg:
A guide to membrane computing. 73-100 - Hans-Georg Beyer, Hans-Paul Schwefel, Ingo Wegener:
How to analyse evolutionary algorithms. 101-130 - Stefan Droste, Thomas Jansen, Ingo Wegener:
Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. 131-144 - Heinz Mühlenbein, Thilo Mahnig:
Evolutionary computation and Wright's equation. 145-165 - Bart Naudts, Luk Schoofs:
GA performance distributions and randomly generated binary constraint satisfaction problems. 167-185 - Erkki Oja:
Unsupervised learning in neural computation. 187-207 - Alex Gammerman, Volodya Vovk:
Prediction algorithms and confidence measures based on algorithmic randomness theory. 209-217 - Tom Heskes, Bart Bakker, Bert Kappen:
Approximate algorithms for neural-Bayesian approaches. 219-238 - Robert Legenstein, Wolfgang Maass:
Neural circuits for pattern recognition with small total wire length. 239-249 - Thomas Natschläger, Wolfgang Maass:
Spiking neurons and the induction of finite state machines. 251-265 - Mika Hirvensalo:
Computing with quanta - impacts of quantum theory on computation. 267-298 - Andris Ambainis, John Watrous:
Two-way finite automata with quantum and classical state. 299-311 - Barbara M. Terhal:
Detecting quantum entanglement. 313-335 - Ronald de Wolf:
Quantum communication and complexity. 337-353
Volume 287, Number 2, September 2002
- Jaroslav Nesetril:
Preface. 355-357 - Ali Akhavi:
Random lattices, threshold phenomena and efficient reduction algorithms. 359-385 - Eric Anderson, Marek Chrobak, John Noga, Jirí Sgall, Gerhard J. Woeginger:
Solution of a problem in DNA computing. 387-391 - Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks:
On list update and work function algorithms. 393-418 - Yossi Azar, Oded Regev, Jirí Sgall, Gerhard J. Woeginger:
Off-line temporary tasks assignment. 419-428 - Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
Approximation algorithms for routing and call scheduling in all-optical chains and rings. 429-448 - Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
The impact of information on broadcasting time in linear radio networks. 449-471 - Limor Drori, David Peleg:
Faster exact solutions for some NP-hard problems. 473-499 - Daniele V. Finocchiaro, Marco Pellegrini:
On computing the diameter of a point set in high dimensional Euclidean space. 501-514 - Philippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis:
On the robustness of interconnections in random graphs: a symbolic approach. 515-534 - Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptively secure distributed public-key systems. 535-561 - Arlette Gaillard, Heinz Gröflin, Alan J. Hoffman, William R. Pulleyblank:
On the submodular matrix representation of a digraph. 563-570 - Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
A strategy for searching with different access costs. 571-584 - Jaroslav Nesetril, Claude Tardif:
Density via duality. 585-591 - Pierre Nicodème, Bruno Salvy, Philippe Flajolet:
Motif statistics. 593-617
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.
last updated on 2024-11-20 21:01 CET 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:
