default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. CiE 2008: Athens, Greece
- Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe:
Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings. Lecture Notes in Computer Science 5028, Springer 2008, ISBN 978-3-540-69405-2 - Daniel Andersson, Kristoffer Arnsfelt Hansen
, Peter Bro Miltersen, Troels Bjerre Sørensen:
Deterministic Graphical Games Revisited. 1-10 - Argimiro Arratia, Iain A. Stewart:
Program Schemes with Deep Pushdown Storage. 11-21 - Matthias Baaz, George Metcalfe:
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics. 22-31 - Sergey Babenyshev, Vladimir V. Rybakov:
Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL. 32-41 - Mathias Barra:
Pure Iteration and Periodicity. 42-51 - Edwin J. Beggs, John V. Tucker:
Programming Experimental Procedures for Newtonian Kinematic Machines. 52-66 - Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen:
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. 67-76 - Andrea Bréard:
A Summation Algorithm from 11th Century China. 77-83 - Michael Brough, Bakhadyr Khoussainov, Peter Nelson:
Sequential Automatic Algebras. 84-93 - Dan E. Browne, Janet Anders:
The Role of Classical Computation in Measurement-Based Quantum Computation. 94-99 - Jérémie Cabessa, Jacques Duparc:
The Algebraic Counterpart of the Wagner Hierarchy. 100-109 - Matteo Cavaliere:
Computing by Observing: A Brief Survey. 110-119 - Matthias Christandl:
A Quantum Information-Theoretic Proof of the Relation between Horn's Problem and the Littlewood-Richardson Coefficients. 120-128 - Charalampos Cornaros:
Pell Equations and Weak Regularity Principles. 129-138 - Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu:
Computable Categoricity of Graphs with Finite Components. 139-148 - Erzsébet Csuhaj-Varjú:
P Automata: Membrane Systems as Acceptors. 149-151 - Mark Daley:
On the Processing Power of Protozoa. 152-153 - Constantinos Daskalakis:
Computing Equilibria in Large Games We Play. 154-157 - Liesbeth De Mol, Maarten Bullynck:
A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC. 158-167 - Michiel De Smet, Andreas Weiermann:
Phase Transitions for Weakly Increasing Sequences. 168-174 - Giovanni Di Crescenzo, Helger Lipmaa:
Succinct NP Proofs from an Extractability Assumption. 175-185 - Jacques Duparc, Alessandro Facchini:
Describing the Wadge Hierarchy for the Alternation Free Fragment of µ-Calculus (I). 186-195 - Willem L. Fouché:
Subrecursive Complexity of Identifying the Ramsey Structure of Posets. 196-205 - Hugo Gimbert, Florian Horn:
Solving Simple Stochastic Games. 206-209 - Christian Glaßer, Christian Reitwießner, Victor L. Selivanov:
The Shrinking Property for NP and coNP. 210-220 - Rica Gonen:
On the Hardness of Truthful Online Auctions with Multidimensional Constraints. 221-230 - Xiaoyang Gu, Jack H. Lutz:
Effective Dimensions and Relative Frequencies. 231-240 - Emmanuel Hainry:
Reachability in Linear Dynamical Systems. 241-250 - Mircea-Dan Hernest, Paulo Oliva:
Hybrid Functional Interpretations. 251-260 - Jens Høyrup:
The Algorithm Concept - Tool for Historiographic Interpretation or Red Herring?. 261-272 - Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion. 273-282 - Marcin Jurdzinski, Rahul Savani:
A Simple P-Matrix Linear Complementarity Problem for Discounted Games. 283-293 - Temesghen Kahsai, Marino Miculan:
Implementing Spi Calculus Using Nominal Techniques. 294-305 - Peter Koepke, Russell G. Miller:
An Enhanced Theory of Infinite Time Register Machines. 306-315 - Antonina Kolokolova:
Many Facets of Complexity in Logic. 316-325 - Shankara Narayanan Krishna, Gabriel Ciobanu:
On the Computational Power of Enhanced Mobile Membranes. 326-335 - Lars Kristiansen:
Recursion in Higher Types and Resource Bounded Turing Machines. 336-348 - James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers:
Computability and Complexity in Self-assembly. 349-358 - Pierre Letouzey:
Extraction in Coq: An Overview. 359-369 - Jiang Liu, Guohua Wu:
Joining to High Degrees. 370-378 - Iris Loeb:
Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem. 379-388 - John Longley:
Interpreting Localized Computational Effects Using Operators of Higher Type. 389-402 - Johann A. Makowsky:
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants. 403-406 - Lakshmi Manasa, Shankara Narayanan Krishna, Kumar Nagaraj:
Updatable Timed Automata with Additive and Diagonal Constraints. 407-416 - Barnaby Martin:
First-Order Model Checking Problems Parameterized by the Model. 417-427 - Keye Martin, Prakash Panangaden:
Domain Theory and the Causal Structure of Space-Time. 428-430 - Ralph Matthes:
Recursion on Nested Datatypes in Dependent Type Theory. 431-446 - Russell Miller, Dustin Mulcahey:
Perfect Local Computability and Computable Simulations. 447-456 - Takako Nemoto:
Complete Determinacy and Subsystems of Second Order Arithmetic. 457-466 - Dag Normann:
Internal Density Theorems for Hierarchies of Continuous Functionals. 467-475 - Nicolas Ollinger:
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem. 476-485 - Lawrence C. Paulson:
The Relative Consistency of the Axiom of Choice - Mechanized Using Isabelle/ZF. 486-490 - Sergei Podzorov:
Upper Semilattices in Many-One Degrees. 491-497 - Colin Riba:
Union of Reducibility Candidates for Orthogonal Constructor Rewriting. 498-510 - Peter C. Richter:
The Quantum Complexity of Markov Chain Monte Carlo. 511-522 - Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of 2D Cellular Automata. 523-532 - Victor L. Selivanov, Klaus W. Wagner:
Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. 533-543 - Alexandra A. Soskova:
omega-Degree Spectra. 544-553 - Mariya Ivanova Soskova:
Cupping Classes of Enumeration Degrees. 554-566 - Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
Principal Typings for Explicit Substitutions Calculi. 567-578 - Jirí Wiedermann, Jan van Leeuwen:
How We Think of Computing Today. 579-593
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-09-28 01:34 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:
