2681 search results - page 278 / 537 » Problem F |
148
click to vote
ICDCS
2005
IEEE
16 years 6 days ago
2005
IEEE
We consider the problem of sending messages into the future, commonly known as timed release cryptography. Existing schemes for this task either solve the relative time problem wi...
193
click to vote
FCT
2005
Springer
16 years 1 days ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
160
click to vote
PLDI
2004
ACM
16 years 19 hour ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
176
click to vote
APPROX
2004
Springer
16 years 3 hour ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
150
click to vote
ISIPTA
2003
IEEE
15 years 12 months ago
2003
IEEE
The finite element method is widely used for solving various problems in geotechnical engineering practice. The input parameters required for the calculations are generally impre...