Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarBenjamin Moseley
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j17]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan
, Kirk Pruhs, Clifford Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49(1): 37-66 (2020)- [c66]Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Online Scheduling via Learned Weights. SODA 2020: 1859-1877 - [i28]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. CoRR abs/2001.06841 (2020) - [i27]Michael Dinitz, Benjamin Moseley:
Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks. CoRR abs/2001.07784 (2020) - [i26]Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou:
Fast Noise Removal for k-Means Clustering. CoRR abs/2003.02433 (2020) - [i25]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Approximate Aggregate Queries Under Additive Inequalities. CoRR abs/2003.10588 (2020) - [i24]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
A Relational Gradient Descent Algorithm For Support Vector Machine Training. CoRR abs/2005.05325 (2020) - [i23]Benjamin Berg, Mor Harchol-Balter, Benjamin Moseley, Weina Wang, Justin Whitehouse:
Optimal Resource Allocation for Elastic and Inelastic Jobs. CoRR abs/2005.09745 (2020) - [i22]Robert D. Carr, Jennifer Iglesias, Giuseppe Lancia, Benjamin Moseley:
Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP. CoRR abs/2005.11912 (2020)
2010 – 2019
- 2019
- [j16]Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Non-clairvoyantly Scheduling to Minimize Convex Functions. Algorithmica 81(9): 3746-3764 (2019) - [c65]Benjamin Moseley, Maxim Sviridenko:
Submodular Optimization with Contention Resolution Extensions. APPROX-RANDOM 2019: 3:1-3:17 - [c64]Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines. FSTTCS 2019: 24:1-24:12 - [c63]Benjamin Moseley:
Scheduling to Approximate Minimization Objectives on Identical Machines. ICALP 2019: 86:1-86:14 - [c62]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Manish Purohit:
Matroid Coflow Scheduling. ICALP 2019: 145:1-145:14 - [c61]Kunal Agrawal, I-Ting Angelina Lee, Jing Li, Kefu Lu, Benjamin Moseley:
Practically Efficient Scheduler for Minimizing Average Flow Time of Parallel Jobs. IPDPS 2019: 134-144 - [c60]Ayan Chakrabarti, Benjamin Moseley:
Backprop with Approximate Activations for Memory-efficient Network Training. NeurIPS 2019: 2426-2435 - [c59]Shali Jiang, Roman Garnett, Benjamin Moseley:
Cost Effective Active Search. NeurIPS 2019: 4881-4890 - [c58]Silvio Lattanzi, Thomas Lavastida, Kefu Lu, Benjamin Moseley:
A Framework for Parallelizing Hierarchical Clustering Methods. ECML/PKDD (1) 2019: 73-89 - [c57]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. PODS 2019: 414-431 - [i21]Ayan Chakrabarti, Benjamin Moseley:
Backprop with Approximate Activations for Memory-efficient Network Training. CoRR abs/1901.07988 (2019) - [i20]Sungjin Im, Benjamin Moseley:
A Conditional Lower Bound on Graph Connectivity in MapReduce. CoRR abs/1904.08954 (2019) - [i19]Benjamin Moseley:
Scheduling to Approximate Minimization Objectives on Identical Machines. CoRR abs/1904.09667 (2019) - [i18]Ryan Curtain, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
On Coresets for Regularized Loss Minimization. CoRR abs/1905.10845 (2019) - [i17]Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Rk-means: Fast Clustering for Relational Data. CoRR abs/1910.04939 (2019) - 2018
- [j15]Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. Theory Comput. Syst. 62(2): 304-318 (2018) - [j14]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. J. Sched. 21(6): 581-582 (2018) - [j13]Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy efficient scheduling of parallelizable jobs. Theor. Comput. Sci. 726: 30-40 (2018) - [c56]Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. ESA 2018: 59:1-59:12 - [c55]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallelizable Jobs Online to Maximize Throughput. LATIN 2018: 755-776 - [c54]Shali Jiang, Gustavo Malkomes, Matthew Abbott, Benjamin Moseley, Roman Garnett:
Efficient nonmyopic batch active search. NeurIPS 2018: 1107-1117 - [c53]Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. SPAA 2018: 291-300 - [i16]Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. CoRR abs/1802.10309 (2018) - [i15]Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. CoRR abs/1804.08317 (2018) - [i14]Bryce Bagley, Blake Bordelon, Benjamin Moseley, Ralf Wessel:
Pre-Synaptic Pool Modification (PSPM): A Supervised Learning Procedure for Spiking Neural Networks. CoRR abs/1810.03199 (2018) - [i13]Shali Jiang, Gustavo Malkomes, Benjamin Moseley, Roman Garnett:
Efficient nonmyopic active search with applications in drug and materials discovery. CoRR abs/1811.08871 (2018) - [i12]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. CoRR abs/1812.09526 (2018) - 2017
- [j12]Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, K. Scott Hemmert, Samuel McCauley, Branden Moore, Benjamin Moseley, Cynthia A. Phillips, David S. Resnick, Arun Rodrigues:
Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation. J. Parallel Distributed Comput. 102: 213-228 (2017) - [j11]Shalmoli Gupta, Ravi Kumar, Kefu Lu, Benjamin Moseley, Sergei Vassilvitskii:
Local Search Methods for k-Means with Outliers. Proc. VLDB Endow. 10(7): 757-768 (2017) - [c52]Gustavo Malkomes, Kefu Lu, Blakeley Hoffman, Roman Garnett, Benjamin Moseley, Richard P. Mann:
Cooperative Set Function Optimization Without Communication or Coordination. AAMAS 2017: 1109-1118 - [c51]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. ESA 2017: 51:1-51:10 - [c50]Shali Jiang, Gustavo Malkomes, Geoff Converse, Alyssa Shofner, Benjamin Moseley, Roman Garnett:
Efficient Nonmyopic Active Search. ICML 2017: 1714-1723 - [c49]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. IPCO 2017: 228-240 - [c48]Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. IPCO 2017: 292-304 - [c47]Benjamin Moseley, Joshua Wang:
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search. NIPS 2017: 3094-3103 - [c46]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. RTSS 2017: 343-350 - [c45]Sungjin Im, Benjamin Moseley:
Fair Scheduling via Iterative Quasi-Uniform Sampling. SODA 2017: 2601-2615 - [c44]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput. SPAA 2017: 87-89 - [c43]Sungjin Im, Benjamin Moseley, Xiaorui Sun:
Efficient massively parallel methods for dynamic programming. STOC 2017: 798-811 - [i11]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. CoRR abs/1703.01634 (2017) - [i10]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(log log m)-competitive Algorithm for Online Machine Minimization. CoRR abs/1708.09046 (2017) - 2016
- [j10]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. J. Sched. 19(6): 617-618 (2016) - [j9]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively Scheduling Tasks with Intermediate Parallelizability. ACM Trans. Parallel Comput. 3(1): 4:1-4:19 (2016) - [c42]Sungjin Im, Janardhan Kulkarni, Benjamin Moseley, Kamesh Munagala:
A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. APPROX-RANDOM 2016: 10:1-10:15 - [c41]Shaurya Ahuja, Kefu Lu, Benjamin Moseley:
Partitioned Feasibility Tests for Sporadic Tasks on Heterogeneous Machines. IPDPS 2016: 1013-1020 - [c40]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time. SODA 2016: 176-189 - [c39]Sungjin Im, Benjamin Moseley:
General Profit Scheduling and the Power of Migration on Heterogeneous Machines. SPAA 2016: 165-173 - [c38]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time. SPAA 2016: 195-205 - 2015
- [j8]Benjamin Moseley:
Scheduling to minimize energy and flow time in broadcast scheduling. J. Sched. 18(1): 107-118 (2015) - [j7]Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast Greedy Algorithms in MapReduce and Streaming. ACM Trans. Parallel Comput. 2(3): 14:1-14:22 (2015) - [c37]Noa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, Yuval Rabani:
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs. ICALP (1) 2015: 78-90 - [c36]Sungjin Im, Benjamin Moseley:
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities. ICALP (1) 2015: 737-748 - [c35]Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, K. Scott Hemmert, Samuel McCauley, Branden Moore, Benjamin Moseley, Cynthia A. Phillips, David S. Resnick, Arun Rodrigues:
Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation. IPDPS 2015: 835-846 - [c34]Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, Branden Moore, Benjamin Moseley, Cynthia A. Phillips:
k-Means Clustering on Two-Level Memory Systems. MEMSYS 2015: 197-205 - [c33]Gustavo Malkomes, Matt J. Kusner, Wenlin Chen, Kilian Q. Weinberger, Benjamin Moseley:
Fast Distributed k-Center Clustering with Outliers on Massive Data. NIPS 2015: 1063-1071 - [c32]Sungjin Im, Shi Li, Benjamin Moseley, Eric Torng:
A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]. SODA 2015: 1070-1086 - [c31]Sungjin Im, Benjamin Moseley:
Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering. SPAA 2015: 65-67 - [c30]Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time. SPAA 2015: 155-160 - [c29]Sungjin Im, Benjamin Moseley:
Scheduling in Bandwidth Constrained Tree Networks. SPAA 2015: 171-180 - [c28]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Stochastic Scheduling of Heavy-tailed Jobs. STACS 2015: 474-486 - [c27]Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. WAOA 2015: 183-195 - 2014
- [j6]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Online Scheduling with General Cost Functions. SIAM J. Comput. 43(1): 126-143 (2014) - [c26]Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent, Kirk Pruhs:
Packet Forwarding Algorithms in a Line Network. LATIN 2014: 610-621 - [c25]Sungjin Im, Benjamin Moseley:
New Approximations for Reordering Buffer Management. SODA 2014: 1093-1111 - [c24]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153 - [c23]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively scheduling tasks with intermediate parallelizability. SPAA 2014: 22-29 - 2013
- [c22]Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions. APPROX-RANDOM 2013: 142-157 - [c21]Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley:
Bargaining for Revenue Shares on Tree Trading Networks. IJCAI 2013: 129-135 - [c20]Benjamin Moseley, Kirk Pruhs, Cliff Stein:
The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). IPCO 2013: 278-289 - [c19]Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy Efficient Scheduling of Parallelizable Jobs. SODA 2013: 948-957 - [c18]Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast greedy algorithms in mapreduce and streaming. SPAA 2013: 1-10 - [c17]Sungjin Im, Benjamin Moseley:
Brief announcement: online batch scheduling for flow objectives. SPAA 2013: 102-104 - [i9]Benjamin Moseley, Kirk Pruhs, Cliff Stein:
The Complexity of Scheduling for p-norms of Flow and Stretch. CoRR abs/1301.0793 (2013) - [i8]Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley:
Bargaining for Revenue Shares on Tree Trading Networks. CoRR abs/1304.5822 (2013) - 2012
- [j5]Daniel Cole, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Speed scaling for stretch plus energy. Oper. Res. Lett. 40(3): 180-184 (2012) - [j4]Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii:
Scalable K-Means++. Proc. VLDB Endow. 5(7): 622-633 (2012) - [j3]Sungjin Im, Benjamin Moseley:
An online scalable algorithm for average flow time in broadcast scheduling. ACM Trans. Algorithms 8(4): 39:1-39:17 (2012) - [j2]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor. Theory of Computing 8(1): 165-195 (2012) - [c16]Neal Barcelo, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Shortest-Elapsed-Time-First on a Multiprocessor. MedAlg 2012: 82-92 - [c15]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling heterogeneous processors isn't as easy as you think. SODA 2012: 1242-1253 - [c14]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Online scheduling with general cost functions. SODA 2012: 1254-1265 - [c13]Kevin J. Lang, Benjamin Moseley, Sergei Vassilvitskii:
Handling forecast errors while bidding for display advertising. WWW 2012: 371-380 - [i7]Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii:
Scalable K-Means++. CoRR abs/1203.6402 (2012) - 2011
- [j1]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
A tutorial on amortized local competitiveness in online scheduling. SIGACT News 42(2): 83-97 (2011) - [c12]Alina Ene, Sungjin Im, Benjamin Moseley:
Fast clustering using MapReduce. KDD 2011: 681-689 - [c11]Sungjin Im, Benjamin Moseley:
Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines. SODA 2011: 95-108 - [c10]Jeff Edmonds, Sungjin Im, Benjamin Moseley:
Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. SODA 2011: 109-119 - [c9]Kyle Fox, Benjamin Moseley:
Online Scheduling on Identical Machines using SRPT. SODA 2011: 120-128 - [c8]Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii:
Filtering: a method for solving graph problems in MapReduce. SPAA 2011: 85-94 - [c7]Benjamin Moseley, Anirban Dasgupta, Ravi Kumar, Tamás Sarlós:
On scheduling in map-reduce and flow-shops. SPAA 2011: 289-298 - [i6]Alina Ene, Sungjin Im, Benjamin Moseley:
Fast Clustering using MapReduce. CoRR abs/1109.1579 (2011) - 2010
- [c6]Sungjin Im, Benjamin Moseley:
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling. SODA 2010: 1322-1333 - [c5]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling jobs with varying parallelizability to reduce variance. SPAA 2010: 11-20 - [c4]Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid:
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). WAOA 2010: 71-82 - [i5]Benjamin Moseley:
Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling. CoRR abs/1007.3747 (2010) - [i4]Kyle Fox, Benjamin Moseley:
Online Scheduling on Identical Machines using SRPT. CoRR abs/1011.2187 (2010)
2000 – 2009
- 2009
- [c3]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. ESA 2009: 444-455 - [c2]Chandra Chekuri, Benjamin Moseley:
Online scheduling to minimize the maximum delay factor. SODA 2009: 1116-1125 - [c1]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling [Extended Abstract]. WAOA 2009: 62-74 - [i3]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. CoRR abs/0906.2048 (2009) - [i2]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling. CoRR abs/0906.2395 (2009) - 2008
- [i1]Chandra Chekuri, Benjamin Moseley:
Online Scheduling to Minimize the Maximum Delay Factor. CoRR abs/0807.1891 (2008)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 and opencitations.net 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 Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from 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 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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-05-29 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
