default search action
Theoretical Computer Science, Volume 813
Volume 813, April 2020
- Bruce M. Kapron, Florian Steinberg:
Type-two polynomial-time and restricted lookahead. 1-19 - Valentina Castiglioni
, Michele Loreti, Simone Tini
The metric linear-time branching-time spectrum on nondeterministic probabilistic processes. 20-69 - Patrick Baillot, Alexis Ghyselen
Combining linear logic and size types for implicit complexity. 70-99 - Ugo Dal Lago
On randomised strategies in the λ-calculus. 100-116 - Olivier Laurent:
Polynomial time in untyped elementary linear logic. 117-142 - Armando B. Matos, Luca Paolini
The fixed point problem of a simple reversible language. 143-154 - Laura Giordano, Alberto Policriti
Adding the power-set to description logics. 155-174 - Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
On the initialization of clocks in timed formalisms. 175-198 - Laura Bozzelli, Aniello Murano
Alternating-time temporal logics with linear past. 199-217 - Luca Paolini
A class of Recursive Permutations which is Primitive Recursive complete. 218-233 - Ugo Dal Lago
Effectful applicative similarity for call-by-name lambda calculi. 234-247 - Luca Spalazzi
Parameterized model checking of networks of timed automata with Boolean guards. 248-269 - David Barozzini, David de Frutos-Escrig
Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts. 270-304 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger
Timeline-based planning over dense temporal domains. 305-326 - Ken-etsu Fujita:
A formal system of reduction paths for parallel reduction. 327-340 - Miguel Couceiro
On the efficiency of normal form systems for representing Boolean functions. 341-361 - Daniel Kernberger, Martin Lange:
On the expressive power of hybrid branching-time logics. 362-374 - Federico Aschieri, Agata Ciabattoni
On the concurrent computational content of intermediate logics. 375-409 - Longchun Wang
A logic for Lawson compact algebraic L-domains. 410-427 - Alexander Bolotov, Montserrat Hermo
Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+. 428-451
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-12-15 01:16 CET 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: