Stop the war!
Остановите войну!
for scientists:
default search action
Theoretical Computer Science, Volume 386
Volume 386, Numbers 1-2, October 2007
- Grzegorz Rozenberg:
Preface. 1-2 - Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur:
Predecessor existence problems for finite discrete dynamical systems. 3-37 - Daowen Qiu:
Automata theory based on quantum logic: Reversibilities and pushdown automata. 38-56 - Andrew Carnell, Daniel Richardson:
Parallel computation in spiking neural nets. 57-72 - Thomas Jansen, Ingo Wegener:
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation. 73-93 - William Benfold, Jonathan Hallam, Adam Prügel-Bennett:
Optimal parameters for search using a barrier tree Markov model. 94-113 - Tobias Storch:
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics. 114-131 - Remco Loos, Mitsunori Ogihara:
Complexity theory for splicing systems. 132-150 - Yuan Feng, Runyao Duan, Zheng-Feng Ji, Mingsheng Ying:
Proof rules for the correctness of quantum programs. 151-166
Volume 386, Number 3, November 2007
- Jos C. M. Baeten, Iain C. C. Phillips:
Preface. 167-168 - Sibylle B. Fröschle, Slawomir Lasota:
Causality versus true-concurrency. 169-187 - Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman:
Concurrent reachability games. 188-217 - Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi:
Separation of synchronous and asynchronous communication via testing. 218-235 - Sébastien Briais, Uwe Nestmann:
Open bisimulation, revisited. 236-271
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.