Hubert Wagener

24 papers A* 4A 2B 2C 1Journal 10Unranked 4
YearRankTypeTitle / Venue / Authors
2009 J jnl
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
SIAM J. Discret. Math.
Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener
1998 J jnl
Effective Systolic Algorithms for Gossiping in Cycles.
Parallel Process. Lett.
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener
1997 C conf
Holographic imaging of lines: a texture based approach.
IV
Alf Ritter, Oliver Deussen, Hubert Wagener, Thomas Strothotte
1997 J jnl
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes.
Inf. Comput.
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
1997 — conf
Rendering Gestures as Line Drawings.
Gesture Workshop
Frank Godenschweger, Thomas Strothotte, Hubert Wagener
1995 B conf
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
FCT
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener
1995 J jnl
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
Inf. Comput.
Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
1995 A conf
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
STACS
Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener
1995 J jnl
Translation queries for sets of polygons.
Int. J. Comput. Geom. Appl.
Mark de Berg, Hazel Everett, Hubert Wagener
1994 — conf
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).
SWAT
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
1994 — conf
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
Canada-France Conference on Parallel and Distributed Computing
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
1994 J jnl
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
RAIRO Theor. Informatics Appl.
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
1993 A conf
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
ESA
Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
1992 A* conf
Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time
FOCS
Hubert Wagener
1991 J jnl
An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point.
J. ACM
Mikhail J. Atallah, Danny Z. Chen, Hubert Wagener
1990 A* conf
Approximation of Convex Polygons.
ICALP
Helmut Alt, Johannes Blömer, Hubert Wagener
1988 J jnl
Approximation of Polygons by Rechtangles and Circles.
Bull. EATCS
Helmut Alt, Hubert Wagener
1988 J jnl
Congruence, Similarity, and Symmetries of Geometric Objects.
Discret. Comput. Geom.
Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
1988 B conf
On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs.
CSL
Hubert Wagener
1988 A* conf
Triangulating a Monotone Polygon in Parallel.
Workshop on Computational Geometry
Hubert Wagener
1987 — conf
Congruence, Similarity, and Symmetries of Geometric Objects.
SCG
Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
1986 — —
Parallel computational geometry - exploiting polygonal order for maximally parallel algorithms.
Hubert Wagener
1983 J jnl
Parallel Computation on 2-3-Trees.
RAIRO Theor. Informatics Appl.
Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener
1983 A* conf
Parallel Dictionaries in 2-3 Trees.
ICALP
Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener