Ernst W. Mayr

	2009
78		Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov: Computer Algebra in Scientific Computing, 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009. Proceedings Springer 2009
77		Wolfram Koepf, Ernst W. Mayr: Mathematik und die Informatik. Informatik Spektrum 32(1): 1-2 (2009)
76		Ralf Hofestädt, Ernst W. Mayr: Bioinformatik. Informatik Spektrum 32(4): 285-286 (2009)
	2007
75		Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov: Computer Algebra in Scientific Computing, 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings Springer 2007
74		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
73		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
	2006
72		Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov: Computer Algebra in Scientific Computing, 9th International Workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006, Proceedings Springer 2006
71		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
	2005
70		Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings Springer 2005
69		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
68		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
	2004
67		Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell: 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
66		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
65		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
	2003
64		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
63		Volker Heun, Ernst W. Mayr: Efficient Embeddings into Hypercube-like Topologies. Comput. J. 46(6): 632-644 (2003)
	2002
62		Ernst W. Mayr: Complexity Theory and Algorithms. Euro-Par 2002: 391
61		Volker Heun, Ernst W. Mayr: Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. J. Algorithms 43(1): 17-50 (2002)
60		Volker Heun, Ernst W. Mayr: Efficient Dynamic Embeddings of Binary Trees into Hypercubes. J. Algorithms 43(1): 51-84 (2002)
	2001
59		Volker Heun, Ernst W. Mayr: Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. J. Parallel Distrib. Comput. 61(8): 1110-1125 (2001)
58		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)
57		Stefan Bischof, Ernst W. Mayr: On-line scheduling of parallel jobs with runtime restrictions. Theor. Comput. Sci. 268(1): 67-90 (2001)
	2000
56		Ernst W. Mayr: Distributed Systems and Algorithms. Euro-Par 2000: 573-574
55		Ernst W. Mayr: In Is on the Boundary: Complexity Considerations for Polynominal Ideals. IFIP TCS 2000: 99
54		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)
	1999
53		Ernst W. Mayr, Friedhelm Meyer auf der Heide, Rolf Wanka: International Workshop on Communication and Data Management in Large Networks. GI Jahrestagung 1999: 334
52		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)
	1998
51		Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997) Springer 1998
50		Lionel Brunie, Ernst W. Mayr: Distributed Systems and Databases. Euro-Par 1998: 503-504
49		Stefan Bischof, Ernst W. Mayr: On-Line Scheduling of Parallel Jobs with Runtime Restrictions. ISAAC 1998: 119-128
48		Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr: Parallel Continuous Randomized Load Balancing (Extended Abstract). SPAA 1998: 192-201
	1997
47		Ulla Koppenhagen, Ernst W. Mayr: The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. FCT 1997: 257-268
46		Ernst W. Mayr, Ralph Werchner: Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks. Algorithmica 18(3): 445-460 (1997)
45		Andrei Z. Broder, Ernst W. Mayr: Counting Minimum Weight Spanning Trees. J. Algorithms 24(1): 171-176 (1997)
44		Ernst W. Mayr: Some Complexity Results for Polynomial Ideals. J. Complexity 13(3): 303-325 (1997)
	1996
43		Volker Heun, Ernst W. Mayr: A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. Euro-Par, Vol. I 1996: 222-233
42		Ernst W. Mayr, Hans Stadtherr: Efficient Parallel Algorithms for Scheduling with Tree Precedence Constrinats. Euro-Par, Vol. II 1996: 543-554
41		Ulla Koppenhagen, Ernst W. Mayr: Optimal Gröbner Base Algorithms for Binomial Ideals. ICALP 1996: 244-255
40		Volker Heun, Ernst W. Mayr: Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. IRREGULAR 1996: 287-298
39		Ulla Koppenhagen, Ernst W. Mayr: An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. ISSAC 1996: 55-62
38		Klaus Kühnle, Ernst W. Mayr: Exponential Space Computation of Gröbner Bases. ISSAC 1996: 63-71
37		Volker Heun, Ernst W. Mayr: Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. STACS 1996: 157-168
36		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)
35		Ernst W. Mayr: Scheduling Interval Orders in Parallel. Parallel Algorithms Appl. 8(1): 21-34 (1996)
34		Ernst W. Mayr, Ralph Werchner: Divide-and-Conquer Algorithms on the Hypercube. Theor. Comput. Sci. 162(2): 283-296 (1996)
	1995
33		Ernst W. Mayr, Claude Puech: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings Springer 1995
32		Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings Springer 1995
31		Ernst W. Mayr: On Polynomial Ideals, Their Complexity, and Applications. FCT 1995: 89-105
30		Ernst W. Mayr: Scheduling interval orders in parallel. HICSS (2) 1995: 20-28
29		Ernst W. Mayr, Ralph Werchner: Optimal Routing of Parentheses on the Hypercube. J. Parallel Distrib. Comput. 26(2): 181-192 (1995)
	1994
28		Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings Springer 1994
27		Ernst W. Mayr, Ralph Werchner: Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks. HICSS (2) 1994: 140-149
	1993
26		Ernst W. Mayr: Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings Springer 1993
25		Ernst W. Mayr, Ralph Werchner: Optimal Tree Contraction on the Hypercube and Related Networks. ESA 1993: 295-305
24		Ernst W. Mayr, Ralph Werchner: Divide-and-Conquer Algorithms on the Hypercube. STACS 1993: 153-162
23		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)
	1992
22		Ernst W. Mayr, Ralph Werchner: Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks. Heinz Nixdorf Symposium 1992: 195-206
21		Ernst W. Mayr, Ralph Werchner: Optimal Routing of Parentheses on the Hypercube. SPAA 1992: 109-117
20		Ernst W. Mayr, C. Greg Plaxton: On the spanning trees of weighted graphs. Combinatorica 12(4): 433-447 (1992)
19		Ernst W. Mayr, Ashok Subramanian: The Complexity of Circuit Value and Network Stability. J. Comput. Syst. Sci. 44(2): 302-323 (1992)
	1991
18		Alexander Wang, Robert Cypher, Ernst W. Mayr: Embedding complete binary trees in faulty hypercubes. SPDP 1991: 112-119
	1989
17		Ernst W. Mayr: Membership in Plynomial Ideals over Q Is Exponential Space Complete. STACS 1989: 400-406
16		Ernst W. Mayr, Ashok Subramanian: The Complexity of Circuit Value and Network Stability. Structure in Complexity Theory Conference 1989: 114-123
15		Richard J. Anderson, Ernst W. Mayr, Manfred K. Warmuth: Parallel Approximation Algorithms for Bin Packing Inf. Comput. 82(3): 262-277 (1989)
14		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)
	1988
13		Ernst W. Mayr: Parallel Approximation Algorithms. FGCS 1988: 542-551
12		Ernst W. Mayr, C. Greg Plaxton: On the Spanning Trees of Weighted Graphs. WG 1988: 394-405
	1987
11		Richard J. Anderson, Ernst W. Mayr: Parallelism and the Maximal Path Problem. Inf. Process. Lett. 24(2): 121-126 (1987)
10		David P. Helmbold, Ernst W. Mayr: Two Processor Scheduling is in NC. SIAM J. Comput. 16(4): 747-759 (1987)
	1986
9		David P. Helmbold, Ernst W. Mayr: Two Processor Scheduling is in NC. Aegean Workshop on Computing 1986: 12-25
8		David P. Helmbold, Ernst W. Mayr: Perfect Graphs and Parallel Algorithms. ICPP 1986: 853-860
7		David P. Helmbold, Ernst W. Mayr: Applications of Parallel Scheduling to Perfect Graphs. WG 1986: 188-203
	1984
6		Thomas H. Spencer, Ernst W. Mayr: Node Weighted Matching. ICALP 1984: 454-464
5		Ernst W. Mayr: An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput. 13(3): 441-460 (1984)
	1983
4		Peter H. Hochschild, Ernst W. Mayr, Alan R. Siegel: Techniques for Solving Graph Problems in Parallel Environments FOCS 1983: 351-359
	1981
3		Ernst W. Mayr: An Algorithm for the General Petri Net Reachability Problem STOC 1981: 238-246
2		Ernst W. Mayr: Persistence of Vector Replacement Systems is Decidable. Acta Inf. 15: 309-318 (1981)
1		Ernst W. Mayr, Albert R. Meyer: The Complexity of the Finite Containment Problem for Petri Nets. J. ACM 28(3): 561-576 (1981)

Coauthor Index

1	Richard J. Anderson	[11] [15]
2	Petra Berenbrink	[48]
3	Stefan Bischof	[49] [57]
4	Klemens Böhm	[68]
5	Andrei Z. Broder	[45]
6	Lionel Brunie	[50]
7	Hans Kleine Büning	[14]
8	Dmytro Chibisov	[66] [69] [71] [73] [74]
9	Robert Cypher	[18]
10	Patrice Enjalbert	[28]
11	Peter Fankhauser	[68]
12	Tom Friedetzky	[48]
13	Norbert Fuhr	[68]
14	Victor G. Ganzha	[69] [70] [71] [72] [74] [75]
15	Vladimir P. Gerdt	[78]
16	Jens Hartmann	[68]
17	Friedhelm Meyer auf der Heide	[53]
18	David P. Helmbold	[7] [8] [9] [10]
19	Volker Heun	[36] [37] [40] [43] [59] [60] [61] [63]
20	Peter H. Hochschild	[4]
21	Ralf Hofestädt	[76]
22	Lutz Horn	[64]
23	Anthony Jameson	[68]
24	Claus-Peter Klas	[68]
25	Stefan Klink	[68]
26	Wolfram Koepf	[77]
27	Ulla Koppenhagen	[39] [41] [47] [52] [54] [58]
28	Agnes Koschmider	[65] [68]
29	Sascha Kriewel	[68]
30	Klaus Kühnle	[38]
31	Patrick Lehti	[68]
32	Theodor Lettmann	[14]
33	Jean-Jacques Lévy	[67]
34	Michael Ley	[64] [65]
35	Peter Luksch	[64] [65] [68]
36	Jörg Maas	[64] [65]
37	Marco von Mevius	[64]
38	Albert R. Meyer	[1]
39	John C. Mitchell	[67]
40	Andreas Oberweis	[64] [65] [68]
41	Paul Ortyl (Pawel Ortyl)	[64] [65] [68]
42	Sergey Pankratov	[66]
43	Stefan Pfingstl	[64] [65] [68]
44	C. Greg Plaxton	[12] [20] [23]
45	Hans Jürgen Prömel	[51]
46	Claude Puech	[33]
47	Patrick Reuther	[68]
48	Enzo Rossi	[64]
49	Ute Rusnak	[64] [65] [68]
50	Felix Rüssel	[64]
51	Guido Sautter	[68]
52	André Schaefer	[68]
53	Gunther Schmidt	[32]
54	Lars Schmidt-Thieme	[68]
55	Eric Schwarzkopf	[68]
56	Alan R. Siegel	[4]
57	Daniel Sommer	[64] [65]
58	Thomas H. Spencer	[6]
59	Hans Stadtherr	[42]
60	Angelika Steger	[51]
61	Nenad Stojanovic	[68]
62	Wolffried Stucky	[64] [65]
63	Rudi Studer	[68]
64	Ashok Subramanian	[16] [19]
65	Gottfried Tinhofer	[32]
66	Roland Vollmar	[64] [65] [68]
67	Evgenii V. Vorozhtsov	[69] [70] [71] [72] [74] [75] [78]
68	Klaus W. Wagner	[28]
69	Bernd Walter	[68]
70	Alexander Wang	[18]
71	Rolf Wanka	[53]
72	Manfred K. Warmuth	[15]
73	Alexander Weber	[68]
74	Ralph Werchner	[21] [22] [24] [25] [27] [29] [34] [46]

Colors in the list of coauthors