Publikationen pro Jahr
Publikationen pro Jahr
- 100 – 127 von 127 Ergebnissen
Suchergebnisse
-
1998
On-line scheduling of parallel jobs with runtime restrictions
Bischof, S. & Mayr, E. W., 1998, Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. Springer Verlag, S. 119-129 11 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1533 LNCS).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
5 Zitate (Scopus) -
1997
Counting Minimum Weight Spanning Trees
Broder, A. Z. & Mayr, E. W., Juli 1997, in: Journal of Algorithms. 24, 1, S. 171-176 6 S.Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung
18 Zitate (Scopus) -
Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks
Mayr, E. W. & Werchner, R., Juli 1997, in: Algorithmica. 18, 3, S. 445-460 16 S.Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung
7 Zitate (Scopus) -
Some complexity results for polynomial ideals
Mayr, E. W., Sept. 1997, in: Journal of Complexity. 13, 3, S. 303-325 23 S.Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung
Open Access40 Zitate (Scopus) -
The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
Koppenhagen, U. & Mayr, E. W., 1997, Fundamentals of Computation Theory - 11th International Symposium, FCT 1997, Proceedings. Chlebus, B. S. & Czaja, L. (Hrsg.). Springer Verlag, S. 257-268 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1279).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
5 Zitate (Scopus) -
Workshop 02: Routing and communication in interconnection networks
Mayr, E. & Das, C., 1997, in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1300 LNCS, S. 167-170 4 S.Publikation: Beitrag in Fachzeitschrift › Leitartikel
Open Access -
1996
A general method for efficient embeddings of graphs into optimal hypercubes
Heun, V. & Mayr, E. W., 1996, Euro-Par 1996 Parallel Processing - 2nd International Euro-Par Conference, Proceedings. Bouge, L., Fraigniaud, P., Mignotte, A., Robert, Y., Bouge, L., Fraigniaud, P., Mignotte, A. & Robert, Y. (Hrsg.). Springer Verlag, S. 222-233 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1123).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
Open Access2 Zitate (Scopus) -
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
Heun, V. & Mayr, E. W., März 1996, in: Journal of Algorithms. 20, 2, S. 375-399 25 S.Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung
16 Zitate (Scopus) -
Divide-and-conquer algorithms on the hypercube
Mayr, E. W. & Werchner, R., 20 Aug. 1996, in: Theoretical Computer Science. 162, 2, S. 283-296 14 S.Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung
Open Access2 Zitate (Scopus) -
Efficient dynamic embedding of arbitrary binary trees into hypercubes
Heun, V. & Mayr, E. W., 1996, Parallel Algorithms for Irregularly Structured Problems - 3rd International Workshop IRREGULAR 1996, Proceedings. Ferreira, A., Rolim, J., Saad, Y. & Yang, T. (Hrsg.). Springer Verlag, S. 287-298 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1117).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
16 Zitate (Scopus) -
Efficient parallel algorithms for scheduling with tree precedence constraints
Mayr, E. W. & Stadtherr, H., 1996, Euro-Par 1996 Parallel Processing - 2nd International Euro-Par Conference, Proceedings. Bouge, L., Fraigniaud, P., Mignotte, A. & Robert, Y. (Hrsg.). Springer Verlag, S. 543-554 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1124).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
Open Access -
Embedding graphs with bounded treewidth into optimal hypercubes
Heun, V. & Mayr, E. W., 1996, STACS 1996 - 13th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Puech, C. & Reischuk, R. (Hrsg.). Springer Verlag, S. 155-168 14 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1046).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
4 Zitate (Scopus) -
Exponential space computation of Groebner bases
Kuehnle, K. & Mayr, E. W., 1996, S. 63-71. 9 S.Publikation: Konferenzbeitrag › Papier › Begutachtung
20 Zitate (Scopus) -
Optimal algorithm for constructing the reduced Groebner basis of binomial ideals
Koppenhagen, U. & Mayr, E. W., 1996, S. 55-61. 7 S.Publikation: Konferenzbeitrag › Papier › Begutachtung
7 Zitate (Scopus) -
Optimal gröbner base algorithms for binomial ideals
Koppenhagen, U. & Mayr, E. W., 1996, Automata, Languages and Programming - 23rd International Colloquium, ICALP 1996, Proceedings. Meyer auf der Heide, F. & Monien, B. (Hrsg.). Springer Verlag, S. 244-255 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1099).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
2 Zitate (Scopus) -
1995
Optimal routing of parentheses on the hypercube
Mayr, E. W. & Werchner, R., 15 Apr. 1995, in: Journal of Parallel and Distributed Computing. 26, 2, S. 181-192 12 S.Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung
6 Zitate (Scopus) -
Preface
Mayr, E. W. & Puech, C., 1995, in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 900, S. V-VIPublikation: Beitrag in Fachzeitschrift › Leitartikel
-
Preface
Mayr, E. W., Schmidt, G. & Tinhofer, G., 1995, in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 903, S. VPublikation: Beitrag in Fachzeitschrift › Leitartikel
-
Preface
Enjalbert, P., Mayr, E. W. & Wagner, K. W., 4 Sept. 1995, in: Theoretical Computer Science. 148, 2, S. 181 1 S.Publikation: Beitrag in Fachzeitschrift › Leitartikel
Open Access -
Scheduling interval orders in parallel
Mayr, E. W., 1995, Proceedings of the 28th Annual Hawaii International Conference on System Sciences, HICSS 1995. IEEE Computer Society, S. 20-28 9 S. 375481. (Proceedings of the Annual Hawaii International Conference on System Sciences; Band 2).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
1 Zitat (Scopus) -
1994
Foreword
Enjalbert, P., Mayr, E. W. & Wagner, K. W., 1994, in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 775 LNCS, S. VPublikation: Beitrag in Fachzeitschrift › Leitartikel
1 Zitat (Scopus) -
Optimal expression evaluation and term matching on the Boolean hypercube and on hypercubic networks
Mayr, E. W. & Werchner, R., 1994, Proceedings of the Hawaii International Conference on System Sciences. Publ by IEEE, S. 140-149 10 S. (Proceedings of the Hawaii International Conference on System Sciences; Band 2).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
-
1993
Optimal tree contraction on the hypercube and related networks
Mayr, E. W. & Werchner, R., 1993, Algorithms ESA 1993 – 1st Annual European Symposium, Proceedings. Lengauer, T. (Hrsg.). Springer Verlag, S. 295-305 11 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 726 LNCS).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
-
Preface
Mayr, E. W., 1993, in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 657 LNCS, S. V-VIPublikation: Beitrag in Fachzeitschrift › Leitartikel
-
1989
On the spanning trees of weighted graphs
Mayr, E. W. & Plaxton, C. G., 1989, Graph-Theoretic Concepts in Computer Science - International Workshop, WG 1988, Proceedings. van Leeuwen, J. (Hrsg.). Springer Verlag, S. 394-405 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 344 LNCS).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
-
1983
TECHNIQUES FOR SOLVING GRAPH PROBLEMS IN PARALLEL ENVIRONMENTS.
Hochschild, P. H., Mayr, E. W. & Siegel, A. R., 1983, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, S. 351-359 9 S. (Annual Symposium on Foundations of Computer Science (Proceedings)).Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung
5 Zitate (Scopus) -
1981
Persistence of vector replacement systems is decidable
Mayr, E., Juni 1981, in: Acta Informatica. 15, 3, S. 309-318 10 S.Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung
57 Zitate (Scopus)