default search action
Ralph Werchner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
- [j7]Martin Sauerhoff, Ingo Wegener, Ralph Werchner:
Optimal ordered binary decision diagrams for read-once formulas. Discret. Appl. Math. 103(1-3): 237-258 (2000)
1990 – 1999
- 1999
- [c8]Martin Sauerhoff, Ingo Wegener, Ralph Werchner:
Relating Branching Program Size and Formula Size over the Full Binary Basis. STACS 1999: 57-67 - 1998
- [c7]Johannes Merkle, Ralph Werchner:
On the Security of Server-Aided RSA Protocols. Public Key Cryptography 1998: 99-116 - 1997
- [j6]Ernst W. Mayr, Ralph Werchner:
Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks. Algorithmica 18(3): 445-460 (1997) - [j5]Bernhard von Stengel, Ralph Werchner:
Complexity of Searching an Immobile Hider in a Graph. Discret. Appl. Math. 78(1-3): 235-249 (1997) - [i3]Johannes Merkle, Ralph Werchner:
On the Security of Server aided RSA protocols. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j4]Ernst W. Mayr, Ralph Werchner:
Divide-and-Conquer Algorithms on the Hypercube. Theor. Comput. Sci. 162(2): 283-296 (1996) - [i2]Martin Sauerhoff, Ingo Wegener, Ralph Werchner:
Optimal Ordered Binary Decision Diagrams for Tree-like Circuits. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j3]Bernd Becker, Rolf Drechsler, Ralph Werchner:
On the Relation between BDDs and FDDs. Inf. Comput. 123(2): 185-197 (1995) - [j2]Susanne Albers, Bernhard von Stengel, Ralph Werchner:
A Combined BIT and TIMESTAMP Algorithm for the List Update Problem. Inf. Process. Lett. 56(3): 135-139 (1995) - [j1]Ernst W. Mayr, Ralph Werchner:
Optimal Routing of Parentheses on the Hypercube. J. Parallel Distributed Comput. 26(2): 181-192 (1995) - [c6]Bernd Becker, Rolf Drechsler, Ralph Werchner:
On the Relation Betwen BDDs and FDDs. LATIN 1995: 72-83 - 1994
- [b1]Ralph Werchner:
Divide-and-Conquer Algorithmen auf dem Hyperwürfel. Goethe University Frankfurt, Frankfurt am Main, Germany, 1994, pp. 1-148 - [c5]Ernst W. Mayr, Ralph Werchner:
Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks. HICSS (2) 1994: 140-149 - 1993
- [c4]Ernst W. Mayr, Ralph Werchner:
Optimal Tree Contraction on the Hypercube and Related Networks. ESA 1993: 295-305 - [c3]Ernst W. Mayr, Ralph Werchner:
Divide-and-Conquer Algorithms on the Hypercube. STACS 1993: 153-162 - [i1]Ernst W. Mayr, Ralph Werchner:
Divide and conquer algorithms on the hypercube. Forschungsberichte, TU Munich TUM I 9322: 1-14 (1993) - 1992
- [c2]Ernst W. Mayr, Ralph Werchner:
Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks. Heinz Nixdorf Symposium 1992: 195-206 - [c1]Ernst W. Mayr, Ralph Werchner:
Optimal Routing of Parentheses on the Hypercube. SPAA 1992: 109-117
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-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint