Ernst W. Mayr

According to our database1, Ernst W. Mayr
  • authored at least 81 papers between 1981 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Editorial: Special Issue on "Theoretical Aspects of Computer Science" (STACS 2015).
Theory Comput. Syst., 2017

2016
Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities.
Fundam. Inform., 2016

2015
Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms.
Fundam. Inform., 2015

Front Matter, Table of Contents, Preface, Conference Organization.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014
A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
Dimension-dependent bounds for Gröbner bases of polynomial ideals.
J. Symb. Comput., 2013

Inequalities for the Number of Walks in Graphs.
Algorithmica, 2013

Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

2012
Inequalities for the Number of Walks in Graphs.
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011
Space-efficient Gröbner basis computation without degree bounds.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010
Degree bounds for Gröbner bases of low-dimensional polynomial ideals.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk).
Proceedings of the Computer Algebra in Scientific Computing - 12th International Workshop, 2010

2009
Mathematik und die Informatik.
Informatik Spektrum, 2009

Bioinformatik.
Informatik Spektrum, 2009

2007
Motion planning for 6R-Robots: multiple tasks with constrained velocity and orientation of the end-effector.
Proceedings of the Symbolic-Numeric Computation, 2007

Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations.
Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2006
On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions.
Proceedings of the Computer Algebra in Scientific Computing, 9th International Workshop, 2006

2005

Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004
Entwicklung eines Informationsportals für die Informatik.
Proceedings of the INFORMATIK 2004, 2004

Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods.
Proceedings of the Automated Deduction in Geometry, 5th International Workshop, 2004

2003
Efficient Embeddings into Hypercube-like Topologies.
Comput. J., 2003

Konzeption und Betrieb eines Kompetenz- und Dienstleistungsnetzes für die Informatik.
Proceedings of the INFORMATIK 2003 - Innovative Informatikanwendungen, Band 1, Beiträge der 33. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 29. September, 2003

2002
Efficient Dynamic Embeddings of Binary Trees into Hypercubes.
J. Algorithms, 2002

Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes.
J. Algorithms, 2002

Complexity Theory and Algorithms.
Proceedings of the Euro-Par 2002, 2002

2001
On-line scheduling of parallel jobs with runtime restrictions.
Theor. Comput. Sci., 2001

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups.
J. Symb. Comput., 2001

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes.
J. Parallel Distrib. Comput., 2001

2000
Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups.
Inf. Comput., 2000

In Is on the Boundary: Complexity Considerations for Polynominal Ideals.
Proceedings of the Theoretical Computer Science, 2000

Distributed Systems and Algorithms.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals.
J. Symb. Comput., 1999

International Workshop on Communication and Data Management in Large Networks.
Proceedings of the Informatik '99, 1999

1998
Parallel Continuous Randomized Load Balancing (Extended Abstract).
SPAA, 1998

On-Line Scheduling of Parallel Jobs with Runtime Restrictions.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Distributed Systems and Databases.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
Some Complexity Results for Polynomial Ideals.
J. Complexity, 1997

Counting Minimum Weight Spanning Trees.
J. Algorithms, 1997

Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks.
Algorithmica, 1997

The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996
Divide-and-Conquer Algorithms on the Hypercube.
Theor. Comput. Sci., 1996

Scheduling Interval Orders in Parallel.
Parallel Algorithms Appl., 1996

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube.
J. Algorithms, 1996

Embedding Graphs with Bounded Treewidth into Optimal Hypercubes.
Proceedings of the STACS 96, 1996

Exponential Space Computation of Gröbner Bases.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

Optimal Gröbner Base Algorithms for Binomial Ideals.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Efficient Parallel Algorithms for Scheduling with Tree Precedence Constrinats.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Optimal Routing of Parentheses on the Hypercube.
J. Parallel Distrib. Comput., 1995

Scheduling interval orders in parallel.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

On Polynomial Ideals, Their Complexity, and Applications.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994
Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993
Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube.
J. Parallel Distrib. Comput., 1993

Divide-and-Conquer Algorithms on the Hypercube.
Proceedings of the STACS 93, 1993

Optimal Tree Contraction on the Hypercube and Related Networks.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
The Complexity of Circuit Value and Network Stability.
J. Comput. Syst. Sci., 1992

On the spanning trees of weighted graphs.
Combinatorica, 1992

Optimal Routing of Parentheses on the Hypercube.
SPAA, 1992

Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991
Embedding complete binary trees in faulty hypercubes.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1989
Parallel Approximation Algorithms for Bin Packing
Inf. Comput., September, 1989

Projections of Vector Addition System Reachability Sets are Semilinear.
Theor. Comput. Sci., 1989

Membership in Plynomial Ideals over Q Is Exponential Space Complete.
Proceedings of the STACS 89, 1989

The Complexity of Circuit Value and Network Stability.
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988
On the Spanning Trees of Weighted Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

Parallel Approximation Algorithms.
FGCS, 1988

1987
Two Processor Scheduling is in NC.
SIAM J. Comput., 1987

Parallelism and the Maximal Path Problem.
Inf. Process. Lett., 1987

1986
Applications of Parallel Scheduling to Perfect Graphs.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

Perfect Graphs and Parallel Algorithms.
Proceedings of the International Conference on Parallel Processing, 1986

Two Processor Scheduling is in NC.
Proceedings of the VLSI Algorithms and Architectures, 1986

1984
An Algorithm for the General Petri Net Reachability Problem.
SIAM J. Comput., 1984

Node Weighted Matching.
Proceedings of the Automata, 1984

1983
Techniques for Solving Graph Problems in Parallel Environments
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1981
The Complexity of the Finite Containment Problem for Petri Nets.
J. ACM, 1981

Persistence of Vector Replacement Systems is Decidable.
Acta Inf., 1981

An Algorithm for the General Petri Net Reachability Problem
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981


  Loading...