Ernst Mayr
#79,389
Most Influential Person Now
German computer scientist
Ernst Mayr 's AcademicInfluence.com Rankings
Ernst Mayr computer-science Degrees
Computer Science
#3579
World Rank
#3759
Historical Rank
Database
#7799
World Rank
#8112
Historical Rank
Download Badge
Computer Science
Why Is Ernst Mayr Influential?
(Suggest an Edit or Addition)According to Wikipedia, Ernst Wilhelm Mayr is a German computer scientist and mathematician. He received the Gottfried Wilhelm Leibniz Prize in 1997 awarded for his contributions to theoretical computer science. Mayr's research in computer science covers algorithms and complexity theory. He also explores symbolic mathematics/computer algebra and methods in bioinformatics. His principal interests lie in describing and modeling parallel and distributed programs and systems, the design and analysis of efficient parallel algorithms and programming paradigms, the design of algorithm solutions for scheduling and load balancing problems and investigation of their complexity theory. He also explores polynomial idealss and their complexity and algorithms as well as algorithms for searching and analyzing extensive bioinformatic data.
Ernst Mayr 's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- An algorithm for the general Petri net reachability problem (1981) (757)
- The complexity of the word problems for commutative semigroups and polynomial ideals (1982) (585)
- Lecture Notes in Computer Science (LNCS) (2011) (139)
- The Complexity of the Finite Containment Problem for Petri Nets (1981) (104)
- Some Complexity Results for Polynomial Ideals (1997) (75)
- Parallel Approximation Algorithms for Bin Packing (1988) (58)
- The complexity of circuit value and network stability (1989) (52)
- Persistence of vector replacement systems is decidable (1981) (51)
- Informatics and Medicine (2008) (50)
- Computational Graph Theory (2002) (49)
- Membership in Plynomial Ideals over Q Is Exponential Space Complete (1989) (49)
- Two Processor Scheduling is in NC (1986) (48)
- Parallelism and greedy algorithms (1984) (44)
- Exponential space computation of Gröbner bases (1996) (40)
- Lectures on Proof Verification and Approximation Algorithms (1998) (38)
- Dimension-dependent bounds for Gröbner bases of polynomial ideals (2013) (37)
- A P-complete problem and approximations to it (1984) (32)
- Perfect Graphs and Parallel Algorithms (1986) (29)
- Counting Minimum Weight Spanning Trees (1997) (29)
- Fast scheduling algorithms on parallel computers (1984) (28)
- Optimal routing of parentheses on the hypercube (1992) (27)
- On the spanning trees of weighted graphs (1988) (26)
- On-line scheduling of parallel jobs with runtime restrictions (1998) (26)
- Parallelism and the Maximal Path Problem (1987) (25)
- Node Weighted Matching (1984) (24)
- Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube (1989) (22)
- Exploring New Frontiers of Theoretical Informatics (2004) (22)
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals (1996) (20)
- Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes (1996) (20)
- A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (1996) (17)
- Degree bounds for Gröbner bases of low-dimensional polynomial ideals (2010) (16)
- Space-efficient Gröbner basis computation without degree bounds (2011) (15)
- Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science (1994) (14)
- Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks (1997) (14)
- Parallel Approximation Algorithms (1988) (14)
- The species problem : a symposium presented at the Atlanta Meeting of the American Association for the Advancement of Science, December 28-29, 1955 (1957) (14)
- Computer algebra in scientific computing : CASC 2000 : Proceedings of the third workshop on Computer Algebra in Scientific Computing, Samarkand, October 5-9, 2000 (2000) (14)
- Well structured parallel programs are not easier to schedule (1981) (14)
- The Dynamic Tree Expression Problem (1988) (13)
- Computing the Dimension of a Polynomial Ideal (2007) (12)
- Inequalities for the Number of Walks in Graphs (2012) (12)
- Projections of Vector Addition System Reachability Sets are Semilinear (1989) (12)
- Techniques for solving graph problems in parallel environments (1983) (11)
- Embedding complete binary trees in faulty hypercubes (1991) (10)
- 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 (2004) (9)
- Complexity of Membership Problems of Different Types of Polynomial Ideals (2017) (9)
- Computer algebra in scientific computing : CASC 2001 : Proceedings of the fourth international workshop on Computer Algebra in Scientific Computing, Konstanz, Sept. 22-26, 2001 (2001) (8)
- Efficient Embeddings into Hypercube-like Topologies (2003) (8)
- Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes (2001) (7)
- Applications of Parallel Scheduling Algorithms to Families of Perfect Graphs (1990) (7)
- Efficient Dynamic Embeddings of Binary Trees into Hypercubes (2002) (7)
- Parallel continuous randomized load balancing (extended abstract) (1998) (7)
- Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities (2013) (7)
- Embedding Graphs with Bounded Treewidth into Optimal Hypercubes (1996) (7)
- Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing (2009) (6)
- Scheduling interval orders in parallel (1995) (6)
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes (2002) (6)
- Divide-and-Conquer Algorithms on the Hypercube (1993) (6)
- Computer Algebra in Scientific Computing (2013) (6)
- Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms (2015) (5)
- Applications of Parallel Scheduling to Perfect Graphs (1987) (5)
- A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes (1996) (5)
- The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups (1997) (5)
- Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets (2013) (5)
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application (2014) (5)
- Basic Parallel Algorithms in Graph Theory (1990) (4)
- Computer Algebra in Scientific Computing, 9th International Workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006, Proceedings (2006) (4)
- Inequalities for the Number of Walks in Trees and General Graphs and a Generalization of a Theorem of Erdös and Simonovits (2011) (4)
- The Complexity of the Boundedness, Coverability, and Selfcoverability Problems for Commutative Semigroups (1995) (4)
- Optimal Parallel Algorithms for Two Processor Scheduling with Tree Precedence Constraints (1995) (4)
- Theoretical aspects of parallel computation (1990) (4)
- Simulation of an ultracomputer with several hot spots. Technical report (1986) (3)
- Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods (2004) (3)
- Optimal Gröbner Base Algorithms for Binomial Ideals (1996) (3)
- Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time (2005) (3)
- Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997) (1998) (3)
- The Complexity of the Equivalence Problem for Commutative Semigroups (1996) (3)
- Pipelined Parallel Computations , and Sorting on a Pipelined Hypercube (1998) (2)
- Parallel graph algorithms (1984) (2)
- Optimal Tree Contraction on the Hypercube and Related Networks (1993) (2)
- Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings (2010) (2)
- Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups (2000) (2)
- On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions (2006) (2)
- Computer Algebra in Scientific Computing: Casc '99: Workshop on Computer Algebra in Scientific Computing 1999 (1999) (2)
- STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995 : proceedings (1995) (2)
- Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities (2016) (2)
- Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations (2007) (2)
- On Polynomial Ideals, Their Complexity, and Applications (1995) (2)
- STACS 95: Proceedings of the Twelfth Annual Symposium on Theoretical Aspects of Computer Science, Held in Munich, Germany, March 2-4, 1995 (1995) (1)
- Selected papers of the eleventh symposium on Theoretical aspects of computer science (1995) (1)
- Inequalities for the Number of Walks in Graphs (2013) (1)
- Scheduling Interval Orders in Parallel Scheduling Interval Orders in Parallel (1994) (1)
- Proceedings of the 10th international conference on Computer Algebra in Scientific Computing (2007) (1)
- Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings (2005) (1)
- Distributed Systems and Databases (1998) (1)
- Complexity Theory and Algorithms (2002) (1)
- Network Implementations of the DTEP Algorithm (1987) (1)
- Computer Algebra in Scientific Computing, 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009. Proceedings (2009) (1)
- Efficient Parallel Algorithms for Scheduling with Tree Precedence Constrinats (1996) (1)
- Proceedings of the 4th Workshop on PASA '96, parallel systems & algorithms, Research Center Jülich, Germany, 10-12 April 1996 (1997) (1)
- Computer Algebra in Scientific Computing, 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings (2007) (1)
- Synthesis of Efficient Structures for Concurrent Computation. (1983) (1)
- 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany (2015) (1)
- Complexity Results for Fork-Free Petri Nets (2015) (1)
- Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (1992) (1)
- Stacs 94: 11th Annual Symposium on Theoretical Aspects of Computer Science Caen, France, February 24-26, 1994 : Proceedings (1994) (1)
- Jets — a maple-package for formal differential geometry (2020) (0)
- Editorial: Special Issue on “Theoretical Aspects of Computer Science” (STACS 2015) (2017) (0)
- 14th International Workshop on Computer Algebra in Scientific Computing (2012) (0)
- Editorial: Special Issue on “Theoretical Aspects of Computer Science” (STACS 2015) (2017) (0)
- Frontmatter, Table of Contents, Preface, Conference Organization (2014) (0)
- Proceedings of the 15th International Workshop on Computer Algebra in Scientific Computing - Volume 8136 (2013) (0)
- Distributed Systems and Algorithms (2000) (0)
- A process for coloring and further processing of at least one optical waveguide (1988) (0)
- Proceedings of the 4th Workshop on PASA '96: Parallel Systems and Algorithms (1997) (0)
- An EfTecth'c Representation of the Reachability Set of Persistent Petri Nets (2023) (0)
- A Method for Implementing Lock-Free Shared Memory Data Structures (2012) (0)
- Degree Bounds for Grobner Bases (1992) (0)
- Graph-Theoretic Concepts in Computer Science (1997) (0)
- International Workshop on Communication and Data Management in Large Networks (1999) (0)
- In Is on the Boundary: Complexity Considerations for Polynominal Ideals (2000) (0)
- Applications of parallel scheduling to perfect graphs. Technical report (1986) (0)
- Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks (1992) (0)
- The Descriptive Complexity Approach to LOGCFL Clemens Lautemann (2011) (0)
- Computer Algebra in Scientific Computing (2013) (0)
- Parallel and Distributed Algorithms (Dagstuhl Seminar 99291) (2021) (0)
- A method for producing a light waveguide lead (1987) (0)
- Computing the Rank of Large Sparse Matrices over Finite Fields (2022) (0)
- Computer Algebra in Scientific Computing CASC’99: Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, Munich, May 31 – June 4, 1999 (2011) (0)
- Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings (1993) (0)
- Proceedings of the 5th International Computer Science Symposium on Computer Science --- Theory and Applications, CSR 2010 (2010) (0)
- Workshop 02: Routing and communication in interconnection networks (1997) (0)
- Graph-theoretic concepts in computer science : 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994 : proceedings (1995) (0)
- Optimal expression evaluation and term matching on the Boolean hypercube and on hypercubic networks (1994) (0)
- Combinatorial Algorithms (1982) (0)
- Front Matter, Table of Contents, Preface, Conference Organization (2015) (0)
- Vladimir Gerdt dies at 73 (2021) (0)
- Optimal Tree Contract ion on the H y p e r c u b e and Related Networks (0)
- Space efficient computation for low-dimensional ideals (2009) (0)
- From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk) (2010) (0)
- N Applications of Parallel Scheduling to Perfect Graphs (0)
- Motion planning for 6R-Robots: multiple tasks with constrained velocity and orientation of the end-effector (2007) (0)
- A Programming and Problem-Solving Seminar (1985) (0)
- Parallel Scheduling (Dagstuhl Seminar 9729) (2021) (0)
- Computations on Simple Games using RelView (2018) (0)
- Proceedings of the 5th international conference on Computer Science: theory and Applications (2010) (0)
- From Petri nets to polynomials and back: Models, their complexity, and new algorithms (2010) (0)
- Computer Algebra in Scientific Computing - 12th International Workshop (Tsakhkadzor, Armenia, September 6-12, 2010) (2010) (0)
- Chapter 10. Challenges in Algorithm Engineering (0)
- Memories on Vladimir Gerdt (2021) (0)
This paper list is powered by the following services:
Other Resources About Ernst Mayr
What Schools Are Affiliated With Ernst Mayr ?
Ernst Mayr is affiliated with the following schools:
