Ralph Werchner

According to our database1, Ralph Werchner authored at least 15 papers between 1992 and 2000.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2000
Optimal ordered binary decision diagrams for read-once formulas.
Discret. Appl. Math., 2000

1999
Relating Branching Program Size and Formula Size over the Full Binary Basis.
Proceedings of the STACS 99, 1999

1997
On the Security of Server aided RSA protocols
Electron. Colloquium Comput. Complex., 1997

Complexity of Searching an Immobile Hider in a Graph.
Discret. Appl. Math., 1997

Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks.
Algorithmica, 1997

1996
Optimal Ordered Binary Decision Diagrams for Tree-like Circuits
Electron. Colloquium Comput. Complex., 1996

1995
Optimal Routing of Parentheses on the Hypercube.
J. Parallel Distributed Comput., 1995

A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.
Inf. Process. Lett., 1995

On the Relation between BDDs and FDDs.
Inf. Comput., 1995

On the Relation Betwen BDDs and FDDs.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994
Divide-and-Conquer Algorithmen auf dem Hyperwürfel.
PhD thesis, 1994

Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993
Divide and conquer algorithms on the hypercube
Forschungsberichte, TU Munich, 1993

Optimal Tree Contraction on the Hypercube and Related Networks.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992


  Loading...