default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeremy T. Fineman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j15]Hao-Ren Yao
, Nairen Cao, Katina Russell, Der-Chen Chang, Ophir Frieder, Jeremy T. Fineman:
Self-Supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax. ACM Trans. Comput. Heal. 5(2): 10:1-10:28 (2024)- [j14]Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport:
Smoothed Analysis of Information Spreading in Dynamic Networks. J. ACM 71(3): 17 (2024) - [c65]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, John Kuszmaul, Maxwell Young:
Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution. PODC 2024: 231-242 - [c64]Jeremy T. Fineman:
Single-Source Shortest Paths with Negative Real Weights in Õ(mn8/9) Time. STOC 2024: 3-14 - 2023
- [c63]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract). HOPC@SPAA 2023: 3-4 - [c62]Nairen Cao, Jeremy T. Fineman:
Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth. SODA 2023: 4354-4372 - [i20]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, John Kuszmaul, Maxwell Young:
Robust and Listening-Efficient Contention Resolution. CoRR abs/2302.07751 (2023) - [i19]Jeremy T. Fineman:
Single-Source Shortest Paths with Negative Real Weights in Õ(mn8/9) Time. CoRR abs/2311.02520 (2023) - 2022
- [j13]Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang:
I/O-Efficient Algorithms for Topological Sort and Related Problems. ACM Trans. Algorithms 18(1): 5:1-5:24 (2022) - [c61]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. ISAAC 2022: 36:1-36:16 - [c60]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Parallel Shortest Paths with Negative Edge Weights. SPAA 2022: 177-190 - [c59]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Brief Announcement: Nested Active-Time Scheduling. SPAA 2022: 381-383 - [c58]Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport:
Smoothed Analysis of Information Spreading in Dynamic Networks. DISC 2022: 18:1-18:22 - [i18]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. CoRR abs/2207.12507 (2022) - [i17]Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport:
Smoothed Analysis of Information Spreading in Dynamic Networks. CoRR abs/2208.05998 (2022) - [i16]Hao-Ren Yao, Nairen Cao, Katina Russell, Der-Chen Chang, Ophir Frieder, Jeremy T. Fineman:
Self-supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax. CoRR abs/2209.00655 (2022) - 2021
- [j12]Jeremy T. Fineman, Aydin Buluç, Seth Gilbert:
Introduction to the Special Issue for SPAA 2018: Part 1. ACM Trans. Parallel Comput. 8(1): 3e:1 (2021) - [j11]Jeremy T. Fineman, Aydin Buluç, Seth Gilbert:
Introduction to the Special Issue for SPAA 2018 - Part 2. ACM Trans. Parallel Comput. 8(2): 6:1 (2021) - [c57]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm. PODC 2021: 493-496 - [c56]Zhe Wang, Kunal Agrawal, Jeremy T. Fineman:
Sub-Linear Overhead in Static Schedules for Fault-Tolerant Transmission. RTSS 2021: 405-417 - 2020
- [j10]Jeremy T. Fineman:
Nearly Work-Efficient Parallel Algorithm for Digraph Reachability. SIAM J. Comput. 49(5) (2020) - [c55]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
Contention Resolution with Message Deadlines. SPAA 2020: 23-35 - [c54]Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun:
Optimal Parallel Algorithms in the Binary-Forking Model. SPAA 2020: 89-102 - [c53]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths. SPAA 2020: 511-513 - [c52]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Efficient construction of directed hopsets and parallel approximate shortest paths. STOC 2020: 336-349
2010 – 2019
- 2019
- [j9]Jeremy T. Fineman, Seth Gilbert, Fabian Kuhn, Calvin Newport:
Contention resolution on a fading channel. Distributed Comput. 32(6): 517-533 (2019) - [j8]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. J. ACM 66(1): 6:1-6:33 (2019) - [c51]Robert Utterback, Kunal Agrawal, Jeremy T. Fineman, I-Ting Angelina Lee:
Efficient race detection with futures. PPoPP 2019: 340-354 - [c50]Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang:
I/O-Efficient Algorithms for Topological Sort and Related Problems. SODA 2019: 2053-2070 - [e2]Jeremy T. Fineman, Michael Mitzenmacher:
2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA. OASIcs 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-099-6 [contents] - [i15]Robert Utterback, Kunal Agrawal, Jeremy T. Fineman, I-Ting Angelina Lee:
Efficient Race Detection with Futures. CoRR abs/1901.00622 (2019) - [i14]Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun:
Optimal Parallel Algorithms in the Binary-Forking Model. CoRR abs/1903.04650 (2019) - [i13]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths. CoRR abs/1912.05506 (2019) - 2018
- [j7]Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport:
Smoothed analysis of dynamic networks. Distributed Comput. 31(4): 273-287 (2018) - [c49]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. IPDPS 2018: 711-722 - [c48]Kunal Agrawal, Joseph Devietti, Jeremy T. Fineman, I-Ting Angelina Lee, Robert Utterback, Changming Xu:
Race Detection and Reachability in Nearly Series-Parallel DAGs. SODA 2018: 156-171 - [c47]Jeremy T. Fineman:
Nearly work-efficient parallel algorithm for digraph reachability. STOC 2018: 457-470 - [e1]Christian Scheideler, Jeremy T. Fineman:
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, July 16-18, 2018. ACM 2018 [contents] - 2017
- [j6]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Storage Reallocation. ACM Trans. Algorithms 13(3): 38:1-38:20 (2017) - [c46]William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz:
The Online House Numbering Problem: Min-Max Online List Labeling. ESA 2017: 33:1-33:15 - [c45]Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport:
Load balancing with bounded convergence in dynamic networks. INFOCOM 2017: 1-9 - [c44]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montes:
File Maintenance: When in Doubt, Change the Layout! SODA 2017: 1503-1522 - [c43]Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai:
Cross-Referenced Dictionaries and the Limits of Write Optimization. SODA 2017: 1523-1532 - [i12]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. CoRR abs/1710.02637 (2017) - [i11]Jeremy T. Fineman:
Nearly Work-Efficient Parallel Algorithm for Digraph Reachability. CoRR abs/1711.01700 (2017) - 2016
- [j5]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert E. Tarjan:
A New Approach to Incremental Cycle Detection and Related Problems. ACM Trans. Algorithms 12(2): 14:1-14:22 (2016) - [j4]Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola:
Experimental Analysis of Space-Bounded Schedulers. ACM Trans. Parallel Comput. 3(1): 8:1-8:27 (2016) - [c42]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Efficient Algorithms with Asymmetric Read and Write Costs. ESA 2016: 14:1-14:18 - [c41]Brendan Sheridan, Jeremy T. Fineman:
A case for distributed work-stealing in regular applications. X10@PLDI 2016: 32-33 - [c40]Jeremy T. Fineman, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Contention Resolution on a Fading Channel. PODC 2016: 155-164 - [c39]Jeremy T. Fineman, Calvin Newport, Tonghe Wang:
Contention Resolution on Multiple Channels with Collision Detection. PODC 2016: 175-184 - [c38]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness. SODA 2016: 636-654 - [c37]Robert Utterback, Kunal Agrawal, Jeremy T. Fineman, I-Ting Angelina Lee:
Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs. SPAA 2016: 83-94 - [c36]Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley:
Cache-Adaptive Analysis. SPAA 2016: 135-144 - [c35]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Parallel Algorithms for Asymmetric Read-Write Costs. SPAA 2016: 145-156 - [i10]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Sorting with Asymmetric Read and Write Costs. CoRR abs/1603.03505 (2016) - 2015
- [j3]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. Algorithmica 73(2): 389-409 (2015) - [j2]Michael A. Bender, Jeremy T. Fineman, Mahnush Movahedi, Jared Saia, Varsha Dani, Seth Gilbert, Seth Pettie, Maxwell Young:
Resource-Competitive Algorithms. SIGACT News 46(3): 57-71 (2015) - [c34]Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. SODA 2015: 431-448 - [c33]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Sorting with Asymmetric Read and Write Costs. SPAA 2015: 1-12 - [c32]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Reallocation for Scheduling and Planning. SPAA 2015: 143-154 - [c31]Jeremy T. Fineman, Brendan Sheridan:
Scheduling Non-Unit Jobs to Minimize Calibrations. SPAA 2015: 161-170 - [c30]Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin C. Newport:
Smoothed Analysis of Dynamic Networks. DISC 2015: 513-527 - [i9]Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport:
Smoothed Analysis of Dynamic Networks. CoRR abs/1508.03579 (2015) - [i8]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Efficient Algorithms under Asymmetric Read and Write Costs. CoRR abs/1511.01038 (2015) - 2014
- [c29]Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan:
Cache-Oblivious Persistence. ESA 2014: 296-308 - [c28]Kunal Agrawal, Jordyn Maglalang, Jeremy T. Fineman:
Cache-conscious scheduling of streaming pipelines on parallel machines with private caches. HiPC 2014: 1-12 - [c27]Jeremy T. Fineman, Calvin C. Newport, Micah Sherr, Tonghe Wang:
Fair Maximal Independent Sets. IPDPS 2014: 712-721 - [c26]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. PODS 2014: 278-288 - [c25]Kunal Agrawal, Jeremy T. Fineman, Brendan Sheridan, Jim Sukha, Robert Utterback:
Provably good scheduling for parallel programs that use data structures through implicit batching. PPoPP 2014: 389-390 - [c24]Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley:
Cache-Adaptive Algorithms. SODA 2014: 958-971 - [c23]Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola:
Experimental analysis of space-bounded schedulers. SPAA 2014: 30-41 - [c22]Kunal Agrawal, Jeremy T. Fineman:
Brief announcement: cache-oblivious scheduling of streaming pipelines. SPAA 2014: 79-81 - [c21]Kunal Agrawal, Jeremy T. Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha, Robert Utterback:
Provably good scheduling for parallel programs that use data structures through implicit batching. SPAA 2014: 84-95 - [i7]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
NoiseOFF: A Backoff Protocol for a Dynamic, Noisy World. CoRR abs/1402.5207 (2014) - [i6]Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan:
Cache-Oblivious Persistence. CoRR abs/1402.5492 (2014) - [i5]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. CoRR abs/1404.2019 (2014) - 2013
- [c20]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Program-centric cost models for locality. MSPC@PLDI 2013: 6:1-6:2 - [c19]Jeremy T. Fineman, Calvin C. Newport, Tonghe Wang:
Brief announcement: fair maximal independent sets in trees. PODC 2013: 51-53 - [c18]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Reducing contention through priority updates. PPoPP 2013: 299-300 - [c17]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Reducing contention through priority updates. SPAA 2013: 152-163 - [c16]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation problems in scheduling. SPAA 2013: 271-279 - [i4]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. CoRR abs/1305.6555 (2013) - 2012
- [c15]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Julian Shun:
Internally deterministic parallel algorithms can be fast. PPoPP 2012: 181-192 - [c14]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Brief announcement: the problem based benchmark suite. SPAA 2012: 68-70 - [c13]Kunal Agrawal, Jeremy T. Fineman, Jordan Krage, Charles E. Leiserson, Sivan Toledo:
Cache-conscious scheduling of streaming applications. SPAA 2012: 236-245 - [c12]Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy sequential maximal independent set and matching are parallel on average. SPAA 2012: 308-317 - [i3]Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. CoRR abs/1202.3205 (2012) - 2011
- [c11]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Scheduling irregular parallel computations on hierarchical caches. SPAA 2011: 355-366 - [p1]Jeremy T. Fineman, Eric Robinson:
Fundamental Graph Algorithms. Graph Algorithms in the Language of Linear Algebra 2011: 45-58 - [r1]Jeremy T. Fineman, Charles E. Leiserson:
Race Detectors for Cilk and Cilk++ Programs. Encyclopedia of Parallel Computing 2011: 1706-1719 - [i2]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert Endre Tarjan:
A New Approach to Incremental Cycle Detection and Related Problems. CoRR abs/1112.0784 (2011) - 2010
- [c10]Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro:
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. SODA 2010: 1448-1456
2000 – 2009
- 2009
- [b1]Jeremy T. Fineman:
Algorithms incorporating concurrency and caching. Massachusetts Institute of Technology, Cambridge, MA, USA, 2009 - [j1]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman:
The Worst Page-Replacement Policy. Theory Comput. Syst. 44(2): 175-185 (2009) - [c9]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert:
A new approach to incremental topological ordering. SODA 2009: 1108-1115 - [c8]Aydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson:
Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. SPAA 2009: 233-244 - 2008
- [c7]Kunal Agrawal, Jeremy T. Fineman, Jim Sukha:
Nested parallelism in transactional memory. PPoPP 2008: 163-174 - [c6]Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott:
Improved approximations for multiprocessor scheduling under uncertainty. SPAA 2008: 246-255 - [i1]Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott:
Improved Approximations for Multiprocessor Scheduling Under Uncertainty. CoRR abs/0802.2418 (2008) - 2007
- [c5]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman:
The Worst Page-Replacement Policy. FUN 2007: 135-145 - [c4]Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson:
Cache-oblivious streaming B-trees. SPAA 2007: 81-92 - 2006
- [c3]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert:
Contention Resolution with Heterogeneous Job Sizes. ESA 2006: 112-123 - 2005
- [c2]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul:
Concurrent cache-oblivious b-trees. SPAA 2005: 228-237 - 2004
- [c1]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson:
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. SPAA 2004: 133-144
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-24 21:30 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:
