Ernst W. Mayr

Publication Activity (10 Years)

Years Active: 1981-2022
Publications (10 Years): 4

Top Topics

Polynomially Bounded

Discrete Event Systems

Top Venues

Fundam. Informaticae

J. Symb. Comput.

Theory Comput. Syst.

Publications

Ernst W. Mayr, Werner M. Seiler, Evgenii V. Vorozhtsov
Memories on Vladimir Gerdt. J. Symb. Comput. 109 (2022)
Ernst W. Mayr, Werner M. Seiler, Evgenii V. Vorozhtsov
Vladimir Gerdt dies at 73. ACM Commun. Comput. Algebra 55 (1) (2021)
Ernst W. Mayr
Editorial: Special Issue on "Theoretical Aspects of Computer Science" (STACS 2015). Theory Comput. Syst. 61 (4) (2017)
Ernst W. Mayr, Jeremias Weihmann
Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities. Fundam. Informaticae 143 (3-4) (2016)
Ernst W. Mayr, Jeremias Weihmann
Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms. Fundam. Informaticae 137 (1) (2015)
Ernst W. Mayr, Nicolas Ollinger
Front Matter, Table of Contents, Preface, Conference Organization. STACS (2015)
Ernst W. Mayr, Jeremias Weihmann
A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application. Petri Nets (2014)
Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr
Inequalities for the Number of Walks in Graphs. Algorithmica 66 (4) (2013)
Ernst W. Mayr, Stephan Ritscher
Dimension-dependent bounds for Gröbner bases of polynomial ideals. J. Symb. Comput. 49 (2013)
Ernst W. Mayr, Jeremias Weihmann
Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets. Petri Nets (2013)
Ernst W. Mayr, Jeremias Weihmann
Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities. RP (2013)
Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann
Inequalities for the Number of Walks in Graphs. ANALCO (2012)
Ernst W. Mayr, Stephan Ritscher
Space-efficient Gröbner basis computation without degree bounds. ISSAC (2011)
Ernst W. Mayr
From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk). CASC (2010)
Ernst W. Mayr, Stephan Ritscher
Degree bounds for Gröbner bases of low-dimensional polynomial ideals. ISSAC (2010)
Ralf Hofestädt, Ernst W. Mayr
Bioinformatik. Inform. Spektrum 32 (4) (2009)
Wolfram Koepf, Ernst W. Mayr
Mathematik und die Informatik. Inform. Spektrum 32 (1) (2009)
Ernst W. Mayr
Lebenslanges Lernen in der Informatik: Beiträge der Hochschulen und Erwartungen der Wirtschaft - Vorwort. Lebenslanges Lernen in der Informatik (2008)
Dmytro Chibisov, Ernst W. Mayr
Motion planning for 6R-Robots: multiple tasks with constrained velocity and orientation of the end-effector. SNC (2007)
Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov
Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations. CASC (2007)
Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov
On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions. CASC (2006)
Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov
Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time. CASC (2005)
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
Fachinformationssystem Informatik (FIS-I) und Semantische Technologien für Informationsportale (SemIPort). GI Jahrestagung (2) (2005)
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
Entwicklung eines Informationsportals für die Informatik. GI Jahrestagung (2) (2004)
Dmytro Chibisov, Ernst W. Mayr, Sergey Pankratov
Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods. Automated Deduction in Geometry (2004)
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
Konzeption und Betrieb eines Kompetenz- und Dienstleistungsnetzes für die Informatik. GI Jahrestagung (1) (2003)
Volker Heun, Ernst W. Mayr
Efficient Embeddings into Hypercube-like Topologies. Comput. J. 46 (6) (2003)
Volker Heun, Ernst W. Mayr
Efficient Dynamic Embeddings of Binary Trees into Hypercubes. J. Algorithms 43 (1) (2002)
Volker Heun, Ernst W. Mayr
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. J. Algorithms 43 (1) (2002)
Ernst W. Mayr
Complexity Theory and Algorithms. Euro-Par (2002)
Ulla Koppenhagen, Ernst W. Mayr
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups. J. Symb. Comput. 31 (1/2) (2001)
Volker Heun, Ernst W. Mayr
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. J. Parallel Distributed Comput. 61 (8) (2001)
Stefan Bischof, Ernst W. Mayr
On-line scheduling of parallel jobs with runtime restrictions. Theor. Comput. Sci. 268 (1) (2001)
Ulla Koppenhagen, Ernst W. Mayr
Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups. Inf. Comput. 158 (2) (2000)
Ernst W. Mayr
In Is on the Boundary: Complexity Considerations for Polynominal Ideals. IFIP TCS (2000)
Ernst W. Mayr
Distributed Systems and Algorithms. Euro-Par (2000)
Ernst W. Mayr, Friedhelm Meyer auf der Heide, Rolf Wanka
International Workshop on Communication and Data Management in Large Networks. GI Jahrestagung (1999)
Ulla Koppenhagen, Ernst W. Mayr
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. J. Symb. Comput. 28 (3) (1999)
Stefan Bischof, Ernst W. Mayr
On-Line Scheduling of Parallel Jobs with Runtime Restrictions. ISAAC (1998)
Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr
Parallel Continuous Randomized Load Balancing (Extended Abstract). SPAA (1998)
Lionel Brunie, Ernst W. Mayr
Distributed Systems and Databases. Euro-Par (1998)
Ulla Koppenhagen, Ernst W. Mayr
The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. FCT (1997)
Andrei Z. Broder, Ernst W. Mayr
Counting Minimum Weight Spanning Trees. J. Algorithms 24 (1) (1997)
Ernst W. Mayr, Ralph Werchner
Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks. Algorithmica 18 (3) (1997)
Ernst W. Mayr
Some Complexity Results for Polynomial Ideals. J. Complex. 13 (3) (1997)
Volker Heun, Ernst W. Mayr
A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. Euro-Par, Vol. I (1996)
Ernst W. Mayr, Hans Stadtherr
Efficient Parallel Algorithms for Scheduling with Tree Precedence Constrinats. Euro-Par, Vol. II (1996)
Ulla Koppenhagen, Ernst W. Mayr
Optimal Gröbner Base Algorithms for Binomial Ideals. ICALP (1996)
Volker Heun, Ernst W. Mayr
Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. IRREGULAR (1996)
Ernst W. Mayr
Scheduling Interval Orders in Parallel. Parallel Algorithms Appl. 8 (1) (1996)
Klaus Kühnle, Ernst W. Mayr
Exponential Space Computation of Gröbner Bases. ISSAC (1996)
Volker Heun, Ernst W. Mayr
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. J. Algorithms 20 (2) (1996)
Ernst W. Mayr, Ralph Werchner
Divide-and-Conquer Algorithms on the Hypercube. Theor. Comput. Sci. 162 (2) (1996)
Volker Heun, Ernst W. Mayr
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. STACS (1996)
Ulla Koppenhagen, Ernst W. Mayr
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. ISSAC (1996)
Ernst W. Mayr
Scheduling interval orders in parallel. HICSS (2) (1995)
Ernst W. Mayr, Ralph Werchner
Optimal Routing of Parentheses on the Hypercube. J. Parallel Distributed Comput. 26 (2) (1995)
Ernst W. Mayr
On Polynomial Ideals, Their Complexity, and Applications. FCT (1995)
Ernst W. Mayr, Ralph Werchner
Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks. HICSS (2) (1994)
Ernst W. Mayr, Ralph Werchner
Optimal Tree Contraction on the Hypercube and Related Networks. ESA (1993)
Volker Heun, Ernst W. Mayr
A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube Forschungsberichte, TU Munich (1993)
Ernst W. Mayr, C. Greg Plaxton
Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube. J. Parallel Distributed Comput. 17 (4) (1993)
Ernst W. Mayr, Ralph Werchner
Divide and conquer algorithms on the hypercube Forschungsberichte, TU Munich (1993)
Ernst W. Mayr, Ralph Werchner
Divide-and-Conquer Algorithms on the Hypercube. STACS (1993)
Ernst W. Mayr, C. Greg Plaxton
On the spanning trees of weighted graphs. Comb. 12 (4) (1992)
Ernst W. Mayr, Ashok Subramanian
The Complexity of Circuit Value and Network Stability. J. Comput. Syst. Sci. 44 (2) (1992)
Ernst W. Mayr, Ralph Werchner
Optimal Routing of Parentheses on the Hypercube. SPAA (1992)
Ernst W. Mayr, Ralph Werchner
Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks. Heinz Nixdorf Symposium (1992)
Alexander Wang, Robert Cypher, Ernst W. Mayr
Embedding complete binary trees in faulty hypercubes. SPDP (1991)
Ernst W. Mayr
Membership in Plynomial Ideals over Q Is Exponential Space Complete. STACS (1989)
Ernst W. Mayr, Ashok Subramanian
The Complexity of Circuit Value and Network Stability. Computational Complexity Conference (1989)
Richard J. Anderson, Ernst W. Mayr, Manfred K. Warmuth
Parallel Approximation Algorithms for Bin Packing Inf. Comput. 82 (3) (1989)
Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr
Projections of Vector Addition System Reachability Sets are Semilinear. Theor. Comput. Sci. 64 (3) (1989)
Ernst W. Mayr
Parallel Approximation Algorithms. FGCS (1988)
Ernst W. Mayr, C. Greg Plaxton
On the Spanning Trees of Weighted Graphs. WG (1988)
Richard J. Anderson, Ernst W. Mayr
Parallelism and the Maximal Path Problem. Inf. Process. Lett. 24 (2) (1987)
David P. Helmbold, Ernst W. Mayr
Two Processor Scheduling is in NC. SIAM J. Comput. 16 (4) (1987)
David P. Helmbold, Ernst W. Mayr
Two Processor Scheduling is in NC. Aegean Workshop on Computing (1986)
David P. Helmbold, Ernst W. Mayr
Applications of Parallel Scheduling to Perfect Graphs. WG (1986)
David P. Helmbold, Ernst W. Mayr
Perfect Graphs and Parallel Algorithms. ICPP (1986)
Thomas H. Spencer, Ernst W. Mayr
Node Weighted Matching. ICALP (1984)
Ernst W. Mayr
An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput. 13 (3) (1984)
Peter H. Hochschild, Ernst W. Mayr, Alan R. Siegel
Techniques for Solving Graph Problems in Parallel Environments FOCS (1983)
Ernst W. Mayr, Albert R. Meyer
The Complexity of the Finite Containment Problem for Petri Nets. J. ACM 28 (3) (1981)
Ernst W. Mayr
Persistence of Vector Replacement Systems is Decidable. Acta Informatica 15 (1981)
Ernst W. Mayr
An Algorithm for the General Petri Net Reachability Problem STOC (1981)