CORR
2004
Springer
13 years 4 months ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
CORR
2004
Springer
13 years 4 months ago
2004
Springer
This paper presents Jartege, a tool which allows random generation of unit tests for Java classes specified in JML. JML (Java Modeling Language) is a specification language for Ja...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log2 n log log n) time complexity of the Sch
CORR
2004
Springer
13 years 4 months ago
2004
Springer
CORR
2004
Springer
13 years 4 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
In this paper we present a framework for creating natural language interfaces to action-based applications. Our framework uses a number of reusable application-independent compone...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...