Foto von Ernst Mayr

Scopus-Profil ansehen

Ernst Mayr

Prof. Dr. rer. nat.

1981 …2022

Publikationen pro Jahr

Filter
Konferenzbeitrag

Suchergebnisse

  • 2014

    A framework for classical Petri net problems: Conservative Petri nets as an application

    Mayr, E. W. & Weihmann, J., 2014, Application and Theory of Petri Nets and Concurrency - 35th International Conference, PETRI NETS 2014, Proceedings. Springer Verlag, S. 314-333 20 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 8489 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    5 Zitate (Scopus)
  • 2013

    Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities

    Mayr, E. W. & Weihmann, J., 2013, Reachability Problems - 7th International Workshop, RP 2013, Proceedings. Springer Verlag, S. 209-221 13 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 8169 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    5 Zitate (Scopus)

  • Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets

    Mayr, E. W. & Weihmann, J., 2013, Application and Theory of Petri Nets and Concurrency - 34th International Conference, PETRI NETS 2013, Proceedings. S. 70-89 20 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 7927 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    5 Zitate (Scopus)
  • 2012

    Inequalities for the number of walks in graphs

    Hemmecke, R., Kosub, S., Mayr, E. W., Täubig, H. & Weihmann, J., 2012, 9th Meeting on Analytic Algorithmics and Combinatorics 2012, ANALCO 2012. Society for Industrial and Applied Mathematics Publications, S. 26-39 14 S. (9th Meeting on Analytic Algorithmics and Combinatorics 2012, ANALCO 2012).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    2 Zitate (Scopus)
  • 2011

    Space-efficient Gröbner basis computation without degree bounds

    Mayr, E. W. & Ritscher, S., 2011, ISSAC 2011 - Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation. S. 257-264 8 S. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    8 Zitate (Scopus)
  • 2010

    Degree bounds for Gröbner bases of low-dimensional polynomial ideals

    Mayr, E. W. & Ritscher, S., 2010, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010. Association for Computing Machinery (ACM), S. 21-27 7 S. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    10 Zitate (Scopus)
  • 2007

    Motion planning for 6R-Robots: Multiple tasks with constrained velocity and orientation of the end-effector

    Chibisov, D. & Mayr, E. W., 2007, SNC'07 - Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation. S. 72-78 7 S. (SNC'07 - Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • Stability investigation of a difference scheme for incompressible navier-stokes equations

    Chibisov, D., Ganzha, V., Mayr, E. W. & Vorozhtsov, E. V., 2007, Computer Algebra in Scientific Computing - 10th International Workshop, CASC 2007, Proceedings. Springer Verlag, S. 102-117 16 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 4770 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    2 Zitate (Scopus)
  • 2006

    On the provably tight approximation of optimal meshing for non-convex regions

    Chibisov, D., Ganzha, V., Mayr, E. W. & Vorozhtsov, E. V., 2006, Computer Algebra in Scientific Computing - 9th International Workshop, CASC 2006, Proceedings. Springer Verlag, S. 109-128 20 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 4194 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)

  • Spatial planning and geometric optimization: Combining configuration space and energy methods

    Chibisov, D., Mayr, E. W. & Pankratov, S., 2006, Automated Deduction in Geometry - 5th International Workshop, ADG 2004, Revised Papers. S. 156-168 13 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 3763 LNAI).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)
  • 2005

    Generation of orthogonal grids on curvilinear trimmed regions in constant time

    Chibisov, D., Ganzha, V., Mayr, E. W. & Vorozhtsov, E. V., 2005, Computer Algebra in Scientific Computing - 8th International Workshop, CASC 2005, Proceedings. S. 105-114 10 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 3718 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    3 Zitate (Scopus)
  • 2004

    Entwicklung eines Informationsportals für die Informatik

    Koschmider, A., Ley, M., Luksch, P., Maas, J., Mayr, E. W., Oberweis, A., Ortyl, P., Pfingstl, S., Rusnak, U., Sommer, D., Stucky, W. & Vollmar, R., 2004, 34. Jahrestagung der Gesellschaft fur Informatik, Informatik verbindet, INFORMATIK 2004 - Band 2. Dadam, P. & Reichert, M. (Hrsg.). Gesellschaft fur Informatik (GI), S. 208-212 5 S. (Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI); Band P-51).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • Exploring new frontiers of theoretical informatics: IFIP 18th World Computer Congress TC1 3rd International Conference on Theoretical Computer Science (TCS2004) 22-27 August 2004 Toulouse, France

    Levy, J. J., Mayr, E. W. & Mitchell, J. C., 2004, Exploring New Frontiers of Theoretical Informatics - IFIP 18th World Computer Congress TC1 and 3rd International Conference on Theoretical Computer Science, TCS 2004. Springer New York LLC, (IFIP Advances in Information and Communication Technology; Band 155).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • 2003

    Konzeption und Betrieb eines Kompetenz- und Dienstleistungsnetzes für die Informatik

    Horn, L., Ley, M., Luksch, P., Maas, J., Mayr, E. W., Oberweis, A., Ortyl, P., Pfingstl, S., Rossi, E., Rüssel, F., Rusnak, U., Sommer, D., Stucky, W., Vollmar, R. & von Mevius, M., 2003, 33. Jahrestagung der Gesellschaft fur Informatik, Innovative Informatikanwendungen, INFORMATIK 2003 - Band 1. Dittrich, K. R., Konig, W., Oberweis, A., Rannenberg, K. & Wahlster, W. (Hrsg.). Gesellschaft fur Informatik (GI), S. 132-147 16 S. (Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI); Band P-34).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)
  • 2002

    Complexity theory and algorithms

    Mayr, E. W., 2002, Euro-Par 2002 Parallel Processing - 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002 Proceedings. Monien, B. & Feldmann, R. (Hrsg.). Springer Verlag, S. 391 1 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 2400).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • 2000

    Distributed systems and algorithms

    Mayr, E. W., 2000, Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings. Bode, A., Ludwig, T., Karl, W. & Wismüller, R. (Hrsg.). Springer Verlag, S. 573-574 2 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1900).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access

  • It is on the boundary: Complexity considerations for polynomial ideals

    Mayr, E. W., 2000, Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - International Conference IFIP TCS 2000, Proceedings. van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P. D. & Ito, T. (Hrsg.). Springer Verlag, S. 99 1 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1872).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
  • 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

    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)
  • 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 Access
    2 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)

  • 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

    On polynomial ideals, their complexity, and applications

    Mayr, E. W., 1995, Fundamentals of Computation Theory - 10th International Conference, FCT 1995, Proceedings. Reichel, H. (Hrsg.). Springer Verlag, S. 89-105 17 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 965).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    2 Zitate (Scopus)

  • 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

    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

    Divide-and-conquer algorithms on the hypercube

    Mayr, E. W. & Werchner, R., 1993, STACS 1993 - 10th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Enjalbert, P., Finkel, A. & Wagner, K. W. (Hrsg.). Springer Verlag, S. 153-162 10 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 665 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)

  • Graph-theoretic concepts in computer science: 18th international workshop, WG ’92 Wiesbaden-Naurod, Germany, June 18-20, 1992 proceedings

    Mayr, E. W., 1993, Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings. Mayr, E. W. (Hrsg.). Springer Verlag, (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 657 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • Optimal implementation of general divide-and-conquer on the hypercube and related networks

    Mayr, E. W. & Werchner, R., 1993, Parallel Architectures and Their Efficient Use - First Heinz Nixdorf Symposium, Proceedings. Meyer auf der Heide, F., Monien, B. & Rosenberg, A. L. (Hrsg.). Springer Verlag, S. 195-206 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 678 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • 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

  • 1992

    Optimal routing of parentheses on the hypercube

    Mayr, E. W. & Werchner, R., 1992, 4th Annual ACM Symposium on Parallel Algorithms and Architectures. Publ by ACM, S. 109-117 9 S. (4th Annual ACM Symposium on Parallel Algorithms and Architectures).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    6 Zitate (Scopus)
  • 1991

    Embedding complete binary trees in faulty hypercubes

    Wang, A., Cypher, R. & Mayr, E., 1991, Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991. Institute of Electrical and Electronics Engineers Inc., S. 112-119 8 S. 218290. (Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    5 Zitate (Scopus)
  • 1989

    Complexity of circuit value and network stability

    Mayr, E. W. & Subramanian, A., 1989, Proc Struct Complexity Theor Fourth Ann Conf. Anon (Hrsg.). Publ by IEEE, S. 114-123 10 S. (Proc Struct Complexity Theor Fourth Ann Conf).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    14 Zitate (Scopus)

  • 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

  • 1987

    Applications of parallel scheduling to perfect graphs

    Helmbold, D. & Mayr, E., 1987, Graph-Theoretic Concepts in Computer Science - International Workshop, WG 1986, Proceedings. Schmidt, G. & Tinhofer, G. (Hrsg.). Springer Verlag, S. 188-203 16 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 246 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    2 Zitate (Scopus)
  • 1986

    PERFECT GRAPHS AND PARALLEL ALGORITHMS.

    Helmbold, D. & Mayr, E., 1986, Proceedings of the International Conference on Parallel Processing. Hwang, K., Jacobs, S. M. & Swartzlander, E. E. (Hrsg.). IEEE, S. 853-860 8 S. (Proceedings of the International Conference on Parallel Processing).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    19 Zitate (Scopus)

  • Two processor scheduling is in NC

    Helmbold, D. & Mayr, E., 1986, VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings. Mehlhorn, K., Makedon, F., Papatheodorou, T. & Spirakis, P. (Hrsg.). Springer Verlag, S. 12-25 14 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 227 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    7 Zitate (Scopus)
  • 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)