@article{Papadimitriou-Ratajczak/05,
AUTHOR = {Papadimitriou, Christos H. and Ratajczak, David},
TITLE = {On a conjecture related to geometric routing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {1},
PAGES = {3-14},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {geometric routing, ad hoc networks, planar graphs, greedy routing, convex embeddings, planar embeddings},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.06.022},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Enachescu-Goel-Govindan-Motwani/05,
AUTHOR = {Enachescu, Mihaela and Goel, Ashish and Govindan, Ramesh and Motwani, Rajeev},
TITLE = {Scale-free aggregation in sensor networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {1},
PAGES = {15-29},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sensor networks, aggregation, random walk, collision time, routing, simultaneous optimization},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.06.023},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Floreen-Kaski-Kohonen-Orponen/05,
AUTHOR = {Flor{\'e}en, Patrik and Kaski, Petteri and Kohonen, Jukka and Orponen, Pekka},
TITLE = {Exact and approximate balanced data gathering in energy-constrained sensor networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {1},
PAGES = {30-46},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data gathering, energy efficient design, multi-hop ad hoc networks, optimization, sensor networks, wireless networks},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.06.024},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{ODell-Wattenhofer/05,
AUTHOR = {O'Dell, R. and Wattenhofer, R.},
TITLE = {Theoretical aspects of connectivity-based multi-hop positioning},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {1},
PAGES = {47-68},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {positioning, localization, multi-hop, connectivity-only, unit disk graph},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.06.026},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leone-Rolim/05,
AUTHOR = {Leone, Pierre and Rolim, Jos{\'e}},
TITLE = {Towards a dynamical model for wireless sensor networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {1},
PAGES = {69-85},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {broadcast, flooding, sensor networks, markov chain},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.06.027},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Stupp-Sidi/05,
AUTHOR = {Stupp, Gideon and Sidi, Moshe},
TITLE = {The expected uncertainty of range-free localization protocols in sensor networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {1},
PAGES = {86-99},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {range free localization, sensor networks},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.06.025},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lu-Shen-Chung/05,
AUTHOR = {Lu, Hongtao and Shen, Ruiming and Chung, Fu-Lai},
TITLE = {Absolute exponential stability of a class of recurrent neural networks with multiple and variable delays},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {2-3},
PAGES = {103-119},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {recurrent neural networks, delays, absolute exponential stability, lyapunov functionals},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.02.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ibarra/05b,
AUTHOR = {Ibarra, Oscar H.},
TITLE = {On determinism versus nondeterminism in $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {2-3},
PAGES = {120-133},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {determinism versus nondeterminism, molecular computing, $p$ system, communicating $p$ system, counter machine, two-way multihead finite automaton},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.052},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ying/05a,
AUTHOR = {Ying, Mingsheng},
TITLE = {A theory of computation based on quantum logic (I)},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {2-3},
PAGES = {134-207},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum logic, orthomodular lattice, algebraic semantics, finite automata, regular languages, quantum computation},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.04.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fischer-Wegener/05,
AUTHOR = {Fischer, Simon and Wegener, Ingo},
TITLE = {The one-dimensional Ising model: Mutation versus recombination},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {2-3},
PAGES = {208-225},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ising model, evolutionary algorithms, randomized local search, expected optimization time},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.04.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Verlan/05,
AUTHOR = {Verlan, Sergey},
TITLE = {A boundary result on enhanced time-varying distributed $H$ systems with parallel computations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {2-3},
PAGES = {226-242},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {molecular computing, splicing systems, formal languages, universal computations},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.056},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dorigo-Blum/05,
AUTHOR = {Dorigo, Marco and Blum, Christian},
TITLE = {Ant colony optimization theory: A survey},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {2-3},
PAGES = {243-278},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ant colony optimization, metaheuristics, combinatorial optimization, convergence, stochastic gradient descent, model-based search, approximate algorithms},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.05.020},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Soloveichik-Winfree/05,
AUTHOR = {Soloveichik, David and Winfree, Erik},
TITLE = {The computational power of Benenson automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {2-3},
PAGES = {279-297},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {molecular computing, dna computing, computational complexity, restriction enzymes, branching programs, circuit complexity},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.07.027},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Erratum in Theor.~Comput.~Sci., Vol. 412, 2011, No. 43, 6112-6113},
}
@article{Goulon-Sigwalt-Abram-Duprat-Dreyfus/05,
AUTHOR = {Goulon-Sigwalt-Abram, Aur{\'e}lie and Duprat, Arthur and Dreyfus, G{\'e}rard},
TITLE = {From Hopfield nets to recursive networks to graph machines: Numerical machine learning for structured data},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {2-3},
PAGES = {298-334},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph, graph machine, structured data, recursive network, folding network, recurrent network, neural network, svm, qsar, qspr, raam, lraam, classification, regression},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.08.026},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shi/05b,
AUTHOR = {Shi, Yaoyun},
TITLE = {Quantum and classical tradeoffs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {344},
NUMBER = {2-3},
PAGES = {335-345},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum computation, quantum state generation, quantum lower bound, grover's algorithm},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.053},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}