- 2018-11-06: We are celebrating 25 years of dblp!
The dblp computer science bibliography is celebrating its 25th anniversary.
On this occasion we would like to invite you to our celebration colloquium.
- Friday, November 23rd, 2018, 4pm
- University of Trier, Campus II, K101 ("Kapelle")
Further details are available here.
- 2018-07-13: ORCID state of dblp
Since more than a year now, dblp has intensified its efforts to link dblp bibliographies to ORCIDs used by that author. ORCID information are now added regularly to the dblp data set. The primary sources for ORCIDs are: first, the annual ORCID open data dump and, second, metadata directly provided by publishers who have started to increasingly label author signatures with ORCID information. Neither of those data sources are free of errors and data hick-ups, so we are still manually cleaning the ORCID data prior to adding them to the corpus. But overall, ORCIDs have helped us to correct numerous cases of homonymous and synonymous bibliographies in dblp, so it is absolutely worth our time.
Since the past big ORCID update from last week (as of July 11, 2018), you can now find in dblp:
- 806,744 ORCID author signatures (i.e., author-publication pairs), that is 6.5% of all author signatures in the dataset
- 165,752 bibliographies that are linked to ORCIDs (either manually or implicit)
- 24,357 bibliographies with ORCIDs manually verified by the dblp team
If you look at computer science publications in dblp that have been published in the recent years, you will find that the fraction of author signatures with ORCID in dblp has climbed to now about 10.9% off all signatures in 2018. Of course, year 2018 is not done yet, and we are continuously working on improving the coverage further among all publications, regardless of the year of publication. The number of signatures and coverage for publication in recent years is:
- 2014: 892,240 signatures (8.2% coverage)
- 2015: 930,746 signatures (7.7% coverage)
- 2016: 984,559 signatures (6.7% coverage)
- 2017: 1,042,103 signatures (5.6% coverage)
- 2018: 439,350 signatures (10.9% coverage)
The oldest publication with an ORCID is from 1961. Because of the small number of publications in dblp from that time, the ORCID coverage for 1961 is a remarkable 0.12%.
- 2018-04-09: Historical dblp file is now available.
A historical version of dblp (called hdblp) is now available at zenodo. hdblp contains historical revisions of all metadata records in dblp. The file can be used to reconstruct dblp for each day between June 1999 and March 2018.
- 2018-02-27: dblp via HTTPS
Finally, all dblp servers now support HTTPS. We will gradually move towards exclusively using HTTPS in the future, so please feel free to update your bookmarks.
- 2017-12-22: 4 million publications!
We are happy to celebrate more than 4,000,000 million computer science publications in the dblp computer science bibliography!
- 2017-09-15: The first 700k: dblp starts integrating ORCIDs
ORCID (http://orcid.org) is a widely used persistent identifier scheme for researchers. As of September 2017, there are more than 3.8 million registered ORCIDs of which about 800,000 have at least one publication listed in the public ORCID corpus. Many publishers will now ask their authors to provide an ORCID when submitting or publishing a paper. We encourage all researchers to register and map their ORCID with their publications.
A few weeks ago, we started first experiments with integrating ORCIDs into dblp. At the moment, there are about 700,000 signatures (i.e., author-publication pairs) in dblp for which we know an ORCID. This is about 6% of all signatures. We expected ORCIDs to help us identify authors and create clear, unambiguous author bibliographies (see How does dblp handle homonyms and synonyms). We were not disappointed. For the initial import, we found in our corpus
- 600 cases where an author profile was related to more than one ORCID. This indicates that the profile actually lists publications from different authors.
- 5000 cases where the same ORCID appears in more than one author profile.
We are currently processing these cases. While we found several cases where ORCID information is wrong (e.g., authors accidentally claiming publications that where written by someone else), the data is very reliable in general. However, according to our philosophy, manual confirmation is needed. This will take some time.
A detailed description on ORCIDs on the dblp web interface and in the data dump can be found at in our F.A.Q.s.
We will keep you posted on development.
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal"
- exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics"
- boolean and: separate words by space
e.g., codd model
- boolean or: connect words by pipe symbol (|)
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
found 540,694 matches
- Leonard Barolli, Makoto Takizawa, Fatos Xhafa, Tomoya Enokido:
Advanced Information Networking and Applications - Proceedings of the 33rd International Conference on Advanced Information Networking and Applications, AINA 2019, Matsue, Japan, March 27-29, 2019. Advances in Intelligent Systems and Computing 926, Springer 2020, ISBN 978-3-030-15031-0 [contents]
- John A. Vince:
Calculus for Computer Graphics, Second Edition. Springer 2019, ISBN 978-3-030-11375-9, pp. 1-303
- Haris Celik:
Feasibility and Performance of Dynamic TDD in Dense and Ultra-Dense Wireless Access Networks. Royal Institute of Technology, Stockholm, Sweden 2019
- Ting Chen:
Effective and Efficient Representation Learning for Graph Structures. University of California, Los Angeles, USA 2019
- Markus Eriksson:
Change Point Detection with Applications to Wireless Sensor Networks. Uppsala University, Sweden 2019
- David Formby:
Network Based Fingerprinting Techniques for Industrial Control Systems. Georgia Institute of Technology, Atlanta, GA, USA 2019
- Jose Mairton B. da Silva Jr.:
Optimization and Fundamental Insights in Full-Duplex Cellular Networks. Royal Institute of Technology, Stockholm, Sweden 2019
- Abdelquoddouss Laghrissi:
Virtual Network Slice Planning. Aalto University, Espoo, Finland 2019
- Gustav Nilsson:
On Robust Distributed Control of Transportation Networks. Lund University, Sweden 2019
- Hooman Peiro Sajjad:
Methods and Algorithms for Data-Intensive Computing: Streams, Graphs, and Geo-Distribution. Royal Institute of Technology, Stockholm, Sweden 2019
- Hamidreza Shariatmadari:
Enabling Ultra-Reliable Low-Latency Communications in 5G Networks. Aalto University, Espoo, Finland 2019
- Forrest Sheldon:
Collective Phenomena in Memristive Networks: Engineering phase transitions into computation. University of California, San Diego, USA 2019
- Olivier Tilmans:
Improving network flexibility. Catholic University of Louvain, Louvain-la-Neuve, Belgium 2019
- Wenchao Yu:
Practical and Scalable Methods for Information Network Analysis and Mining. University of California, Los Angeles, USA 2019
- Jeffrey Yuan:
Genome Assembly of Long Error-Prone Reads Using De Bruijn Graphs and Repeat Graphs. University of California, San Diego, USA 2019
- Yu Zhang:
Prediction of Electronic Component Prices: from Classical Statistical and Machine Learning Models to Deep Neural Networks with Feature Embedding. University of California, Los Angeles, USA 2019
- Hind Almisbahi:
Analysing graphene vibrations via molecular dynamics simulations and dimension reduction techniques. University of Surrey, Guildford, UK 2019
- Danya Bachir:
Estimating Urban Mobility with Mobile Network Geolocation Data Mining. (Estimation de la mobilité urbaine par l'exploitation des données de géolocalisation de téléphonie mobile). Telecom SudParis, Évry, Essonne, France 2019
- Ahmed Ould Mohamed Moctar:
Détection et suivi de l'évolution de communautés ego-centrées dans les réseaux sociaux dynamiques. (Detecting and Tracking Ego-Community Evolution in Dynamic Social Networks). Cheikh Anta Diop University, Dakar, Senegal 2019
skipping 540,664 more matches
loading more results
failed to load more results, please try again later
The full-text search results are provided via , courtesy of AI2.
found ?? matches
- service temporarily not available