Sciweavers

TCS
2011
12 years 11 months ago
Correctness of linear logic proof structures is NL-complete
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
Paulin Jacobé de Naurois, Virgile Mogbil
TCS
2011
12 years 11 months ago
Musings around the geometry of interaction, and coherence
We introduce the Danos-Régnier category
Jean Goubault-Larrecq
TCS
2011
12 years 11 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
TCS
2011
12 years 11 months ago
A semantic measure of the execution time in linear logic
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...
TCS
2011
12 years 11 months ago
Bitonic sorters of minimal depth
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
Tamir Levi, Ami Litman
TCS
2011
12 years 11 months ago
Local 7-coloring for planar subgraphs of unit disk graphs
Jurek Czyzowicz, Stefan Dobrev, H. González...