default search action
ISITA 2018: Singapore
- International Symposium on Information Theory and Its Applications, ISITA 2018, Singapore, October 28-31, 2018. IEEE 2018, ISBN 978-4-88552-318-2
Mo-AM-1-1: Deletion/DNA Codes
- Takehiko Mori, Manabu Hagiwara:
Cardinalities of BAD Correcting Codes. 1-5 - Toyohiko Saeki, Takayuki Nozaki
:
An Improvement of Non-binary Code Correcting Single b-Burst of Insertions or Deletions. 6-10 - Justin Kong, David J. Webb, Manabu Hagiwara:
Formalization of Insertion/Deletion Codes and the Levenshtein Metric in Lean. 11-15 - Mu Zhang, Kui Cai, Kees A. Schouhamer Immink, Pingping Chen:
Soft-Decision Decoding for DNA-Based Data Storage. 16-20 - Ramy F. Taki ElDin
On Constant GC-content Cyclic DNA Codes With Long Codewords. 21-25
Mo-AM-1-2: Machine Learning (Invited Session)
- Yasuo Tabei:
Scalable Machine Learning on Compact Data Representations. 26-30 - Mohammad Emtiyaz Khan, Didrik Nielsen:
Fast yet Simple Natural-Gradient Descent for Variational Inference in Complex Models. 31-35 - Wataru Kumagai:
Introduction to Bandit Convex Optimization Algorithms. 36-39 - Kohei Hatano:
Combinatorial Online Prediction. 40-44
Mo-AM-1-3: Statistical Analysis
- Masahiro Kobayashi
Generalized Dirichlet-Process-Means for Robust and Maximum Distortion Criteria. 45-49 - Frédérique E. Oggier, Silivanxay Phetsouvanh, Anwitaman Datta
Entropic Centrality for non-atomic Flow Networks. 50-54 - Andre Wibisono, Varun S. Jog:
Convexity of mutual information along the Ornstein-Uhlenbeck flow. 55-59 - Yuji Iikubo, Shunsuke Horii, Toshiyasu Matsushima:
Sparse Bayesian Hierarchical Mixture of Experts and Variational Inference. 60-64 - Sultan Alam
On Enumerating Distributions for Associated Vectors in the Entropy Space. 65-69
Mo-AM-1-4: Signature Schemes
- Chik How Tan, Theo Fanuela Prabowo
Rank Metric Code-based Signature. 70-74 - Masayuki Fukumitsu, Shingo Hasegawa:
A Generic Construction of an Identity-based Signature from a Sigma Protocol. 75-79 - Nasima Begum
Efficiency Improvement in Group Signature Scheme with Probabilistic Revocation. 80-84 - Ai Ishida, Yusuke Sakai, Goichiro Hanaoka:
A Consideration on the Transformation from Deniable Group Signature to Disavowable PKENO. 85-89
Mo-PM-1-1: Index/Network Coding
- Motohiko Isaka:
Expected Error Rate of Probabilistic Network Codes over Gaussian Relay Network. 90-94 - Mahesh Babu Vaddi, B. Sundar Rajan:
Reduced Dimensional Optimal Vector Linear Index Codes for Index Coding Problems with Symmetric Neighboring and Consecutive Side-information. 95-99 - Karanam Vikas Bharadwaj, B. Sundar Rajan:
Index Codes for Interlinked Cycle Structures with Outer Cycles. 100-104 - Chinmayananda Arunachala, B. Sundar Rajan:
Optimal Scalar Linear Index Codes for Some Two-Sender Unicast Index Coding Problems. 105-109 - Mahesh Babu Vaddi, B. Sundar Rajan:
On the Broadcast Rate of Index Coding Problems with Symmetric and Consecutive Interference. 110-114
Mo-PM-1-2: Non-Asymptotic Information Theory (Invited Session)
- Anelia Somekh-Baruch:
Information Spectrum Analysis for Mismatched Decoding. 115-119 - Wei Yang, Rafael F. Schaefer
Privacy Amplification: Recent Developments and Applications. 120-124 - Josep Font-Segura
Asymptotics of the Random Coding Union Bound. 125-129 - Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
Connections Between the Error Probability and the r-wise Hamming Distances. 130-134
Mo-PM-1-3: Communication Systems
- Kui Cai, Kees A. Schouhamer Immink:
Detection of Noisy and Corrupted Data Using Clustering Techniques. 135-138 - Akira Osamura, Guanghui Song, Jun Cheng, Kui Cai:
Sparse Multiple Access and Code Design with Near Channel Capacity Performance. 139-143 - Dongshin Yang, Yutaka Jitsumatsu:
Super Resolution Channel Estimation with Spread Spectrum Signal and Atomic Norm Minimization. 144-148 - Mohammad Nur Hasan, Brian M. Kurkoski:
An Efficient Strategy for Applying Compute-and-Forward to the MARC. 149-153 - Asit Kumar Pradhan, Andrew Thangaraj:
Block-error Threshold Analysis of Protographs in 5G-Standard. 154-158
Mo-PM-1-4: Security Models and Protocols
- Yusuke Kawamoto
On the Anonymization of Differentially Private Location Obfuscation. 159-163 - Takao Murakami:
A Succinct Model for Re-identification of Mobility Traces Based on Small Training Data. 164-168 - Yuto Ehara, Mitsuru Tada:
How to generate transparent random numbers using blockchain. 169-173 - Ken Naganuma, Masayuki Yoshino, Hisayoshi Sato, Nishio Yamada, Takayuki Suzuki, Noboru Kunihiro
Decentralized Netting Protocol over Consortium Blockchain. 174-177 - Cheng-Ta Huang, Hung-Jui Ko, Zhi-Wei Zhuang, Ping-Cheng Shih, Shiuh-Jeng Wang:
Mobile Forensics for Cloud Storage Service on iOS Systems. 178-182
Mo-PM-2-1: Lattice and Closest Vector Problem
- Fan Zhou, Brian Michael Kurkoski:
Shaping Gain of Lattices Based on Convolutional Codes and Construction A. 183-187 - Warangrat Wiriya, Brian M. Kurkoski:
Reliability-Based Parametric LDLC Decoding. 188-192 - Ferdinand Blomqvist, Marcus Greferath:
The Double-Plane Algorithm: A simple algorithm for the closest vector problem. 193-197 - Ferdinand Blomqvist:
On quotient metrics and decoding problems. 198-202 - Masanori Hirotomo, Hiroto Tamiya, Masakatu Morii:
Further Results on the Error Correction Capability of Irregular LDPC Codes under the Gallager A Algorithm. 203-207
Mo-PM-2-2: Cryptographic Protocols (1)
- Satoshi Furukawa, Noboru Kunihiro
Multi-party Key Exchange Protocols from Supersingular Isogenies. 208-212 - SeongHan Shin:
Secure Hybrid Authentication Protocols against Malicious Key Generation Center. 213-217 - Yohei Watanabe, Yoshihisa Kuroki, Shinnosuke Suzuki, Yuta Koga, Mitsugu Iwamoto, Kazuo Ohta:
Card-Based Majority Voting Protocols with Three Inputs Using Three Cards. 218-222 - Koutaro Okada, Hiroki Koga:
A Construction of the (4, n)-Threshold Visual Cryptography Scheme Using a 3-Design. 223-227 - Yuji Suga:
An algebraic interpretation of the XOR-based Secret Sharing Schemes. 228-231
Mo-PM-2-3: Graph-Based Analysis / Network Coding
- Niladri Das, Brijesh Kumar Rai:
On the Power of Vector Linear Network Coding. 232-236 - Yuta Kumano, Yoshiyuki Sakamaki, Hironori Uchikawa:
Complete Multipartite Graph Codes. 237-241 - Frédérique E. Oggier, Silivanxay Phetsouvanh, Anwitaman Datta
Entropy-based Graph Clustering - A Simulated Annealing Approach. 242-246 - Takafumi Nakano, Tadashi Wadayama:
Analysis on Probabilistic Construction of Connected Dominating Sets over Regular Graph Ensembles. 247-251 - Satoshi Takabe, Tadashi Wadayama:
k-connectivity of Random Graphs and Random Geometric Graphs in Node Fault Model. 252-256
Mo-PM-2-4: Error Probability Analysis
- Hideki Yoshikawa:
Error Performance Analysis of the K-best Viterbi Decoding Algorithm. 257-260 - Toshihiro Niinomi, Hideki Yagi, Shigeichi Hirasawa:
Decision Feedback Scheme with Criterion LR+Th for the Ensemble of Linear Block Codes. 261-265 - Anshoo Tandon, Mehul Motani:
On the Sphere Packing Error Exponent for Constant Subblock-Composition Codes. 266-270 - Tadashi Tomizuka, Riku Iwanaga, Ikuo Oka, Shingo Ata:
Exact Analysis for Error Probability of Max-Log-MAP Decoding in Sequence Dependent Channels. 271-275 - Tomohiko Uyematsu, Tetsunao Matsuta:
Error Exponents of Joint Channel Coding and Intrinsic Randomness for Memoryless Channels. 276-280
Tu-AM-1-1: Erasure Correction
- Yuta Hanaki, Takayuki Nozaki
Erasure Correcting Codes by Using Shift Operation and Exclusive OR. 281-285 - Yoshihiro Murayama, Takayuki Nozaki
Efficient Scheduling of Serial Iterative Decoding for Zigzag Decodable Fountain Codes. 286-290 - Tomokazu Emoto, Takayuki Nozaki
Shifted Coded Slotted ALOHA. 291-295 - Fedor I. Ivanov, Alexey Kreshchuk
On the Local Erasure Correction Capacity of Convolutional Codes. 296-300 - Arti D. Yardi
Blind Reconstruction of Binary Cyclic Codes over Binary Erasure Channel. 301-305
Tu-AM-1-2: Practical Security
- Shota Terada, Hideto Nakano, Shinya Okumura, Atsuko Miyaji
An Experimental Analysis on Lattice Attacks against Ring-LWE over Decomposition Fields. 306-310 - Tadanori Teruya:
An Observation on the Randomness Assumption over Lattices. 311-315 - Tetsuya Hirakawa, Kanayo Ogura, Bhed Bahadur Bista, Toyoo Takata:
An Analysis of a Defence Method against Slow HTTP DoS Attack. 316-320 - Hiroshi Yamamoto, Kazuki Sano:
A Watermarking Method for Embedding into the External Shapes of Objects. 321-325 - Hiroyuki Okazaki
Suitable Symbolic Models for Cryptographic Verification of Secure Protocols in ProVerif. 326-330
Tu-AM-1-3: Quantum Information (1)
- Ryutaroh Matsumoto:
Exploring Quantum Supremacy in Access Structures of Secret Sharing by Coding Theory. 331-333 - Arun John Moncy, Pradeep Kiran Sarvepalli:
Performance of Nonbinary Cubic Codes. 334-338 - Ayumu Nakayama, Masakazu Yoshida, Jun Cheng:
Quantum Key Distribution using Extended Mean King's Problem. 339-343 - Tiancheng Wang
Error performance and robustness of optimum quantum detection for MPSK signals in the presence of phase noise. 344-348
Tu-AM-1-4: Shannon Theory
- Shigeaki Kuzuoka:
A Study on the Problem of Channel Resolvability for Channels with Countable Input Alphabet. 349-353 - Jun Yoshizawa, Shota Saito
Variable-Length Intrinsic Randomness Allowing Positive Value of the Average Variational Distance. 354-358 - Shota Saito
New Results on Variable-Length Lossy Compression Allowing Positive Overflow and Excess Distortion Probabilities. 359-363 - Ryo Nomura
Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability. 364-368 - Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable Rate Regions for Source Coding with Delayed Partial Side Information. 369-373
Tu-PM-1-1: LDPC Codes
- Ryo Shibata, Gou Hosoya, Hiroyuki Yashima:
Structured Concatenation of Protograph LDPC Codes and Markers for Insertion/Deletion Channels. 374-378 - Kengo Shibata, Shan Lu, Masakazu Yoshida, Krishna R. Narayanan, Jun Cheng:
Error Floor Estimation of Spatially-Coupled Irregular LDPC Code Ensembles. 379-383 - Pavel S. Rybin
On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes. 384-388
Tu-PM-1-2: Post-Quantum Cryptography (Invited Session)
- Yasuhiko Ikematsu, Koichiro Akiyama, Tsuyoshi Takagi:
An Improvement on the Linear Algebraic Attack for the Indeterminate Equation Encryption Scheme. 389-393 - Bagus Santoso
A New Three-Pass Code-based Zero-Knowledge Identification Scheme with Cheating Probability of Exactly Half. 394-398 - Hyungrok Jo, Yoshinori Yamasaki:
LPS-type Ramanujan graphs. 399-403
Tu-PM-1-3: Applications of Information Theory
- Boris Ryabko, Anton Rakitskiy
Investigation of the Processors Evolution Using the Computer Capacity. 404-408 - Nobuhiro Mikami, Kanji Mashita, Naoyuki Aikawa:
Adaptive Notch Howling Canceller Using Group Delay Information. 409-412 - Takaya Miyano, Kenichiro Cho:
Chaos-Based Stream Cipher Using a Star Network of Chaotic Maps. 413-417
Tu-PM-1-4: Compressed Sensing
- Tomoki Tamai, Koujin Takeda:
Variational Bayes method for matrix factorization to two sparse factorized matrices. 418-422 - Wen-Yao Chen, Chung-Chin Lu:
Recovery Guarantee of Sparse Binary Sensing Matrices under Greedy Algorithm. 423-426 - Minori Ihara, Kazunori Iwata, Nobuo Suematsu, Kazushi Mimura:
Typical Performance of Sparse Signal Recovery from a Linear Measurement with Large Coherence. 427-431
Tu-PM-2-1: Polar Codes
- Kai-Hsin Wang, Wei Hou, Shan Lu, Ping-Yuen Wu, Yeong-Luh Ueng
Improving Polar Codes by Spatial Coupling. 432-436 - Prakash Chaki
On the Properties of Bit-Reversal Shortening in Polar Codes. 437-441 - Ruslan Alexandrovich Morozov, Peter Trifonov:
Efficient SC Decoding of Convolutional Polar Codes. 442-446
Tu-PM-2-2: Symmetric Key Cryptography
- Nobuyuki Sugio, Yasutaka Igarashi, Toshinobu Kaneko:
Integral Cryptanalysis of Reduced-round KASUMI. 447-451 - Yusuke Matsuoka, Atsuko Miyaji
Revisited Diffusion Analysis of Salsa and ChaCha. 452-456 - Hidenori Kuwakado, Shoichi Hirose, Masahiro Mambo:
Parallelizable Message Preprocessing for Merkle-Damgård Hash Functions. 457-461
Tu-PM-2-3: Quantum Information (2)
- Walter O. Krawec, Eric P. Geiss:
Semi-Quantum Key Distribution with Limited Measurement Capabilities. 462-466 - Keita Ishikawa, Tiancheng Wang
Effect of Non-Symmetric Loss on Quantum Reading Using a Quasi-Bell State. 467-471 - Souichi Takahira, Tsuyoshi Sasaki Usuda:
Applying a symmetrization method by coding to non-symmetric mixed-state signals. 472-475
Tu-PM-2-4: Sequences
- Takafumi Hayashi
A Novel Construction of Quadtree-structured Zero-correlation Zone Sequence Sets. 476-480 - Tetsuya Kojima:
Hadamard-type Matrices on Finite Fields and Their Applications to Sequence Generation. 481-485 - Shunsuke Araki, Hideyuki Muraoka, Takeru Miyazaki, Satoshi Uehara, Ken'ichi Kakizaki:
A Study on Computational Methods of the Logistic Map over Integers for a Pseudorandom Number Generator. 486-490
We-AM-1-1: Coding for Various Models
- Ming Hui Jovan Lee, Ivan Tjuawinata, Han Mao Kiah:
Reducing the Average Delay in Gradient Coding. 491-495 - Yanling Chen, A. J. Han Vinck:
Some classes of systematic polynomial codes correcting single- and adjacent transposition errors. 496-500 - Yeow Meng Chee
Codes for Endurance-Limited Memories. 501-505 - Victor Buttigieg, Johann A. Briffa:
Time-Varying Variable-Length Error-Correcting Codes. 506-510 - Hsiang-Shun Shih, Chih-Shin Wang, Chia-Chun Chen, Mao-Chao Lin:
Tree-Search Decoding Using Reduced-Size Stacks. 511-515
We-AM-1-2: Cryptographic Protocols (2)
- Yuma Kanai, Kazuki Yoneyama:
On Hiding Access Timings in ORAM. 516-519 - Shintaro Terada, Kazuki Yoneyama:
Improved Verifiable Delegated Private Set Intersection. 520-524 - Hiraku Morita
Tree-based Secure Comparison of Secret Shared Data. 525-529 - Hiraku Morita
Secure Division Protocol and Applications to Privacy-preserving Chi-squared Tests. 530-534 - Satsuya Ohata, Hiraku Morita
Accuracy/Efficiency Trade-Off for Privacy-Preserving Division Protocol. 535-539
We-AM-1-3: Data Compression
- Nozomi Miya, Takahiro Yoshida, Hajime Jinushi:
A Consideration on Classification of Extended Binary Memoryless Sources Under Which Distinct Huffman Codes Are Constructed. 540-544 - Tomotaka Hiraoka, Hirosuke Yamamoto
Dynamic AIFV Coding. 545-549 - T. Aaron Gulliver, Ulrich Speidel, Niko Rebenich:
A Note on Lempel-Ziv Parser Tails and Substring Lengths. 550-554 - Takahiro Ota, Hiroyoshi Morita, Akiko Manada:
Compression by Substring Enumeration with a Finite Alphabet Using Sorting. 555-559
We-AM-1-4: Multiuser Information Theory
- Fedor I. Ivanov, Pavel S. Rybin
Novel Signal-Code Construction for Multiple Access System over Vector-Disjunctive Channel. 560-564 - Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe:
Recursive Construction of k-Ary Uniquely Decodable Codes for Multiple-Access Adder Channel. 565-569 - Lóránt Farkas, Tamás Kói
Contributions to Successive Decoding for Multiple Access Channels. 570-574 - Haruhiko Kaneko:
Slepian-Wolf Coding with Side-Information Having Insertion/Deletion Errors. 575-579 - Jun Muramatsu
Multi-Terminal Codes Using Constrained-Random-Number Generators. 580-584
We-PM-1-1: Bounds and Metrics
- Anshoo Tandon, Han Mao Kiah, Mehul Motani:
Improved Asymptotic Sphere-Packing Bounds for Subblock-Constrained Codes. 585-589 - Juliana Hildebrandt
Lower Bound-oriented Parameter Calculation for AN Coding. 590-594 - Danny Dubé:
Arbitrarily Low Redundancy Construction of Balanced Codes Using Realistic Resources. 595-599 - Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
An Upper Bound on the Generalized Cayley Distance. 600-604 - Jos H. Weber, Kees A. Schouhamer Immink:
Properties of Binary Pearson Codes. 605-609
We-PM-1-2: Cryptanalysis
- Ryuichi Sakai, Yasuyuki Murakami:
Equivalent Secret Key Attack against Knapsack PKC based on Subset Sum Decision Problem. 610-613 - Yasuyuki Murakami, Ryuichi Sakai:
Security of Knapsack Cryptosystem Using Subset-Sum Decision Problem against Alternative-Solution Attack. 614-617 - Yoshinori Uetake, Akihiro Sanada, Takuya Kusaka, Yasuyuki Nogami, Leo Weissbart, Sylvain Duquesne:
Side-Channel Attack using Order 4 Element against Curve25519 on ATmega328P. 618-622 - Ken Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker
A Study on the Parameter Size of the Montgomery Trick for ECDLP. 623-627 - Ken Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker
A Study on the Parameter of the Distinguished Point Method in Pollard's Rho Method for ECDLP. 628-632
We-PM-1-3: Data Compression and Related Topics
- Reynald Affeldt
Examples of Formal Proofs about Data Compression. 633-637 - Hidetoshi Yokoo, Toshiki Shimizu:
Probability Approximation in Asymmetric Numeral Systems. 638-642 - Hiroshi Fujisaki:
Invariant Measures for the Subshifts Associated with the Asymmetric Binary Systems. 643-647 - Shivkumar K. Manickam, Navin Kashyap:
On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint. 648-652
We-PM-1-4: Information Theoretic Security / Multiterminal
- Shahab Ghasemi-Goojani, Panagiotis Papadimitratos:
On the Capacity of State-Dependent Gaussian Z-Interference Channel. 653-657 - Viswanathan Ramachandran
State-Dependent Gaussian Broadcast Channel with Common State Reconstructions. 658-662 - Aditya Sinha, Parthajit Mohapatra, Jemin Lee, Tony Q. S. Quek
On the Secrecy Capacity of 2-user Gaussian Interference Channel with Independent Secret Keys. 663-667 - Mohammed Ahmed Salem, Azlan Abdul Aziz, Mohamad Yusoff Bin Alias
Secrecy Performance on Half-Duplex Two-Way Multi-Relay Transmission Technique Under Wireless Physical Layer Security. 668-672 - Shahab Ghasemi-Goojani, Panagiotis Papadimitratos:
The Symmetric Two-Hop Channel with an Untrusted Relay. 673-677
We-PM-2-1: Applications of Algebraic Coding
- Chong-Dao Lee:
New Locator Polynomials for Cyclic Codes. 678-682 - Swaminathan Ramabadran
Joint Reconstruction of Reed-Solomon Encoder and Convolutional Interleaver in a Noisy Environment. 683-687 - Wentu Song, Kui Cai:
Some Constructions of Optimal Locally Repairable Codes. 688-692 - Roy D. Cideciyan, Simeon Furrer, Mark A. Lantz:
Shortened Cyclic Codes for Correcting and Detecting Burst Errors. 693-697
We-PM-2-2: Public-Key Cryptography
- Takahiro Matsuda, Jacob C. N. Schuldt:
A New Key Encapsulation Combiner. 698-702 - Yusuke Sakai, Goichiro Hanaoka:
A Remark on an Identity-Based Encryption Scheme with Non-interactive Opening. 703-706 - Junichiro Hayata, Masahito Ishizaka, Yusuke Sakai, Goichiro Hanaoka, Kanta Matsuura
Generic Construction of Adaptively Secure Anonymous Key-Policy Attribute-Based Encryption from Public-Key Searchable Encryption. 707-711 - Ryo Kato, Naohisa Nishida, Ryo Hirano, Tatsumi Oba, Yuji Unagami, Shota Yamada, Tadanori Teruya, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka:
Embedding Lemmas for Functional Encryption. 712-716
We-PM-2-3: Fundamentals of Information Theory
- Munenori Eto, Masanori Kawakita, Jun'ichi Takeuchi:
Asymptotic Behavior of Typical Sets and the Smallest High Probability Set. 717-721 - Shun Watanabe
Second-Order Optimal Test in Composite Hypothesis Testing. 722-726 - Yuta Sakai
Generalized Fano-Type Inequality for Countably Infinite Systems with List-Decoding. 727-731 - Kenji Nakagawa, Yoshinori Takei, Kohei Watabe:
Analysis for the Slow Convergence in Arimoto Algorithm. 732-736
We-PM-2-4: Information Theoretic Security
- Bagus Santoso
Post Encryption Compression with Affine Encoders for Secrecy Amplification in Distributed Source Encryption with Correlated Keys. 737-741 - Selma Belhadj Amor, Atefeh Gilani, Sadaf Salehkalaibar, Vincent Y. F. Tan:
Distributed Hypothesis Testing with Privacy Constraints. 742-746 - Ukyo Michiwaki, Yutaka Jitsumatsu:
A new proof of an inequality between two secrecy exponents. 747-751 - Nick A. Letzepis:
A Finite Block Length Achievability Bound for Low Probability of Detection Communication. 752-756
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.
last updated on 2024-12-16 22:15 CET 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: