13306 search results - page 409 / 2662 » Theoretical Computer Science |
202
Voted
RTA
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
207
Voted
SOFSEM
2005
Springer
16 years 1 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
163
Voted
SOFSEM
2005
Springer
16 years 1 months ago
2005
Springer
We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings...
175
click to vote
SOFSEM
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. Anonymous communication with onions requires that a user application determines the whole routing path of an onion. This scenario has certain disadvantages, it might be d...
186
Voted
SOFSEM
2005
Springer
16 years 1 months ago
2005
Springer
Motivated by a potentially flawed deployment of the one time pad in a recent quantum cryptographic application securing a bank transfer [12], we show how to implement a statistica...