ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy ...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...