Computability and realizability for interactive computations (English)
- New search for: Broy, Manfred
- New search for: Broy, Manfred
In:
Information and Computation
;
241
;
277-301
;
2013
-
ISSN:
- Article (Journal) / Electronic Resource
-
Title:Computability and realizability for interactive computations
-
Contributors:Broy, Manfred ( author )
-
Published in:Information and Computation ; 241 ; 277-301
-
Publisher:
- New search for: Elsevier Inc.
-
Publication date:2013-01-24
-
Size:25 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 241
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Developments in implicit computational complexityMarion, Jean-Yves et al. | 2013
- 3
-
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchyBaillot, Patrick et al. | 2012
- 32
-
An abstract approach to stratification in linear logicBoudes, Pierre / Mazza, Damiano / Tortora de Falco, Lorenzo et al. | 2011
- 62
-
Quantitative classical realizabilityBrunel, Aloïs et al. | 2012
- 96
-
Formal security proofs with minimal fuss: Implicit computational complexity at workNowak, David / Zhang, Yu et al. | 2012
- 114
-
A higher-order characterization of probabilistic polynomial timeDal Lago, Ugo / Parisen Toldin, Paolo et al. | 2012
- 142
-
Entropy of regular timed languagesAsarin, Eugene / Basset, Nicolas / Degorre, Aldric et al. | 2014
- 177
-
The complexity of multi-mean-payoff and multi-energy gamesVelner, Yaron / Chatterjee, Krishnendu / Doyen, Laurent / Henzinger, Thomas A. / Rabinovich, Alexander / Raskin, Jean-François et al. | 2014
- 197
-
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automataZheng, Shenggen / Qiu, Daowen / Gruska, Jozef et al. | 2013
- 215
-
Approximate periodicityAmir, Amihood / Eisenberg, Estrella / Levy, A. et al. | 2013
- 227
-
Session typing and asynchronous subtyping for the higher-order π-calculusMostrous, Dimitris / Yoshida, Nobuko et al. | 2014
- 227
-
Session typing and asynchronous subtyping for the higher-order @p-calculusMostrous, D. / Yoshida, N. et al. | 2015
- 264
-
Normality and two-way automataCarton, Olivier / Heiber, Pablo Ariel et al. | 2014
- 277
-
Computability and realizability for interactive computationsBroy, Manfred et al. | 2013
- 302
-
Checking determinism of regular expressions with countingChen, Haiming / Lu, Ping et al. | 2014
- 321
-
Parametric multisingular hybrid Petri nets: Formal definitions and analysis techniquesMotallebi, Hassan / Abdollahi Azgomi, Mohammad et al. | 2014
- i
-
Editorial Board| 2015