F. Dehne, A. Fabri, and C. Kenyon. Scalable and architecture independent parallel geometric algorithms with high probability optimal time. In Proc.6th IEEESymposiumonParalleland Distributed Processing, pages 586--593, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Parallel Pattern Matching with Scaling - Mongelli, Song (Correct)
....is equal to the element P [b x c; b c] Pattern matching with scaling appears, for example, in some image processing applications where the source of the captured image can be at di erent distances [1] Consider a problem with input size n. We use the CGM (Coarse Grained Multicomputer) model [2,3], with p processors each with O(n=p) local memory. Usually we have n p. The processors are connected through an interconnection network that allows point to point communication among processors. A CGM algorithm is described as a number of alternating computing rounds and communication rounds. In ....
....algorithm is presented in Section 5. We obtain the time required by this algorithm in Section 6 and show experimental results in Section 7. Then we give concluding remarks in Section 8. 2 Preliminary De nitions 2. 1 CGM (Coarse Grained Multicomputer) Model The CGM model was proposed by Dehne [2,3]. It is similar to the BSP model (Bulk Synchronous Parallel) 11] However, it uses only two parameters: the input size n and the number of processors p, each with a local memory of size O(n=p) The term coarse grained means the size of the local memory is much larger than O(1) Each processor is ....
[Article contains additional citation context not shown here]
F. Dehne, A. Fabri and C. Kenyon, Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time, in Proc. 6th IEEE Symposium on Parallel and Distributed Processing, 1994, 586-593.
DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica.. Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon. Scalable and architecture independent parallel geometric algorithms with high probability optimal time. In Proc.6th IEEESymposiumonParalleland Distributed Processing, pages 586--593, 1994.
DOI: 10.1007/s00453-001-0109-4 - Algorithmica Algorithmica.. Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time, Proc. IEEE Symposium on Parallel and Distributed Processing, 1994, pp. 586--593.
Randomized Parallel List Ranking For - Distributed Memory Multiprocessors Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, andC.Kenyon, "Scalable and Architecture IndependentParallel Geometric Algorithms withHighProbabilityOptimal Time," in Proc. 6thIEEE SymposiumonParallel and Distributed Processing, 1994, pp. 586-593.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, Scalable and architecture independent parallel geometric algorithms with high probability optimal time, in Proc. 6th IEEE Symposium on Parallel and Distributed Processing, 1994," pp. 586#593.
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (13 citations) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon. Scalable and architecture independent parallel geometric algorithms with high probability optimal time. In Proc.6th IEEESymposiumonParalleland Distributed Processing, pages 586--593, 1994.
Randomized Parallel List Ranking For - Distributed Memory Multiprocessors Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, andC.Kenyon, "Scalable and Architecture IndependentParallel Geometric Algorithms withHighProbabilityOptimal Time," in Proc. 6thIEEE SymposiumonParallel and Distributed Processing, 1994, pp. 586-593.
Efficient Parallel Graph Algorithms for Coarse-Grained .. - Dehne, Ferreira.. (2002) (18 citations) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time, Proc. IEEE Symposium on Parallel and Distributed Processing, 1994, pp. 586--593.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, Scalable and architecture independent parallel geometric algorithms with high probability optimal time, in Proc. 6th IEEE Symposium on Parallel and Distributed Processing, 1994," pp. 586#593.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, Scalable and architecture independent parallel geometric algorithms with high probability optimal time, in Proc. 6th IEEE Symposium on Parallel and Distributed Processing, 1994," pp. 586#593.
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (13 citations) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon. Scalable and architecture independent parallel geometric algorithms with high probability optimal time. In Proc.6th IEEESymposiumonParalleland Distributed Processing, pages 586--593, 1994.
Efficient Parallel Graph Algorithms for Coarse-Grained.. - Dehne, Ferreira, E. (2002) (18 citations) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time, Proc. IEEE Symposium on Parallel and Distributed Processing, 1994, pp. 586--593.
Randomized Parallel List Ranking For Distributed Memory.. - Dehne, Song (1996) (4 citations) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, andC.Kenyon, "Scalable and Architecture IndependentParallel Geometric Algorithms withHighProbabilityOptimal Time," in Proc. 6thIEEE SymposiumonParallel and Distributed Processing, 1994, pp. 586-593.
Randomized Parallel List Ranking for Distributed Memory.. - Dehne, Song (1996) (4 citations) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, andC.Kenyon, "Scalable and Architecture IndependentParallel Geometric Algorithms withHighProbabilityOptimal Time," in Proc. 6thIEEE SymposiumonParallel and Distributed Processing, 1994, pp. 586-593.
Coarse Grained Parallel Algorithms for Detecting.. - Caceres, Chan.. (1928) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, "Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time," in Proc. 6th IEEE Symposium on Parallel and Distributed Processing, pages 586--593, 1994.
Coarse Grained Parallel Algorithms for Detecting.. - Caceres, Chan.. (1928) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, "Scalable and Architecture IndependentParallel Geometric Algorithms with High Probability Optimal Time," in Proc. 6th IEEE Symposium on Parallel and DistributedProcessing, pages 586--593, 1994.
Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (2002) (18 citations) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time, Proc. IEEE Symposium on Parallel and Distributed Processing, 1994, pp. 586--593.
A Randomized Parallel Three-Dimensional Convex Hull.. - Dehne, Deng, Dymond, al. (1997) Self-citation (Dehne Fabri) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon. Scalable and Architecture Independent Parallel Geometric Algorithms with High Probability Optimal Time. Proc.6th IEEE Symposium on Parallel and Distributed Processing, pages 586--593, 1994.
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (13 citations) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon. Scalable and architecture independent parallel geometric algorithms with high probability optimal time. In Proc.6th IEEESymposiumonParalleland Distributed Processing, pages 586--593, 1994.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) Self-citation (Dehne) (Correct)
No context found.
F. Dehne, A. Fabri, and C. Kenyon, Scalable and architecture independent parallel geometric algorithms with high probability optimal time, in Proc. 6th IEEE Symposium on Parallel and Distributed Processing, 1994," pp. 586#593.
EfficientParallel Graph Algorithms For Coarse - Grained Multicomputers And (Correct)
No context found.
F. Dehne, A. Fabri, andC.Kenyon, "Scalable andArchitecture IndependentParallel Geometric Algorithms with High ProbabilityOptimal Time," in Proc. 6th IEEE Symposium on Parallel and DistributedProcessing, pages 586--593, 1994.
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
No context found.
F. Dehne, A. Fabri, andC.Kenyon, "Scalable andArchitecture IndependentParallel Geometric Algorithms with High ProbabilityOptimal Time," in Proc. 6th IEEE Symposium on Parallel and DistributedProcessing, pages 586--593, 1994.
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
No context found.
F. Dehne, A. Fabri, andC.Kenyon, "Scalable andArchitecture IndependentParallel Geometric Algorithms with High ProbabilityOptimal Time," in Proc. 6th IEEE Symposium on Parallel and DistributedProcessing, pages 586--593, 1994.
Parallel Computation On Interval Graphs: Algorithms And .. - Ferreira, Lassous.. (2002) (Correct)
No context found.
Dehne F, Fabri A, Kenyon C. Scalable and architecture independent parallel geometric algorithms with high probability optimal time. Proceedings 6th IEEE SPDP. IEEE Press: San Antonio, CA, 1994; 586--593.
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
No context found.
F. Dehne, A. Fabri, andC.Kenyon, "Scalable andArchitecture IndependentParallel Geometric Algorithms with High ProbabilityOptimal Time," in Proc. 6th IEEE Symposium on Parallel and DistributedProcessing, pages 586--593, 1994.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC