Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErnst W. Mayr
Ernst Wilhelm Mayr
Person information
- affiliation: TU Munich, Faculty of Computer Science
- affiliation: Johann Wolfgang Goethe University of Frankfurt, Institute of Computer Science
- affiliation: Stanford University, Department of Computer Science
- award (1997): Gottfried Wilhelm Leibniz Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j34]Ernst W. Mayr, Werner M. Seiler, Evgenii V. Vorozhtsov:
Memories on Vladimir Gerdt. J. Symb. Comput. 109: 50-56 (2022)- 2021
- [j33]Ernst W. Mayr, Werner M. Seiler, Evgenii V. Vorozhtsov:
Vladimir Gerdt dies at 73. ACM Commun. Comput. Algebra 55(1): 1-2 (2021)
2010 – 2019
- 2017
- [j32]Ernst W. Mayr:
Editorial: Special Issue on "Theoretical Aspects of Computer Science" (STACS 2015). Theory Comput. Syst. 61(4): 945-947 (2017) - 2016
- [j31]Ernst W. Mayr, Jeremias Weihmann:
Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities. Fundam. Informaticae 143(3-4): 355-391 (2016) - [e20]Ernst W. Mayr:
Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers. Lecture Notes in Computer Science 9224, Springer 2016, ISBN 978-3-662-53173-0 [contents] - 2015
- [j30]Ernst W. Mayr, Jeremias Weihmann:
Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms. Fundam. Informaticae 137(1): 61-86 (2015) - [c50]Ernst W. Mayr, Nicolas Ollinger:
Front Matter, Table of Contents, Preface, Conference Organization. STACS 2015 - [e19]Ernst W. Mayr, Nicolas Ollinger:
32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. LIPIcs 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-78-1 [contents] - 2014
- [c49]Ernst W. Mayr, Jeremias Weihmann:
A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application. Petri Nets 2014: 314-333 - [e18]Ernst W. Mayr, Natacha Portier:
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France. LIPIcs 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-65-1 [contents] - 2013
- [j29]Hanjo Täubig, Jeremias Weihmann, Sven Kosub
, Raymond Hemmecke, Ernst W. Mayr:
Inequalities for the Number of Walks in Graphs. Algorithmica 66(4): 804-828 (2013) - [j28]Ernst W. Mayr, Stephan Ritscher:
Dimension-dependent bounds for Gröbner bases of polynomial ideals. J. Symb. Comput. 49: 78-94 (2013) - [c48]Ernst W. Mayr, Jeremias Weihmann:
Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets. Petri Nets 2013: 70-89 - [c47]Ernst W. Mayr, Jeremias Weihmann:
Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities. RP 2013: 209-221 - [e17]Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov:
Computer Algebra in Scientific Computing - 15th International Workshop, CASC 2013, Berlin, Germany, September 9-13, 2013. Proceedings. Lecture Notes in Computer Science 8136, Springer 2013, ISBN 978-3-319-02296-3 [contents] - 2012
- [c46]Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann:
Inequalities for the Number of Walks in Graphs. ANALCO 2012: 26-39 - [e16]Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov:
Computer Algebra in Scientific Computing - 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012. Proceedings. Lecture Notes in Computer Science 7442, Springer 2012, ISBN 978-3-642-32972-2 [contents] - 2011
- [c45]Ernst W. Mayr, Stephan Ritscher:
Space-efficient Gröbner basis computation without degree bounds. ISSAC 2011: 257-264 - [e15]Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov:
Computer Algebra in Scientific Computing - 13th International Workshop, CASC 2011, Kassel, Germany, September 5-9, 2011. Proceedings. Lecture Notes in Computer Science 6885, Springer 2011, ISBN 978-3-642-23567-2 [contents] - 2010
- [c44]Ernst W. Mayr:
From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk). CASC 2010: 204 - [c43]Ernst W. Mayr, Stephan Ritscher:
Degree bounds for Gröbner bases of low-dimensional polynomial ideals. ISSAC 2010: 21-27 - [e14]Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov:
Computer Algebra in Scientific Computing - 12th International Workshop, CASC 2010, Tsakhkadzor, Armenia, September 6-12, 2010. Proceedings. Lecture Notes in Computer Science 6244, Springer 2010, ISBN 978-3-642-15273-3 [contents] - [e13]Farid M. Ablayev, Ernst W. Mayr:
Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings. Lecture Notes in Computer Science 6072, Springer 2010, ISBN 978-3-642-13181-3 [contents]
2000 – 2009
- 2009
- [j27]Wolfram Koepf, Ernst W. Mayr:
Mathematik und die Informatik. Inform. Spektrum 32(1): 1-2 (2009) - [j26]Ralf Hofestädt, Ernst W. Mayr:
Bioinformatik. Inform. Spektrum 32(4): 285-286 (2009) - [e12]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. Lecture Notes in Computer Science 5743, Springer 2009, ISBN 978-3-642-04102-0 [contents] - 2008
- [c42]Ernst W. Mayr:
Lebenslanges Lernen in der Informatik: Beiträge der Hochschulen und Erwartungen der Wirtschaft - Vorwort. Lebenslanges Lernen in der Informatik 2008: 7-9 - 2007
- [c41]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 - [c40]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 - [e11]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. Lecture Notes in Computer Science 4770, Springer 2007, ISBN 978-3-540-75186-1 [contents] - 2006
- [c39]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 - [e10]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. Lecture Notes in Computer Science 4194, Springer 2006, ISBN 3-540-45182-X [contents] - 2005
- [c38]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 - [c37]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 - [e9]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. Lecture Notes in Computer Science 3718, Springer 2005, ISBN 3-540-28966-6 [contents] - 2004
- [c36]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 - [c35]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 - [e8]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. IFIP 155, Kluwer/Springer 2004, ISBN 1-4020-8140-5 [contents] - 2003
- [j25]Volker Heun, Ernst W. Mayr:
Efficient Embeddings into Hypercube-like Topologies. Comput. J. 46(6): 632-644 (2003) - [c34]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 - 2002
- [j24]Volker Heun, Ernst W. Mayr:
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. J. Algorithms 43(1): 17-50 (2002) - [j23]Volker Heun, Ernst W. Mayr:
Efficient Dynamic Embeddings of Binary Trees into Hypercubes. J. Algorithms 43(1): 51-84 (2002) - [c33]Ernst W. Mayr:
Complexity Theory and Algorithms. Euro-Par 2002: 391 - 2001
- [j22]Volker Heun, Ernst W. Mayr:
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. J. Parallel Distributed Comput. 61(8): 1110-1125 (2001) - [j21]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) - [j20]Stefan Bischof, Ernst W. Mayr:
On-line scheduling of parallel jobs with runtime restrictions. Theor. Comput. Sci. 268(1): 67-90 (2001) - [e7]Victor G. Ganzha, Ernst Wilhelm Mayr, Evgenii V. Vorozhtsov:
Computer Algebra in Scientific Computing, CASC 2001, Konstanz, Germany, September 22-26, 2001. Springer Berlin Heidelberg 2001, ISBN 978-3-642-56666-0 [contents] - 2000
- [j19]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) - [c32]Ernst W. Mayr:
Distributed Systems and Algorithms. Euro-Par 2000: 573-574 - [c31]Ernst W. Mayr:
In Is on the Boundary: Complexity Considerations for Polynominal Ideals. IFIP TCS 2000: 99
1990 – 1999
- 1999
- [j18]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) - [c30]Ernst W. Mayr, Friedhelm Meyer auf der Heide, Rolf Wanka:
International Workshop on Communication and Data Management in Large Networks. GI Jahrestagung 1999: 334 - [e6]Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov:
Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, CASC 1999, Munich, Germany, May 31 - June 4, 1999. Springer 1999, ISBN 978-3-540-66047-7 [contents] - 1998
- [c29]Lionel Brunie, Ernst W. Mayr:
Distributed Systems and Databases. Euro-Par 1998: 503-504 - [c28]Stefan Bischof, Ernst W. Mayr:
On-Line Scheduling of Parallel Jobs with Runtime Restrictions. ISAAC 1998: 119-128 - [c27]Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr:
Parallel Continuous Randomized Load Balancing (Extended Abstract). SPAA 1998: 192-201 - [e5]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). Lecture Notes in Computer Science 1367, Springer 1998, ISBN 3-540-64201-3 [contents] - 1997
- [j17]Ernst W. Mayr, Ralph Werchner:
Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks. Algorithmica 18(3): 445-460 (1997) - [j16]Andrei Z. Broder, Ernst W. Mayr:
Counting Minimum Weight Spanning Trees. J. Algorithms 24(1): 171-176 (1997) - [j15]Ernst W. Mayr:
Some Complexity Results for Polynomial Ideals. J. Complex. 13(3): 303-325 (1997) - [c26]Ulla Koppenhagen, Ernst W. Mayr:
The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. FCT 1997: 257-268 - 1996
- [j14]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) - [j13]Ernst W. Mayr:
Scheduling Interval Orders in Parallel. Parallel Algorithms Appl. 8(1): 21-34 (1996) - [j12]Ernst W. Mayr, Ralph Werchner:
Divide-and-Conquer Algorithms on the Hypercube. Theor. Comput. Sci. 162(2): 283-296 (1996) - [c25]Volker Heun, Ernst W. Mayr:
A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. Euro-Par, Vol. I 1996: 222-233 - [c24]Ernst W. Mayr, Hans Stadtherr:
Efficient Parallel Algorithms for Scheduling with Tree Precedence Constrinats. Euro-Par, Vol. II 1996: 543-554 - [c23]Ulla Koppenhagen, Ernst W. Mayr:
Optimal Gröbner Base Algorithms for Binomial Ideals. ICALP 1996: 244-255 - [c22]Volker Heun, Ernst W. Mayr:
Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. IRREGULAR 1996: 287-298 - [c21]Ulla Koppenhagen, Ernst W. Mayr:
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. ISSAC 1996: 55-62 - [c20]Klaus Kühnle, Ernst W. Mayr:
Exponential Space Computation of Gröbner Bases. ISSAC 1996: 63-71 - [c19]Volker Heun, Ernst W. Mayr:
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. STACS 1996: 157-168 - 1995
- [j11]Ernst W. Mayr, Ralph Werchner:
Optimal Routing of Parentheses on the Hypercube. J. Parallel Distributed Comput. 26(2): 181-192 (1995) - [c18]Ernst W. Mayr:
On Polynomial Ideals, Their Complexity, and Applications. FCT 1995: 89-105 - [c17]Ernst W. Mayr:
Scheduling interval orders in parallel. HICSS (2) 1995: 20-28 - [e4]Ernst W. Mayr, Claude Puech:
STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings. Lecture Notes in Computer Science 900, Springer 1995, ISBN 3-540-59042-0 [contents] - [e3]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. Lecture Notes in Computer Science 903, Springer 1995, ISBN 3-540-59071-4 [contents] - 1994
- [c16]Ernst W. Mayr, Ralph Werchner:
Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks. HICSS (2) 1994: 140-149 - [e2]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. Lecture Notes in Computer Science 775, Springer 1994, ISBN 3-540-57785-8 [contents] - 1993
- [j10]Ernst W. Mayr, C. Greg Plaxton:
Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube. J. Parallel Distributed Comput. 17(4): 374-380 (1993) - [c15]Ernst W. Mayr, Ralph Werchner:
Optimal Tree Contraction on the Hypercube and Related Networks. ESA 1993: 295-305 - [c14]Ernst W. Mayr, Ralph Werchner:
Divide-and-Conquer Algorithms on the Hypercube. STACS 1993: 153-162 - [e1]Ernst W. Mayr:
Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings. Lecture Notes in Computer Science 657, Springer 1993, ISBN 3-540-56402-0 [contents] - [i2]Volker Heun, Ernst W. Mayr:
A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube. Forschungsberichte, TU Munich TUM I 9321: 1-20 (1993) - [i1]Ernst W. Mayr, Ralph Werchner:
Divide and conquer algorithms on the hypercube. Forschungsberichte, TU Munich TUM I 9322: 1-14 (1993) - 1992
- [j9]Ernst W. Mayr, C. Greg Plaxton:
On the spanning trees of weighted graphs. Comb. 12(4): 433-447 (1992) - [j8]Ernst W. Mayr, Ashok Subramanian:
The Complexity of Circuit Value and Network Stability. J. Comput. Syst. Sci. 44(2): 302-323 (1992) - [c13]Ernst W. Mayr, Ralph Werchner:
Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks. Heinz Nixdorf Symposium 1992: 195-206 - [c12]Ernst W. Mayr, Ralph Werchner:
Optimal Routing of Parentheses on the Hypercube. SPAA 1992: 109-117 - 1991
- [c11]Alexander Wang, Robert Cypher, Ernst W. Mayr:
Embedding complete binary trees in faulty hypercubes. SPDP 1991: 112-119
1980 – 1989
- 1989
- [j7]Richard J. Anderson, Ernst W. Mayr, Manfred K. Warmuth:
Parallel Approximation Algorithms for Bin Packing. Inf. Comput. 82(3): 262-277 (1989) - [j6]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) - [c10]Ernst W. Mayr, Ashok Subramanian:
The Complexity of Circuit Value and Network Stability. SCT 1989: 114-123 - [c9]Ernst W. Mayr:
Membership in Plynomial Ideals over Q Is Exponential Space Complete. STACS 1989: 400-406 - 1988
- [c8]Ernst W. Mayr:
Parallel Approximation Algorithms. FGCS 1988: 542-551 - [c7]Ernst W. Mayr, C. Greg Plaxton:
On the Spanning Trees of Weighted Graphs. WG 1988: 394-405 - 1987
- [j5]Richard J. Anderson, Ernst W. Mayr:
Parallelism and the Maximal Path Problem. Inf. Process. Lett. 24(2): 121-126 (1987) - [j4]David P. Helmbold, Ernst W. Mayr:
Two Processor Scheduling is in NC. SIAM J. Comput. 16(4): 747-759 (1987) - 1986
- [c6]David P. Helmbold, Ernst W. Mayr:
Two Processor Scheduling is in NC. Aegean Workshop on Computing 1986: 12-25 - [c5]David P. Helmbold, Ernst W. Mayr:
Perfect Graphs and Parallel Algorithms. ICPP 1986: 853-860 - [c4]David P. Helmbold, Ernst W. Mayr:
Applications of Parallel Scheduling to Perfect Graphs. WG 1986: 188-203 - 1984
- [j3]Ernst W. Mayr:
An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput. 13(3): 441-460 (1984) - [c3]Thomas H. Spencer, Ernst W. Mayr:
Node Weighted Matching. ICALP 1984: 454-464 - 1983
- [c2]Peter H. Hochschild, Ernst W. Mayr, Alan R. Siegel:
Techniques for Solving Graph Problems in Parallel Environments. FOCS 1983: 351-359 - 1981
- [j2]Ernst W. Mayr:
Persistence of Vector Replacement Systems is Decidable. Acta Informatica 15: 309-318 (1981) - [j1]Ernst W. Mayr, Albert R. Meyer:
The Complexity of the Finite Containment Problem for Petri Nets. J. ACM 28(3): 561-576 (1981) - [c1]Ernst W. Mayr:
An Algorithm for the General Petri Net Reachability Problem. STOC 1981: 238-246
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
