8810 search results - page 1593 / 1762 » Openness |
151
Voted
PODC
2010
ACM
15 years 8 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
176
click to vote
CTRSA
2009
Springer
15 years 8 months ago
2009
Springer
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
148
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
158
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
158
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...