Ernst W. Mayr - RankMe

105 papers A* 4A 9B 30Misc 1Journal 36Unranked 23

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