Hubert Wagener

1998
21		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)
1997
20	EE	Frank Godenschweger, Thomas Strothotte, Hubert Wagener: Rendering Gestures as Line Drawings. Gesture Workshop 1997: 147-157
19		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)
1995
18		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
17		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
16		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)
15		Mark de Berg, Hazel Everett, Hubert Wagener: Translation queries for sets of polygons. Int. J. Comput. Geometry Appl. 5(3): 221-242 (1995)
1994
14		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
13		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
12		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)
1993
11		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
1992
10		Hubert Wagener: Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time FOCS 1992: 593-599
1991
9	EE	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)
1990
8		Helmut Alt, Johannes Blömer, Hubert Wagener: Approximation of Convex Polygons. ICALP 1990: 703-716
1988
7		Hubert Wagener: On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. CSL 1988: 384-399
6		Hubert Wagener: Triangulating a Monotone Polygon in Parallel. Workshop on Computational Geometry 1988: 136-147
5		Helmut Alt, Hubert Wagener: Approximation of Polygons by Rechtangles and Circles. Bulletin of the EATCS 36: 103-112 (1988)
4		Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Discrete & Computational Geometry 3: 237-256 (1988)
1987
3	EE	Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Symposium on Computational Geometry 1987: 308-315
1983
2		Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener: Parallel Dictionaries in 2-3 Trees. ICALP 1983: 597-609
1		Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener: Parallel Computation on 2-3-Trees. ITA 17(4): 397-404 (1983)

Coauthor Index

1	Helmut Alt	[3] [4] [5] [8]
2	Mikhail J. Atallah	[9]
3	Mark de Berg	[15]
4	Johannes Blömer	[8]
5	Danny Z. Chen	[9]
6	Hazel Everett	[15]
7	Frank Godenschweger	[20]
8	Juraj Hromkovic	[11] [12] [13] [14] [16] [17] [18] [19] [21]
9	Przemyslawa Kanarek	[17]
10	Ralf Klasing	[11] [12] [13] [14] [16] [17] [18] [19] [21]
11	Krzysztof Lorys	[17]
12	Kurt Mehlhorn	[3] [4]
13	Dana Pardubská	[12] [14] [18] [21]
14	Wolfgang J. Paul	[1] [2]
15	Elena Stöhr	[11] [16]
16	Thomas Strothotte	[20]
17	Walter Unger	[12] [13] [14] [17] [18] [19]
18	Uzi Vishkin	[1] [2]
19	Juraj Waczulík	[18] [21]
20	Emo Welzl	[3] [4]

Colors in the list of coauthors