default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBora Uçar
Person information
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2019
[b2]Bora Uçar:
Partitioning, matching, and ordering: Combinatorial scientific computing with matrices and tensors. (Partitionnement, couplage et permutation: Calcul scientifique combinatoire sur des matrices et des tenseurs). ENS Lyon, France, 2019- 2005
- [b1]Bora Uçar:
Parallel sparse matrix-vector multiplies and iterative solvers (Paralel seyrek matris-vektör çarpımı ve dolaylı yöntemler). İhsan Doğramacı Bilkent University, Turkey, 2005
Journal Articles
- 2022
- [j31]Fanny Dufossé, Kamer Kaya
, Ioannis Panagiotas, Bora Uçar:
Scaling matrices and counting the perfect matchings in graphs. Discret. Appl. Math. 308: 130-146 (2022) - [j30]Jules Bertrand, Fanny Dufossé, Somesh Singh, Bora Uçar:
Algorithms and Data Structures for Hyperedge Queries. ACM J. Exp. Algorithmics 27: 1.13:1-1.13:23 (2022) - 2020
- [j29]Eric R. Hein, Srinivas Eswar, Abdurrahman Yasar, Jiajia Li, Jeffrey S. Young, Thomas M. Conte, Ümit V. Çatalyürek, Richard W. Vuduc, E. Jason Riedy, Bora Uçar:
Programming Strategies for Irregular Algorithms on the Emu Chick. ACM Trans. Parallel Comput. 7(4): 25:1-25:25 (2020) - 2019
- [j28]Filip Pawlowski, Bora Uçar, Albert-Jan Yzelman:
A multi-dimensional Morton-ordered block storage for mode-oblivious tensor computations. J. Comput. Sci. 33: 34-44 (2019) - [j27]Julien Herrmann, M. Yusuf Özkaya, Bora Uçar, Kamer Kaya, Ümit V. Çatalyürek:
Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs. SIAM J. Sci. Comput. 41(4): A2117-A2145 (2019) - 2018
- [j26]Oguz Kaya, Bora Uçar:
Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees. SIAM J. Sci. Comput. 40(1) (2018) - [j25]Enver Kayaaslan, Cevdet Aykanat, Bora Uçar:
1.5D Parallel Sparse Matrix-Vector Multiply. SIAM J. Sci. Comput. 40(1) (2018) - [j24]Enver Kayaaslan, Thomas Lambert, Loris Marchal, Bora Uçar:
Scheduling series-parallel task graphs to minimize peak memory. Theor. Comput. Sci. 707: 1-23 (2018) - 2017
- [j23]Michele Benzi, Bora Uçar:
Preconditioning Techniques Based on the Birkhoff-von Neumann Decomposition. Comput. Methods Appl. Math. 17(2): 201 (2017) - 2016
- [j22]Massimiliano Fasi, Julien Langou, Yves Robert, Bora Uçar:
A backward/forward recovery approach for the preconditioned conjugate gradient method. J. Comput. Sci. 17: 522-534 (2016) - 2015
- [j21]Thomas Lambert, Loris Marchal, Bora Uçar:
Comments on the hierarchically structured bin packing problem. Inf. Process. Lett. 115(2): 306-309 (2015) - [j20]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
Hypergraph partitioning for multiple communication cost metrics: Model and methods. J. Parallel Distributed Comput. 77: 69-83 (2015) - [j19]Fanny Dufossé, Kamer Kaya, Bora Uçar:
Two approximation algorithms for bipartite matching on multicore architectures. J. Parallel Distributed Comput. 85: 62-78 (2015) - 2014
- [j18]Philip A. Knight, Daniel Ruiz, Bora Uçar:
A Symmetry Preserving Algorithm for Matrix Scaling. SIAM J. Matrix Anal. Appl. 35(3): 931-955 (2014) - 2013
- [j17]Kamer Kaya, Johannes Langguth, Fredrik Manne, Bora Uçar:
Push-relabel based algorithms for the maximum transversal problem. Comput. Oper. Res. 40(5): 1266-1275 (2013) - [j16]Iain S. Duff, Bora Uçar:
Direct methods for sparse matrix solution. Scholarpedia 8(10): 9700 (2013) - [j15]Kamer Kaya, Bora Uçar:
Constructing Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Anal. Appl. 34(2): 345-354 (2013) - 2012
- [j14]Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, Yves Robert, François-Henry Rouet, Bora Uçar:
On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment. SIAM J. Sci. Comput. 34(4) (2012) - 2011
- [j13]Iain S. Duff, Kamer Kaya, Bora Uçar:
Design, implementation, and analysis of maximum transversal algorithms. ACM Trans. Math. Softw. 38(2): 13:1-13:31 (2011) - [j12]Eray Özkural, Bora Uçar, Cevdet Aykanat:
Parallel Frequent Item Set Mining with Selective Item Replication. IEEE Trans. Parallel Distributed Syst. 22(10): 1632-1640 (2011) - 2010
- [j11]Bora Uçar, Ümit V. Çatalyürek, Cevdet Aykanat:
A Matrix Partitioning Interface to PaToH in MATLAB. Parallel Comput. 36(5-6): 254-272 (2010) - [j10]Iain S. Duff, Bora Uçar:
On the Block Triangular Form of Symmetric Matrices. SIAM Rev. 52(3): 455-470 (2010) - [j9]Ümit V. Çatalyürek, Cevdet Aykanat, Bora Uçar:
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe. SIAM J. Sci. Comput. 32(2): 656-683 (2010) - 2009
- [j8]Kamer Kaya, Bora Uçar:
Exact Algorithms for a Task Assignment Problem. Parallel Process. Lett. 19(3): 451-465 (2009) - 2008
- [j7]Cevdet Aykanat, Berkant Barla Cambazoglu, Bora Uçar:
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices. J. Parallel Distributed Comput. 68(5): 609-625 (2008) - 2007
- [j6]Bora Uçar, Cevdet Aykanat, Mustafa Ç. Pinar, Tahir Malas:
Parallel image restoration using surrogate constraint methods. J. Parallel Distributed Comput. 67(2): 186-204 (2007) - [j5]Kamer Kaya, Bora Uçar, Cevdet Aykanat:
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories. J. Parallel Distributed Comput. 67(3): 271-285 (2007) - [j4]Bora Uçar, Cevdet Aykanat:
Revisiting Hypergraph Models for Sparse Matrix Partitioning. SIAM Rev. 49(4): 595-603 (2007) - [j3]Bora Uçar, Cevdet Aykanat:
Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods. SIAM J. Sci. Comput. 29(4): 1683-1709 (2007) - 2006
- [j2]Bora Uçar, Cevdet Aykanat, Kamer Kaya, Murat Ikinci:
Task assignment in heterogeneous computing systems. J. Parallel Distributed Comput. 66(1): 32-46 (2006) - 2004
- [j1]Bora Uçar, Cevdet Aykanat:
Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies. SIAM J. Sci. Comput. 25(6): 1837-1859 (2004)
Conference and Workshop Papers
- 2024
- [c48]Henrik Reinstädtler, Christian Schulz, Bora Uçar:
Engineering Edge Orientation Algorithms. ESA 2024: 97:1-97:18 - [c47]Damien Lesens, Jérémy E. Cohen, Bora Uçar:
Orthogonal Matching Pursuit-Based Algorithms for the Birkhoff-Von Neumann Decomposition. EUSIPCO 2024: 2457-2461 - 2023
- [c46]Ioannis Panagiotas, Grégoire Pichon, Somesh Singh, Bora Uçar:
Engineering Fast Algorithms for the Bottleneck Matching Problem. ESA 2023: 87:1-87:15 - 2022
- [c45]Somesh Singh, Bora Uçar:
An Efficient Parallel Implementation of a Perfect Hashing Method for Hypergraphs. IPDPS Workshops 2022: 265-274 - 2021
- [c44]Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar:
Fully-dynamic Weighted Matching Approximation in Practice. ACDA 2021: 32-44 - [c43]Johannes Langguth, Ioannis Panagiotas, Bora Uçar:
Shared-memory implementation of the Karp-Sipser kernelization process. HiPC 2021: 71-80 - 2020
- [c42]Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar:
Karp-Sipser based kernels for bipartite graph matching. ALENEX 2020: 134-145 - [c41]Ioannis Panagiotas, Bora Uçar:
Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching. ESA 2020: 76:1-76:23 - [c40]Filip Pawlowski, Rob H. Bisseling, Bora Uçar, A. N. Yzelman:
Combinatorial Tiling for Sparse Neural Networks. HPEC 2020: 1-7 - [c39]Raluca Portase, Bora Uçar:
Matrix symmetrization and sparse direct solvers. CSC 2020: 128-137 - 2019
- [c38]Jiajia Li, Bora Uçar, Ümit V. Çatalyürek, Jimeng Sun, Kevin J. Barker, Richard W. Vuduc:
Efficient and effective sparse tensor reordering. ICS 2019: 227-237 - [c37]M. Yusuf Özkaya, Anne Benoit, Bora Uçar, Julien Herrmann, Ümit V. Çatalyürek:
A Scalable Clustering-Based Task Scheduler for Homogeneous Processors Using DAG Partitioning. IPDPS 2019: 155-165 - [c36]Filip Pawlowski, Bora Uçar, Albert-Jan Yzelman:
High Performance Tensor-Vector Multiplication on Shared-Memory Systems. PPAM (1) 2019: 38-48 - [c35]Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar:
Effective Heuristics for Matchings in Hypergraphs. SEA² 2019: 248-264 - 2018
- [c34]Abdurrahman Yasar, Bora Uçar, Ümit V. Çatalyürek:
SiNA: A Scalable Iterative Network Aligner. ASONAM 2018: 111-118 - [c33]Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar:
Approximation algorithms for maximum matchings in undirected graphs. CSC 2018: 56-65 - 2017
- [c32]Julien Herrmann, Jonathan Kho, Bora Uçar, Kamer Kaya, Ümit V. Çatalyürek:
Acyclic Partitioning of Large Directed Acyclic Graphs. CCGrid 2017: 371-380 - 2016
- [c31]Oguz Kaya, Bora Uçar:
High Performance Parallel Algorithms for the Tucker Decomposition of Sparse Tensors. ICPP 2016: 103-112 - [c30]Didier El Baz, Bora Uçar:
PCO Introduction and Committees. IPDPS Workshops 2016: 721 - 2015
- [c29]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
Fast and High Quality Topology-Aware Task Mapping. IPDPS 2015: 197-206 - [c28]Max Rietmann, Daniel Peter, Olaf Schenk, Bora Uçar, Marcus J. Grote:
Load-Balanced Local Time Stepping for Large-Scale Wave Propagation. IPDPS 2015: 925-935 - [c27]Massimiliano Fasi, Yves Robert, Bora Uçar:
Combining Backward and Forward Recovery to Cope with Silent Errors in Iterative Solvers. IPDPS Workshops 2015: 980-989 - [c26]Didier El Baz, Bora Uçar:
PCO Introduction and Committees. IPDPS Workshops 2015: 1106-1107 - [c25]Enver Kayaaslan, Bora Uçar, Cevdet Aykanat:
Semi-two-dimensional Partitioning for Parallel Sparse Matrix-Vector Multiplication. IPDPS Workshops 2015: 1125-1134 - [c24]Oguz Kaya, Bora Uçar:
Scalable sparse tensor decompositions in distributed memory systems. SC 2015: 77:1-77:11 - 2014
- [c23]Enver Kayaaslan, Bora Uçar:
Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matrices. HiPC 2014: 1-10 - [c22]Fanny Dufossé, Kamer Kaya, Bora Uçar:
Bipartite Matching Heuristics with Quality Guarantees on Shared Memory Parallel Computers. IPDPS 2014: 540-549 - [c21]Anaël Grandjean, Bora Uçar:
On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers. PDP 2014: 9-16 - 2013
- [c20]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs. Euro-Par 2013: 850-861 - [c19]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs. ICPP 2013: 21-29 - [c18]Ichitaro Yamazaki, Xiaoye S. Li, François-Henry Rouet, Bora Uçar:
On Partitioning and Reordering Problems in a Hierarchically Parallel Hybrid Linear Solver. IPDPS Workshops 2013: 1391-1400 - [c17]Anne Benoit, Johannes Langguth, Bora Uçar:
Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints. IPDPS Workshops 2013: 1744-1753 - [c16]Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
Analysis of Partitioning Models and Metrics in Parallel Sparse Matrix-Vector Multiplication. PPAM (2) 2013: 174-184 - 2012
- [c15]Anaël Grandjean, Johannes Langguth, Bora Uçar:
On Optimal and Balanced Sparse Matrix Partitioning Problems. CLUSTER 2012: 257-265 - [c14]Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya, Bora Uçar:
UMPa: A multi-objective, multi-level partitioner for communication minimization. Graph Partitioning and Graph Clustering 2012: 53-66 - [c13]Ümit V. Çatalyürek, Kamer Kaya, Johannes Langguth, Bora Uçar:
A partitioning-based divisive clustering technique for maximizing the modularity. Graph Partitioning and Graph Clustering 2012: 171-186 - [c12]Iain S. Duff, Efstratios Gallopoulos, Daniela di Serafino, Bora Uçar:
Topic 10: Parallel Numerical Algorithms. Euro-Par 2012: 550 - [c11]Ümit V. Çatalyürek, Kamer Kaya, Bora Uçar:
On Shared-Memory Parallelization of a Sparse Matrix Scaling Algorithm. ICPP 2012: 68-77 - [c10]Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya, Bora Uçar:
Multithreaded Clustering for Multi-level Hypergraph Partitioning. IPDPS 2012: 848-859 - 2011
- [c9]Kamer Kaya, François-Henry Rouet, Bora Uçar:
On Partitioning Problems with Complex Objectives. Euro-Par Workshops (1) 2011: 334-344 - [c8]Thomas Ropars, Amina Guermouche, Bora Uçar, Esteban Meneses, Laxmikant V. Kalé, Franck Cappello:
On the Use of Cluster-Based Partial Message Logging to Improve Fault Tolerance for MPI HPC Applications. Euro-Par (1) 2011: 567-578 - [c7]Ümit V. Çatalyürek, Kamer Kaya, Bora Uçar:
Integrated data placement and task assignment for scientific workflows in clouds. DICT@HPDC 2011: 45-54 - [c6]Mathias Jacquelin, Loris Marchal, Yves Robert, Bora Uçar:
On Optimal Tree Traversals for Sparse Matrix Factorization. IPDPS 2011: 556-567 - 2010
- [c5]Bora Uçar, Ümit V. Çatalyürek:
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning. PDP 2010: 593-600 - 2008
- [c4]Patrick Amestoy, Iain S. Duff, Daniel Ruiz, Bora Uçar:
A Parallel Matrix Scaling Algorithm. VECPAR 2008: 301-313 - 2007
- [c3]Bora Uçar:
Heuristics for a Matrix Symmetrization Problem. PPAM 2007: 718-727 - 2004
- [c2]Bora Uçar, Cevdet Aykanat:
A Message Ordering Problem in Parallel Programs. PVM/MPI 2004: 131-138 - 2003
- [c1]Bora Uçar, Cevdet Aykanat:
Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices. ISCIS 2003: 926-933
Parts in Books or Collections
- 2014
- [p1]Anne Benoit, Loris Marchal, Yves Robert, Bora Uçar, Frédéric Vivien:
Scheduling for Large-Scale Systems. Computing Handbook, 3rd ed. (1) 2014: 59: 1-33
Editorship
- 2022
- [e3]Christian Schulz, Bora Uçar:
20th International Symposium on Experimental Algorithms, SEA 2022, July 25-27, 2022, Heidelberg, Germany. LIPIcs 233, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-251-8 [contents] - 2017
- [e2]Srinivas Alum, Ananth Kalyanaraman, Bora Uçar, Kishore Kothapalli, Mahantesh Halappanavar, Kamesh Madduri, Madhu Govindaraju, Yinglong Xia, Sushil K. Prasad, Martina Barnas, Ashish Sureka, Pankesh Patel, Vikas Saxena, Sanjay Goel:
Tenth International Conference on Contemporary Computing, IC3 2017, Noida, India, August 10-12, 2017. IEEE Computer Society 2017, ISBN 978-1-5386-3077-8 [contents] - 2016
- [e1]Assefaw Hadish Gebremedhin, Erik G. Boman, Bora Uçar:
2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, Albuquerque, New Mexico, USA, October 10-12, 2016. SIAM 2016, ISBN 978-1-61197-469-0 [contents]
Reference Works
- 2011
- [r3]Ümit V. Çatalyürek, Bora Uçar, Cevdet Aykanat:
Hypergraph Partitioning. Encyclopedia of Parallel Computing 2011: 871-881 - [r2]Patrick Amestoy, Alfredo Buttari, Iain S. Duff, Abdou Guermouche, Jean-Yves L'Excellent, Bora Uçar:
Multifrontal Method. Encyclopedia of Parallel Computing 2011: 1209-1216 - [r1]Patrick Amestoy, Alfredo Buttari, Iain S. Duff, Abdou Guermouche, Jean-Yves L'Excellent, Bora Uçar:
Mumps. Encyclopedia of Parallel Computing 2011: 1232-1238
Informal and Other Publications
- 2024
- [i9]Henrik Reinstädtler, Christian Schulz, Bora Uçar:
Engineering Edge Orientation Algorithms. CoRR abs/2404.13997 (2024) - 2023
- [i8]Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i7]George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2021
- [i6]Fatih Tasyaran, Berkay Demireller, Kamer Kaya, Bora Uçar:
Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments. CoRR abs/2103.05394 (2021) - [i5]Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar:
Fully-dynamic Weighted Matching Approximation in Practice. CoRR abs/2104.13098 (2021) - 2019
- [i4]Eric R. Hein, Srinivas Eswar, Abdurrahman Yasar, Jiajia Li, Jeffrey S. Young, Thomas M. Conte, Ümit V. Çatalyürek, Rich Vuduc, E. Jason Riedy, Bora Uçar:
Programming Strategies for Irregular Algorithms on the Emu Chick. CoRR abs/1901.02775 (2019) - 2015
- [i3]Massimiliano Fasi, Julien Langou, Yves Robert, Bora Uçar:
A Backward/Forward Recovery Approach for the Preconditioned Conjugate Gradient Method. CoRR abs/1511.04478 (2015) - 2013
- [i2]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
GPU accelerated maximum cardinality matching algorithms for bipartite graphs. CoRR abs/1303.1379 (2013) - 2009
- [i1]Iain S. Duff, Bora Uçar:
Combinatorial problems in solving linear systems. Combinatorial Scientific Computing 2009
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-11-07 21:32 CET 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:
