The following pages link to Frank Dehne (Q287249):
Displaying 50 items.
- Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem (Q287251) (← links)
- Computing the configuration space for a robot on a mesh-of-prosessors (Q582158) (← links)
- Randomized parallel list ranking for distributed memory multiprocessors. (Q676261) (← links)
- Determining maximum \(k\)-width-connectivity on meshes (Q685604) (← links)
- Pipelined search on coarse grained networks (Q914381) (← links)
- Parallel branch and bound on fine-grained hypercube multiprocessors (Q916373) (← links)
- Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474) (← links)
- Translation separability of sets of polygons (Q1100897) (← links)
- Optical clustering (Q1100928) (← links)
- Clustering methods for geometric objects and applications to design problems (Q1100929) (← links)
- Solving visibility and separability problems on a mesh-of-processors (Q1104081) (← links)
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
- Editor's foreword to: Special issue on parallel algorithms for geometric problems on digitized pictures (Q1175641) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Parallel algorithms for determining \(k\)-width connectivity in binary images (Q1177080) (← links)
- Parallel fractional cascading on hypercube multiprocessors (Q1196294) (← links)
- Multisearch techniques: Parallel data structures on mesh-connected computers (Q1328103) (← links)
- (Q1384683) (redirect page) (← links)
- A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers (Q1384686) (← links)
- Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (Q1601013) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
- Shortest paths in time-dependent FIFO networks (Q2428679) (← links)
- An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (Q2464330) (← links)
- WordNet++: A lexicon for the Color-X-method (Q2734644) (← links)
- (Q2751885) (← links)
- (Q2779600) (← links)
- (Q3484388) (← links)
- (Q3670582) (← links)
- (Q3745337) (← links)
- (Q3785935) (← links)
- (Q3787488) (← links)
- (Q3795223) (← links)
- (Q3796757) (← links)
- (Q3820006) (← links)
- (Q4408092) (← links)
- (Q4427882) (← links)
- (Q4473266) (← links)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
- Parallel Sorting for GPUs (Q4686656) (← links)
- (Q4694761) (← links)
- (Q4785983) (← links)
- ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY (Q4820063) (← links)
- “The big sweep”: On the power of the wavefront approach to Voronoi diagrams (Q5096887) (← links)
- Euro-Par 2004 Parallel Processing (Q5311351) (← links)
- SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS (Q5687655) (← links)
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE (Q5709135) (← links)
- Computing and Combinatorics (Q5717009) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897987) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902520) (← links)
