Hubert Wagener

Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener: On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. SIAM J. Discrete Math. 23(3): 1612-1645 (2009)

Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener: Effective Systolic Algorithms for Gossiping in Cycles. Parallel Processing Letters 8(2): 197-205 (1998)

Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Inf. Comput. 133(1): 1-33 (1997)

Frank Godenschweger, Thomas Strothotte, Hubert Wagener: Rendering Gestures as Line Drawings. Gesture Workshop 1997: 147-157

Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener: Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. Inf. Comput. 123(1): 17-28 (1995)

Mark de Berg, Hazel Everett, Hubert Wagener: Translation queries for sets of polygons. Int. J. Comput. Geometry Appl. 5(3): 221-242 (1995)

Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener: Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). FCT 1995: 273-282

Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener: On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. STACS 1995: 255-266

Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská: The Complexity of Systolic Dissemination of Information in Interconnection Networks. ITA 28(3-4): 303-342 (1994)

Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská: The Complexity of Systolic Dissemination of Information in Interconnection Networks. Canada-France Conference on Parallel and Distributed Computing 1994: 235-249

Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). SWAT 1994: 219-230

Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener: Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. ESA 1993: 200-211

Hubert Wagener: Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time. FOCS 1992: 593-599

Mikhail J. Atallah, Danny Z. Chen, Hubert Wagener: An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point. J. ACM 38(3): 516-533 (1991)

Helmut Alt, Johannes Blömer, Hubert Wagener: Approximation of Convex Polygons. ICALP 1990: 703-716

Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Discrete & Computational Geometry 3: 237-256 (1988)

Helmut Alt, Hubert Wagener: Approximation of Polygons by Rechtangles and Circles. Bulletin of the EATCS 36: 103-112 (1988)

Hubert Wagener: Triangulating a Monotone Polygon in Parallel. Workshop on Computational Geometry 1988: 136-147

Hubert Wagener: On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. CSL 1988: 384-399

Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Symposium on Computational Geometry 1987: 308-315

Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener: Parallel Computation on 2-3-Trees. ITA 17(4): 397-404 (1983)

Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener: Parallel Dictionaries in 2-3 Trees. ICALP 1983: 597-609