Остановите войну!
for scientists:
default search action
Michael A. Bender
- > Home > Persons > Michael A. Bender
Publications
- 2024
- [c129]Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul:
Modern Hashing Made Simple. SOSA 2024: 363-373 - [i40]Alex Conway, Ainesh Bakshi, Arghya Bhattacharya, Rory Bennett, Yizheng Jiao, Eric Knorr, Yang Zhan, Michael A. Bender, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, Martin Farach-Colton:
File System Aging. CoRR abs/2401.08858 (2024) - [i39]Hagit Attiya, Michael A. Bender, Martin Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. CoRR abs/2403.14445 (2024) - 2023
- [j64]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once. J. ACM 70(6): 40:1-40:51 (2023) - [j63]Prashant Pandey, Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson:
IcebergHT: High Performance Hash Tables Through Stability and Low Associativity. Proc. ACM Manag. Data 1(1): 47:1-47:26 (2023) - [c128]Krishnan Gosakan, Jaehyun Han, William Kuszmaul, Ibrahim N. Mubarek, Nirjhar Mukherjee, Karthik Sriram, Guido Tagliavini, Evan West, Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Jayneel Gandhi, Rob Johnson, Sudarsun Kannan, Donald E. Porter:
Mosaic Pages: Big TLB Reach with Small Pages. ASPLOS (3) 2023: 433-448 - [c126]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Tiny Pointers. SODA 2023: 477-508 - [c125]Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini:
An Associativity Threshold Phenomenon in Set-Associative Caches. SPAA 2023: 117-127 - [i37]Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini:
An Associativity Threshold Phenomenon in Set-Associative Caches. CoRR abs/2304.04954 (2023) - 2022
- [j62]Janet Vorobyeva, Daniel R. Delayo, Michael A. Bender, Martin Farach-Colton, Prashant Pandey, Cynthia A. Phillips, Shikha Singh, Eric D. Thomas, Thomas M. Kroeger:
Using advanced data structures to enable responsive security monitoring. Clust. Comput. 25(4): 2893-2914 (2022) - [c122]Yizheng Jiao, Simon Bertron, Sagar Patel, Luke Zeller, Rory Bennett, Nirjhar Mukherjee, Michael A. Bender, Michael Condict, Alex Conway, Martin Farach-Colton, Xiongzi Ge, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
BetrFS: a compleat file system for commodity SSDs. EuroSys 2022: 610-627 - [c121]Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. FOCS 2022: 980-990 - [c120]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
What Does Dynamic Optimality Mean in External Memory? ITCS 2022: 18:1-18:23 - [c118]David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, J. Ahmed Dellas, Martin Farach-Colton, Tyler Seip, Kenny Zhang:
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. SIGMOD Conference 2022: 325-339 - [c114]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the optimal time/space tradeoff for hash tables. STOC 2022: 1284-1297 - [i36]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
What Does Dynamic Optimality Mean in External Memory? CoRR abs/2201.01742 (2022) - [i35]Michael A. Bender, Alexander Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. CoRR abs/2203.02763 (2022) - [i34]David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, J. Ahmed Dellas, Martin Farach-Colton, Tyler Seip, Kenny Zhang:
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. CoRR abs/2203.14927 (2022) - [i32]Prashant Pandey, Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson:
IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity. CoRR abs/2210.04068 (2022) - 2021
- [j60]Shikha Singh, Prashant Pandey, Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Cynthia A. Phillips:
Timely Reporting of Heavy Hitters Using External Memory. ACM Trans. Database Syst. 46(4): 14:1-14:35 (2021) - [j59]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Jannen, Yizheng Jiao, Rob Johnson, Eric Knorr, Sara McAllister, Nirjhar Mukherjee, Prashant Pandey, Donald E. Porter, Jun Yuan, Yang Zhan:
External-memory Dictionaries in the Affine and PDAM Models. ACM Trans. Parallel Comput. 8(3): 15:1-15:20 (2021) - [j58]Yang Zhan, Alex Conway, Yizheng Jiao, Nirjhar Mukherjee, Ian Groombridge, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
Copy-on-Abundant-Write for Nimble File System Clones. ACM Trans. Storage 17(1): 5:1-5:27 (2021) - [c113]Michael A. Bender, Rathish Das, Martin Farach-Colton, Tianchi Mo, David Tench, Yung Ping Wang:
Mitigating False Positives in Filters: to Adapt or to Cache? APOCS 2021: 16-24 - [c110]Prashant Pandey, Alex Conway, Joe Durie, Michael A. Bender, Martin Farach-Colton, Rob Johnson:
Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design. SIGMOD Conference 2021: 1386-1399 - [c107]Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Donald E. Porter, Guido Tagliavini, Janet Vorobyeva, Evan West:
Paging and the Address-Translation Problem. SPAA 2021: 105-117 - [i29]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
All-Purpose Hashing. CoRR abs/2109.04548 (2021) - [i28]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the Optimal Time/Space Tradeoff for Hash Tables. CoRR abs/2111.00602 (2021) - [i27]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Tiny Pointers. CoRR abs/2111.12800 (2021) - 2020
- [j57]Yang Zhan, Alex Conway, Nirjhar Mukherjee, Ian Groombridge, Martin Farach-Colton, Rob Johnson, Yizheng Jiao, Michael A. Bender, William Jannen, Donald E. Porter, Jun Yuan:
How to Not Copy Files. login Usenix Mag. 45(3) (2020) - [c106]Yang Zhan, Alexander Conway, Yizheng Jiao, Nirjhar Mukherjee, Ian Groombridge, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
How to Copy Files. FAST 2020: 75-89 - [c103]Prashant Pandey, Shikha Singh, Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Cynthia A. Phillips:
Timely Reporting of Heavy Hitters using External Memory. SIGMOD Conference 2020: 1431-1446 - [c102]Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul:
Flushing Without Cascades. SODA 2020: 650-669 - 2019
- [c96]Alex Conway, Eric Knorr, Yizheng Jiao, Michael A. Bender, William Jannen, Rob Johnson, Donald E. Porter, Martin Farach-Colton:
Filesystem Aging: It's more Usage than Fullness. HotStorage 2019 - [c95]Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai:
Optimal Ball Recycling. SODA 2019: 2527-2546 - [c94]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Jannen, Yizheng Jiao, Rob Johnson, Eric Knorr, Sara McAllister, Nirjhar Mukherjee, Prashant Pandey, Donald E. Porter, Jun Yuan, Yang Zhan:
Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design. SPAA 2019: 265-274 - [c93]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
Achieving optimal backlog in multi-processor cup games. STOC 2019: 1148-1157 - [i24]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
Achieving Optimal Backlog in Multi-Processor Cup Games. CoRR abs/1904.02861 (2019) - 2018
- [j52]Yang Zhan, Yizheng Jiao, Donald E. Porter, Alex Conway, Eric Knorr, Martin Farach-Colton, Michael A. Bender, Jun Yuan, William Jannen, Rob Johnson:
Efficient Directory Mutations in a Full-Path-Indexed File System. ACM Trans. Storage 14(3): 22:1-22:27 (2018) - [c92]Yang Zhan, Alexander Conway, Yizheng Jiao, Eric Knorr, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
The Full Path to Full-Path Indexing. FAST 2018: 123-138 - [c91]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. FOCS 2018: 182-193 - [e3]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Lecture Notes in Computer Science 10807, Springer 2018, ISBN 978-3-319-77403-9 [contents] - [i23]Michael A. Bender, Jake Christensen, Alexander Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai:
Optimal Ball Recycling. CoRR abs/1807.01804 (2018) - [i22]Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Prashant Pandey, Cynthia A. Phillips, Shikha Singh:
The Online Event-Detection Problem. CoRR abs/1812.09824 (2018) - 2017
- [j49]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) - [j48]Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
Writes Wrought Right, and Other Adventures in File System Optimization. ACM Trans. Storage 13(1): 3:1-3:26 (2017) - [j47]Alex Conway, Ainesh Bakshi, Yizheng Jiao, Yang Zhan, Michael A. Bender, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, Martin Farach-Colton:
How to Fragment Your File System. login Usenix Mag. 42(2) (2017) - [c88]Alexander Conway, Ainesh Bakshi, Yizheng Jiao, William Jannen, Yang Zhan, Jun Yuan, Michael A. Bender, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Martin Farach-Colton:
File Systems Fated for Senescence? Nonsense, Says Science! FAST 2017: 45-58 - [c87]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Simon Mauras, Tyler Mayer, Cynthia A. Phillips, Helen Xu:
Write-Optimized Skip Lists. PODS 2017: 69-78 - [c84]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 - [i20]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. CoRR abs/1711.01616 (2017) - 2016
- [c83]Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
Optimizing Every Operation in a Write-optimized File System. FAST 2016: 1-14 - [c81]William Jannen, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
Lazy Analytics: Let Other Queries Do the Work For You. HotStorage 2016 - [c80]Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton, Pramod Ganapathi, Rob Johnson, Samuel McCauley, Bertrand Simon, Shikha Singh:
The I/O Complexity of Computing Prime Tables. LATIN 2016: 192-206 - [c75]Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
Optimizing Every Operation in a Write-optimized File System. USENIX Annual Technical Conference 2016 - 2015
- [j44]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) - [j41]William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
BetrFS: Write-Optimization in a Kernel File System. ACM Trans. Storage 11(4): 18:1-18:29 (2015) - [j40]Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, Yang Zhan:
An Introduction to Bε-trees and Write-Optimization. login Usenix Mag. 40(5) (2015) - [c74]William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
BetrFS: A Right-Optimized Write-Optimized File System. FAST 2015: 301-315 - [c70]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 - 2014
- [c68]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai:
The Batched Predecessor Problem in External Memory. ESA 2014: 112-124 - [c67]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. PODS 2014: 278-288 - [i17]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
- [c64]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation problems in scheduling. SPAA 2013: 271-279 - [i16]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
- [j37]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok:
Don't Thrash: How to Cache Your Hash on Flash. Proc. VLDB Endow. 5(11): 1627-1637 (2012) - [c60]John Esmet, Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul:
The TokuFS Streaming File System. HotStorage 2012 - [i15]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok:
Don't Thrash: How to Cache Your Hash on Flash. CoRR abs/1208.0290 (2012) - 2011
- [c58]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok:
Don't Thrash: How to Cache Your Hash on Flash. HotStorage 2011 - 2007
- [j23]Harold N. Gabow, Michael A. Bender, Martin Farach-Colton:
Introduction to SODA 2002 and 2003 special issue. ACM Trans. Algorithms 3(4): 36 (2007) - [c50]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
- [j20]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
Insertion Sort is O(n log n). Theory Comput. Syst. 39(3): 391-397 (2006) - [c46]Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul:
Cache-oblivious string B-trees. PODS 2006: 233-242 - 2005
- [j18]Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin:
Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2): 75-94 (2005) - [j17]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Cache-Oblivious B-Trees. SIAM J. Comput. 35(2): 341-358 (2005) - [c42]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial contention resolution for simple channels. SPAA 2005: 325-332 - 2004
- [j11]Michael A. Bender, Martin Farach-Colton:
The Level Ancestor Problem simplified. Theor. Comput. Sci. 321(1): 5-12 (2004) - [c38]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial Analyses of Window Backoff Strategies. IPDPS Next Generation Software Program - NSFNGS - PI Workshop 2004 - [i7]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
Insertion Sort is O(n log n). CoRR cs.DS/0407003 (2004) - 2002
- [c31]Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton:
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. ESA 2002: 139-151 - [c30]Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito:
Two Simplified Algorithms for Maintaining Order in a List. ESA 2002: 152-164 - [c29]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA 2002: 165-173 - [c27]Michael A. Bender, Martin Farach-Colton:
The Level Ancestor Problem Simplified. LATIN 2002: 508-515 - [i3]Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup:
Efficient Tree Layout in a Multilevel Memory Hierarchy. CoRR cs.DS/0211010 (2002) - 2000
- [c17]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Cache-Oblivious B-Trees. FOCS 2000: 399-409 - [c15]Michael A. Bender, Martin Farach-Colton:
The LCA Problem Revisited. LATIN 2000: 88-94
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-04-25 02:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint