default search action
Devdatt P. Dubhashi
Person information
- affiliation: Chalmers University of Technology, Department of Computer Science and Engineering
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c40]Emil Carlsson, Debabrota Basu, Fredrik D. Johansson, Devdatt P. Dubhashi:
Pure Exploration in Bandits with Linear Constraints. AISTATS 2024: 334-342 - [i21]Herman Bergström, Emil Carlsson, Devdatt P. Dubhashi, Fredrik D. Johansson:
Active Preference Learning for Ordering Items In- and Out-of-sample. CoRR abs/2405.03059 (2024) - [i20]Marc Wanner, Laura Lewis, Chiranjib Bhattacharyya, Devdatt P. Dubhashi, Alexandru Gheorghiu:
Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms. CoRR abs/2405.18489 (2024) - [i19]Jonathan D. Thomas, Andrea Silvi, Devdatt P. Dubhashi, Emil Carlsson, Moa Johansson:
Learning Efficient Recursive Numeral Systems via Reinforcement Learning. CoRR abs/2409.07170 (2024) - [i18]Jonathan D. Thomas, Andrea Silvi, Devdatt P. Dubhashi, Vikas Garg, Moa Johansson:
ACE: Abstractions for Communicating Efficiently. CoRR abs/2409.20120 (2024) - 2023
- [j23]Arman Rahbar, Emilio Jorge, Devdatt P. Dubhashi, Morteza Haghir Chehreghani:
Do Kernel and Neural Embeddings Help in Training and Generalization? Neural Process. Lett. 55(2): 1681-1695 (2023) - [c39]David Bosch, Ashkan Panahi, Ayça Özçelikkale, Devdatt P. Dubhashi:
Random Features Model with General Convex Regularization: A Fine Grained Analysis with Precise Asymptotic Learning Curves. AISTATS 2023: 11371-11414 - [c38]Emil Carlsson, Devdatt P. Dubhashi, Terry Regier:
Iterated learning and communication jointly explain efficient color naming systems. CogSci 2023 - [c37]Arman Rahbar, Ashkan Panahi, Morteza Haghir Chehreghani, Devdatt P. Dubhashi, Hamid Krim:
Recovery Bounds on Class-Based Optimal Transport: A Sum-of-Norms Regularization Framework. ICML 2023: 28549-28577 - [i17]Emil Carlsson, Devdatt P. Dubhashi, Terry Regier:
Iterated learning and communication jointly explain efficient color naming systems. CoRR abs/2305.10154 (2023) - [i16]Emil Carlsson, Devdatt P. Dubhashi:
Pragmatic Reasoning in Structured Signaling Games. CoRR abs/2305.10167 (2023) - [i15]Emil Carlsson, Debabrota Basu, Fredrik D. Johansson, Devdatt P. Dubhashi:
Pure Exploration in Bandits with Linear Constraints. CoRR abs/2306.12774 (2023) - 2022
- [j22]Devdatt P. Dubhashi:
Can universities combat the 'wrong kind of AI'? Commun. ACM 65(12): 24-26 (2022) - [c36]Ashkan Panahi, Arman Rahbar, Chiranjib Bhattacharyya, Devdatt P. Dubhashi, Morteza Haghir Chehreghani:
Analysis of Knowledge Transfer in Kernel Regime. CIKM 2022: 1615-1624 - [c35]Emil Carlsson, Devdatt P. Dubhashi:
Pragmatic Reasoning in Structured Signaling Games. CogSci 2022 - [i14]Adel Daoud, Felipe Jordan, Makkunda Sharma, Fredrik D. Johansson, Devdatt P. Dubhashi, Sourabh Bikash Paul, Subhashis Banerjee:
Using satellites and artificial intelligence to measure health and material-living standards in India. CoRR abs/2202.00109 (2022) - [i13]David Bosch, Ashkan Panahi, Ayça Özçelikkale, Devdatt P. Dubhashi:
Double Descent in Random Feature Models: Precise Asymptotic Analysis for General Convex Regularization. CoRR abs/2204.02678 (2022) - 2021
- [j21]Devdatt P. Dubhashi:
AI futures: fact and fantasy. Commun. ACM 64(10): 30-31 (2021) - [c34]Emil Carlsson, Devdatt P. Dubhashi, Fredrik D. Johansson:
Learning Approximate and Exact Numeral Systems via Reinforcement Learning. CogSci 2021 - [c33]Emil Carlsson, Devdatt P. Dubhashi, Fredrik D. Johansson:
Thompson Sampling for Bandits with Clustered Arms. IJCAI 2021: 2212-2218 - [i12]Emil Carlsson, Devdatt P. Dubhashi, Fredrik D. Johansson:
Learning Approximate and Exact Numeral Systems via Reinforcement Learning. CoRR abs/2105.13857 (2021) - [i11]Emil Carlsson, Devdatt P. Dubhashi, Fredrik D. Johansson:
Thompson Sampling for Bandits with Clustered Arms. CoRR abs/2109.01656 (2021) - 2020
- [j20]Ashkan Panahi, Morteza Haghir Chehreghani, Devdatt P. Dubhashi:
Accelerated proximal incremental algorithm schemes for non-strongly convex functions. Theor. Comput. Sci. 812: 203-213 (2020) - [c32]Behzad Salami, Konstantinos Parasyris, Adrián Cristal, Osman S. Unsal, Xavier Martorell, Paul Carpenter, Raúl de la Cruz, Leonardo Bautista-Gomez, Daniel A. Jiménez, Carlos Álvarez, Seyed Saber Nabavi Larimi, Sergi Madonar, Miquel Pericàs, Pedro Trancoso, Mustafa Abduljabbar, Jing Chen, Pirah Noor Soomro, Madhavan Manivannan, Micha vor dem Berge, Stefan Krupop, Frank Klawonn, Al Mekhlafi, Sigrun May, Tobias Becker, Georgi Gaydadjiev, Hans Salomonsson, Devdatt P. Dubhashi, Oron Port, Yoav Etsion, Do Le Quoc, Christof Fetzer, Martin Kaiser, Nils Kucza, Jens Hagemeyer, René Griessl, Lennart Tigges, Kevin Mika, A. Hüffmeier, Marcelo Pasin, Valerio Schiavoni, Isabelly Rocha, Christian Göttel, Pascal Felber:
LEGaTO: Low-Energy, Secure, and Resilient Toolset for Heterogeneous Computing. DATE 2020: 169-174 - [i10]Arman Rahbar, Ashkan Panahi, Chiranjib Bhattacharyya, Devdatt P. Dubhashi, Morteza Haghir Chehreghani:
On the Unreasonable Effectiveness of Knowledge Distillation: Analysis in the Kernel Regime. CoRR abs/2003.13438 (2020) - [i9]Aniruddha Adiga, Devdatt P. Dubhashi, Bryan L. Lewis, Madhav V. Marathe, Srinivasan Venkatramanan, Anil Vullikanti:
Models for COVID-19 Pandemic: A Comparative Analysis. CoRR abs/2009.10014 (2020) - [i8]Adel Daoud, Devdatt P. Dubhashi:
Statistical modeling: the three cultures. CoRR abs/2012.04570 (2020)
2010 – 2019
- 2019
- [c31]Erik Thiel, Morteza Haghir Chehreghani, Devdatt P. Dubhashi:
A Non-Convex Optimization Approach to Correlation Clustering. AAAI 2019: 5159-5166 - [i7]Andreas Ekström, Christian Forssén, Christos Dimitrakakis, Devdatt P. Dubhashi, Håkan T. Johansson, Azam Sheikh Muhammad, Hans Salomonsson, Alexander Schliep:
Bayesian optimization in ab initio nuclear physics. CoRR abs/1902.00941 (2019) - [i6]Ashkan Panahi, Erik Thiel, Morteza Haghir Cheraghani, Devdatt P. Dubhashi:
Stochastic Incremental Algorithms for Optimal Transport with SON Regularizer. CoRR abs/1903.03850 (2019) - [i5]Emilio Jorge, Morteza Haghir Chehreghani, Devdatt P. Dubhashi:
Spectral Analysis of Kernel and Neural Embeddings: Optimization and Generalization. CoRR abs/1905.05095 (2019) - [i4]Behzad Salami, Konstantinos Parasyris, Adrián Cristal, Osman S. Unsal, Xavier Martorell, Paul Carpenter, Raúl de la Cruz, Leonardo Bautista-Gomez, Daniel A. Jiménez, Carlos Álvarez, S. Nabavi, Sergi Madonar, Miquel Pericàs, Pedro Trancoso, Mustafa Abduljabbar, Jing Chen, Pirah Noor Soomro, Madhavan Manivannan, Micha vor dem Berge, Stefan Krupop, Frank Klawonn, Al Mekhlafi, Sigrun May, Tobias Becker, Georgi Gaydadjiev, Daniel Ödman, Hans Salomonsson, Devdatt P. Dubhashi, Oron Port, Yoav Etsion, Do Le Quoc, Christof Fetzer, Martin Kaiser, Nils Kucza, Jens Hagemeyer, René Griessl, Lennart Tigges, Kevin Mika, A. Hüffmeier, Th. Jungeblu, Marcelo Pasin, Valerio Schiavoni, Isabelly Rocha, Christian Göttel, Pascal Felber:
LEGaTO: Low-Energy, Secure, and Resilient Toolset for Heterogeneous Computing. CoRR abs/1912.01563 (2019) - 2018
- [c30]Adrián Cristal, Osman S. Unsal, Xavier Martorell, Paul Carpenter, Raúl de la Cruz, Leonardo Bautista-Gomez, Daniel Jiménez-González, Carlos Álvarez, Behzad Salami, Sergi Madonar, Miquel Pericàs, Pedro Trancoso, Micha vor dem Berge, Gunnar Billung-Meyer, Stefan Krupop, Wolfgang Christmann, Frank Klawonn, Amani Mihklafi, Tobias Becker, Georgi Gaydadjiev, Hans Salomonsson, Devdatt P. Dubhashi, Oron Port, Yoav Etsion, Vesna Nowack, Christof Fetzer, Jens Hagemeyer, Thorsten Jungeblut, Nils Kucza, Martin Kaiser, Mario Porrmann, Marcelo Pasin, Valerio Schiavoni, Isabelly Rocha, Christian Göttel, Pascal Felber:
LEGaTO: towards energy-efficient, secure, fault-tolerant toolset for heterogeneous computing. CF 2018: 276-278 - [c29]Mikael Kågebäck, Devdatt P. Dubhashi, Asad B. Sayeed:
DeepColor: Reinforcement Learning optimizes information efficiency and well-formedness in color name partitioning. CogSci 2018 - [c28]Adrián Cristal, Osman S. Unsal, Xavier Martorell, Paul Carpenter, Raúl de la Cruz, Leonardo Bautista-Gomez, Daniel Jiménez-González, Carlos Álvarez, Behzad Salami, Sergi Madonar, Miquel Pericàs, Pedro Trancoso, Micha vor dem Berge, Gunnar Billung-Meyer, Stefan Krupop, Wolfgang Christmann, Frank Klawonn, Amani Mihklafi, Tobias Becker, Georgi Gaydadjiev, Hans Salomonsson, Devdatt P. Dubhashi, Oron Port, Elad Hadar, Yoav Etsion, Christof Fetzer, Jens Hagemeyer, Thorsten Jungeblut, Nils Kucza, Martin Kaiser, Mario Porrmann, Marcelo Pasin, Valerio Schiavoni, Isabelly Rocha, Christian Göttel, Pascal Felber:
LEGaTO: first steps towards energy-efficient toolset for heterogeneous computing. SAMOS 2018: 210-217 - [p1]Devdatt P. Dubhashi, Fabrizio Grandoni, Alessandro Panconesi:
Distributed Approximation Algorithms via LP-Duality and Randomization. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 203-224 - 2017
- [j19]Devdatt P. Dubhashi, Shalom Lappin:
AI dangers: imagined and real. Commun. ACM 60(2): 43-45 (2017) - [c27]Aristide C. Y. Tossou, Christos Dimitrakakis, Devdatt P. Dubhashi:
Thompson Sampling for Stochastic Bandits with Graph Feedback. AAAI 2017: 2660-2666 - [c26]Ashkan Panahi, Devdatt P. Dubhashi, Fredrik D. Johansson, Chiranjib Bhattacharyya:
Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery. ICML 2017: 2769-2777 - [i3]Aristide C. Y. Tossou, Christos Dimitrakakis, Devdatt P. Dubhashi:
Thompson Sampling For Stochastic Bandits with Graph Feedback. CoRR abs/1701.04238 (2017) - [i2]Vinay Jethava, Devdatt P. Dubhashi:
GANs for LIFE: Generative Adversarial Networks for Likelihood Free Inference. CoRR abs/1711.11139 (2017) - 2016
- [r3]Devdatt P. Dubhashi:
Distributed Vertex Coloring. Encyclopedia of Algorithms 2016: 586-589 - 2015
- [j18]Nina Tahmasebi, Lars Borin, Gabriele Capannini, Devdatt P. Dubhashi, Peter Exner, Markus Forsberg, Gerhard Gossen, Fredrik D. Johansson, Richard Johansson, Mikael Kågebäck, Olof Mogren, Pierre Nugues, Thomas Risse:
Visions and open challenges for a knowledge-based culturomics. Int. J. Digit. Libr. 15(2-4): 169-187 (2015) - [c25]Fredrik D. Johansson, Devdatt P. Dubhashi:
Learning with Similarity Functions on Graphs using Matchings of Geometric Embeddings. KDD 2015: 467-476 - [c24]Fredrik D. Johansson, Otto Frost, Carl Retzner, Devdatt P. Dubhashi:
Classifying Large Graphs with Differential Privacy. MDAI 2015: 3-17 - [c23]Mikael Kågebäck, Fredrik D. Johansson, Richard Johansson, Devdatt P. Dubhashi:
Neural context embeddings for automatic discovery of word senses. VS@HLT-NAACL 2015: 25-32 - [c22]Fredrik D. Johansson, Ankani Chattoraj, Chiranjib Bhattacharyya, Devdatt P. Dubhashi:
Weighted Theta Functions and Embeddings with Applications to Max-Cut, Clustering and Summarization. NIPS 2015: 1018-1026 - [c21]Olof Mogren, Mikael Kågebäck, Devdatt P. Dubhashi:
Extractive Summarization by Aggregating Multiple Similarities. RANLP 2015: 451-457 - 2014
- [c20]Mikael Kågebäck, Olof Mogren, Nina Tahmasebi, Devdatt P. Dubhashi:
Extractive Summarization using Continuous Vector Space Models. CVSC@EACL 2014: 31-39 - [c19]Cezary Mazurek, Juliusz Pukacki, Michal Kosiedowski, Szymon Trocha, Michael Sullivan, Hemant Darbari, Amit Saxena, Rajendra Joshi, Devdatt P. Dubhashi, Subazini Thankaswamy, Paul R. Brenner, Sandra Gesing, Jarek Nabrzyski, Anil Srivastava:
Federated clouds for biomedical research: Integrating OpenStack for ICTBioMed. CloudNet 2014: 294-299 - [c18]Fredrik D. Johansson, Vinay Jethava, Devdatt P. Dubhashi, Chiranjib Bhattacharyya:
Global graph kernels using geometric embeddings. ICML 2014: 694-702 - 2013
- [j17]Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi:
Lovász ϑ function, SVMs and finding dense subgraphs. J. Mach. Learn. Res. 14(1): 3495-3536 (2013) - [c17]Lars Borin, Devdatt P. Dubhashi, Markus Forsberg, Richard Johansson, Dimitrios Kokkinakis, Pierre Nugues:
Mining semantics for culturomics: towards a knowledge-based approach. UnstructureNLP@CIKM 2013: 3-10 - [c16]Linus Hermansson, Tommi Kerola, Fredrik Johansson, Vinay Jethava, Devdatt P. Dubhashi:
Entity disambiguation in anonymized graphs using graph kernels. CIKM 2013: 1037-1046 - [c15]Fredrik Johansson, Vinay Jethava, Devdatt P. Dubhashi:
DLOREAN: Dynamic Location-Aware Reconstruction of Multiway Networks. ICDM Workshops 2013: 1012-1019 - [c14]Vinay Jethava, Jacob Sznajdman, Chiranjib Bhattacharyya, Devdatt P. Dubhashi:
Lovasz ϑ, SVMs and applications. ITW 2013: 1-5 - 2012
- [c13]Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi:
"The Lovasz $\theta$ function, SVMs and finding large dense subgraphs". NIPS 2012: 1169-1177 - 2011
- [j16]Vinay Jethava, Chiranjib Bhattacharyya, Devdatt P. Dubhashi, Goutham N. Vemuri:
NETGEM: Network Embedded Temporal GEnerative Model for gene expression data. BMC Bioinform. 12: 327 (2011) - [c12]Vinay Jethava, Liliana Calderón-Benavides, Ricardo Baeza-Yates, Chiranjib Bhattacharyya, Devdatt P. Dubhashi:
Scalable multi-dimensional user intent identification using tree structured distributions. SIGIR 2011: 395-404 - [e1]Srinivas Aluru, Sanghamitra Bandyopadhyay, Ümit V. Çatalyürek, Devdatt P. Dubhashi, Phillip H. Jones, Manish Parashar, Bertil Schmidt:
Contemporary Computing - 4th International Conference, IC3 2011, Noida, India, August 8-10, 2011. Proceedings. Communications in Computer and Information Science 168, Springer 2011, ISBN 978-3-642-22605-2 [contents]
2000 – 2009
- 2009
- [b2]Devdatt P. Dubhashi, Alessandro Panconesi:
Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press 2009, ISBN 978-0-521-88427-3, pp. I-XIV, 1-196 - 2008
- [r2]Devdatt P. Dubhashi:
Distributed Vertex Coloring. Encyclopedia of Algorithms 2008 - [i1]Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Devdatt P. Dubhashi:
Adaptive Dynamics of Realistic Small-World Networks. CoRR abs/0804.1115 (2008) - 2007
- [j15]Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti:
Localized Techniques for Broadcasting in Wireless Sensor Networks. Algorithmica 49(4): 412-446 (2007) - [j14]Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan:
Positive Influence and Negative Dependence. Comb. Probab. Comput. 16(1): 29-41 (2007) - [j13]Andreas Baltz, Devdatt P. Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth:
Probabilistic analysis for a multiple depot vehicle routing problem. Random Struct. Algorithms 30(1-2): 206-225 (2007) - [j12]Devdatt P. Dubhashi, Olle Häggström, Gabriele Mambrini, Alessandro Panconesi, Chiara Petrioli:
Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks. Wirel. Networks 13(1): 107-125 (2007) - [r1]Alessandro Panconesi, Fabrizio Grandoni, Devdatt P. Dubhashi:
Distributed Approximation Algorithms via LP-Duality and Randomization. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j11]Daniel Dalevi, Devdatt P. Dubhashi, Malte Hermansson:
Bayesian classifiers for detecting HGT using fixed and variable order markov models of genomic signatures. Bioinform. 22(5): 517-522 (2006) - [c11]Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi:
Randomization in Constraint Programming for Airline Planning. CP 2006: 406-420 - 2005
- [j10]Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. 71(4): 467-479 (2005) - [c10]Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth:
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. FSTTCS 2005: 360-371 - [c9]Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio:
Irrigating ad hoc networks in constant time. SPAA 2005: 106-115 - [c8]Daniel Dalevi, Devdatt P. Dubhashi:
The Peres-Shields Order Estimator for Fixed and Variable Length Markov Models with Applications to DNA Sequence Similarity. WABI 2005: 291-302 - 2003
- [c7]Devdatt P. Dubhashi, Luigi Laura, Alessandro Panconesi:
Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. FSTTCS 2003: 168-182 - [c6]Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. SODA 2003: 717-724
1990 – 1999
- 1998
- [j9]Devdatt P. Dubhashi, Desh Ranjan:
Balls and bins: A study in negative dependence. Random Struct. Algorithms 13(2): 99-124 (1998) - [j8]Devdatt P. Dubhashi, David A. Grable, Alessandro Panconesi:
Near-Optimal, Distributed Edge Colouring via the Nibble Method. Theor. Comput. Sci. 203(2): 225-251 (1998) - [c5]Devdatt P. Dubhashi:
Martingales and Locality in Distributed Computing. FSTTCS 1998: 174-185 - [c4]Devdatt P. Dubhashi:
Talagrand's Inequality and Locality in Distributed Computing. RANDOM 1998: 60-70 - 1997
- [j7]Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide:
Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett. 62(2): 103-110 (1997) - [j6]Devdatt P. Dubhashi:
Simple proofs of occupancy tail bounds. Random Struct. Algorithms 11(2): 119-123 (1997) - [j5]Shiva Chaudhuri, Devdatt P. Dubhashi:
Probabilistic Recurrence Relations Revisited. Theor. Comput. Sci. 181(1): 45-56 (1997) - 1995
- [j4]Devdatt P. Dubhashi, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
The Fourth Moment in Luby's Distribution. Theor. Comput. Sci. 148(1): 133-140 (1995) - [c3]Devdatt P. Dubhashi, Alessandro Panconesi:
Near-Optimal Distributed Edge Coloring. ESA 1995: 448-459 - [c2]Shiva Chaudhuri, Devdatt P. Dubhashi:
(Probabilistic) Recurrence Realtions Revisited. LATIN 1995: 207-219 - 1994
- [j3]Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn:
A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994) - 1993
- [j2]Devdatt P. Dubhashi:
Quantifier Elimination in p-adic Fields. Comput. J. 36(5): 419-426 (1993) - [c1]Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel:
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. FSTTCS 1993: 436-443 - 1992
- [b1]Devdatt P. Dubhashi:
Algorithmic Investigations In P-adic Fields. Cornell University, USA, 1992 - [j1]Devdatt P. Dubhashi:
On Decidable Varieties of Heyting Algebras. J. Symb. Log. 57(3): 988-991 (1992)
Coauthor Index
aka: Morteza Haghir Cheraghani
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 2025-01-09 13:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint