Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 394
Volume 394, Numbers 1-2, March 2008
- Bruno Courcelle, Christian Delhommé:
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic. 1-38
- Yu Zhang:
Cryptographic logical relations. 39-63 - James Laird:
Decidability and syntactic control of interference. 64-83 - Toon Calders:
Itemset frequency satisfiability: Complexity and axiomatization. 84-111 - Flavio D. Garcia, Peter van Rossum:
Sound and complete computational interpretation of symbolic hashes in the standard model. 112-133
- Mojmír Kretínský, Vojtech Rehák
, Jan Strejcek:
Petri nets are less expressive than state-extended PA. 134-140
Volume 394, Number 3, April 2008
- Arnold Beckmann, Edwin J. Beggs, Benedikt Löwe:
From Gödel to Einstein: Computability between logic and physics at CiE 2006. 141-143
- Arnon Avron:
Constructibility and decidability versus domain independence and absoluteness. 144-158 - W. Paul Cockshott, Lewis Mackenzie, Greg Michaelson:
Physical constraints on hypercomputation. 159-174 - Willem L. Fouché:
Dynamics of a generic Brownian motion: Recursive aspects. 175-186 - Viv Kendon, Olivier Maloyer:
Optimal computation with non-unitary quantum walks. 187-196 - Peter Koepke, Ryan Siders:
Minimality considerations for ordinal computers modeling constructibility. 197-207 - Benedek Nagy, Sándor Vályi:
Interval-valued computations and their connection with PSPACE. 208-222 - Philip D. Welch:
Bounding lemmata for non-deterministic halting times of transfinite Turing machines. 223-228
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.
last updated on 2024-04-22 20:02 CEST 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:
