Hubert Wagener

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
SIAM J. Discret. Math., 2009

1998
Effective Systolic Algorithms for Gossiping in Cycles.
Parallel Process. Lett., 1998

1997
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes.
Inf. Comput., 1997

Holographic imaging of lines: a texture based approach.
Proceedings of the First International Conference on Information Visualisation, 1997

Rendering Gestures as Line Drawings.
Proceedings of the Gesture and Sign Language in Human-Computer Interaction, 1997

1995
Translation queries for sets of polygons.
Int. J. Comput. Geom. Appl., 1995

Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
Inf. Comput., 1995

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
Proceedings of the STACS 95, 1995

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
RAIRO Theor. Informatics Appl., 1994

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).
Proceedings of the Algorithm Theory, 1994

1992
Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time
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.
J. ACM, 1991

1990
Approximation of Convex Polygons.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1988
Approximation of Polygons by Rechtangles and Circles.
Bull. EATCS, 1988

Congruence, Similarity, and Symmetries of Geometric Objects.
Discret. Comput. Geom., 1988

On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs.
Proceedings of the CSL '88, 1988

Triangulating a Monotone Polygon in Parallel.
Proceedings of the Computational Geometry and its Applications, 1988

1986
Parallel computational geometry - exploiting polygonal order for maximally parallel algorithms.
PhD thesis, 1986

1983
Parallel Computation on 2-3-Trees.
RAIRO Theor. Informatics Appl., 1983

Parallel Dictionaries in 2-3 Trees.
Proceedings of the Automata, 1983


  Loading...