256 search results - page 42 / 52 » Application-Only Call Graph Construction |
105
click to vote
EUROCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
PODC
2004
ACM
15 years 5 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
WEBDB
2010
Springer
15 years 4 months ago
2010
Springer
For documents with complex or atypical annotations, multihierarchical structures play the role of the document tree in traditional XML documents. We define a model of overlapping...
136
click to vote
LICS
2000
IEEE
15 years 4 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...