 | 2000 |
|---|
| 17 |       | Martin Sauerhoff,
Ingo Wegener,
Ralph Werchner:
Optimal ordered binary decision diagrams for read-once formulas.
Discrete Applied Mathematics 103(1-3): 237-258 (2000) |
| 1999 |
|---|
| 16 |  | Martin Sauerhoff,
Ingo Wegener,
Ralph Werchner:
Relating Branching Program Size and Formula Size over the Full Binary Basis.
STACS 1999: 57-67 |
| 1998 |
|---|
| 15 | | Johannes Merkle,
Ralph Werchner:
On the Security of Server-Aided RSA Protocols.
Public Key Cryptography 1998: 99-116 |
| 1997 |
|---|
| 14 | | Ernst W. Mayr,
Ralph Werchner:
Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks.
Algorithmica 18(3): 445-460 (1997) |
| 13 | | Bernhard von Stengel,
Ralph Werchner:
Complexity of Searching an Immobile Hider in a Graph.
Discrete Applied Mathematics 78(1-3): 235-249 (1997) |
| 12 | | Johannes Merkle,
Ralph Werchner:
On the Security of Server aided RSA protocols
Electronic Colloquium on Computational Complexity (ECCC) 4(27): (1997) |
| 1996 |
|---|
| 11 | | Martin Sauerhoff,
Ingo Wegener,
Ralph Werchner:
Optimal Ordered Binary Decision Diagrams for Tree-like Circuits
Electronic Colloquium on Computational Complexity (ECCC) 3(22): (1996) |
| 10 | | Ernst W. Mayr,
Ralph Werchner:
Divide-and-Conquer Algorithms on the Hypercube.
Theor. Comput. Sci. 162(2): 283-296 (1996) |
| 1995 |
|---|
| 9 | | Bernd Becker,
Rolf Drechsler,
Ralph Werchner:
On the Relation Betwen BDDs and FDDs.
LATIN 1995: 72-83 |
| 8 | | Bernd Becker,
Rolf Drechsler,
Ralph Werchner:
On the Relation between BDDs and FDDs.
Inf. Comput. 123(2): 185-197 (1995) |
| 7 | | 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) |
| 6 | | Ernst W. Mayr,
Ralph Werchner:
Optimal Routing of Parentheses on the Hypercube.
J. Parallel Distrib. Comput. 26(2): 181-192 (1995) |
| 1994 |
|---|
| 5 | | 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 |
|---|
| 4 | | Ernst W. Mayr,
Ralph Werchner:
Optimal Tree Contraction on the Hypercube and Related Networks.
ESA 1993: 295-305 |
| 3 | | Ernst W. Mayr,
Ralph Werchner:
Divide-and-Conquer Algorithms on the Hypercube.
STACS 1993: 153-162 |
| 1992 |
|---|
| 2 | | Ernst W. Mayr,
Ralph Werchner:
Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks.
Heinz Nixdorf Symposium 1992: 195-206 |
| 1 | | Ernst W. Mayr,
Ralph Werchner:
Optimal Routing of Parentheses on the Hypercube.
SPAA 1992: 109-117 |
