#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1950

2004

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
- Symposium on Computational Geometry
- 1987

- Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener
- ICALP
- 1983

Our model of computation is a parallel computer with k synchronized processors PI,...,Pk sharing a common random access storage, where simultaneous access to the same storage location by two or more processors is not allowed. Suppose a 2-3 tree T with n leaves is implemented in the storage, suppose al,...,a k are data that may or may not be stored in the… (More)

- Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener
- ITA
- 1983

- Mikhail J. Atallah, Danny Ziyi Chen, Hubert Wagener
- J. ACM
- 1991

A parallel algorithm for computing the visible portions of a simple polygonal chain with n vertices from a point in the plane is presented. The algorithm runs m O(log n) time using 0(n / log n) processors in the EREW-PRAM computational model, and hence is asymptotically optimal. Nonnumerical Algorithms and Problems—computations on discrete structures.… (More)

- Hubert Wagener
- Workshop on Computational Geometry
- 1988

- H H Wagener
- Archiv fur klinische und experimentelle…
- 1967

- F Leuschner, H Otto, H H Wagener
- Naunyn-Schmiedebergs Archiv für Pharmakologie
- 1970

- Helmut Alt, Johannes Blömer, Hubert Wagener
- ICALP
- 1990

- Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
- ESA
- 1993

This paper continues with the study of the communication modes introduced in, University of Paderborn. (Extended abstract presented at WG'93.)] as a generalization of the standard one-way and two-way modes allowing to send messages between processors of interconnection networks via vertex-disjoint paths in one communication step. The complexity of… (More)

- Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
- Inf. Comput.
- 1994

The communication power of the one-way and two-way edge-disjoint path modes for broadcast and gossip is investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). The main results achieved are the following: 1. For each connected graph G n of n nodes, the complexity of broadcast in G n , B min (G n),… (More)