The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ernst W. Mayr: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dmytro Chibisov, Ernst W. Mayr, Sergey Pankratov
    Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods. [Citation Graph (0, 0)][DBLP]
    Automated Deduction in Geometry, 2004, pp:156-168 [Conf]
  2. David P. Helmbold, Ernst W. Mayr
    Two Processor Scheduling is in NC. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:12-25 [Conf]
  3. Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov
    Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time. [Citation Graph (0, 0)][DBLP]
    CASC, 2005, pp:105-114 [Conf]
  4. Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov
    On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions. [Citation Graph (0, 0)][DBLP]
    CASC, 2006, pp:109-128 [Conf]
  5. Ernst W. Mayr, Ashok Subramanian
    The Complexity of Circuit Value and Network Stability. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:114-123 [Conf]
  6. Ernst W. Mayr, Ralph Werchner
    Optimal Tree Contraction on the Hypercube and Related Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:295-305 [Conf]
  7. Lionel Brunie, Ernst W. Mayr
    Distributed Systems and Databases. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:503-504 [Conf]
  8. Volker Heun, Ernst W. Mayr
    A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:222-233 [Conf]
  9. Ernst W. Mayr
    Distributed Systems and Algorithms. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:573-574 [Conf]
  10. Ernst W. Mayr
    Complexity Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:391- [Conf]
  11. Ernst W. Mayr, Hans Stadtherr
    Efficient Parallel Algorithms for Scheduling with Tree Precedence Constrinats. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. II, 1996, pp:543-554 [Conf]
  12. Ulla Koppenhagen, Ernst W. Mayr
    The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:257-268 [Conf]
  13. Ernst W. Mayr
    On Polynomial Ideals, Their Complexity, and Applications. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:89-105 [Conf]
  14. Ernst W. Mayr
    Parallel Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    FGCS, 1988, pp:542-551 [Conf]
  15. Peter H. Hochschild, Ernst W. Mayr, Alan R. Siegel
    Techniques for Solving Graph Problems in Parallel Environments [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:351-359 [Conf]
  16. Peter Fankhauser, Norbert Fuhr, Jens Hartmann, Anthony Jameson, Claus-Peter Klas, Stefan Klink, Agnes Koschmider, Sascha Kriewel, Patrick Lehti, Peter Luksch 0002, 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). [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (2), 2005, pp:698-712 [Conf]
  17. Ernst W. Mayr, Friedhelm Meyer auf der Heide, Rolf Wanka
    International Workshop on Communication and Data Management in Large Networks. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1999, pp:334- [Conf]
  18. Lutz Horn, Michael Ley, Peter Luksch 0002, 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. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (1), 2003, pp:132-147 [Conf]
  19. Agnes Koschmider, Michael Ley, Peter Luksch 0002, 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. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (2), 2004, pp:208-212 [Conf]
  20. Ernst W. Mayr
    Scheduling interval orders in parallel. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:20-28 [Conf]
  21. Ernst W. Mayr, Ralph Werchner
    Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1994, pp:140-149 [Conf]
  22. Ulla Koppenhagen, Ernst W. Mayr
    Optimal Gröbner Base Algorithms for Binomial Ideals. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:244-255 [Conf]
  23. Thomas H. Spencer, Ernst W. Mayr
    Node Weighted Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:454-464 [Conf]
  24. David P. Helmbold, Ernst W. Mayr
    Perfect Graphs and Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:853-860 [Conf]
  25. Ernst W. Mayr
    In Is on the Boundary: Complexity Considerations for Polynominal Ideals. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:99- [Conf]
  26. Volker Heun, Ernst W. Mayr
    Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1996, pp:287-298 [Conf]
  27. Stefan Bischof, Ernst W. Mayr
    On-Line Scheduling of Parallel Jobs with Runtime Restrictions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:119-128 [Conf]
  28. Ulla Koppenhagen, Ernst W. Mayr
    An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:55-62 [Conf]
  29. Klaus Kühnle, Ernst W. Mayr
    Exponential Space Computation of Gröbner Bases. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:63-71 [Conf]
  30. Ernst W. Mayr, Ralph Werchner
    Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:195-206 [Conf]
  31. Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr
    Parallel Continuous Randomized Load Balancing (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:192-201 [Conf]
  32. Ernst W. Mayr, Ralph Werchner
    Optimal Routing of Parentheses on the Hypercube. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:109-117 [Conf]
  33. Volker Heun, Ernst W. Mayr
    Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:157-168 [Conf]
  34. Ernst W. Mayr, Ralph Werchner
    Divide-and-Conquer Algorithms on the Hypercube. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:153-162 [Conf]
  35. Ernst W. Mayr
    Membership in Plynomial Ideals over Q Is Exponential Space Complete. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:400-406 [Conf]
  36. Ernst W. Mayr
    An Algorithm for the General Petri Net Reachability Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:238-246 [Conf]
  37. David P. Helmbold, Ernst W. Mayr
    Applications of Parallel Scheduling to Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:188-203 [Conf]
  38. Ernst W. Mayr, C. Greg Plaxton
    On the Spanning Trees of Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:394-405 [Conf]
  39. Ernst W. Mayr
    Persistence of Vector Replacement Systems is Decidable. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:309-318 [Journal]
  40. Ernst W. Mayr, Ralph Werchner
    Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:3, pp:445-460 [Journal]
  41. Volker Heun, Ernst W. Mayr
    Efficient Embeddings into Hypercube-like Topologies. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2003, v:46, n:6, pp:632-644 [Journal]
  42. Ernst W. Mayr, C. Greg Plaxton
    On the spanning trees of weighted graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:4, pp:433-447 [Journal]
  43. Richard J. Anderson, Ernst W. Mayr, Manfred K. Warmuth
    Parallel Approximation Algorithms for Bin Packing [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:3, pp:262-277 [Journal]
  44. Ulla Koppenhagen, Ernst W. Mayr
    Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:158, n:2, pp:98-124 [Journal]
  45. Richard Anderson, Ernst W. Mayr
    Parallelism and the Maximal Path Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:121-126 [Journal]
  46. Ernst W. Mayr, Albert R. Meyer
    The Complexity of the Finite Containment Problem for Petri Nets. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:3, pp:561-576 [Journal]
  47. Andrei Z. Broder, Ernst W. Mayr
    Counting Minimum Weight Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:171-176 [Journal]
  48. Volker Heun, Ernst W. Mayr
    Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:1, pp:17-50 [Journal]
  49. Volker Heun, Ernst W. Mayr
    Efficient Dynamic Embeddings of Binary Trees into Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:1, pp:51-84 [Journal]
  50. Volker Heun, Ernst W. Mayr
    A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:2, pp:375-399 [Journal]
  51. Ernst W. Mayr
    Some Complexity Results for Polynomial Ideals. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:3, pp:303-325 [Journal]
  52. Ernst W. Mayr, Ashok Subramanian
    The Complexity of Circuit Value and Network Stability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:302-323 [Journal]
  53. Volker Heun, Ernst W. Mayr
    Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:8, pp:1110-1125 [Journal]
  54. Ernst W. Mayr, C. Greg Plaxton
    Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1993, v:17, n:4, pp:374-380 [Journal]
  55. Ernst W. Mayr, Ralph Werchner
    Optimal Routing of Parentheses on the Hypercube. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:2, pp:181-192 [Journal]
  56. Ulla Koppenhagen, Ernst W. Mayr
    An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:31, n:1/2, pp:259-276 [Journal]
  57. Ulla Koppenhagen, Ernst W. Mayr
    An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1999, v:28, n:3, pp:317-338 [Journal]
  58. David P. Helmbold, Ernst W. Mayr
    Two Processor Scheduling is in NC. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:747-759 [Journal]
  59. Ernst W. Mayr
    An Algorithm for the General Petri Net Reachability Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:3, pp:441-460 [Journal]
  60. Stefan Bischof, Ernst W. Mayr
    On-line scheduling of parallel jobs with runtime restrictions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:67-90 [Journal]
  61. Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr
    Projections of Vector Addition System Reachability Sets are Semilinear. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:3, pp:343-350 [Journal]
  62. Ernst W. Mayr, Ralph Werchner
    Divide-and-Conquer Algorithms on the Hypercube. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:162, n:2, pp:283-296 [Journal]
  63. Dmytro Chibisov, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov
    Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations. [Citation Graph (0, 0)][DBLP]
    CASC, 2007, pp:102-117 [Conf]

  64. Motion planning for 6R-Robots: multiple tasks with constrained velocity and orientation of the end-effector. [Citation Graph (, )][DBLP]


  65. Embedding complete binary trees in faulty hypercubes. [Citation Graph (, )][DBLP]


Search in 0.574secs, Finished in 0.577secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002