default search action
Takeshi Koshiba
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
- [j45]Masahito Hayashi
, Takeshi Koshiba
Universal Adaptive Construction of Verifiable Secret Sharing and Its Application to Verifiable Secure Distributed Data Storage. IEEE/ACM Trans. Netw. 32(1): 253-267 (2024) - 2023
- [j44]Takeshi Koshiba
A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm. J. Inf. Secur. Appl. 73: 103430 (2023) - [j43]Michele Dall'Arno, Francesco Buscemi, Takeshi Koshiba:
Computing the quantumguesswork: a quadratic assignment problem. Quantum Inf. Comput. 23(9&10): 721-732 (2023) - 2022
- [j42]Md. Billal Hossain
CARAN: A Context-Aware Recency-Based Attention Network for Point-of-Interest Recommendation. IEEE Access 10: 36299-36310 (2022) - [j41]Md. Kowsher
Bangla-BERT: Transformer-Based Efficient Model for Transfer Learning and Language Understanding. IEEE Access 10: 91855-91870 (2022) - [j40]Behrouz Zolfaghari
The Odyssey of Entropy: Cryptography. Entropy 24(2): 266 (2022) - [j39]Behrouz Zolfaghari
From Random Numbers to Random Objects. Entropy 24(7): 928 (2022) - [j38]Maiki Fujita, Takeshi Koshiba
Perfectly Secure Message Transmission Against Rational Adversaries. IEEE J. Sel. Areas Inf. Theory 3(2): 390-404 (2022) - [j37]Masahito Hayashi
Quantum verifiable protocol for secure modulo zero-sum randomness. Quantum Inf. Process. 21(8): 291 (2022) - [j36]Michele Dall'Arno
Guesswork of a Quantum Ensemble. IEEE Trans. Inf. Theory 68(5): 3139-3143 (2022) - 2021
- [j35]Mohammad Shahedul Islam, Md. Abul Kashem Mia, Mohammad Shamsur Rahman, Mohammad Shamsul Arefin, Pranab Kumar Dhar, Takeshi Koshiba
Frequent contiguous pattern mining over biological sequences of protein misfolded diseases. BMC Bioinform. 22(1): 435 (2021) - [j34]Tushar Kanti Saha
Efficient Private Conjunctive Query Protocol Over Encrypted Data. Cryptogr. 5(1): 2 (2021) - [j33]Behrouz Zolfaghari
Content Delivery Networks: State of the Art, Trends, and Future Roadmap. ACM Comput. Surv. 53(2): 34:1-34:34 (2021) - [j32]Sabiha Anan
Image Defogging Framework Using Segmentation and the Dark Channel Prior. Entropy 23(3): 285 (2021) - [j31]Arifa Sultana, Kaushik Deb
Classification of Indoor Human Fall Events Using Deep Learning. Entropy 23(3): 328 (2021) - [j30]Behrouz Zolfaghari
Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis. Entropy 23(11): 1459 (2021) - [j29]Anik Sen
CricShotClassify: An Approach to Classifying Batting Shots from Cricket Videos Using a Convolutional Neural Network and Gated Recurrent Unit. Sensors 21(8): 2846 (2021) - [j28]Syed Mohammad Minhaz Hossain
Plant Leaf Disease Recognition Using Depth-Wise Separable Convolution-Based Models. Symmetry 13(3): 511 (2021) - [i18]Michele Dall'Arno, Francesco Buscemi, Takeshi Koshiba:
Classical computation of quantum guesswork. CoRR abs/2112.01666 (2021) - 2020
- [j27]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba
Almost Fully Secured Lattice-Based Group Signatures with Verifier-Local Revocation. Cryptogr. 4(4): 33 (2020) - [j26]Vikrant Singh, Behrouz Zolfaghari
Generalized Mm, r-Network: A Case for Fixed Message Dimensions. IEEE Commun. Lett. 24(1): 38-42 (2020) - [j25]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba:
Combined interactive protocol for lattice-based group signature schemes with verifier-local revocation. Int. J. Grid Util. Comput. 11(5): 662-673 (2020) - [j24]Tushar Kanti Saha, Deevashwer Rathee, Takeshi Koshiba:
Efficient protocols for private wildcards pattern matching. J. Inf. Secur. Appl. 55: 102609 (2020) - [j23]Farhana Shirin Chowdhury, Pranab Kumar Dhar, Kaushik Deb, Takeshi Koshiba
Blind Image Watermarking in Canonical and Cepstrum Domains Based on 4-Connected t-o'clock Scrambling. Symmetry 12(2): 266 (2020) - [j22]Pranab Kumar Dhar, Azizul Hakim Chowdhury, Takeshi Koshiba
Blind Audio Watermarking Based on Parametric Slant-Hadamard Transform and Hessenberg Decomposition. Symmetry 12(3): 333 (2020) - [c51]Takeshi Koshiba:
Fourier-based Verifiable Function Secret Sharing. ISITA 2020: 442-446 - [c50]Lihua Wang, Tushar Kanti Saha
Enhanced Secure Comparison Schemes Using Homomorphic Encryption. NBiS 2020: 211-224 - [i17]Maiki Fujita, Takeshi Koshiba, Kenji Yasunaga:
Perfectly Secure Message Transmission against Rational Adversaries. CoRR abs/2009.07513 (2020)
2010 – 2019
- 2019
- [j21]Tushar Kanti Saha
Efficient private database queries using ring-LWE somewhat homomorphic encryption. J. Inf. Secur. Appl. 49 (2019) - [j20]Tomoyuki Morimae, Takeshi Koshiba:
Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client. Quantum Inf. Comput. 19(3&4): 214-221 (2019) - [j19]Go Sato, Takeshi Koshiba
Arbitrable blind quantum computation. Quantum Inf. Process. 18(12): 370 (2019) - [c49]Kenji Yasunaga
Perfectly Secure Message Transmission Against Independent Rational Adversaries. GameSec 2019: 563-582 - [c48]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba:
A Guests Managing System with Lattice-Based Verifier-Local Revocation Group Signature Scheme with Time-Bound Keys. ICMC 2019: 81-96 - [i16]Masahito Hayashi, Takeshi Koshiba:
Verifiable Quantum Secure Modulo Summation. CoRR abs/1910.05976 (2019) - 2018
- [j18]Ei Mon Cho, Lwin San, Takeshi Koshiba:
Non-transferable proxy re-encryption for multiple groups. Int. J. Space Based Situated Comput. 8(1): 20-29 (2018) - [j17]Tushar Kanti Saha
Outsourcing private equality tests to the cloud. J. Inf. Secur. Appl. 43: 83-98 (2018) - [j16]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba:
Achieving Strong Security and Member Registration for Lattice-based Group Signature Scheme with Verifier-local Revocation. J. Internet Serv. Inf. Secur. 8(4): 1-15 (2018) - [c47]Maiki Fujita, Kenji Yasunaga
Perfectly Secure Message Transmission Against Rational Timid Adversaries. GameSec 2018: 127-144 - [c46]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba
Achieving Full Security for Lattice-Based Group Signatures with Verifier-Local Revocation. ICICS 2018: 287-302 - [c45]Takeshi Koshiba
New Assumptions on Isogenous Pairing Groups with Applications to Attribute-Based Encryption. ICISC 2018: 3-19 - [c44]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba
Almost-Fully Secured Fully Dynamic Group Signatures with Efficient Verifier-Local Revocation and Time-Bound Keys. IDCS 2018: 134-147 - [c43]Masahito Hayashi, Takeshi Koshiba
Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication. ISIT 2018: 2614-2618 - [c42]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba
Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation. ISPEC 2018: 229-247 - [c41]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba:
Zero-Knowledge Proof for Lattice-Based Group Signature Schemes with Verifier-Local Revocation. NBiS 2018: 772-782 - [c40]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba
Achieving Strong Security and Verifier-Local Revocation for Dynamic Group Signatures from Lattice Assumptions. STM 2018: 3-19 - [i15]Masahito Hayashi, Takeshi Koshiba:
Secure Modulo Zero-Sum Randomness as Cryptographic Resource. IACR Cryptol. ePrint Arch. 2018: 802 (2018) - 2017
- [j15]Takeshi Koshiba:
Foreword. IEICE Trans. Inf. Syst. 100-D(3): 413 (2017) - [j14]Masaya Yasuda, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, Takeshi Koshiba
Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors. J. Math. Cryptol. 11(1): 1-24 (2017) - [c39]Tushar Kanti Saha
Private Conjunctive Query over Encrypted Data. AFRICACRYPT 2017: 149-164 - [c38]Maharage Nisansala Sevwandi Perera, Takeshi Koshiba:
Fully Secure Lattice-Based Group Signatures with Verifier-Local Revocation. AINA 2017: 795-802 - [c37]Ei Mon Cho, Takeshi Koshiba
Secure Deduplication in a Multiple Group Signature Setting. AINA 2017: 811-818 - [c36]Ei Mon Cho, Takeshi Koshiba
Big Data Cloud Deduplication Based on Verifiable Hash Convergent Group Signcryption. BigDataService 2017: 265-270 - [c35]Tushar Kanti Saha
Efficient Protocols for Private Database Queries. DBSec 2017: 337-348 - [c34]Tushar Kanti Saha
Privacy-Preserving Equality Test Towards Big Data. FPS 2017: 95-110 - [c33]Tushar Kanti Saha
Private Comparison Protocol and Its Application to Range Queries. IDCS 2017: 128-141 - [c32]Ei Mon Cho, Takeshi Koshiba
Secure SMS Transmission Based on Verifiable Hash Convergent Group Signcryption. MDM 2017: 332-335 - [c31]Tushar Kanti Saha
An Efficient Privacy-Preserving Comparison Protocol. NBiS 2017: 553-565 - [c30]Takuya Ohsawa, Naruhiro Kurokawa, Takeshi Koshiba
Function Secret Sharing Using Fourier Basis. NBiS 2017: 865-875 - [c29]Ei Mon Cho, Lwin San, Takeshi Koshiba:
Secure Non-transferable Proxy Re-encryption for Group Membership and Non-membership. NBiS 2017: 876-887 - [i14]Masahito Hayashi, Takeshi Koshiba:
Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority. CoRR abs/1701.04470 (2017) - [i13]Ryota Iwamoto, Takeshi Koshiba:
Non-Malleable Codes Against Affine Errors. CoRR abs/1701.07914 (2017) - [i12]Takeshi Koshiba:
Fourier-based Function Secret Sharing with General Access Structure. CoRR abs/1712.00735 (2017) - [i11]Maiki Fujita, Takeshi Koshiba:
Perfectly Secure Message Transmission Scheme against Rational Adversaries. IACR Cryptol. ePrint Arch. 2017: 309 (2017) - [i10]Masahito Hayashi, Takeshi Koshiba:
Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority. IACR Cryptol. ePrint Arch. 2017: 457 (2017) - 2016
- [c28]Tushar Kanti Saha
An Enhancement of Privacy-Preserving Wildcards Pattern Matching. FPS 2016: 145-160 - [i9]Takeshi Koshiba, Katsuyuki Takashima:
Pairing Cryptography Meets Isogeny: A New Framework of Isogenous Pairing Groups. IACR Cryptol. ePrint Arch. 2016: 1138 (2016) - 2015
- [j13]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
New packing method in somewhat homomorphic encryption and its applications. Secur. Commun. Networks 8(13): 2194-2213 (2015) - [c27]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption. ACISP 2015: 471-487 - [c26]Masaya Yasuda, Takeshi Koshiba
Secure Data Devolution: Practical Re-encryption with Auxiliary Data in LWE-based Somewhat Homomorphic Encryption. SCC@ASIACCS 2015: 53-61 - [c25]Masaya Yasuda, Takeshi Shimoyama, Narishige Abe, Shigefumi Yamada, Takashi Shinzaki, Takeshi Koshiba
Privacy-Preserving Fuzzy Commitment for Biometrics via Layered Error-Correcting Codes. FPS 2015: 117-133 - 2014
- [j12]Masaya Yasuda, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, Takeshi Koshiba
On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption. J. Math. Cryptol. 8(3): 305-329 (2014) - [c24]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption. ACISP 2014: 338-353 - [i8]Ryuhei Mori, Takeshi Koshiba, Osamu Watanabe, Masaki Yamamoto:
Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets. CoRR abs/1406.0373 (2014) - 2013
- [c23]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics. CD-ARES Workshops 2013: 55-74 - [c22]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
Secure pattern matching using somewhat homomorphic encryption. CCSW 2013: 65-76 - [c21]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
Practical Packing Method in Somewhat Homomorphic Encryption. DPM/SETOP 2013: 34-50 - 2012
- [j11]Akinori Kawachi, Takeshi Koshiba
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. J. Cryptol. 25(3): 528-555 (2012) - [p1]Takeshi Koshiba
Quantum Cryptography. Handbook of Natural Computing 2012: 1521-1543 - 2010
- [c20]Takeshi Koshiba
Public Discussion Must Be Back and Forth in Secure Message Transmission. ICISC 2010: 325-337
2000 – 2009
- 2009
- [c19]Kai-Yuen Cheong, Takeshi Koshiba
Strengthening the Security of Distributed Oblivious Transfer. ACISP 2009: 377-388 - [c18]Kai-Yuen Cheong, Takeshi Koshiba
Reducing Complexity Assumptions for Oblivious Transfer. IWSEC 2009: 110-124 - [c17]Takeshi Koshiba
Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function. TCQ 2009: 33-46 - 2008
- [j10]Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions. IEEE Trans. Inf. Theory 54(6): 2566-2571 (2008) - [c16]Kaoru Kurosawa, Takeshi Koshiba
Simple Direct Reduction of String (1, 2)-OT to Rabin's OT without Privacy Amplification. ICITS 2008: 199-209 - [i7]Kai-Yuen Cheong, Takeshi Koshiba:
Reducing Complexity Assumptions for Oblivious Transfer. IACR Cryptol. ePrint Arch. 2008: 140 (2008) - 2007
- [j9]Tetsuya Izu, Jun Kogure, Takeshi Koshiba
Low-density attack revisited. Des. Codes Cryptogr. 43(1): 47-59 (2007) - [j8]Kai-Yuen Cheong, Takeshi Koshiba
More on Security of Public-Key Cryptosystems Based on Chebyshev Polynomials. IEEE Trans. Circuits Syst. II Express Briefs 54-II(9): 795-799 (2007) - [i6]Kaoru Kurosawa, Takeshi Koshiba:
Direct Reduction of String (1, 2)-OT to Rabin's OT. IACR Cryptol. ePrint Arch. 2007: 46 (2007) - [i5]Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba:
How to Derive Lower Bound on Oblivious Transfer Reduction. IACR Cryptol. ePrint Arch. 2007: 65 (2007) - [i4]Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi Shimoyama:
Low-Density Attack Revisited. IACR Cryptol. ePrint Arch. 2007: 66 (2007) - 2006
- [j7]Akinori Kawachi, Takeshi Koshiba:
Progress in Quantum Computational Cryptography. J. Univers. Comput. Sci. 12(6): 691-709 (2006) - [i3]Takeshi Koshiba, Yoshiharu Seri:
Round-Efficient One-Way Permutation Based Perfectly Concealing Bit Commitment Scheme. Electron. Colloquium Comput. Complex. TR06 (2006) - [i2]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami:
Computational Indistinguishability between Quantum States and Its Cryptographic Application. IACR Cryptol. ePrint Arch. 2006: 148 (2006) - 2005
- [j6]Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba
Universal test for quantum one-way permutations. Theor. Comput. Sci. 345(2-3): 370-385 (2005) - [c15]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT 2005: 268-284 - 2004
- [j5]Masahiko Takenaka, Takeshi Shimoyama, Takeshi Koshiba:
Theoretical Analysis of chi2 Attack on RC6. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A(1): 28-36 (2004) - [c14]Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra:
Universal Test for Quantum One-Way Permutations. MFCS 2004: 839-850 - [c13]Takeshi Koshiba, Kaoru Kurosawa:
Short Exponent Diffie-Hellman Problems. Public Key Cryptography 2004: 173-186 - 2003
- [c12]Masahiko Takenaka, Takeshi Shimoyama, Takeshi Koshiba
Theoretical Analysis of chi2 Attack on RC6. ACISP 2003: 142-153 - 2002
- [c11]Takeshi Shimoyama, Masahiko Takenaka, Takeshi Koshiba:
Multiple Linear Cryptanalysis of a Reduced Round RC6. FSE 2002: 76-88 - [c10]Takeshi Koshiba
On Sufficient Randomness for Secure Public-Key Cryptosystems. Public Key Cryptography 2002: 34-47 - [i1]Masahiko Takenaka, Takeshi Shimoyama, Takeshi Koshiba:
Theoretical Analysis of "Correlations in RC6". IACR Cryptol. ePrint Arch. 2002: 176 (2002) - 2001
- [c9]Takeshi Koshiba
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata. ISAAC 2001: 268-278 - [c8]Takeshi Koshiba:
A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes. Public Key Cryptography 2001: 87-103 - 2000
- [j4]Takeshi Koshiba, Erkki Mäkinen, Yuji Takada:
Inferring pure context-free languages from positive data. Acta Cybern. 14(3): 469-477 (2000) - [c7]Takeshi Koshiba, Kunihiko Hiraishi:
A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples. Words, Languages & Combinatorics 2000: 253-265
1990 – 1999
- 1999
- [c6]Takeshi Koshiba
A Technique for Boosting the Security of Cryptographic Systems with One-Way Hash Functions. ICISC 1999: 76-81 - 1998
- [c5]Kazuo Misue, Kiyoshi Nitta
Enhancing D-ABDUCTOR towards a diagrammatic user interface platform. KES (1) 1998: 359-368 - 1997
- [j3]Takeshi Koshiba:
On a Hierarchy of Slender Languages Based on Control Sets. Fundam. Informaticae 31(1): 41-47 (1997) - [j2]Takeshi Koshiba
Learning Deterministic even Linear Languages From Positive Examples. Theor. Comput. Sci. 185(1): 63-79 (1997) - [c4]Takeshi Koshiba:
Computational learning theoretic cryptanalysis of language theoretic cryptosystems. ICICS 1997: 28-38 - 1996
- [j1]Yasubumi Sakakibara, Kazuo Misue, Takeshi Koshiba:
A machine learning approach to knowledge acquisitions from text databases. Int. J. Hum. Comput. Interact. 8(3): 309-324 (1996) - [c3]Takeshi Koshiba
Decision Tree Learning Systems with Switching Evaluators. AI 1996: 349-361 - 1995
- [c2]Takeshi Koshiba, Erkki Mäkinen, Yuji Takada:
Learning Strongly Deterministic Even Linear Languages from Positive Examples. ALT 1995: 41-54 - [c1]Takeshi Koshiba:
Typed pattern languages and their learnability. EuroCOLT 1995: 367-379
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 21:15 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: