4865 search results - page 606 / 973 » The Complexity of Graph Connectivity |
164
click to vote
ASPDAC
2004
ACM
16 years 7 days ago
2004
ACM
Much attention has been directed to different aspects of the design of pipelines [1,2,3,4]. Design of the control logic of non-linear pipelines has however, been considered as a su...
154
click to vote
EJC
2010
15 years 6 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
186
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
175
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
148
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...