ICALP
13 years 10 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
13 years 10 months ago
2001 Springer 
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
ICALP
13 years 10 months ago
2001 Springer 
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
ICALP
13 years 10 months ago
2001 Springer  ICALP
13 years 10 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 ...
|
Programming Languages