Graph-Theoretic Concepts in Computer Science: 18th International Workshop, WG '92 Wiesbaden-Naurod, Germany, June 18–20, 1992 Proceedings von Mayr, Ernst W

Volltext

Informatics and Medicine - From Molecules to Populations von Kuhn, K A, Knoll, A, Mewes, H-W, Schwaiger, M, Bode, A, Broy, M, Daniel, H, Feussner, H, Gradinger, R, Hauner, H, Höfler, H, Holzmann, B, Horsch, A, Kemper, A, Krcmar, H, Kochs, E F, Lange, R, Leidl, R, Mansmann, U, Mayr, E W, Meitinger, T, Molls, M, Navab, N, Nüsslin, F, Peschel, C, Reiser, M, Ring, J, Rummeny, E J, Schlichter, J, Schmid, R, Wichmann, H E, Ziegler, S

Volltext

STACS 94: 11th Annual Symposium on Theoretical Aspects of Computer Science Caen, France, February 24–26, 1994 Proceedings von Enjalbert, Patrice, Mayr, Ernst W, Wagner, Klaus W

Volltext

Graph-Theoretic Concepts in Computer Science: 20th International Workshop, WG '94 Herrsching, Germany, June 16–18, 1994 Proceedings von Mayr, Ernst W, Schmidt, Gunther, Tinhofer, Gottfried

Volltext

On-line scheduling of parallel jobs with runtime restrictions von Bischof, Stefan, W. Mayr, Ernst

Volltext

An algorithm for the general Petri net reachability problem von MAYR, E. W

Volltext

Efficient Embeddings into Hypercube-like Topologies von Heun, Volker, Mayr, Ernst W

Volltext

Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups von Koppenhagen, Ulla, Mayr, Ernst W.

Volltext

Distributed Systems and Algorithms von Mayr, Ernst W.

Volltext

The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups von Koppenhagen, Ulla, Mayr, Ernst W.

Volltext

The complexity of circuit value and network stability von Mayr, Ernst W., Subramanian, Ashok

Volltext

Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks von Mayr, E. W., Werchner, R.

Volltext

On-Line Scheduling of Parallel Jobs with Runtime Restrictions von Bischof, Stefan, Mayr, Ernst W.

Volltext

Methods in Year 50: Preserving the Past and Preparing for the Future von Haux, R., Aronsky, D., Leong, T. Y., McCray, A. T.

Volltext

Lectures on Proof Verification and Approximation Algorithms von Mayr, Ernst W, Prömel, Hans Jürgen, Steger, Angelika, Goos, G, Hartmanis, J

Volltext

Optimal Routing of Parentheses on the Hypercube von Mayr, E.W., Werchner, R.

Volltext

Counting Minimum Weight Spanning Trees von Broder, Andrei Z., Mayr, Ernst W.

Volltext

Comprehensive Triangular Decomposition von Chen, Changbo, Golubitsky, Oleg, Lemaire, François, Maza, Marc Moreno, Pan, Wei

Volltext

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube von Heun, Volker, Mayr, Ernst W.

Volltext

On the spanning trees of weighted graphs von MAYR, E. W, PLAXTON, C. G

Volltext