Hubert Wagener

According to our database, Hubert Wagener authored at least 21 papers between 1983 and 2009.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2009

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.

Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener

SIAM J. Discret. Math., 2009

1998

Effective Systolic Algorithms for Gossiping in Cycles.

Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener

Parallel Process. Lett., 1998

1997

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes.

Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener

Inf. Comput., 1997

Holographic imaging of lines: a texture based approach.

Alf Ritter, Oliver Deussen, Hubert Wagener, Thomas Strothotte

Proceedings of the First International Conference on Information Visualisation, 1997

Rendering Gestures as Line Drawings.

Frank Godenschweger, Thomas Strothotte, Hubert Wagener

Proceedings of the Gesture and Sign Language in Human-Computer Interaction, 1997

1995

Translation queries for sets of polygons.

Mark de Berg, Hazel Everett, Hubert Wagener

Int. J. Comput. Geom. Appl., 1995

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.

Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener

Proceedings of the STACS 95, 1995

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).

Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).

Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener

Proceedings of the Algorithm Theory, 1994

The Complexity of Systolic Dissemination of Information in Interconnection Networks.

Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská

Proceedings of the Parallel and Distributed Computing, 1994

1993

Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.

Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time

Hubert Wagener

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point.

Mikhail J. Atallah, Danny Z. Chen, Hubert Wagener

J. ACM, 1991

1990

Approximation of Convex Polygons.

Helmut Alt, Johannes Blömer, Hubert Wagener

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1988

Approximation of Polygons by Rechtangles and Circles.

Helmut Alt, Hubert Wagener

Bull. EATCS, 1988

On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs.

Hubert Wagener

Proceedings of the CSL '88, 1988

Triangulating a Monotone Polygon in Parallel.

Hubert Wagener

Proceedings of the Computational Geometry and its Applications, 1988

1987

Congruence, Similarity, and Symmetries of Geometric Objects.

Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Parallel computational geometry - exploiting polygonal order for maximally parallel algorithms.

Hubert Wagener

PhD thesis, 1986

1983

Parallel Computation on 2-3-Trees.

Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener

RAIRO Theor. Informatics Appl., 1983

Parallel Dictionaries in 2-3 Trees.

Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener

Proceedings of the Automata, 1983