MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Ralph Werchner" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

10 documents found, showing 1 through 10.

ATOM

On the security of server-aided RSA protocols
by Johannes Merkle, Ralph Werchner — 1998 — Proc. PKC '98 , Lect. Notes in Comp. Sci., Vol.1431
…On the Security of Server-Aided RSA Protocols Johannes Merkle ⋆ and Ralph Werchner Universität…
Cited by 6 (1 self) – Add To MetaCart

Optimal Ordered Binary Decision Diagrams for Fanout-Free Circuits
by Martin Sauerhoff, Ingo Wegener, Ralph Werchner — 1996 — in Proc. SASIMI96
….uni-dortmund.de Ralph Werchner FB Mathematik Univ. Frankfurt a. M. 60054 Frankfurt, Germany werchner…
Cited by 3 (0 self) – Add To MetaCart

Relating Branching Program Size and Formula Size over the Full Binary Basis
by Martin Sauerhoff, Ingo Wegener, Ralph Werchner — 1998 — In Proc. of 16th STACS, LNCS 1563
… , Ingo Wegener 1 , and Ralph Werchner 2 1 FB Informatik, LS 2, Univ. Dortmund, 44221 Dortmund…
Cited by 3 (3 self) – Add To MetaCart

Optimal Ordered Binary Decision Diagrams for Tree-like Circuits
by Martin Sauerhoff, Ingo Wegener, Ralph Werchner — 1996 — Proc. of SASIMI
… Informatik, LS II Univ. Dortmund 44221 Dortmund Germany Ralph Werchner FB Mathematik Univ. Frankfurt a. M…
Cited by 2 (1 self) – Add To MetaCart

Satisfiability Problems for Ordered Functional Decision Diagrams
by Ralph Werchner, Thilo Harich, Rolf Drechsler, Bernd Becker — 1996 — Universitat Frankfurt
…Satisfiability Problems for Ordered Functional Decision Diagrams Ralph Werchner Thilo Harich Rolf…
Cited by 3 (2 self) – Add To MetaCart

Divide-and-Conquer Algorithms on the Hypercube
by Ernst W. Mayr, Ralph Werchner — 1993 — Theoretical Computer Science
… Universitat Munchen, D-80290 Munchen Ralph Werchner 2 Fachbereich Mathematik, J.W. Goethe-Universitat, D…
Cited by 5 (3 self) – Add To MetaCart

Complexity of Searching an Immobile Hider in a Graph
by Bernhard Von Stengel, Ralph Werchner — 1996
…Complexity of Searching an Immobile Hider in a Graph Bernhard von Stengel 1 and Ralph Werchner…
Cited by 3 (0 self) – Add To MetaCart

Optimal Routing of Parentheses on the Hypercube
by Ernst W. Mayr, Ralph Werchner, Fachbereich Informatik — 1994 — In Proceedings of the Symposium on Parallel Architectures and Algorithms
…Optimal Routing of Parentheses on the Hypercube Ernst W. Mayr Ralph Werchner Fachbereich Informatik…
Cited by 14 (6 self) – Add To MetaCart

A Combined BIT and TIMESTAMP Algorithm for the List Update Problem
by Susanne Albers, Bernhard Von Stengel, Ralph Werchner — 1995 — INFORMATION PROCESSING LETTERS
… 56 (1995) 135--139 Susanne Albers, Bernhard von Stengel, Ralph Werchner International Computer…
Cited by 24 (9 self) – Add To MetaCart

On the Relation Between BDDs and FDDs
by Bernd Becker, Rolf Drechsler, Ralph Werchner, Fachbereich Informatik, Johann Wolfgang Goethe-universitat — 1995 — Information and Computation
…On the Relation Between BDDs and FDDs Bernd Becker Rolf Drechsler Ralph Werchner Fachbereich 20…
Cited by 27 (12 self) – Add To MetaCart

Showing 1 through 10.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB