default search action
Barna Saha
Person information
- affiliation: University of California, San Diego, CA, USA
- affiliation (former): University of California Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c66]Barna Saha, Christopher Ye:
I/O Complexity of Attention, or How Optimal is FlashAttention? ICML 2024 - [c65]Monika Henzinger, Barna Saha, Martin P. Seybold
, Christopher Ye:
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. ITCS 2024: 62:1-62:25 - [c64]Donatella Firmani, Sainyam Galhotra, Barna Saha, Divesh Srivastava:
Building Taxonomies with Triplet Queries. SEBD 2024: 14-24 - [c63]Barna Saha, Christopher Ye:
Faster Approximate All Pairs Shortest Paths. SODA 2024: 4758-4827 - [c62]Debarati Das
Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. SPAA 2024: 293-295 - [i42]Barna Saha, Christopher Ye:
The I/O Complexity of Attention, or How Optimal is Flash Attention? CoRR abs/2402.07443 (2024) - [i41]Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye:
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. CoRR abs/2407.09651 (2024) - [i40]Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha:
Clustering with Non-adaptive Subset Queries. CoRR abs/2409.10908 (2024) - 2023
- [j18]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
Community Recovery in the Geometric Block Model. J. Mach. Learn. Res. 24: 338:1-338:53 (2023) - [c61]Tomasz Kociumaka, Anish Mukherjee
Approximating Edit Distance in the Fully Dynamic Model. FOCS 2023: 1628-1638 - [c60]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
An Algorithmic Bridge Between Hamming and Levenshtein Distances. ITCS 2023: 58:1-58:23 - [c59]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC 2023: 377-390 - [e1]Barna Saha, Rocco A. Servedio:
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023. ACM 2023, ISBN 978-1-4503-9913-5 [contents] - [i39]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees and Dyck. CoRR abs/2302.04229 (2023) - [i38]Tomasz Kociumaka, Anish Mukherjee, Barna Saha:
Approximating Edit Distance in the Fully Dynamic Model. CoRR abs/2307.07175 (2023) - [i37]Monika Henzinger, Andrea Lincoln
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. CoRR abs/2307.16771 (2023) - [i36]Barna Saha, Christopher Ye:
Faster Approximate All Pairs Shortest Paths. CoRR abs/2309.13225 (2023) - 2022
- [c58]Debarati Das, Barna Saha:
Approximating LCS and Alignment Distance over Multiple Sequences. APPROX/RANDOM 2022: 54:1-54:21 - [c57]Elazar Goldenberg, Tomasz Kociumaka
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. FOCS 2022: 674-685 - [c56]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. FOCS 2022: 686-697 - [c55]Debarati Das, Tomasz Kociumaka, Barna Saha:
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. ICALP 2022: 49:1-49:20 - [c54]Sainyam Galhotra, Donatella Firmani, Barna Saha, Divesh Srivastava:
Hierarchical Entity Resolution using an Oracle. SIGMOD Conference 2022: 414-428 - [c53]Monika Henzinger, Andrea Lincoln
The Complexity of Average-Case Dynamic Subgraph Counting. SODA 2022: 459-498 - [c52]Dominik Kempa, Barna Saha:
An Upper Bound and Linear-Space Queries on the LZ-End Parsing. SODA 2022: 2847-2866 - [c51]Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln
How Compression and Approximation Affect Efficiency in String Distance Measures. SODA 2022: 2867-2919 - [i35]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
Community Recovery in the Geometric Block Model. CoRR abs/2206.11303 (2022) - [i34]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh:
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. CoRR abs/2209.07524 (2022) - [i33]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
An Algorithmic Bridge Between Hamming and Levenshtein Distances. CoRR abs/2211.12496 (2022) - 2021
- [j17]Raghavendra Addanki, Sainyam Galhotra, Barna Saha:
How to Design Robust Algorithms using Noisy Comparison Oracle. Proc. VLDB Endow. 14(10): 1703-1716 (2021) - [j16]Sainyam Galhotra
Efficient and effective ER with progressive blocking. VLDB J. 30(4): 537-557 (2021) - [c50]Barna Saha:
Sublinear Algorithms for Edit Distance (Invited Talk). MFCS 2021: 5:1-5:1 - [c49]Barna Saha:
Approximation Algorithms for Large Scale Data Analysis. PODS 2021: 30-32 - [c48]Sainyam Galhotra, Donatella Firmani, Barna Saha, Divesh Srivastava:
BEER: Blocking for Effective Entity Resolution. SIGMOD Conference 2021: 2711-2715 - [i32]Raghavendra Addanki, Sainyam Galhotra, Barna Saha:
How to Design Robust Algorithms using Noisy Comparison Oracle. CoRR abs/2105.05782 (2021) - [i31]Elazar Goldenberg, Aviad Rubinstein, Barna Saha:
Does Preprocessing help in Fast Sequence Comparisons? CoRR abs/2108.09115 (2021) - [i30]Debarati Das, Barna Saha:
Approximating LCS and Alignment Distance over Multiple Sequences. CoRR abs/2110.12402 (2021) - [i29]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. CoRR abs/2111.12706 (2021) - [i28]Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha:
How Compression and Approximation Affect Efficiency in String Distance Measures. CoRR abs/2112.05836 (2021) - [i27]Debarati Das, Tomasz Kociumaka, Barna Saha:
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. CoRR abs/2112.05866 (2021) - [i26]Monika Henzinger, Andrea Lincoln
The Complexity of Average-Case Dynamic Subgraph Counting. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c47]Tomasz Kociumaka
Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance. FOCS 2020: 1168-1179 - [c46]Elazar Goldenberg, Aviad Rubinstein, Barna Saha:
Does preprocessing help in fast sequence comparisons? STOC 2020: 657-670 - [i25]Saba Ahmadi, Sainyam Galhotra, Barna Saha, Roy Schwartz:
Fair Correlation Clustering. CoRR abs/2002.03508 (2020) - [i24]Sainyam Galhotra, Donatella Firmani, Barna Saha, Divesh Srivastava:
Efficient and Effective ER with Progressive Blocking. CoRR abs/2005.14326 (2020) - [i23]Tomasz Kociumaka, Barna Saha:
Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance. CoRR abs/2007.12762 (2020)
2010 – 2019
- 2019
- [j15]Karl Bringmann, Fabrizio Grandoni
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM J. Comput. 48(2): 481-512 (2019) - [c45]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
Connectivity of Random Annulus Graphs and the Geometric Block Model. APPROX-RANDOM 2019: 53:1-53:23 - [c44]Barna Saha, Sanjay Subramanian:
Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost. ESA 2019: 81:1-81:17 - [c43]Elazar Goldenberg, Robert Krauthgamer
Sublinear Algorithms for Gap Edit Distance. FOCS 2019: 1101-1120 - [c42]Saba Ahmadi, Samir Khuller, Barna Saha:
Min-Max Correlation Clustering via MultiCut. IPCO 2019: 13-26 - [c41]Ari Kobren, Barna Saha, Andrew McCallum:
Paper Matching with Local Fairness Constraints. KDD 2019: 1247-1257 - [c40]Sainyam Galhotra, Donatella Firmani, Barna Saha, Divesh Srivastava:
Crowd-Sourced Entity Resolution with Control Queries. SEBD 2019 - [c39]Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni
Dynamic set cover: improved algorithms and lower bounds. STOC 2019: 114-125 - [i22]Ari Kobren, Barna Saha, Andrew McCallum:
Paper Matching with Local Fairness Constraints. CoRR abs/1905.11924 (2019) - [i21]Saba Ahmadi, Sainyam Galhotra, Samir Khuller, Barna Saha, Roy Schwartz:
Min-Max Correlation Clustering via MultiCut. CoRR abs/1907.00117 (2019) - [i20]Barna Saha, Sanjay Subramanian:
Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost. CoRR abs/1908.04976 (2019) - [i19]Elazar Goldenberg, Robert Krauthgamer, Barna Saha:
Sublinear Algorithms for Gap Edit Distance. CoRR abs/1910.00901 (2019) - 2018
- [j14]Donatella Firmani, Sainyam Galhotra, Barna Saha, Divesh Srivastava:
Robust Entity Resolution Using a CrowdOracle. IEEE Data Eng. Bull. 41(2): 91-103 (2018) - [j13]Barna Saha, Aravind Srinivasan:
A new approximation technique for resource-allocation problems. Random Struct. Algorithms 52(4): 680-715 (2018) - [j12]Arnab Bhattacharyya, Fabrizio Grandoni
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. ACM Trans. Algorithms 14(3): 26:1-26:2 (2018) - [c38]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
The Geometric Block Model. AAAI 2018: 2215-2222 - [c37]Sainyam Galhotra, Soumyabrata Pal, Arya Mazumdar, Barna Saha:
The Geometric Block Model and Applications. Allerton 2018: 1147-1150 - [c36]Sainyam Galhotra, Donatella Firmani
Robust Entity Resolution using Random Graphs. SIGMOD Conference 2018: 3-18 - [i18]Raghavendra Addanki, Barna Saha:
Fully Dynamic Set Cover - Improved and Simple. CoRR abs/1804.03197 (2018) - [i17]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
Connectivity in Random Annulus Graphs and the Geometric Block Model. CoRR abs/1804.05013 (2018) - 2017
- [c35]Arya Mazumdar, Barna Saha:
A Theoretical Analysis of First Heuristics of Crowdsourced Entity Resolution. AAAI 2017: 970-976 - [c34]Barna Saha:
Fast & Space-Efficient Approximations of Language Edit Distance and RNA Folding: An Amnesic Dynamic Programming Approach. FOCS 2017: 295-306 - [c33]Rajesh Jayaram, Barna Saha:
Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!. ICALP 2017: 19:1-19:15 - [c32]Arya Mazumdar, Barna Saha:
Query Complexity of Clustering with Side Information. NIPS 2017: 4682-4693 - [c31]Arya Mazumdar, Barna Saha:
Clustering with Noisy Queries. NIPS 2017: 5788-5799 - [i16]Arya Mazumdar, Barna Saha:
A Theoretical Analysis of First Heuristics of Crowdsourced Entity Resolution. CoRR abs/1702.01208 (2017) - [i15]Arya Mazumdar, Barna Saha:
Clustering with Noisy Queries. CoRR abs/1706.07510 (2017) - [i14]Arya Mazumdar, Barna Saha:
Query Complexity of Clustering with Side Information. CoRR abs/1706.07719 (2017) - [i13]Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams:
Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. CoRR abs/1707.05095 (2017) - [i12]Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha:
The Geometric Block Model. CoRR abs/1709.05510 (2017) - 2016
- [j11]Samir Khuller, Barna Saha, Kanthi K. Sarpatwar:
New Approximation Results for Resource Replication Problems. Algorithmica 74(3): 969-991 (2016) - [j10]Donatella Firmani
Online Entity Resolution Using an Oracle. Proc. VLDB Endow. 9(5): 384-395 (2016) - [j9]Mohammad Taghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. ACM Trans. Algorithms 12(3): 36:1-36:19 (2016) - [c30]Arya Mazumdar, Barna Saha:
Clustering with an oracle. Allerton 2016: 738-739 - [c29]Karl Bringmann, Fabrizio Grandoni
Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. FOCS 2016: 375-384 - [i11]Arya Mazumdar, Barna Saha:
Clustering Via Crowdsourcing. CoRR abs/1604.01839 (2016) - 2015
- [j8]Ravishankar Krishnaswamy, Amit Kumar
Facility Location with Matroid or Knapsack Constraints. Math. Oper. Res. 40(2): 446-459 (2015) - [j7]Shanshan Ying, Flip Korn, Barna Saha, Divesh Srivastava:
TreeScope: Finding Structural Anomalies In Semi-Structured Data. Proc. VLDB Endow. 8(12): 1904-1907 (2015) - [c28]Barna Saha:
Language Edit Distance and Maximum Likelihood Parsing of Stochastic Grammars: Faster Algorithms and Connection to Fundamental Graph Problems. FOCS 2015: 118-135 - [c27]Lukasz Golab, Flip Korn, Feng Li, Barna Saha, Divesh Srivastava:
Size-Constrained Weighted Set Cover. ICDE 2015: 879-890 - 2014
- [j6]Lukasz Golab, Howard J. Karloff, Flip Korn, Barna Saha, Divesh Srivastava:
Discovering Conservation Rules. IEEE Trans. Knowl. Data Eng. 26(6): 1332-1348 (2014) - [c26]Barna Saha:
The Dyck Language Edit Distance Problem in Near-Linear Time. FOCS 2014: 611-620 - [c25]Barna Saha, Divesh Srivastava:
Data quality: The other face of Big Data. ICDE 2014: 1294-1297 - [c24]MohammadTaghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. SODA 2014: 1-12 - [c23]Mohammad Taghi Hajiaghayi, Theodore Johnson, Mohammad Reza Khani, Barna Saha:
Hierarchical graph partitioning. SPAA 2014: 51-60 - [c22]Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha:
Distributed data placement to minimize communication costs via graph partitioning. SSDBM 2014: 20:1-20:12 - [i10]Barna Saha:
Faster Language Edit Distance, Connection to All-pairs Shortest Paths and Related Problems. CoRR abs/1411.7315 (2014) - 2013
- [j5]Flip Korn, Barna Saha, Divesh Srivastava, Shanshan Ying:
On Repairing Structural Problems In Semi-structured Data. Proc. VLDB Endow. 6(9): 601-612 (2013) - [c21]Seungjoon Lee, Manish Purohit, Barna Saha:
Firewall placement in cloud data centers. SoCC 2013: 52:1-52:2 - [c20]Barna Saha:
Renting a Cloud. FSTTCS 2013: 437-448 - [c19]Arya Mazumdar, Yury Polyanskiy, Barna Saha:
On Chebyshev radius of a set in Hamming space and the closest string problem. ISIT 2013: 1401-1405 - [i9]Mohammad Taghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. CoRR abs/1307.2808 (2013) - [i8]Barna Saha:
Efficiently Computing Edit Distance to Dyck Language. CoRR abs/1311.2557 (2013) - [i7]Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha:
Distributed Data Placement via Graph Partitioning. CoRR abs/1312.0285 (2013) - 2012
- [j4]Xin Luna Dong, Barna Saha, Divesh Srivastava:
Less is More: Selecting Sources Wisely for Integration. Proc. VLDB Endow. 6(2): 37-48 (2012) - [c18]Samir Khuller, Barna Saha, Kanthi K. Sarpatwar:
New Approximation Results for Resource Replication Problems. APPROX-RANDOM 2012: 218-230 - [c17]Barna Saha, Samir Khuller:
Set Cover Revisited: Hypergraph Cover with Hard Capacities. ICALP (1) 2012: 762-773 - [c16]Lukasz Golab, Howard J. Karloff, Flip Korn, Barna Saha, Divesh Srivastava:
Discovering Conservation Rules. ICDE 2012: 738-749 - 2011
- [b1]Barna Saha:
Approximation Algorithms for Resource Allocation. University of Maryland, College Park, MD, USA, 2011 - [j3]Bernhard Haeupler
New Constructive Aspects of the Lovász Local Lemma. J. ACM 58(6): 28:1-28:28 (2011) - [j2]Jian Li, Barna Saha, Amol Deshpande:
A unified approach to ranking in probabilistic databases. VLDB J. 20(2): 249-275 (2011) - [c15]Nikhil Bansal, Ravishankar Krishnaswamy, Barna Saha:
On Capacitated Set Cover Problems. APPROX-RANDOM 2011: 38-49 - [c14]Saeed Alaei
AdCell: Ad Allocation in Cellular Networks. ESA 2011: 311-322 - [c13]Andreas Thor
Link Prediction for Annotation Graphs Using Graph Summarization. ISWC (1) 2011: 714-729 - [c12]Ravishankar Krishnaswamy, Amit Kumar
The Matroid Median Problem. SODA 2011: 1117-1130 - [i6]Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha:
AdCell: Ad Allocation in Cellular Networks. CoRR abs/1112.5396 (2011) - 2010
- [c11]Bernhard Haeupler
New Constructive Aspects of the Lovasz Local Lemma. FOCS 2010: 397-406 - [c10]Barna Saha, Ioana Stanoi, Kenneth L. Clarkson:
Schema covering: a step towards enabling reuse in information integration. ICDE 2010: 285-296 - [c9]Barna Saha, Aravind Srinivasan:
A New Approximation Technique for Resource-Allocation Problems. ICS 2010: 342-357 - [c8]Barna Saha, Allison Hoch, Samir Khuller, Louiqa Raschid, Xiao-Ning Zhang
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs. RECOMB 2010: 456-472 - [c7]Samir Khuller, Jian Li, Barna Saha:
Energy Efficient Scheduling via Partial Shutdown. SODA 2010: 1360-1372 - [i5]Samir Khuller, Jian Li, Barna Saha:
Energy Efficient Scheduling via Partial Shutdown. Scheduling 2010 - [i4]Bernhard Haeupler, Barna Saha, Aravind Srinivasan:
New Constructive Aspects of the Lovasz Local Lemma. CoRR abs/1001.1231 (2010) - [i3]Barna Saha, Aravind Srinivasan:
A New Approximation Technique for Resource-Allocation Problems. CoRR abs/1001.1470 (2010)
2000 – 2009
- 2009
- [j1]Jian Li, Barna Saha, Amol Deshpande:
A Unified Approach to Ranking in Probabilistic Databases. Proc. VLDB Endow. 2(1): 502-513 (2009) - [c6]Samir Khuller, Barna Saha:
On Finding Dense Subgraphs. ICALP (1) 2009: 597-608 - [c5]Barna Saha, Lise Getoor:
On Maximum Coverage in the Streaming Model & Application to Multi-topic Blog-Watch. SDM 2009: 697-708 - [i2]Jian Li, Barna Saha, Amol Deshpande:
A Unified Approach to Ranking in Probabilistic Databases. CoRR abs/0904.1366 (2009) - [i1]Samir Khuller, Jian Li, Barna Saha:
Energy Efficient Scheduling via Partial Shutdown. CoRR abs/0912.1329 (2009) - 2008
- [c4]Bogdan Alexe, Michael N. Gubanov, Mauricio A. Hernández, C. T. Howard Ho, Jen-Wei Huang
Simplifying Information Integration: Object-Based Flow-of-Mappings Framework for Integration. BIRTE 2008: 108-121 - 2007
- [c3]Barna Saha, Pabitra Mitra:
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree. SDM 2007: 581-586 - 2006
- [c2]Barna Saha, Pabitra Mitra:
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree. ICDM Workshops 2006: 667-671 - [c1]Sumit Ganguly, Barna Saha:
On Estimating Path Aggregates over Streaming Graphs. ISAAC 2006: 163-172
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-15 21:34 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: