default search action
Hubert Wagener
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j10]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. Discret. Math. 23(3): 1612-1645 (2009)
1990 – 1999
- 1998
- [j9]Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener:
Effective Systolic Algorithms for Gossiping in Cycles. Parallel Process. Lett. 8(2): 197-205 (1998) - 1997
- [j8]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) - [c13]Frank Godenschweger, Thomas Strothotte, Hubert Wagener:
Rendering Gestures as Line Drawings. Gesture Workshop 1997: 147-157 - [c12]Alf Ritter, Oliver Deussen, Hubert Wagener, Thomas Strothotte:
Holographic imaging of lines: a texture based approach. IV 1997: 272-278 - 1995
- [j7]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) - [j6]Mark de Berg, Hazel Everett, Hubert Wagener:
Translation queries for sets of polygons. Int. J. Comput. Geom. Appl. 5(3): 221-242 (1995) - [c11]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 - [c10]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 - 1994
- [j5]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská:
The Complexity of Systolic Dissemination of Information in Interconnection Networks. RAIRO Theor. Informatics Appl. 28(3-4): 303-342 (1994) - [c9]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 - [c8]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 - 1993
- [c7]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
- [c6]Hubert Wagener:
Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time. FOCS 1992: 593-599 - 1991
- [j4]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
- [c5]Helmut Alt, Johannes Blömer, Hubert Wagener:
Approximation of Convex Polygons. ICALP 1990: 703-716
1980 – 1989
- 1988
- [j3]Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl:
Congruence, Similarity, and Symmetries of Geometric Objects. Discret. Comput. Geom. 3: 237-256 (1988) - [j2]Helmut Alt, Hubert Wagener:
Approximation of Polygons by Rechtangles and Circles. Bull. EATCS 36: 103-112 (1988) - [c4]Hubert Wagener:
Triangulating a Monotone Polygon in Parallel. Workshop on Computational Geometry 1988: 136-147 - [c3]Hubert Wagener:
On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. CSL 1988: 384-399 - 1987
- [c2]Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl:
Congruence, Similarity, and Symmetries of Geometric Objects. SCG 1987: 308-315 - 1986
- [b1]Hubert Wagener:
Parallel computational geometry - exploiting polygonal order for maximally parallel algorithms. Technical University of Berlin, Germany, 1986 - 1983
- [j1]Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener:
Parallel Computation on 2-3-Trees. RAIRO Theor. Informatics Appl. 17(4): 397-404 (1983) - [c1]Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener:
Parallel Dictionaries in 2-3 Trees. ICALP 1983: 597-609
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: