Ernst W. Mayr

Ernst W. Mayr, Stephan Ritscher: Dimension-dependent bounds for Gröbner bases of polynomial ideals. J. Symb. Comput. 49: 78-94 (2013)

Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann: Inequalities for the Number of Walks in Graphs. ANALCO 2012: 28-39

Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov (Eds.): Computer Algebra in Scientific Computing - 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012. Proceedings. Lecture Notes in Computer Science 7442, Springer 2012, isbn 978-3-642-32972-2

Ernst W. Mayr, Stephan Ritscher: Space-efficient Gröbner basis computation without degree bounds. ISSAC 2011: 257-264

Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov (Eds.): Computer Algebra in Scientific Computing - 13th International Workshop, CASC 2011, Kassel, Germany, September 5-9, 2011. Proceedings. Lecture Notes in Computer Science 6885, Springer 2011, isbn 978-3-642-23567-2

Ernst W. Mayr: From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk). CASC 2010: 204

Ernst W. Mayr, Stephan Ritscher: Degree bounds for Gröbner bases of low-dimensional polynomial ideals. ISSAC 2010: 21-27

Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov (Eds.): Computer Algebra in Scientific Computing - 12th International Workshop, CASC 2010, Tsakhkadzor, Armenia, September 6-12, 2010. Proceedings. Lecture Notes in Computer Science 6244, Springer 2010, isbn 978-3-642-15273-3

Farid M. Ablayev, Ernst W. Mayr (Eds.): Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings. Lecture Notes in Computer Science 6072, Springer 2010, isbn 978-3-642-13181-3

Wolfram Koepf, Ernst W. Mayr: Mathematik und die Informatik. Informatik Spektrum 32(1): 1-2 (2009)

Ralf Hofestädt, Ernst W. Mayr: Bioinformatik. Informatik Spektrum 32(4): 285-286 (2009)

Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov (Eds.): Computer Algebra in Scientific Computing, 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009. Proceedings. Lecture Notes in Computer Science 5743, Springer 2009, isbn 978-3-642-04102-0

Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov: Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations. CASC 2007: 102-117

Dmytro Chibisov, Ernst W. Mayr: Motion planning for 6R-Robots: multiple tasks with constrained velocity and orientation of the end-effector. SNC 2007: 72-78

Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov (Eds.): Computer Algebra in Scientific Computing, 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings. Lecture Notes in Computer Science 4770, Springer 2007, isbn 978-3-540-75186-1

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: 109-128

Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov (Eds.): Computer Algebra in Scientific Computing, 9th International Workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006, Proceedings. Lecture Notes in Computer Science 4194, Springer 2006, isbn 3-540-45182-X

Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov: Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time. CASC 2005: 105-114

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: 698-712

Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov (Eds.): Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings. Lecture Notes in Computer Science 3718, Springer 2005, isbn 3-540-28966-6

Dmytro Chibisov, Ernst W. Mayr, Sergey Pankratov: Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods. Automated Deduction in Geometry 2004: 156-168

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: 208-212

Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell (Eds.): 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. Kluwer 2004, isbn 1-4020-8140-5

Volker Heun, Ernst W. Mayr: Efficient Embeddings into Hypercube-like Topologies. Comput. J. 46(6): 632-644 (2003)

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: 132-147

Volker Heun, Ernst W. Mayr: Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. J. Algorithms 43(1): 17-50 (2002)

Volker Heun, Ernst W. Mayr: Efficient Dynamic Embeddings of Binary Trees into Hypercubes. J. Algorithms 43(1): 51-84 (2002)

Ernst W. Mayr: Complexity Theory and Algorithms. Euro-Par 2002: 391

Volker Heun, Ernst W. Mayr: Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. J. Parallel Distrib. Comput. 61(8): 1110-1125 (2001)

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): 259-276 (2001)

Stefan Bischof, Ernst W. Mayr: On-line scheduling of parallel jobs with runtime restrictions. Theor. Comput. Sci. 268(1): 67-90 (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): 98-124 (2000)

Ernst W. Mayr: Distributed Systems and Algorithms. Euro-Par 2000: 573-574

Ernst W. Mayr: In Is on the Boundary: Complexity Considerations for Polynominal Ideals. IFIP TCS 2000: 99

Ulla Koppenhagen, Ernst W. Mayr: An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. J. Symb. Comput. 28(3): 317-338 (1999)

Ernst W. Mayr, Friedhelm Meyer auf der Heide, Rolf Wanka: International Workshop on Communication and Data Management in Large Networks. GI Jahrestagung 1999: 334

Lionel Brunie, Ernst W. Mayr: Distributed Systems and Databases. Euro-Par 1998: 503-504

Stefan Bischof, Ernst W. Mayr: On-Line Scheduling of Parallel Jobs with Runtime Restrictions. ISAAC 1998: 119-128

Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr: Parallel Continuous Randomized Load Balancing (Extended Abstract). SPAA 1998: 192-201

Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (Eds.): Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997). Lecture Notes in Computer Science 1367, Springer 1998, isbn 3-540-64201-3

Ernst W. Mayr, Ralph Werchner: Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks. Algorithmica 18(3): 445-460 (1997)

Andrei Z. Broder, Ernst W. Mayr: Counting Minimum Weight Spanning Trees. J. Algorithms 24(1): 171-176 (1997)

Ernst W. Mayr: Some Complexity Results for Polynomial Ideals. J. Complexity 13(3): 303-325 (1997)

Ulla Koppenhagen, Ernst W. Mayr: The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. FCT 1997: 257-268

Volker Heun, Ernst W. Mayr: A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. J. Algorithms 20(2): 375-399 (1996)

Ernst W. Mayr: Scheduling Interval Orders in Parallel. Parallel Algorithms Appl. 8(1): 21-34 (1996)

Ernst W. Mayr, Ralph Werchner: Divide-and-Conquer Algorithms on the Hypercube. Theor. Comput. Sci. 162(2): 283-296 (1996)

Volker Heun, Ernst W. Mayr: A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. Euro-Par, Vol. I 1996: 222-233

Ernst W. Mayr, Hans Stadtherr: Efficient Parallel Algorithms for Scheduling with Tree Precedence Constrinats. Euro-Par, Vol. II 1996: 543-554

Ulla Koppenhagen, Ernst W. Mayr: Optimal Gröbner Base Algorithms for Binomial Ideals. ICALP 1996: 244-255

Volker Heun, Ernst W. Mayr: Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. IRREGULAR 1996: 287-298

Ulla Koppenhagen, Ernst W. Mayr: An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. ISSAC 1996: 55-62

Klaus Kühnle, Ernst W. Mayr: Exponential Space Computation of Gröbner Bases. ISSAC 1996: 63-71

Volker Heun, Ernst W. Mayr: Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. STACS 1996: 157-168

Ernst W. Mayr, Ralph Werchner: Optimal Routing of Parentheses on the Hypercube. J. Parallel Distrib. Comput. 26(2): 181-192 (1995)

Ernst W. Mayr: On Polynomial Ideals, Their Complexity, and Applications. FCT 1995: 89-105

Ernst W. Mayr: Scheduling interval orders in parallel. HICSS (2) 1995: 20-28

Ernst W. Mayr, Claude Puech (Eds.): STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings. Lecture Notes in Computer Science 900, Springer 1995, isbn 3-540-59042-0

Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (Eds.): Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings. Lecture Notes in Computer Science 903, Springer 1995, isbn 3-540-59071-4

Ernst W. Mayr, Ralph Werchner: Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks. HICSS (2) 1994: 140-149

Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner (Eds.): STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings. Lecture Notes in Computer Science 775, Springer 1994, isbn 3-540-57785-8

Ernst W. Mayr, C. Greg Plaxton: Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube. J. Parallel Distrib. Comput. 17(4): 374-380 (1993)

Ernst W. Mayr, Ralph Werchner: Optimal Tree Contraction on the Hypercube and Related Networks. ESA 1993: 295-305

Ernst W. Mayr, Ralph Werchner: Divide-and-Conquer Algorithms on the Hypercube. STACS 1993: 153-162

Ernst W. Mayr (Ed.): Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings. Lecture Notes in Computer Science 657, Springer 1993, isbn 3-540-56402-0

Ernst W. Mayr, C. Greg Plaxton: On the spanning trees of weighted graphs. Combinatorica 12(4): 433-447 (1992)

Ernst W. Mayr, Ashok Subramanian: The Complexity of Circuit Value and Network Stability. J. Comput. Syst. Sci. 44(2): 302-323 (1992)

Ernst W. Mayr, Ralph Werchner: Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks. Heinz Nixdorf Symposium 1992: 195-206

Ernst W. Mayr, Ralph Werchner: Optimal Routing of Parentheses on the Hypercube. SPAA 1992: 109-117

Alexander Wang, Robert Cypher, Ernst W. Mayr: Embedding complete binary trees in faulty hypercubes. SPDP 1991: 112-119

Richard J. Anderson, Ernst W. Mayr, Manfred K. Warmuth: Parallel Approximation Algorithms for Bin Packing. Inf. Comput. 82(3): 262-277 (1989)

Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr: Projections of Vector Addition System Reachability Sets are Semilinear. Theor. Comput. Sci. 64(3): 343-350 (1989)

Ernst W. Mayr, Ashok Subramanian: The Complexity of Circuit Value and Network Stability. Structure in Complexity Theory Conference 1989: 114-123

Ernst W. Mayr: Membership in Plynomial Ideals over Q Is Exponential Space Complete. STACS 1989: 400-406

Ernst W. Mayr: Parallel Approximation Algorithms. FGCS 1988: 542-551

Ernst W. Mayr, C. Greg Plaxton: On the Spanning Trees of Weighted Graphs. WG 1988: 394-405

Richard J. Anderson, Ernst W. Mayr: Parallelism and the Maximal Path Problem. Inf. Process. Lett. 24(2): 121-126 (1987)

David P. Helmbold, Ernst W. Mayr: Two Processor Scheduling is in NC. SIAM J. Comput. 16(4): 747-759 (1987)

David P. Helmbold, Ernst W. Mayr: Two Processor Scheduling is in NC. Aegean Workshop on Computing 1986: 12-25

David P. Helmbold, Ernst W. Mayr: Perfect Graphs and Parallel Algorithms. ICPP 1986: 853-860

David P. Helmbold, Ernst W. Mayr: Applications of Parallel Scheduling to Perfect Graphs. WG 1986: 188-203

Ernst W. Mayr: An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput. 13(3): 441-460 (1984)

Thomas H. Spencer, Ernst W. Mayr: Node Weighted Matching. ICALP 1984: 454-464

Peter H. Hochschild, Ernst W. Mayr, Alan R. Siegel: Techniques for Solving Graph Problems in Parallel Environments. FOCS 1983: 351-359

Ernst W. Mayr: Persistence of Vector Replacement Systems is Decidable. Acta Inf. 15: 309-318 (1981)

Ernst W. Mayr, Albert R. Meyer: The Complexity of the Finite Containment Problem for Petri Nets. J. ACM 28(3): 561-576 (1981)

Ernst W. Mayr: An Algorithm for the General Petri Net Reachability Problem. STOC 1981: 238-246