default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrikanta Tirthapura
Person information
- affiliation: Iowa State University, Ames, IA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j39]Yu Zhang
, Kanat Tangwongsan, Srikanta Tirthapura:
Fast Streaming k-Means Clustering With Coreset Caching. IEEE Trans. Knowl. Data Eng. 34(6): 2740-2754 (2022)- 2021
- [j38]Trong Duc Nguyen, Ming-Hung Shih, Divesh Srivastava, Srikanta Tirthapura, Bojian Xu:
Stratified random sampling from streaming and stored data. Distributed Parallel Databases 39(3): 665-710 (2021) - [j37]Seyed-Vahid Sanei-Mehri, Apurba Das, Hooman Hashemi, Srikanta Tirthapura:
Mining Largest Maximal Quasi-Cliques. ACM Trans. Knowl. Discov. Data 15(5): 81:1-81:21 (2021) - [c57]Ashraf Tahmasbi, Ellango Jothimurugesan, Srikanta Tirthapura, Phillip B. Gibbons:
DriftSurf: Stable-State / Reactive-State Learning under Concept Drift. ICML 2021: 10054-10064 - 2020
- [j36]Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura:
Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs. ACM Trans. Parallel Comput. 7(1): 5:1-5:28 (2020) - [c56]Trong Duc Nguyen, Ming-Hung Shih, Sai Sree Parvathaneni, Bojian Xu, Divesh Srivastava, Srikanta Tirthapura:
Random Sampling for Group-By Queries. ICDE 2020: 541-552 - [i21]Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura:
Shared-Memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs. CoRR abs/2001.11433 (2020) - [i20]Ashraf Tahmasbi, Ellango Jothimurugesan, Srikanta Tirthapura, Phillip B. Gibbons:
DriftSurf: A Risk-competitive Learning Algorithm under Concept Drift. CoRR abs/2003.06508 (2020)
2010 – 2019
- 2019
- [j35]Apurba Das, Michael Svendsen, Srikanta Tirthapura:
Incremental maintenance of maximal cliques in a dynamic graph. VLDB J. 28(3): 351-375 (2019) - [c55]Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura:
FLEET: Butterfly Estimation from a Bipartite Graph Stream. CIKM 2019: 1201-1210 - [c54]Trong Duc Nguyen, Ming-Hung Shih, Divesh Srivastava, Srikanta Tirthapura, Bojian Xu:
Stratified Random Sampling over Streaming and Stored Data. EDBT 2019: 25-36 - [c53]Kanat Tangwongsan, Srikanta Tirthapura:
Parallel Streaming Random Sampling. Euro-Par 2019: 451-465 - [c52]Apurba Das, Srikanta Tirthapura:
Shared-Memory Parallel Maximal Biclique Enumeration. HiPC 2019: 34-43 - [c51]Rajesh Jayaram, Gokarna Sharma, Srikanta Tirthapura, David P. Woodruff:
Weighted Reservoir Sampling from Distributed Streams. PODS 2019: 218-235 - [c50]Seshadhri Comandur, Srikanta Tirthapura:
Scalable Subgraph Counting: The Methods Behind The Madness. WWW (Companion Volume) 2019: 1317-1318 - [i19]Srikanta Tirthapura, David P. Woodruff:
Optimal Random Sampling from Distributed Streams Revisited. CoRR abs/1903.12065 (2019) - [i18]Rajesh Jayaram, Gokarna Sharma, Srikanta Tirthapura, David P. Woodruff:
Weighted Reservoir Sampling from Distributed Streams. CoRR abs/1904.04126 (2019) - [i17]Kanat Tangwongsan, Srikanta Tirthapura:
Parallel Streaming Random Sampling. CoRR abs/1906.04120 (2019) - [i16]Trong Duc Nguyen, Ming-Hung Shih, Sai Sree Parvathaneni, Bojian Xu, Divesh Srivastava, Srikanta Tirthapura:
Random Sampling for Group-By Queries. CoRR abs/1909.02629 (2019) - 2018
- [j34]Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Work-efficient parallel union-find. Concurr. Comput. Pract. Exp. 30(4) (2018) - [j33]Anupam Sanghi, Raghav Sood, Dharmendra Singh, Jayant R. Haritsa, Srikanta Tirthapura:
HYDRA: A Dynamic Big Data Regenerator. Proc. VLDB Endow. 11(12): 1974-1977 (2018) - [j32]Apurba Das, Srikanta Tirthapura:
Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph. IEEE Trans. Multi Scale Comput. Syst. 4(3): 231-242 (2018) - [c49]Seyed-Vahid Sanei-Mehri, Apurba Das, Srikanta Tirthapura:
Enumerating Top-k Quasi-Cliques. IEEE BigData 2018: 1107-1112 - [c48]Anupam Sanghi, Raghav Sood, Jayant R. Haritsa, Srikanta Tirthapura:
Scalable and Dynamic Regeneration of Big Data Volumes. EDBT 2018: 301-312 - [c47]Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura:
Shared-Memory Parallel Maximal Clique Enumeration. HiPC 2018: 62-71 - [c46]Yu Zhang, Srikanta Tirthapura, Graham Cormode:
Learning Graphical Models from a Distributed Stream. ICDE 2018: 725-736 - [c45]Pan Xu, Cuong Nguyen, Srikanta Tirthapura:
Onion Curve: A Space Filling Curve with Near-Optimal Clustering. ICDE 2018: 1236-1239 - [c44]Trong Duc Nguyen, Srikanta Tirthapura:
V2V: Vector Embedding of a Graph and Applications. IPDPS Workshops 2018: 1175-1183 - [c43]Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura:
Butterfly Counting in Bipartite Networks. KDD 2018: 2150-2159 - [c42]Ellango Jothimurugesan, Ashraf Tahmasbi, Phillip B. Gibbons, Srikanta Tirthapura:
Variance-Reduced Stochastic Gradient Descent on Streaming Data. NeurIPS 2018: 9928-9937 - [r2]Bibudh Lahiri, Srikanta Tirthapura:
Stream Sampling. Encyclopedia of Database Systems (2nd ed.) 2018 - [i15]Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura:
Butterfly Counting in Bipartite Networks. CoRR abs/1801.00338 (2018) - [i14]Pan Xu, Cuong Nguyen, Srikanta Tirthapura:
Onion Curve: A Space Filling Curve with Near-Optimal Clustering. CoRR abs/1801.07399 (2018) - [i13]Trong Duc Nguyen, Ming-Hung Shih, Divesh Srivastava, Srikanta Tirthapura, Bojian Xu:
Variance-Optimal Offline and Streaming Stratified Random Sampling. CoRR abs/1801.09039 (2018) - [i12]Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura:
Shared-Memory Parallel Maximal Clique Enumeration. CoRR abs/1807.09417 (2018) - [i11]Seyed-Vahid Sanei-Mehri, Apurba Das, Srikanta Tirthapura:
Enumerating Top-k Quasi-Cliques. CoRR abs/1808.09531 (2018) - [i10]Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura:
Counting Butterfies from a Large Bipartite Graph Stream. CoRR abs/1812.03398 (2018) - 2017
- [j31]Brock Bose, Bhargav Avasarala, Srikanta Tirthapura, Yung-Yu Chung, Donald Steiner:
Detecting Insider Threats Using RADISH: A System for Real-Time Anomaly Detection in Heterogeneous Data Streams. IEEE Syst. J. 11(2): 471-482 (2017) - [j30]Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura:
Enumeration of Maximal Cliques from an Uncertain Graph. IEEE Trans. Knowl. Data Eng. 29(3): 543-555 (2017) - [j29]Arko Provo Mukherjee, Srikanta Tirthapura:
Enumerating Maximal Bicliques from a Large Graph Using MapReduce. IEEE Trans. Serv. Comput. 10(5): 771-784 (2017) - [c41]Yu Zhang, Kanat Tangwongsan, Srikanta Tirthapura:
Streaming k-Means Clustering with Fast Queries. ICDE 2017: 449-460 - [i9]Yu Zhang, Kanat Tangwongsan, Srikanta Tirthapura:
Streaming Algorithms for k-Means Clustering with Fast Queries. CoRR abs/1701.03826 (2017) - [i8]Apurba Das, Srikanta Tirthapura:
A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph. CoRR abs/1707.08272 (2017) - [i7]Yu Zhang, Srikanta Tirthapura, Graham Cormode:
Learning Graphical Models from a Distributed Stream. CoRR abs/1710.02103 (2017) - 2016
- [j28]Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff:
Space-Efficient Estimation of Statistics Over Sub-Sampled Streams. Algorithmica 74(2): 787-811 (2016) - [j27]Bibudh Lahiri, Arko Provo Mukherjee, Srikanta Tirthapura:
Identifying correlated heavy-hitters in a two-dimensional data stream. Data Min. Knowl. Discov. 30(4): 797-818 (2016) - [j26]Sneha Aman Singh, Divesh Srivastava, Srikanta Tirthapura:
Estimating Quantiles from the Union of Historical and Streaming Data. Proc. VLDB Endow. 10(4): 433-444 (2016) - [j25]Yung-Yu Chung, Srikanta Tirthapura, David P. Woodruff:
A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream. IEEE Trans. Knowl. Data Eng. 28(6): 1356-1368 (2016) - [c40]Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity. Euro-Par 2016: 561-573 - [i6]Apurba Das, Michael Svendsen, Srikanta Tirthapura:
Change-Sensitive Algorithms for Maintaining Maximal Cliques in a Dynamic Graph. CoRR abs/1601.06311 (2016) - [i5]Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Work-Efficient Parallel and Incremental Graph Connectivity. CoRR abs/1602.05232 (2016) - 2015
- [j24]Srikanta Tirthapura, David P. Woodruff:
A General Method for Estimating Correlated Aggregates Over a Data Stream. Algorithmica 73(2): 235-260 (2015) - [j23]Sneha Aman Singh, Srikanta Tirthapura:
An Evaluation of Streaming Algorithms for Distinct Counting Over a Sliding Window. Frontiers ICT 2: 23 (2015) - [j22]Michael Svendsen, Arko Provo Mukherjee, Srikanta Tirthapura:
Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes. J. Parallel Distributed Comput. 79-80: 104-114 (2015) - [c39]Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura:
Mining maximal cliques from an uncertain graph. ICDE 2015: 243-254 - [c38]Srikanta Tirthapura:
Distinct Random Sampling from a Distributed Stream. IPDPS 2015: 532-541 - 2014
- [j21]Costas Busch, Ryan LaFortune, Srikanta Tirthapura:
Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor. Algorithmica 69(3): 658-684 (2014) - [j20]Sneha Aman Singh, Srikanta Tirthapura:
Monitoring persistent items in the union of distributed streams. J. Parallel Distributed Comput. 74(11): 3115-3127 (2014) - [j19]Akshay Deepak, David Fernández-Baca, Srikanta Tirthapura, Michael J. Sanderson, Michelle M. McMahon:
EvoMiner: frequent subtree mining in phylogenetic databases. Knowl. Inf. Syst. 41(3): 559-590 (2014) - [j18]Bibudh Lahiri, Srikanta Tirthapura, Jaideep Chandrashekar:
Space-efficient tracking of persistent items in a massive data stream. Stat. Anal. Data Min. 7(1): 70-92 (2014) - [j17]Pan Xu, Srikanta Tirthapura:
Optimality of Clustering Properties of Space-Filling Curves. ACM Trans. Database Syst. 39(2): 10:1-10:27 (2014) - [j16]Albert Angel, Nick Koudas, Nikos Sarkas, Divesh Srivastava, Michael Svendsen, Srikanta Tirthapura:
Dense subgraph maintenance under streaming edge weight updates for real-time story identification. VLDB J. 23(2): 175-199 (2014) - [c37]Arko Provo Mukherjee, Srikanta Tirthapura:
Enumerating Maximal Bicliques from a Large Graph Using MapReduce. BigData Congress 2014: 707-716 - [c36]Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Parallel streaming frequency-based aggregates. SPAA 2014: 236-245 - [i4]Arko Provo Mukherjee, Srikanta Tirthapura:
Enumerating Maximal Bicliques from a Large Graph using MapReduce. CoRR abs/1404.4910 (2014) - 2013
- [j15]A. Pavan, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Counting and Sampling Triangles from a Graph Stream. Proc. VLDB Endow. 6(14): 1870-1881 (2013) - [c35]Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura:
Parallel triangle counting in massive streaming graphs. CIKM 2013: 781-786 - [i3]Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura:
Parallel Triangle Counting in Massive Streaming Graphs. CoRR abs/1308.2166 (2013) - [i2]Bibudh Lahiri, Arko Provo Mukherjee, Srikanta Tirthapura:
Identifying Correlated Heavy-Hitters in a Two-Dimensional Data Stream. CoRR abs/1310.1161 (2013) - [i1]Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura:
Mining Maximal Cliques from an Uncertain Graph. CoRR abs/1310.6780 (2013) - 2012
- [j14]Zhenhui Shen, Srikanta Tirthapura:
Approximate covering detection among content-based subscriptions using space filling curves. J. Parallel Distributed Comput. 72(12): 1591-1602 (2012) - [c34]Srikanta Tirthapura, David P. Woodruff:
A General Method for Estimating Correlated Aggregates over a Data Stream. ICDE 2012: 162-173 - [c33]Pan Xu, Srikanta Tirthapura:
A Lower Bound on Proximity Preservation by Space Filling Curves. IPDPS 2012: 1295-1305 - [c32]Pan Xu, Srikanta Tirthapura:
On the optimality of clustering properties of space filling curves. PODS 2012: 215-224 - [c31]Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff:
Space-efficient estimation of statistics over sub-sampled streams. PODS 2012: 273-282 - [c30]Srikanta Tirthapura, David P. Woodruff:
Rectangle-efficient aggregation in spatial data streams. PODS 2012: 283-294 - 2011
- [c29]Bibudh Lahiri, Jaideep Chandrashekar, Srikanta Tirthapura:
Space-efficient tracking of persistent items in a massive data stream. DEBS 2011: 255-266 - [c28]Srikanta Tirthapura, David P. Woodruff:
Optimal Random Sampling from Distributed Streams Revisited. DISC 2011: 283-297 - 2010
- [j13]Bibudh Lahiri, Srikanta Tirthapura:
Identifying frequent items in a network using gossip. J. Parallel Distributed Comput. 70(12): 1241-1253 (2010) - [j12]Costas Busch, Srikanta Tirthapura:
Concurrent counting is harder than queuing. Theor. Comput. Sci. 411(43): 3823-3833 (2010) - [c27]Shan Zhou, Lei Ying, Srikanta Tirthapura:
Delay, cost and infrastructure tradeoff of epidemic routing in mobile sensor networks. IWCMC 2010: 1242-1246
2000 – 2009
- 2009
- [j11]Graham Cormode, Srikanta Tirthapura, Bojian Xu:
Time-decayed correlated aggregates over data streams. Stat. Anal. Data Min. 2(5-6): 294-310 (2009) - [j10]Graham Cormode, Srikanta Tirthapura, Bojian Xu:
Time-decaying Sketches for Robust Aggregation of Sensor Data. SIAM J. Comput. 39(4): 1309-1339 (2009) - [c26]Bibudh Lahiri, Srikanta Tirthapura:
Finding correlated heavy-hitters over data streams. IPCCC 2009: 307-314 - [c25]Graham Cormode, Srikanta Tirthapura, Bojian Xu:
Time-Decayed Correlated Aggregates over Data Streams. SDM 2009: 271-282 - [e2]Srikanta Tirthapura, Lorenzo Alvisi:
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009. ACM 2009, ISBN 978-1-60558-396-9 [contents] - [r1]Bibudh Lahiri, Srikanta Tirthapura:
Stream Sampling. Encyclopedia of Database Systems 2009: 2838-2842 - 2008
- [j9]Bojian Xu, Srikanta Tirthapura, Costas Busch:
Sketching asynchronous data streams over sliding windows. Distributed Comput. 20(5): 359-374 (2008) - [c24]Graham Cormode, Flip Korn, Srikanta Tirthapura:
Exponentially Decayed Aggregates on Data Streams. ICDE 2008: 1379-1381 - [c23]Graham Cormode, Flip Korn, Srikanta Tirthapura:
Time-decaying aggregates in out-of-order streams. PODS 2008: 89-98 - [c22]Bibudh Lahiri, Srikanta Tirthapura:
Computing Frequent Elements Using Gossip. SIROCCO 2008: 119-130 - 2007
- [j8]A. Pavan, Srikanta Tirthapura:
Range-Efficient Counting of Distinct Elements in a Massive Data Stream. SIAM J. Comput. 37(2): 359-379 (2007) - [c21]Zhenhui Shen, Srikanta Tirthapura:
Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves. ICDCS 2007: 2 - [c20]Costas Busch, Ryan LaFortune, Srikanta Tirthapura:
Improved sparse covers for graphs excluding a fixed minor. PODC 2007: 61-70 - [c19]Graham Cormode, Srikanta Tirthapura, Bojian Xu:
Time-decaying sketches for sensor data aggregation. PODC 2007: 215-224 - [c18]Costas Busch, Srikanta Tirthapura:
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. STACS 2007: 465-476 - 2006
- [j7]Maurice Herlihy, Srikanta Tirthapura:
Self-stabilizing smoothing and balancing networks. Distributed Comput. 18(5): 345-357 (2006) - [j6]Maurice Herlihy, Srikanta Tirthapura:
Randomized smoothing networks. J. Parallel Distributed Comput. 66(5): 626-632 (2006) - [j5]Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, Roger Wattenhofer:
Dynamic Analysis of the Arrow Distributed Protocol. Theory Comput. Syst. 39(6): 875-901 (2006) - [j4]Srikanta Tirthapura, Maurice Herlihy:
Self-Stabilizing Distributed Queuing. IEEE Trans. Parallel Distributed Syst. 17(7): 646-655 (2006) - [c17]Srikanta Tirthapura, Sudip Seal, Srinivas Aluru:
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition. ICPP 2006: 505-512 - [c16]Srikanta Tirthapura, Costas Busch:
Concurrent counting is harder than queuing. IPDPS 2006 - [c15]Zhenhui Shen, Srikanta Tirthapura:
Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup ReuseEvent. NCA 2006: 77-84 - [c14]Srikanta Tirthapura, Bojian Xu, Costas Busch:
Sketching asynchronous streams over a sliding window. PODC 2006: 82-91 - [e1]Soma Chaudhuri, Samir R. Das, Himadri S. Paul, Srikanta Tirthapura:
Distributed Computing and Networking, 8th International Conference, ICDCN 2006, Guwahati, India, December 27-30, 2006. Lecture Notes in Computer Science 4308, Springer 2006, ISBN 3-540-68139-6 [contents] - 2005
- [j3]Costas Busch, Srikanta Tirthapura:
Analysis of Link Reversal Routing Algorithms. SIAM J. Comput. 35(2): 305-326 (2005) - [c13]Zhenhui Shen, Srinivas Aluru, Srikanta Tirthapura:
Indexing for Subscription Covering in Publish-Subscribe Systems. PDCS 2005: 328-333 - [c12]Srikanta Tirthapura:
Adaptive Counting Networks. ICDCS 2005: 241-250 - [c11]Aduri Pavan, Srikanta Tirthapura:
Range Efficient Computation of F0 over Massive Data Streams. ICDE 2005: 32-43 - 2004
- [j2]Phillip B. Gibbons, Srikanta Tirthapura:
Distributed Streams Algorithms for Sliding Windows. Theory Comput. Syst. 37(3): 457-478 (2004) - [c10]Maurice Herlihy, Srikanta Tirthapura:
Randomized Smoothing Networks. IPDPS 2004 - [c9]Srikanta Tirthapura:
Brief announcement: adaptive balancing networks. PODC 2004: 387 - 2003
- [b1]Srikanta Tirthapura:
Distributed Queuing and Applications. Brown University, USA, 2003 - [c8]Maurice Herlihy, Srikanta Tirthapura:
Self-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura. ICDCS 2003: 4-11 - [c7]Srikanta Tirthapura:
Brief announcement: concurrent counting is harder than queuing. PODC 2003: 112 - [c6]Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura:
Analysis of link reversal routing algorithms for mobile ad hoc networks. SPAA 2003: 210-219 - 2002
- [c5]Phillip B. Gibbons, Srikanta Tirthapura:
Distributed streams algorithms for sliding windows. SPAA 2002: 63-72 - 2001
- [j1]Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer:
Ordered Multicast and Distributed Swap. ACM SIGOPS Oper. Syst. Rev. 35(1): 85-96 (2001) - [c4]Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer:
Competitive concurrent distributed queuing. PODC 2001: 127-133 - [c3]Phillip B. Gibbons, Srikanta Tirthapura:
Estimating simple functions on the union of data streams. SPAA 2001: 281-291 - [c2]Maurice Herlihy, Srikanta Tirthapura:
Self Stabilizing Distributed Queuing. DISC 2001: 209-223 - 2000
- [c1]Philip N. Klein, Srikanta Tirthapura, Daniel Sharvit, Benjamin B. Kimia:
A tree-edit-distance algorithm for comparing simple, closed shapes. SODA 2000: 696-704
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:18 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:
