Searching for authors named "Danny Soroker" – sorted by Relevance.
3 documents found, showing 1 through 3.
-
Tolerating Faults in Hypercubes using Subcube Partitioning
- …We examine the issue of running algorithms on a hypercube which has both node and edge faults, and we assume a worst case distribution of the faults. We prove that for any constant c, an n-dimensional hypercube (n-cube) with n c faulty components contains a fault-free subgraph that can implement …
- Cited by 10 (1 self) – Add To MetaCart
-
Using XForms to Simplify Web Programming
- …The difficulty of developing and deploying commercial web applications increases as the number of technologies they use increases and as the interactions between these technologies become more complex. This paper describes a way to avoid this increasing complexity by re-examining the basic requireme…
- Cited by 5 (1 self) – Add To MetaCart
-
Transitive compaction in parallel via branchings
- …We study the following problem: given a strongly connected digraph, find a minimal strongly connected spanning subgraph of it. Our main result is a parallel algorithm for this problem, which runs in polylog parallel time and uses O(n 3) processors on a PRAM. Our algorithm is simple and the major too…
- Cited by 10 (5 self) – Add To MetaCart
Showing 1 through 3.
