Sciweavers

725 search results - page 124 / 145
» Bounding Degrees on RPL
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 10 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
ICDCS
1997
IEEE
15 years 10 months ago
Distributed Recovery with K-Optimistic Logging
Fault-tolerance techniques based on checkpointing and message logging have been increasingly used in real-world applications to reduce service down-time. Most industrial applicati...
Yi-Min Wang, Om P. Damani, Vijay K. Garg
IPPS
1996
IEEE
15 years 10 months ago
Implementing the Data Diffusion Machine Using Crossbar Routers
The Data Diffusion Machine is a scalable virtual shared memory architecture. A hierarchical network is used to ensure that all data can be located in a time bounded by O(logp), wh...
Henk L. Muller, Paul W. A. Stallard, David H. D. W...
STOC
1992
ACM
122views Algorithms» more  STOC 1992»
15 years 10 months ago
Existence and Construction of Edge Disjoint Paths on Expander Graphs
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 ...
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
CLUSTER
2006
IEEE
15 years 10 months ago
A Performance Instrumentation Framework to Characterize Computation-Communication Overlap in Message-Passing Systems
Effective overlap of computation and communication is a well understood technique for latency hiding and can yield significant performance gains for applications on high-end compu...
Aniruddha G. Shet, P. Sadayappan, David E. Bernhol...