Ernst W. Mayr

According to our database, Ernst W. Mayr authored at least 74 papers between 1981 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2022

Memories on Vladimir Gerdt.

Ernst W. Mayr, Werner M. Seiler, Evgenii V. Vorozhtsov

J. Symb. Comput., 2022

2021

Vladimir Gerdt dies at 73.

Ernst W. Mayr, Werner M. Seiler, Evgenii V. Vorozhtsov

ACM Commun. Comput. Algebra, 2021

2017

Editorial: Special Issue on "Theoretical Aspects of Computer Science" (STACS 2015).

Ernst W. Mayr

Theory Comput. Syst., 2017

2016

Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities.

Ernst W. Mayr, Jeremias Weihmann

Fundam. Informaticae, 2016

2015

Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms.

Ernst W. Mayr, Jeremias Weihmann

Fundam. Informaticae, 2015

Front Matter, Table of Contents, Preface, Conference Organization.

Ernst W. Mayr, Nicolas Ollinger

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application.

Ernst W. Mayr, Jeremias Weihmann

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013

Dimension-dependent bounds for Gröbner bases of polynomial ideals.

Ernst W. Mayr, Stephan Ritscher

J. Symb. Comput., 2013

Inequalities for the Number of Walks in Graphs.

Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr

Algorithmica, 2013

Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities.

Ernst W. Mayr, Jeremias Weihmann

Proceedings of the Reachability Problems - 7th International Workshop, 2013

Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets.

Ernst W. Mayr, Jeremias Weihmann

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

2011

Space-efficient Gröbner basis computation without degree bounds.

Ernst W. Mayr, Stephan Ritscher

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

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

Ernst W. Mayr, Stephan Ritscher

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk).

Ernst W. Mayr

Proceedings of the Computer Algebra in Scientific Computing - 12th International Workshop, 2010

2009

Mathematik und die Informatik.

Wolfram Koepf, Ernst W. Mayr

Inform. Spektrum, 2009

Bioinformatik.

Ralf Hofestädt, Ernst W. Mayr

Inform. Spektrum, 2009

2008

Lebenslanges Lernen in der Informatik: Beiträge der Hochschulen und Erwartungen der Wirtschaft - Vorwort.

Ernst W. Mayr

Proceedings of the Lebenslanges Lernen in der Informatik: Workshop im Rahmen der GI-Jahrestagung INFORMATIK 2008 am 11. September 2008 in München, 2008

2007

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

Dmytro Chibisov, Ernst W. Mayr

Proceedings of the Symbolic-Numeric Computation, 2007

Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations.

Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov

Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2006

On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions.

Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov

Proceedings of the Computer Algebra in Scientific Computing, 9th International Workshop, 2006

2005

Fachinformationssystem Informatik (FIS-I) und Semantische Technologien für Informationsportale (SemIPort).

Peter Fankhauser, Norbert Fuhr, Jens Hartmann, Anthony Jameson, Claus-Peter Klas, Stefan Klink, Agnes Koschmider, Sascha Kriewel, Patrick Lehti, Peter Luksch, Ernst W. Mayr, Andreas Oberweis, Paul Ortyl, Stefan Pfingstl, Patrick Reuther, Ute Rusnak, Guido Sautter, Klemens Böhm, André Schaefer, Lars Schmidt-Thieme, Eric Schwarzkopf, Nenad Stojanovic, Rudi Studer, Roland Vollmar, Bernd Walter, Alexander Weber

Proceedings of the 35. Jahrestagung der Gesellschaft für Informatik, 2005

Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time.

Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov

Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004

Entwicklung eines Informationsportals für die Informatik.

Agnes Koschmider, Michael Ley, Peter Luksch, Jörg Maas, Ernst W. Mayr, Andreas Oberweis, Paul Ortyl, Stefan Pfingstl, Ute Rusnak, Daniel Sommer, Wolffried Stucky, Roland Vollmar

Proceedings of the 34. Jahrestagung der Gesellschaft für Informatik, 2004

Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods.

Dmytro Chibisov, Ernst W. Mayr, Sergey Pankratov

Proceedings of the Automated Deduction in Geometry, 5th International Workshop, 2004

2003

Efficient Embeddings into Hypercube-like Topologies.

Volker Heun, Ernst W. Mayr

Comput. J., 2003

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

Lutz Horn, Michael Ley, Peter Luksch, Jörg Maas, Ernst W. Mayr, Andreas Oberweis, Paul Ortyl, Stefan Pfingstl, Enzo Rossi, Felix Rüssel, Ute Rusnak, Daniel Sommer, Wolffried Stucky, Roland Vollmar, Marco von Mevius

Proceedings of the 33. Jahrestagung der Gesellschaft für Informatik, Innovative Informatikanwendungen, INFORMATIK 2003, Frankfurt am Main, Germany, September 29, 2003

2002

Efficient Dynamic Embeddings of Binary Trees into Hypercubes.

Volker Heun, Ernst W. Mayr

J. Algorithms, 2002

Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes.

Volker Heun, Ernst W. Mayr

J. Algorithms, 2002

Complexity Theory and Algorithms.

Ernst W. Mayr

Proceedings of the Euro-Par 2002, 2002

2001

On-line scheduling of parallel jobs with runtime restrictions.

Stefan Bischof, Ernst W. Mayr

Theor. Comput. Sci., 2001

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups.

Ulla Koppenhagen, Ernst W. Mayr

J. Symb. Comput., 2001

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes.

Volker Heun, Ernst W. Mayr

J. Parallel Distributed Comput., 2001

2000

Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups.

Ulla Koppenhagen, Ernst W. Mayr

Inf. Comput., 2000

In Is on the Boundary: Complexity Considerations for Polynominal Ideals.

Ernst W. Mayr

Proceedings of the Theoretical Computer Science, 2000

Distributed Systems and Algorithms.

Ernst W. Mayr

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals.

Ulla Koppenhagen, Ernst W. Mayr

J. Symb. Comput., 1999

International Workshop on Communication and Data Management in Large Networks.

Ernst W. Mayr, Friedhelm Meyer auf der Heide, Rolf Wanka

Proceedings of the Informatik '99, 1999

1998

Parallel Continuous Randomized Load Balancing (Extended Abstract).

Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

Distributed Systems and Databases.

Lionel Brunie, Ernst W. Mayr

Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997

Some Complexity Results for Polynomial Ideals.

Ernst W. Mayr

J. Complex., 1997

Counting Minimum Weight Spanning Trees.

Andrei Z. Broder, Ernst W. Mayr

J. Algorithms, 1997

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

Ernst W. Mayr, Ralph Werchner

Algorithmica, 1997

The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups.

Ulla Koppenhagen, Ernst W. Mayr

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996

Divide-and-Conquer Algorithms on the Hypercube.

Ernst W. Mayr, Ralph Werchner

Theor. Comput. Sci., 1996

Scheduling Interval Orders in Parallel.

Ernst W. Mayr

Parallel Algorithms Appl., 1996

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube.

Volker Heun, Ernst W. Mayr

J. Algorithms, 1996

Embedding Graphs with Bounded Treewidth into Optimal Hypercubes.

Volker Heun, Ernst W. Mayr

Proceedings of the STACS 96, 1996

Exponential Space Computation of Gröbner Bases.

Klaus Kühnle, Ernst W. Mayr

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes.

Volker Heun, Ernst W. Mayr

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

Optimal Gröbner Base Algorithms for Binomial Ideals.

Ulla Koppenhagen, Ernst W. Mayr

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Efficient Parallel Algorithms for Scheduling with Tree Precedence Constrinats.

Ernst W. Mayr, Hans Stadtherr

Proceedings of the Euro-Par '96 Parallel Processing, 1996

A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes.

Volker Heun, Ernst W. Mayr

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Optimal Routing of Parentheses on the Hypercube.

Ernst W. Mayr, Ralph Werchner

J. Parallel Distributed Comput., 1995

On Polynomial Ideals, Their Complexity, and Applications.

Ernst W. Mayr

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks.

Ernst W. Mayr, Ralph Werchner

Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993

Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube.

Ernst W. Mayr, C. Greg Plaxton

J. Parallel Distributed Comput., 1993

Optimal Tree Contraction on the Hypercube and Related Networks.

Ernst W. Mayr, Ralph Werchner

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

The Complexity of Circuit Value and Network Stability.

Ernst W. Mayr, Ashok Subramanian

J. Comput. Syst. Sci., 1992

On the spanning trees of weighted graphs.

Ernst W. Mayr, C. Greg Plaxton

Comb., 1992

Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks.

Ernst W. Mayr, Ralph Werchner

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991

Embedding complete binary trees in faulty hypercubes.

Alexander Wang, Robert Cypher, Ernst W. Mayr

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1989

Parallel Approximation Algorithms for Bin Packing

Richard J. Anderson, Ernst W. Mayr, Manfred K. Warmuth

Inf. Comput., September, 1989

Projections of Vector Addition System Reachability Sets are Semilinear.

Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr

Theor. Comput. Sci., 1989

Membership in Plynomial Ideals over Q Is Exponential Space Complete.

Ernst W. Mayr

Proceedings of the STACS 89, 1989

1988

Parallel Approximation Algorithms.

Ernst W. Mayr

Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

1987

Two Processor Scheduling is in NC.

David P. Helmbold, Ernst W. Mayr

SIAM J. Comput., 1987

Parallelism and the Maximal Path Problem.

Richard J. Anderson, Ernst W. Mayr

Inf. Process. Lett., 1987

1986

Applications of Parallel Scheduling to Perfect Graphs.

David P. Helmbold, Ernst W. Mayr

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

Perfect Graphs and Parallel Algorithms.

David P. Helmbold, Ernst W. Mayr

Proceedings of the International Conference on Parallel Processing, 1986

1984

An Algorithm for the General Petri Net Reachability Problem.

Ernst W. Mayr

SIAM J. Comput., 1984

Node Weighted Matching.

Thomas H. Spencer, Ernst W. Mayr

Proceedings of the Automata, 1984

1983

Techniques for Solving Graph Problems in Parallel Environments

Peter H. Hochschild, Ernst W. Mayr, Alan R. Siegel

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1981

The Complexity of the Finite Containment Problem for Petri Nets.

Ernst W. Mayr, Albert R. Meyer

J. ACM, 1981

Persistence of Vector Replacement Systems is Decidable.

Ernst W. Mayr

Acta Informatica, 1981