default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilfried N. Gansterer
Person information
- affiliation: University of Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c62]Viktoria Mayer, Wilfried N. Gansterer:
A New Exact State Reconstruction Strategy for Conjugate Gradient Methods with Arbitrary Preconditioners. IPDPS (Workshops) 2024: 1150-1152- [c61]Lorenz Kummer
, Samir Moustafa, Sebastian Schrittwieser, Wilfried N. Gansterer, Nils M. Kriege:
Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Leman Go Indifferent. KDD 2024: 1428-1439 - [c60]Franka Bause, Samir Moustafa, Johannes Langguth, Wilfried N. Gansterer, Nils M. Kriege:
On the Two Sides of Redundancy in Graph Neural Networks. ECML/PKDD (6) 2024: 371-388 - [i8]João Nuno Ferreira Alves, Samir Moustafa, Siegfried Benkner, Alexandre P. Francisco, Wilfried N. Gansterer, Luís M. S. Russo:
Accelerating Graph Neural Networks with a Novel Matrix Compression Format. CoRR abs/2409.02208 (2024) - 2023
- [c59]Lorenz Kummer, Kevin Sidak, Tabea Reichmann, Wilfried N. Gansterer:
Adaptive Precision Training (AdaPT): A dynamic quantized training approach for DNNs. SDM 2023: 559-567 - [i7]Franka Bause, Samir Moustafa, Johannes Langguth, Wilfried N. Gansterer, Nils M. Kriege:
Non-Redundant Graph Neural Networks with Improved Expressiveness. CoRR abs/2310.04190 (2023) - [i6]Lorenz Kummer, Samir Moustafa, Nils M. Kriege, Wilfried N. Gansterer:
Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent. CoRR abs/2311.01205 (2023) - 2022
- [j24]Emmanuel Agullo, Mirco Altenbernd, Hartwig Anzt, Leonardo Bautista-Gomez, Tommaso Benacchio, Luca Bonaventura, Hans-Joachim Bungartz, Sanjay Chatterjee, Florina M. Ciorba, Nathan DeBardeleben, Daniel Drzisga, Sebastian Eibl, Christian Engelmann, Wilfried N. Gansterer, Luc Giraud, Dominik Göddeke, Marco Heisig, Fabienne Jézéquel, Nils Kohl, Xiaoye Sherry Li, Romain Lion, Miriam Mehl, Paul Mycek, Michael Obersteiner, Enrique S. Quintana-Ortí, Francesco Rizzi, Ulrich Rüde, Martin Schulz, Fred Fung, Robert Speck, Linda Stals, Keita Teranishi, Samuel Thibault, Dominik Thönnes, Andreas Wagner, Barbara I. Wohlmuth:
Resiliency in numerical algorithm design for extreme scale simulations. Int. J. High Perform. Comput. Appl. 36(2): 251-285 (2022) - [c58]Robert Ernstbrunner, Viktoria Mayer, Wilfried N. Gansterer:
Accuracy vs. Cost in Parallel Fixed-Precision Low-Rank Approximations of Sparse Matrices. IPDPS 2022: 459-469 - 2021
- [i5]Lorenz Kummer, Kevin Sidak, Tabea Reichmann, Wilfried N. Gansterer:
MARViN - Multiple Arithmetic Resolutions Vacillating in Neural Networks. CoRR abs/2107.13490 (2021) - 2020
- [j23]Karl E. Prikopa, Wilfried N. Gansterer:
Fault-tolerant least squares solvers for wireless sensor networks based on gossiping. J. Parallel Distributed Comput. 136: 52-62 (2020) - [c57]Carlos Pachajoa, Christina Pacher, Markus Levonyak, Wilfried N. Gansterer:
Algorithm-Based Checkpoint-Recovery for the Conjugate Gradient Method. ICPP 2020: 14:1-14:11 - [c56]Markus Levonyak, Christina Pacher, Wilfried N. Gansterer:
Scalable Resilience Against Node Failures for Communication-Hiding Preconditioned Conjugate Gradient and Conjugate Residual Methods. PP 2020: 81-92 - [c55]Carlos Pachajoa, Robert Ernstbrunner, Wilfried N. Gansterer:
A Generic Strategy for Node-Failure Resilience for Certain Iterative Linear Algebra Methods. FTXS@SC 2020: 41-50 - [i4]Carlos Pachajoa, Christina Pacher, Markus Levonyak, Wilfried N. Gansterer:
Algorithm-Based Checkpoint-Recovery for the Conjugate Gradient Method. CoRR abs/2007.04066 (2020) - [i3]Emmanuel Agullo, Mirco Altenbernd, Hartwig Anzt, Leonardo Bautista-Gomez, Tommaso Benacchio, Luca Bonaventura, Hans-Joachim Bungartz, Sanjay Chatterjee, Florina M. Ciorba, Nathan DeBardeleben, Daniel Drzisga, Sebastian Eibl, Christian Engelmann, Wilfried N. Gansterer, Luc Giraud, Dominik Göddeke, Marco Heisig, Fabienne Jézéquel, Nils Kohl, Xiaoye Sherry Li, Romain Lion, Miriam Mehl, Paul Mycek, Michael Obersteiner, Enrique S. Quintana-Ortí, Francesco Rizzi, Ulrich Rüde, Martin Schulz, Fred Fung, Robert Speck, Linda Stals, Keita Teranishi, Samuel Thibault, Dominik Thönnes, Andreas Wagner, Barbara I. Wohlmuth:
Resiliency in Numerical Algorithm Design for Extreme Scale Simulations. CoRR abs/2010.13342 (2020)
2010 – 2019
- 2019
- [j22]Marc Casas, Wilfried N. Gansterer, Elias Wimmer:
Resilient gossip-inspired all-reduce algorithms for high-performance computing: Potential, limitations, and open questions. Int. J. High Perform. Comput. Appl. 33(2) (2019) - [c54]Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer, Jesper Larsson Träff:
How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. ICPP 2019: 67:1-67:10 - [c53]Carlos Pachajoa, Christina Pacher, Wilfried N. Gansterer:
Node-Failure-Resistant Preconditioned Conjugate Gradient Method without Replacement Nodes. FTXS@SC 2019: 31-40 - [i2]Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer, Jesper Larsson Träff:
How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. CoRR abs/1907.13077 (2019) - [i1]Markus Levonyak, Christina Pacher, Wilfried N. Gansterer:
Scalable Resilience Against Node Failures for Communication-Hiding Preconditioned Conjugate Gradient and Conjugate Residual Methods. CoRR abs/1912.09230 (2019) - 2018
- [c52]Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer:
Extending and Evaluating Fault-Tolerant Preconditioned Conjugate Gradient Methods. FTXS@SC 2018: 49-58 - 2017
- [j21]Michael Moldaschl, Karl E. Prikopa, Wilfried N. Gansterer:
Fault tolerant communication-optimal 2.5D matrix multiplication. J. Parallel Distributed Comput. 104: 179-190 (2017) - [c51]Carlos Pachajoa, Wilfried N. Gansterer:
On the Resilience of Conjugate Gradient and Multigrid Methods to Node Failures. Euro-Par Workshops 2017: 569-580 - 2016
- [j20]Andreas Berger, Alessandro D'Alconzo, Wilfried N. Gansterer, Antonio Pescapè:
Mining agile DNS traffic using graph analysis for cybercrime detection. Comput. Networks 100: 28-44 (2016) - [j19]Andrea Hess, Karin Anna Hummel, Wilfried N. Gansterer, Günter Haring:
Data-driven Human Mobility Modeling: A Survey and Engineering Guidance for Mobile Networking. ACM Comput. Surv. 48(3): 38:1-38:39 (2016) - [j18]Ondrej Sluciak, Hana Straková, Markus Rupp, Wilfried N. Gansterer:
Distributed Gram-Schmidt orthogonalization with simultaneous elements refinement. EURASIP J. Adv. Signal Process. 2016: 25 (2016) - [j17]Karl E. Prikopa, Wilfried N. Gansterer, Elias Wimmer:
Parallel iterative refinement linear least squares solvers based on all-reduce operations. Parallel Comput. 57: 167-184 (2016) - [c50]Andreas Janecek, Wilfried N. Gansterer:
ACO-inspired Acceleration of Gossip Averaging. GECCO 2016: 21-28 - [c49]Andreas Janecek, Wilfried N. Gansterer:
Understanding the Information Flow of ACO-Accelerated Gossip Algorithms. ICSI (1) 2016: 426-433 - 2015
- [j16]Mukhtar Azeem, Majid Iqbal Khan, Samee Ullah Khan, Wilfried N. Gansterer:
Efficient scheduling of sporadic tasks for real-time wireless sensor networks. IET Wirel. Sens. Syst. 5(1): 1-10 (2015) - 2014
- [j15]Michael Moldaschl, Wilfried N. Gansterer:
Comparison of eigensolvers for symmetric band matrices. Sci. Comput. Program. 90: 55-66 (2014) - [c48]Karl E. Prikopa, Hana Straková, Wilfried N. Gansterer:
Analysis and Comparison of Truly Distributed Solvers for Linear Least Squares Problems on Wireless Sensor Networks. Euro-Par 2014: 403-414 - [c47]Michael Moldaschl, Wilfried N. Gansterer, Ondrej Hlinka, Florian Meyer, Franz Hlawatsch:
Distributed decorrelation in sensor networks with application to distributed particle filtering. ICASSP 2014: 6117-6121 - 2013
- [j14]Majid I. Khan, Wilfried N. Gansterer, Günter Haring:
Static vs. mobile sink: The influence of basic parameters on energy efficiency in wireless sensor networks. Comput. Commun. 36(9): 965-978 (2013) - [j13]Wilfried N. Gansterer, Gerhard Niederbrucker, Hana Straková, Stefan Schulze Grotthoff:
Scalable and fault tolerant orthogonalization based on randomized distributed data aggregation. J. Comput. Sci. 4(6): 480-488 (2013) - [c46]Gerhard Niederbrucker, Wilfried N. Gansterer:
Robust gossip-based aggregation: A practical point of view. ALENEX 2013: 133-147 - [c45]Andreas Berger, Stefan Ruehrup, Wilfried N. Gansterer, Oliver Jung:
Locality matters: Reducing Internet traffic graphs using location analysis. DSN 2013: 1-12 - [c44]Hana Straková, Gerhard Niederbrucker, Wilfried N. Gansterer:
Fault Tolerance Properties of Gossip-Based Distributed Orthogonal Iteration Methods. ICCS 2013: 189-198 - [c43]Karl E. Prikopa, Wilfried N. Gansterer:
On Mixed Precision Iterative Refinement for Eigenvalue Problems. ICCS 2013: 2647-2650 - [c42]Andreas Berger, Wilfried N. Gansterer:
Modeling DNS agility with DNSMap. INFOCOM Workshops 2013: 387-392 - [c41]Andreas Berger, Wilfried N. Gansterer:
Modeling DNS agility with DNSMap. INFOCOM 2013: 3153-3158 - [c40]Hana Straková, Wilfried N. Gansterer:
A Distributed Eigensolver for Loosely Coupled Networks. PDP 2013: 51-57 - 2012
- [j12]Gerhard König, Michael Moldaschl, Wilfried N. Gansterer:
Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations. J. Comput. Appl. Math. 236(15): 3696-3703 (2012) - [c39]Ondrej Sluciak, Hana Straková, Markus Rupp, Wilfried N. Gansterer:
Distributed Gram-Schmidt orthogonalization based on dynamic consensus. ACSCC 2012: 1207-1211 - [c38]Gerhard Niederbrucker, Hana Straková, Wilfried N. Gansterer:
Improving Fault Tolerance and Accuracy of a Distributed Reduction Algorithm. SC Companion 2012: 643-651 - [c37]Hana Straková, Wilfried N. Gansterer:
Abstract: Gossip-Based Distributed Matrix Computations. SC Companion 2012: 1405-1406 - [c36]Hana Straková, Wilfried N. Gansterer:
Poster: Gossip-Based Distributed Matrix Computations. SC Companion 2012: 1407 - [c35]Thang Viet Huynh, Manfred Mücke, Wilfried N. Gansterer:
Evaluation of the Stretch S6 Hybrid Reconfigurable Embedded CPU Architecture for Power-Efficient Scientific Computing. ICCS 2012: 196-205 - 2011
- [j11]Andreas Janecek, Stefan Schulze Grotthoff, Wilfried N. Gansterer:
libNMF - A Library for Nonnegative Matrix Factorization. Comput. Informatics 30(2): 205-224 (2011) - [c34]Thang Viet Huynh, Manfred Mücke, Wilfried N. Gansterer:
Native Double Precision LINPACK Implementation on a Hybrid Reconfigurable CPU. IPDPS Workshops 2011: 298-301 - [c33]Hana Straková, Wilfried N. Gansterer, Thomas Zemen:
Distributed QR Factorization Based on Randomized Algorithms. PPAM (1) 2011: 235-244 - [c32]Wilfried N. Gansterer, Gerhard Niederbrucker, Hana Straková, Stefan Schulze Grotthoff:
Robust distributed orthogonalization based on randomized aggregation. ScalA@SC 2011: 7-10 - [c31]Gerhard Niederbrucker, Wilfried N. Gansterer:
A fast solver for modeling the evolution of virus populations. SC 2011: 74:1-74:11 - [c30]Gerhard Niederbrucker, Wilfried N. Gansterer:
Effcient Solution of Evolution Models for Virus Populations. ICCS 2011: 126-135 - [c29]Bernd Lesser, Manfred Mücke, Wilfried N. Gansterer:
Effects of Reduced Precision on Floating-Point SVM Classification Accuracy. ICCS 2011: 508-517 - [e1]Karin Anna Hummel, Helmut Hlavacs, Wilfried N. Gansterer:
Performance Evaluation of Computer and Communication Systems. Milestones and Future Challenges - IFIP WG 6.3/7.3 International Workshop, PERFORM 2010, in Honor of Günter Haring on the Occasion of His Emeritus Celebration, Vienna, Austria, October 14-16, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6821, Springer 2011, ISBN 978-3-642-25574-8 [contents] - 2010
- [j10]Alexander K. Seewald, Wilfried N. Gansterer:
On the detection and identification of botnets. Comput. Secur. 29(1): 45-58 (2010) - [j9]Martin Koehler, Matthias Ruckenbauer, Ivan Janciak, Siegfried Benkner, Hans Lischka, Wilfried N. Gansterer:
A grid services cloud for molecular modelling workflows. Int. J. Web Grid Serv. 6(2): 176-195 (2010) - [c28]Manfred Mücke, Bernd Lesser, Wilfried N. Gansterer:
Peak Performance Model for a Custom Precision Floating-Point Dot Product on FPGAs. Euro-Par Workshops 2010: 399-406 - [c27]Martin Koehler, Matthias Ruckenbauer, Ivan Janciak, Siegfried Benkner, Hans Lischka, Wilfried N. Gansterer:
Supporting Molecular Modeling Workflows within a Grid Services Cloud. ICCSA (4) 2010: 13-28 - [c26]Wilfried N. Gansterer, Gerhard König:
On twisted factorizations of block tridiagonal matrices. ICCS 2010: 279-287 - [c25]Hannes Schabauer, Christoph Pacher, Andrew G. Sunderland, Wilfried N. Gansterer:
Toward a parallel solver for generalized complex symmetric eigenvalue problems. ICCS 2010: 437-445
2000 – 2009
- 2009
- [c24]David Pölz, Wilfried N. Gansterer:
Trustnet Architecture for E-mail Communication. DEXA Workshops 2009: 48-52 - [c23]Wilfried N. Gansterer, David Pölz:
E-Mail Classification for Phishing Defense. ECIR 2009: 449-460 - [c22]Wilfried N. Gansterer, Andreas R. Gruber, Christoph Pacher:
Non-splitting Tridiagonalization of Complex Symmetric Matrices. ICCS (1) 2009: 481-490 - 2008
- [j8]Martin Petraschek, Thomas Hoeher, Oliver Jung, Helmut Hlavacs, Wilfried N. Gansterer:
Security and Usability Aspects of Man-in-the-Middle Attacks on ZRTP. J. Univers. Comput. Sci. 14(5): 673-692 (2008) - [j7]Helmut Hlavacs, Wilfried N. Gansterer, Hannes Schabauer, Joachim Zottl, Martin Petraschek, Thomas Hoeher, Oliver Jung:
Enhancing ZRTP by using Computational Puzzles. J. Univers. Comput. Sci. 14(5): 693-716 (2008) - [c21]Andreas Janecek, Wilfried N. Gansterer, K. Ashwin Kumar:
Multi-Level Reputation-Based Greylisting. ARES 2008: 10-17 - [c20]Majid I. Khan, Wilfried N. Gansterer, Günter Haring:
Identifying the Boundary of a Wireless Sensor Network with a Mobile Sink. ADHOC-NOW 2008: 369-379 - [c19]Wilfried N. Gansterer, Hannes Schabauer, Christoph Pacher, N. Finger:
Tridiagonalizing Complex Symmetric Matrices in Waveguide Simulations. ICCS (1) 2008: 945-954 - [c18]Majid I. Khan, Wilfried N. Gansterer, Günter Haring:
Energy consumption vs. latency in a new boundary identification method for WSNs with a mobile sink. MOBIWAC 2008: 125-132 - [c17]Gerald Stampfel, Wilfried N. Gansterer, Martin Ilger:
Implications of the EU Data Retention Directive 2006/24/EC. Sicherheit 2008: 45-58 - [c16]Wilfried N. Gansterer, Michael Ilger:
Towards Self-Learning and Fully Transparent UCE Prevention. Sicherheit 2008: 277-290 - [c15]Andreas Janecek, Wilfried N. Gansterer, Michael Demel, Gerhard F. Ecker:
On the Relationship Between Feature Selection and Classification Accuracy. FSDM 2008: 90-105 - 2007
- [j6]Majid I. Khan, Wilfried N. Gansterer, Günter Haring:
Congestion Avoidance and Energy Efficient Routing Protocol for Wireless Sensor Networks with a Mobile Sink. J. Networks 2(6): 42-49 (2007) - [c14]Wilfried N. Gansterer, Michael Ilger:
Analyzing UCE/UBE traffic. ICEC 2007: 195-204 - [c13]Wilfried N. Gansterer, Andreas Janecek, Peter Lechner:
A Reliable Component-Based Architecture for E-Mail Filtering. ARES 2007: 43-52 - [c12]Joachim Zottl, Wilfried N. Gansterer, Helmut Hlavacs:
A Hierarchical Two-Tier Information Management Architecture for Mobile Ad-Hoc Grid Environments. CCGRID 2007: 707-712 - [c11]Majid I. Khan, Wilfried N. Gansterer, Günter Haring:
In-Network Storage Model for Data Persistence under Congestion in Wireless Sensor Network. CISIS 2007: 221-228 - [c10]Matthias Ruckenbauer, Ivona Brandic, Siegfried Benkner, Wilfried N. Gansterer, Osvaldo Gervasi, Mario Barbatti, Hans Lischka:
Nonadiabatic Ab Initio Surface-Hopping Dynamics Calculation in a Grid Environment - First Experiences. ICCSA (1) 2007: 281-294 - 2005
- [c9]Wilfried N. Gansterer, Joachim Zottl:
Parallelization of Divide-and-Conquer Eigenvector Accumulation. Euro-Par 2005: 847-856 - [c8]Wilfried N. Gansterer:
Computing Orthogonal Decompositions of Block Tridiagonal or Banded Matrices. International Conference on Computational Science (1) 2005: 25-32 - [c7]Wilfried N. Gansterer, Wolfgang Kreuzer, Hans Lischka:
Data Reduction Schemes in Davidson Subspace Diagonalization for MR-CI. LSSC 2005: 564-571 - 2004
- [j5]Wilfried N. Gansterer, Yihua Bai, Robert M. Day, Robert C. Ward:
Framework for approximating eigenpairs in electronic structure computations. Comput. Sci. Eng. 6(5): 50-59 (2004) - [j4]Yihua Bai, Wilfried N. Gansterer, Robert C. Ward:
Block tridiagonalization of "effectively" sparse symmetric matrices. ACM Trans. Math. Softw. 30(3): 326-352 (2004) - [c6]Joachim Zottl, Wilfried N. Gansterer:
Message Passing vs. Virtual Shared Memory, A Performance Comparison. DAPSYS 2004: 39-46 - 2003
- [j3]Wilfried N. Gansterer, Robert C. Ward, Richard P. Muller, William A. Goddard III:
Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices. SIAM J. Sci. Comput. 25(1): 65-85 (2003) - 2002
- [j2]Harald J. Ehold, Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber:
Optimizing Local Performance in HPF. Parallel Comput. 28(3): 415-432 (2002) - [j1]Wilfried N. Gansterer, Robert C. Ward, Richard P. Muller:
An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. ACM Trans. Math. Softw. 28(1): 45-58 (2002)
1990 – 1999
- 1999
- [c5]Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber:
Blocking Techniques in Numerical Software. ACPC 1999: 127-139 - [c4]Harald J. Ehold, Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber:
HPF and Numerical Libraries. ACPC 1999: 140-152 - [c3]Helmut Kofler, Ernst J. Haunschmid, Wilfried N. Gansterer, Christoph W. Ueberhuber:
The Locality Property in Topological Irregular Graph Hierarchies. ACPC 1999: 437-449 - [c2]Wilfried N. Gansterer, Dieter F. Kvasnicka, Karlheinz Schwarz, Christoph W. Ueberhuber:
Blocking Techniques in Symmetric Eigensolvers. PP 1999 - 1998
- [c1]Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber:
Multi-sweep Algorithms for the Symmetric Eigenproblem. VECPAR 1998: 20-28
Coauthor Index
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-10-07 22:19 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:
