You have Guest access.
Log In
Arnold Beckmann, Costas Dimitracopoulos and Benedikt Löwe
Front matter
1-10
Deterministic Graphical Games Revisited
11-21
Program Schemes with Deep Pushdown Storage
22-31
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
32-41
Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
42-51
Pure Iteration and Periodicity A Note on Some Small Sub-recursive Classes
52-66
Programming Experimental Procedures for Newtonian Kinematic Machines
67-76
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
77-83
A Summation Algorithm from 11th Century China Possible Relations Between Structure and Argument
84-93
Sequential Automatic Algebras
94-99
The Role of Classical Computation in Measurement-Based Quantum Computation
100-109
The Algebraic Counterpart of the Wagner Hierarchy
110-119
Computing by Observing: A Brief Survey
120-128
A Quantum Information-Theoretic Proof of the Relation between Horn’s Problem and the Littlewood-Richardson Coefficients
129-138
Pell Equations and Weak Regularity Principles
139-148
Computable Categoricity of Graphs with Finite Components
149-151
P Automata: Membrane Systems as Acceptors
152-153
On the Processing Power of Protozoa
154-157
Computing Equilibria in Large Games We Play
158-167
A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC
168-174
Phase Transitions for Weakly Increasing Sequences
175-185
Succinct NP Proofs from an Extractability Assumption
186-195
Describing the Wadge Hierarchy for the Alternation Free Fragment of μ -Calculus (I) The Levels Below ω 1
196-205
Subrecursive Complexity of Identifying the Ramsey Structure of Posets
206-209
Solving Simple Stochastic Games
210-220
The Shrinking Property for NP and coNP
221-230
On the Hardness of Truthful Online Auctions with Multidimensional Constraints
231-240
Effective Dimensions and Relative Frequencies
241-250
Reachability in Linear Dynamical Systems
251-260
Hybrid Functional Interpretations
261-272
The Algorithm Concept – Tool for Historiographic Interpretation or Red Herring?
273-282
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion
283-293
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
294-305
Implementing Spi Calculus Using Nominal Techniques
306-315
An Enhanced Theory of Infinite Time Register Machines
316-325
Many Facets of Complexity in Logic
326-335
On the Computational Power of Enhanced Mobile Membranes
336-348
Recursion in Higher Types and Resource Bounded Turing Machines
349-358
Computability and Complexity in Self-assembly
359-369
Extraction in Coq: An Overview
370-378
Joining to High Degrees
379-388
Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem
389-402
Interpreting Localized Computational Effects Using Operators of Higher Type
403-406
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
407-416
Updatable Timed Automata with Additive and Diagonal Constraints
417-427
First-Order Model Checking Problems Parameterized by the Model
428-430
Domain Theory and the Causal Structure of Space-Time
431-446
Recursion on Nested Datatypes in Dependent Type Theory
447-456
Perfect Local Computability and Computable Simulations
457-466
Complete Determinacy and Subsystems of Second Order Arithmetic
467-475
Internal Density Theorems for Hierarchies of Continuous Functionals
476-485
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
486-490
The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF
491-497
Upper Semilattices in Many-One Degrees
498-510
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
511-522
The Quantum Complexity of Markov Chain Monte Carlo
523-532
Topological Dynamics of 2D Cellular Automata
533-543
Complexity of Aperiodicity for Topological Properties of Regular ω -Languages
544-553
ω -Degree Spectra
554-566
Cupping Classes of S02\Sigma^0_2 Enumeration Degrees
567-578
Principal Typings for Explicit Substitutions Calculi
579-593
How We Think of Computing Today
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info