default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSreenivas Gollapudi
Person information
- affiliation: University at Buffalo, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c84]Kate Donahue, Sreenivas Gollapudi, Kostas Kollias:
When Are Two Lists Better than One?: Benefits and Harms in Joint Decision-Making. AAAI 2024: 10030-10038- [c83]Alex Zhai, Dee Guo, Sreenivas Gollapudi, Kostas Kollias, Daniel Delling:
Deep Learning-Based Alternative Route Computation. AISTATS 2024: 4078-4086 - [c82]Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop:
First Passage Percolation with Queried Hints. AISTATS 2024: 4231-4239 - [c81]Aditya Bhaskara
, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar:
Data Exchange Markets via Utility Balancing. WWW 2024: 57-65 - [c80]Sara Ahmadian, Sreenivas Gollapudi, Gregory Hutchins, Kostas Kollias, Xizhi Tan:
Extracting Small Subgraphs in Road Networks. WWW 2024: 493-502 - [c79]Sara Ahmadian, Sreenivas Gollapudi, Kostas Kollias, Vivek Kumar, Ameya Velingker, Santhoshini Velusamy:
Efficient Location Sampling Algorithms for Road Networks. WWW (Companion Volume) 2024: 899-902 - [i23]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar:
Data Exchange Markets via Utility Balancing. CoRR abs/2401.13053 (2024) - [i22]Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop:
First Passage Percolation with Queried Hints. CoRR abs/2403.10640 (2024) - [i21]Mehran Kazemi, Nishanth Dikkala, Ankit Anand, Petar Devic, Ishita Dasgupta, Fangyu Liu, Bahare Fatemi, Pranjal Awasthi, Dee Guo, Sreenivas Gollapudi, Ahmed Qureshi:
ReMI: A Dataset for Reasoning with Multiple Images. CoRR abs/2406.09175 (2024) - 2023
- [j12]Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias:
Robust Routing Using Electrical Flows. ACM Trans. Spatial Algorithms Syst. 9(4): 24:1-24:25 (2023) - [c78]Sreenivas Gollapudi, Kostas Kollias, Chinmay Maheshwari, Manxi Wu:
Online Learning for Traffic Navigation in Congested Networks. ALT 2023: 642-662 - [c77]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala:
Online Learning and Bandits with Queried Hints. ITCS 2023: 16:1-16:24 - [c76]Ameya Velingker, Ali Kemal Sinop, Ira Ktena, Petar Velickovic, Sreenivas Gollapudi:
Affinity-Aware Graph Networks. NeurIPS 2023 - [i20]Pranjal Awasthi, Kush Bhatia, Sreenivas Gollapudi, Kostas Kollias:
Congested Bandits: Optimal Routing via Short-term Resets. CoRR abs/2301.09251 (2023) - [i19]Kate Donahue, Kostas Kollias, Sreenivas Gollapudi:
When Are Two Lists Better than One?: Benefits and Harms in Joint Decision-making. CoRR abs/2308.11721 (2023) - 2022
- [c75]Pranjal Awasthi, Abhimanyu Das, Sreenivas Gollapudi:
Beyond GNNs: An Efficient Architecture for Graph Problems. AAAI 2022: 6019-6027 - [c74]Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi:
The pit stop problem: how to plan your next road trip. SIGSPATIAL/GIS 2022: 47:1-47:9 - [c73]Pranjal Awasthi, Kush Bhatia, Sreenivas Gollapudi, Kostas Kollias:
Congested Bandits: Optimal Routing via Short-term Resets. ICML 2022: 1078-1100 - [i18]Ameya Velingker, Ali Kemal Sinop, Ira Ktena, Petar Velickovic, Sreenivas Gollapudi:
Affinity-Aware Graph Networks. CoRR abs/2206.11941 (2022) - [i17]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala:
Online Learning and Bandits with Queried Hints. CoRR abs/2211.02703 (2022) - 2021
- [c72]Kostas Kollias, Arun Chandrashekharapuram, Lisa Fawcett, Sreenivas Gollapudi, Ali Kemal Sinop:
Weighted Stackelberg Algorithms for Road Traffic Optimization. SIGSPATIAL/GIS 2021: 57-68 - [c71]Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias:
Robust Routing Using Electrical Flows. SIGSPATIAL/GIS 2021: 282-292 - [c70]Pranjal Awasthi, Abhimanyu Das, Sreenivas Gollapudi:
A Convergence Analysis of Gradient Descent on Graph Neural Networks. NeurIPS 2021: 20385-20397 - [c69]Sreenivas Gollapudi, Guru Guruganesh, Kostas Kollias, Pasin Manurangsi, Renato Paes Leme, Jon Schneider:
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms. NeurIPS 2021: 22498-22508 - [c68]Sreenivas Gollapudi, Kostas Kollias, Ali Shameli:
Cost Sharing in Two-Sided Markets. SAGT 2021: 251-265 - [c67]Gaurav Aggarwal, Sreenivas Gollapudi, Raghavender, Ali Kemal Sinop:
Sketch-based Algorithms for Approximate Shortest Paths in Road Networks. WWW 2021: 3918-3929 - [i16]Sreenivas Gollapudi, Guru Guruganesh, Kostas Kollias, Pasin Manurangsi, Renato Paes Leme, Jon Schneider:
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms. CoRR abs/2106.04819 (2021) - 2020
- [j11]Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kamesh Munagala, Kangning Wang:
Predict and Match: Prophet Inequalities with Uncertain Supply. Proc. ACM Meas. Anal. Comput. Syst. 4(1): 04:1-04:23 (2020) - [c66]Aditya Bhaskara, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
Adaptive Probing Policies for Shortest Path Routing. NeurIPS 2020 - [c65]Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kamesh Munagala, Kangning Wang:
Predict and Match: Prophet Inequalities with Uncertain Supply. SIGMETRICS (Abstracts) 2020: 13-14 - [c64]Abhimanyu Das, Sreenivas Gollapudi, Ravi Kumar, Rina Panigrahy:
On the Learnability of Random Deep Networks. SODA 2020: 398-410 - [c63]Sreenivas Gollapudi, Kostas Kollias, Benjamin Plaut:
Almost Envy-Free Repeated Matching in Two-Sided Markets. WINE 2020: 3-16 - [i15]Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kamesh Munagala, Kangning Wang:
Predict and Match: Prophet Inequalities with Uncertain Supply. CoRR abs/2001.06779 (2020) - [i14]Sreenivas Gollapudi, Kostas Kollias, Benjamin Plaut:
Almost Envy-free Repeated Matching in Two-sided Markets. CoRR abs/2009.09336 (2020)
2010 – 2019
- 2019
- [j10]Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
The Segmentation-Thickness Tradeoff in Online Marketplaces. Proc. ACM Meas. Anal. Comput. Syst. 3(1): 18:1-18:26 (2019) - [j9]Sreenivas Gollapudi:
Introduction to the Special Issue on Urban Mobility: Algorithms and Systems. ACM Trans. Spatial Algorithms Syst. 5(2): 7:1 (2019) - [c62]Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi:
You Get What You Share: Incentives for a Sharing Economy. AAAI 2019: 2004-2011 - [c61]Sreenivas Gollapudi, Debmalya Panigrahi:
Online Algorithms for Rent-Or-Buy with Expert Advice. ICML 2019: 2319-2327 - [c60]Manish Purohit, Sreenivas Gollapudi, Manish Raghavan:
Hiring Under Uncertainty. ICML 2019: 5181-5189 - [c59]Sreenivas Gollapudi:
Welfare Maximization in Online Two-sided Marketplaces. KDD 2019: 3184 - [c58]Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
The Segmentation-Thickness Tradeoff in Online Marketplaces. SIGMETRICS (Abstracts) 2019: 31-32 - [i13]Abhimanyu Das, Sreenivas Gollapudi, Ravi Kumar, Rina Panigrahy:
On the Learnability of Deep Random Networks. CoRR abs/1904.03866 (2019) - [i12]Manish Raghavan, Manish Purohit, Sreenivas Gollapudi:
Hiring Under Uncertainty. CoRR abs/1905.02709 (2019) - 2018
- [c57]Zachary Friggstad, Sreenivas Gollapudi, Kostas Kollias, Tamás Sarlós, Chaitanya Swamy, Andrew Tomkins:
Orienteering Algorithms for Generating Travel Itineraries. WSDM 2018: 180-188 - [c56]Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy:
Minimizing Latency in Online Ride and Delivery Services. WWW 2018: 379-388 - [i11]Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy:
Minimizing Latency in Online Ride and Delivery Services. CoRR abs/1802.02744 (2018) - [i10]Sreenivas Gollapudi, Kostas Kollias, Ali Shameli:
Cost Sharing in Two-Sided Markets. CoRR abs/1809.02718 (2018) - 2017
- [j8]Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
Segmenting two-sided markets. SIGecom Exch. 16(1): 48-52 (2017) - [c55]Sreenivas Gollapudi, Ravi Kumar, Debmalya Panigrahi, Rina Panigrahy:
Partitioning Orders in Online Shopping Services. CIKM 2017: 1319-1328 - [c54]Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika:
Profit Sharing and Efficiency in Utility Games. ESA 2017: 43:1-43:14 - [c53]Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff:
Algorithms for $\ell_p$ Low-Rank Approximation. ICML 2017: 806-814 - [c52]Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
Segmenting Two-Sided Markets. WWW 2017: 63-72 - [i9]Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff:
Algorithms for $\ell_p$ Low Rank Approximation. CoRR abs/1705.06730 (2017) - [i8]Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
Two-sided Facility Location. CoRR abs/1711.11392 (2017) - 2016
- [c51]Abhimanyu Das, Sreenivas Gollapudi, Emre Kiciman, Onur Varol:
Information dissemination in heterogeneous-intent networks. WebSci 2016: 259-268 - 2014
- [c50]Kshipra Bhawalkar, Sreenivas Gollapudi, Debmalya Panigrahi:
Online Set Cover with Set Requests. APPROX-RANDOM 2014: 64-79 - [c49]Rakesh Agrawal, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi:
Similarity Search using Concept Graphs. CIKM 2014: 719-728 - [c48]Sreenivas Gollapudi, Debmalya Panigrahi:
Fair Allocation in Online Markets. CIKM 2014: 1179-1188 - [c47]Abhimanyu Das, Sreenivas Gollapudi, Arindam Khan, Renato Paes Leme:
Role of conformity in opinion dynamics in social networks. COSN 2014: 25-36 - [c46]Rakesh Agrawal, Maria Christoforaki, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi, Adith Swaminathan:
Mining Videos from the Web for Electronic Textbooks. ICFCA 2014: 219-234 - [c45]Abhimanyu Das, Sreenivas Gollapudi, Kamesh Munagala:
Modeling opinion dynamics in social networks. WSDM 2014: 403-412 - 2013
- [j7]Aleksandrs Slivkins, Filip Radlinski, Sreenivas Gollapudi:
Ranked bandits in metric spaces: learning diverse rankings over large document collections. J. Mach. Learn. Res. 14(1): 399-436 (2013) - [c44]Rakesh Agrawal, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi:
Studying from electronic textbooks. CIKM 2013: 1715-1720 - [c43]Abhimanyu Das, Sreenivas Gollapudi, Rina Panigrahy, Mahyar Salek:
Debiasing social wisdom. KDD 2013: 500-508 - [c42]Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala:
Optimal auctions via the multiplicative weight method. EC 2013: 73-90 - [c41]Kshipra Bhawalkar, Sreenivas Gollapudi, Kamesh Munagala:
Coevolutionary opinion formation games. STOC 2013: 41-50 - [c40]Debmalya Panigrahi, Sreenivas Gollapudi:
Document selection for tiered indexing in commerce search. WSDM 2013: 73-82 - 2012
- [j6]Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala:
Budget-Constrained Auctions with Heterogeneous Items. Theory Comput. 8(1): 429-460 (2012) - [c39]Sreenivas Gollapudi, Samuel Ieong, Anitha Kannan:
Structured query reformulations in commerce search. CIKM 2012: 1890-1894 - [c38]Rakesh Agrawal, Sunandan Chakraborty, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi:
Quality of textbooks: an empirical study. ACM DEV 2012: 16:1 - [c37]Rakesh Agrawal, Sunandan Chakraborty, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi:
Empowering authors to diagnose comprehension burden in textbooks. KDD 2012: 967-975 - [c36]Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala:
Mechanisms and allocations with positive network externalities. EC 2012: 179-196 - [c35]Rakesh Agrawal, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi:
Electronic Textbooks and Data Mining. WAIM 2012: 20-21 - [c34]Anand Bhalgat, Sreenivas Gollapudi:
Ad Allocation for Browse Sessions. WINE 2012: 475-481 - [c33]Marc Najork, Dennis Fetterly, Alan Halverson, Krishnaram Kenthapadi, Sreenivas Gollapudi:
Of hammers and nails: an empirical comparison of three paradigms for processing large graphs. WSDM 2012: 103-112 - [c32]Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Li Zhang:
Understanding cyclic trends in social choices. WSDM 2012: 593-602 - [i7]Sreenivas Gollapudi, Samuel Ieong, Anitha Kannan:
Structured Query Reformulations in Commerce Search. CoRR abs/1208.2478 (2012) - [i6]Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala:
Optimal Auctions via the Multiplicative Weight Method. CoRR abs/1211.1699 (2012) - 2011
- [j5]Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Estimating PageRank on graph streams. J. ACM 58(3): 13:1-13:19 (2011) - [j4]Rakesh Agrawal, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi:
Data mining for improving textbooks. SIGKDD Explor. 13(2): 7-19 (2011) - [c31]Rakesh Agrawal, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi:
Enriching textbooks with images. CIKM 2011: 1847-1856 - [c30]Sreenivas Gollapudi, Samuel Ieong, Alexandros Ntoulas, Stelios Paparizos:
Efficient query rewrite for structured web queries. CIKM 2011: 2417-2420 - [c29]Rakesh Agrawal, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi:
Enriching Education through Data Mining. PReMI 2011: 1-2 - [c28]Shuai Ding, Sreenivas Gollapudi, Samuel Ieong, Krishnaram Kenthapadi, Alexandros Ntoulas:
Indexing strategies for graceful degradation of search quality. SIGIR 2011: 575-584 - [c27]Debmalya Panigrahi, Sreenivas Gollapudi:
Result enrichment in commerce search using browse trails. WSDM 2011: 267-276 - [c26]Srikanth Jagabathula, Nina Mishra, Sreenivas Gollapudi:
Shopping for products you don't know you need. WSDM 2011: 705-714 - [c25]Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Munagala:
Consideration set generation in commerce search. WWW 2011: 317-326 - [c24]Rakesh Agrawal, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi:
Identifying enrichment candidates in textbooks. WWW (Companion Volume) 2011: 483-492 - [i5]Sreenivas Gollapudi, Samuel Ieong, Alexandros Ntoulas, Stelios Paparizos:
Efficient Query Rewrite for Structured Web Queries. CoRR abs/1108.2685 (2011) - 2010
- [c23]Rakesh Agrawal, Sreenivas Gollapudi, Krishnaram Kenthapadi, Nitish Srivastava, Raja Velu:
Enriching textbooks through data mining. ACM DEV 2010: 19 - [c22]Aleksandrs Slivkins, Filip Radlinski, Sreenivas Gollapudi:
Learning optimally diverse rankings over large document collections. ICML 2010: 983-990 - [c21]Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala:
Budget constrained auctions with heterogeneous items. STOC 2010: 379-388 - [c20]Anish Das Sarma, Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Ranking mechanisms in twitter-like forums. WSDM 2010: 21-30 - [c19]Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, Rina Panigrahy:
A sketch-based distance oracle for web-scale graphs. WSDM 2010: 401-410 - [i4]Sreenivas Gollapudi, Rina Panigrahy:
Revisiting the Examination Hypothesis with Query Specific Position Bias. CoRR abs/1003.2458 (2010) - [i3]Aleksandrs Slivkins, Filip Radlinski, Sreenivas Gollapudi:
Learning optimally diverse rankings over large document collections. CoRR abs/1005.5197 (2010) - [i2]Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Li Zhang:
Understanding Fashion Cycles as a Social Choice. CoRR abs/1009.2617 (2010)
2000 – 2009
- 2009
- [j3]Sreenivas Gollapudi, Aneesh Sharma:
An Axiomatic Framework for Result Diversification. IEEE Data Eng. Bull. 32(4): 7-14 (2009) - [c18]Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Sparse Cut Projections in Graph Streams. ESA 2009: 480-491 - [c17]Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverson, Samuel Ieong:
Diversifying search results. WSDM 2009: 5-14 - [c16]Marc Najork, Sreenivas Gollapudi, Rina Panigrahy:
Less is more: sampling the neighborhood graph makes SALSA better and faster. WSDM 2009: 242-251 - [c15]Sreenivas Gollapudi, Aneesh Sharma:
An axiomatic approach for result diversification. WWW 2009: 381-390 - [i1]Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala:
Budget Constrained Auctions with Heterogeneous Items. CoRR abs/0907.4166 (2009) - 2008
- [c14]Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong:
Bypass rates: reducing query abandonment using negative inferences. KDD 2008: 177-185 - [c13]Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Estimating PageRank on graph streams. PODS 2008: 69-78 - [c12]Sreenivas Gollapudi, Rina Panigrahy:
The power of two min-hashes for similarity search among hierarchical data objects. PODS 2008: 211-220 - 2007
- [c11]Sreenivas Gollapudi, Marc Najork, Rina Panigrahy:
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms. WAW 2007: 195-201 - [c10]Atish Das Sarma, Deeparnab Chakrabarty, Sreenivas Gollapudi:
Public Advertisement Broker Markets. WINE 2007: 558-563 - 2006
- [c9]Sreenivas Gollapudi, Rina Panigrahy:
Exploiting asymmetry in hierarchical topic extraction. CIKM 2006: 475-482 - [c8]Sreenivas Gollapudi, Rina Panigrahy:
A dictionary for approximate string search and longest prefix search. CIKM 2006: 768-775 - [c7]Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar:
Programmable clustering. PODS 2006: 348-354 - 2005
- [c6]Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang:
Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. INFOCOM 2005: 2147-2158 - 2004
- [c5]Sreenivas Gollapudi, D. Sivakumar:
Framework and algorithms for trend analysis in massive temporal data sets. CIKM 2004: 168-177 - [c4]Sreenivas Gollapudi, D. Sivakumar:
Data stream algorithms for scalable bandwidth management. ICC 2004: 1851-1856 - [c3]Sreenivas Gollapudi, D. Sivakumar:
A mechanism for equitable bandwidth allocation under QoS and budget constraints. IWQoS 2004: 138-147 - 2000
- [j2]Aidong Zhang, Sreenivas Gollapudi:
QoS Management in Educational Digital Library Environments. Multim. Tools Appl. 10(2/3): 133-156 (2000)
1990 – 1999
- 1998
- [j1]Sreenivas Gollapudi, Aidong Zhang:
Buffer Model and Management in Distributed Multimedia Presentation Systems. Multim. Syst. 6(3): 206-218 (1998) - 1996
- [c2]Sreenivas Gollapudi, Aidong Zhang:
Buffer Management in Multimedia Database Systems. ICMCS 1996: 186- - [c1]Sreenivas Gollapudi, Aidong Zhang:
NetMedia: A Client-Server Distributed Multimedia Environment. IW-MMDBMS 1996: 160-167
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-16 21:23 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:
