Theoretical Computer Science

We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...

Philippe de Groote

claim paper

Read More »

23

click to vote

RTA
1999
Springer

101views Theoretical Computer Science» more RTA 1999»

Strong Normalization of Proof Nets Modulo Structural Congruences

13 years 12 months ago

Download twiki.di.uniroma1.it

Roberto Di Cosmo, Stefano Guerrini

claim paper

Read More »

24

click to vote

RANDOM
1999
Springer

81views Theoretical Computer Science» more RANDOM 1999»

Approximation of Multi-color Discrepancy

13 years 12 months ago

Download www.mpi-inf.mpg.de

Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...

Benjamin Doerr, Anand Srivastav

claim paper

Read More »

25

click to vote

RANDOM
1999
Springer

89views Theoretical Computer Science» more RANDOM 1999»

Completeness and Robustness Properties of Min-Wise Independent Permutations

13 years 12 months ago

Download www.eecs.harvard.edu

Andrei Z. Broder, Michael Mitzenmacher

claim paper

Read More »

28

click to vote

RANDOM
1999
Springer

107views Theoretical Computer Science» more RANDOM 1999»

Fast Approximate PCPs for Multidimensional Bin-Packing Problems

13 years 12 months ago

Download www.cs.princeton.edu

Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a veriﬁer can be quickly convinced that a set of multidimensional blo...

Tugkan Batu, Ronitt Rubinfeld, Patrick White

claim paper

Read More »

22

click to vote

RANDOM
1999
Springer

85views Theoretical Computer Science» more RANDOM 1999»

Linear Consistency Testing

13 years 12 months ago