3131 search results - page 216 / 627 » Generalized connection caching |
188
click to vote
STOC
1992
ACM
15 years 10 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
172
click to vote
PODC
1990
ACM
15 years 10 months ago
1990
ACM
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
151
click to vote
DAC
2010
ACM
15 years 10 months ago
2010
ACM
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
197
click to vote
DAC
2010
ACM
15 years 10 months ago
2010
ACM
Online social networks are a growing internet phenomenon: they connect millions of individuals through sharing of common interests, political and religious views, careers, etc. So...
172
click to vote
CCCG
2004
15 years 8 months ago
2004
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...