13306 search results - page 270 / 2662 » Theoretical Computer Science |
177
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
165
click to vote
RTA
1999
Springer
15 years 11 months ago
1999
Springer
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...
157
click to vote
CSE
2008
IEEE
15 years 6 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
185
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
161
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
ACT DATATYPE APPROACH Patrick Michel Arnd Poetzsch-Heffter