default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVitaly Skachek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j27]Henk D. L. Hollmann
, Karan Khathuria, Ago-Erik Riet, Vitaly Skachek:
On some batch code properties of the simplex code. Des. Codes Cryptogr. 91(5): 1595-1605 (2023)- [j26]Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov, Vitaly Skachek:
Nonbinary LDPC Coded QAM Signals With Optimized Mapping: Bounds and Simulation Results. IEEE Trans. Inf. Theory 69(8): 4837-4854 (2023) - [c45]Irina E. Bocharova, Boris D. Kudryashov, Sander Mikelsaar, Vitaly Skachek:
Bound on the ML Decoding Error Probability for Coded QAM Signals with Shaping. ISIT 2023: 270-275 - [c44]Irina E. Bocharova, Boris D. Kudryashov, Sander Mikelsaar, Vitaly Skachek:
Shaping for NB QC-LDPC Coded QAM Signals. ISTC 2023: 1-5 - [c43]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek:
LDPC coded QAM signaling: Mapping and Shaping. ISTC 2023: 1-6 - 2022
- [j25]Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus:
Preface of special issue on coding theory and applications. Cryptogr. Commun. 14(3): 503 (2022) - [j24]Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov, Vitaly Skachek, Tähvend Uustalu:
Design and Analysis of NB QC-LDPC Codes Over Small Alphabets. IEEE Trans. Commun. 70(5): 2964-2976 (2022) - [j23]Ago-Erik Riet, Vitaly Skachek, Eldho K. Thomas:
Batch Codes for Asynchronous Recovery of Data. IEEE Trans. Inf. Theory 68(3): 1545-1559 (2022) - [c42]Irina E. Bocharova, Henk D. L. Hollmann, Karan Khathuria, Boris D. Kudryashov, Vitaly Skachek:
Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel. ISIT 2022: 666-671 - [c41]Ivo Kubjas, Vitaly Skachek:
Partial Extraction from Invertible Bloom Filters. ISIT 2022: 2415-2420 - 2021
- [c40]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek:
Euclidean Distance Spectra of Irregular NB LDPC Coded QAM Signals with Optimized Mappings. ISIT 2021: 226-231 - [c39]Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov, Vitaly Skachek:
A Random Coding Bound on the ML Decoding Error Probability for NB LDPC Coded QAM Signals. ITW 2021: 1-6 - [i39]Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov, Vitaly Skachek:
NB QC-LDPC Coded QAM Signals with Optimized Mapping: Bounds and Simulation Results. CoRR abs/2108.08716 (2021) - [i38]Henk D. L. Hollmann, Karan Khathuria, Ago-Erik Riet, Vitaly Skachek:
On some batch code properties of the simplex code. CoRR abs/2110.07421 (2021) - 2020
- [c38]Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov, Vitaly Skachek, Tähvend Uustalu:
Optimization of Irregular NB QC-LDPC Block Codes over Small Alphabets. ITW 2020: 1-5 - [i37]Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov, Vitaly Skachek, Tähvend Uustalu:
Optimization of NB QC-LDPC Block Codes and Their Performance Analysis. CoRR abs/2006.12147 (2020) - [i36]Ivo Kubjas, Vitaly Skachek:
Failure Probability Analysis for Partial Extraction from Invertible Bloom Filters. CoRR abs/2008.00879 (2020)
2010 – 2019
- 2019
- [j22]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Eirik Rosnes, Øyvind Ytrehus:
LDPC Codes Over the BEC: Bounds and Decoding Algorithms. IEEE Trans. Commun. 67(3): 1754-1769 (2019) - [j21]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
BP-LED Decoding Algorithm for LDPC Codes Over AWGN Channels. IEEE Trans. Inf. Theory 65(3): 1677-1693 (2019) - [j20]Yauhen Yakimenka, Vitaly Skachek, Irina E. Bocharova, Boris D. Kudryashov:
Stopping Redundancy Hierarchy Beyond the Minimum Distance. IEEE Trans. Inf. Theory 65(6): 3724-3737 (2019) - [c37]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek:
AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes. ISIT 2019: 56-60 - [i35]A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama, Van Khu Vu, Akiko Manada, Kui Cai, Shunsuke Horii, Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta, Xingwei Zhong, Zhen Mei, Renfei Bu, Jos H. Weber, Vitaly Skachek, Hiroyoshi Morita, N. Hovhannisyan, Hiroshi Kamabe, Shan Lu, Hirosuke Yamamoto, Kengo Hashimoto, Øyvind Ytrehus, Shigeaki Kuzuoka, Mikihiko Nishiara, Han Mao Kiah, Jun Muramatsu, Shigeki Miyake:
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory. CoRR abs/1907.02944 (2019) - 2018
- [c36]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Improved Redundant Parity-Check Based BP Decoding of LDPC Codes. ISIT 2018: 1161-1165 - [c35]Ago-Erik Riet, Vitaly Skachek, Eldho K. Thomas:
Asynchronous Batch and PIR Codes from Hypergraphs. ITW 2018: 1-5 - [i34]Yauhen Yakimenka, Vitaly Skachek, Irina E. Bocharova, Boris D. Kudryashov:
Stopping Redundancy Hierarchy Beyond the Minimum Distance. CoRR abs/1804.06770 (2018) - [i33]Ago-Erik Riet, Vitaly Skachek, Eldho K. Thomas:
Asynchronous Batch and PIR Codes from Hypergraphs. CoRR abs/1806.00592 (2018) - 2017
- [j19]Francisco A. Monteiro, Alister G. Burr, Ioannis Chatzigeorgiou, Camilla Hollanti, Ioannis Krikidis, Hulya Seferoglu, Vitaly Skachek:
Special issue on network coding. EURASIP J. Adv. Signal Process. 2017: 29 (2017) - [c34]Ivo Kubjas, Vitaly Skachek:
Two-party function computation on the reconciled data. Allerton 2017: 390-396 - [c33]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance. ICMCTA 2017: 48-61 - [c32]Eldho K. Thomas, Vitaly Skachek:
Constructions and Bounds for Batch Codes with Small Parameters. ICMCTA 2017: 283-295 - [c31]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Average spectra for ensembles of LDPC codes and applications. ISIT 2017: 361-365 - [c30]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek:
Performance of ML decoding for ensembles of binary and nonbinary regular LDPC codes of finite lengths. ISIT 2017: 794-798 - [e1]Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus:
Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. Lecture Notes in Computer Science 10495, Springer 2017, ISBN 978-3-319-66277-0 [contents] - [i32]Ivo Kubjas, Vitaly Skachek:
Two-Party Function Computation on the Reconciled Data. CoRR abs/1701.07495 (2017) - [i31]Eldho K. Thomas, Vitaly Skachek:
Explicit Constructions and Bounds for Batch Codes with Restricted Size of Reconstruction Sets. CoRR abs/1701.07579 (2017) - [i30]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
BP-LED decoding algorithm for LDPC codes over AWGN channels. CoRR abs/1705.09507 (2017) - [i29]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance. CoRR abs/1707.01025 (2017) - [i28]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Eirik Rosnes, Øyvind Ytrehus:
ML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms. CoRR abs/1709.01455 (2017) - 2016
- [j18]Dejan Vukobratovic, Dusan Jakovetic, Vitaly Skachek, Dragana Bajovic, Dino Sejdinovic, Günes Karabulut-Kurt, Camilla Hollanti, Ingo Fischer:
CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT. IEEE Access 4: 3360-3378 (2016) - [j17]Dushantha N. K. Jayakody, Vitaly Skachek, Bin Chen:
Spatially coupled LDPC coding in cooperative wireless networks. EURASIP J. Adv. Signal Process. 2016: 20 (2016) - [j16]Kees A. Schouhamer Immink, Vitaly Skachek:
Minimum Pearson Distance Detection Using Mass-Centered Codewords in the Presence of Unknown Varying Offset. IEEE J. Sel. Areas Commun. 34(9): 2510-2517 (2016) - [c29]Vitaly Skachek, Kees A. Schouhamer Immink:
Minimum pearson distance detection in the presence of unknown slowly varying offset. ISIT 2016: 195-199 - [c28]Hui Zhang, Vitaly Skachek:
Bounds for batch codes with restricted query size. ISIT 2016: 1192-1196 - [c27]Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Low complexity algorithm approaching the ML decoding of binary LDPC codes. ISIT 2016: 2704-2708 - [c26]Irina E. Bocharova, Boris D. Kudryashov, Eirik Rosnes, Vitaly Skachek, Øyvind Ytrehus:
Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC. ISTC 2016: 16-20 - [c25]Dejan Vukobratovic, Dusan Jakovetic, Vitaly Skachek, Dragana Bajovic, Dino Sejdinovic:
Network function computation as a service in future 5G machine type communications. ISTC 2016: 365-369 - [c24]Akashkumar Rajaram, Dushantha Nalin K. Jayakody, Vitaly Skachek:
Store-then-cooperate: Energy harvesting scheme in cooperative relay networks. ISWCS 2016: 445-450 - [c23]Dushantha Nalin K. Jayakody, Vitaly Skachek, Bin Chen:
Spatially-coupled LDPC coding in cooperative wireless networks. WCNC 2016: 1-6 - [i27]Dejan Vukobratovic, Dusan Jakovetic, Vitaly Skachek, Dragana Bajovic, Dino Sejdinovic, Gunes Karabulut-Kurt, Camilla Hollanti, Ingo Fischer:
CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT. CoRR abs/1609.03363 (2016) - [i26]Vitaly Skachek:
Batch and PIR Codes and Their Connections to Locally-Repairable Codes. CoRR abs/1611.09914 (2016) - 2015
- [c22]Ivo Kubjas, Vitaly Skachek:
Data dissemination problem in wireless networks. Allerton 2015: 1197-1204 - [c21]Faruk Göloglu, Jüri Lember, Ago-Erik Riet, Vitaly Skachek:
New bounds for permutation codes in Ulam metric. ISIT 2015: 1726-1730 - [c20]Yauhen Yakimenka, Vitaly Skachek:
Refined upper bounds on stopping redundancy of binary linear codes. ITW 2015: 1-5 - [i25]Ivo Kubjas, Vitaly Skachek:
Data Dissemination Problem in Wireless Networks. CoRR abs/1504.00481 (2015) - [i24]Faruk Göloglu, Jüri Lember, Ago-Erik Riet, Vitaly Skachek:
New Bounds for Permutation Codes in Ulam Metric. CoRR abs/1504.05100 (2015) - [i23]Hui Zhang, Vitaly Skachek:
Bounds for Batch Codes with Restricted Query Size. CoRR abs/1510.08883 (2015) - 2014
- [j15]Vitaly Skachek, Kees A. Schouhamer Immink:
Constant Weight Codes: An Approach Based on Knuth's Balancing Method. IEEE J. Sel. Areas Commun. 32(5): 909-918 (2014) - [j14]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
Optimal Index Codes With Near-Extreme Rates. IEEE Trans. Inf. Theory 60(3): 1515-1527 (2014) - [c19]Vincent Gripon, Vitaly Skachek, Michael G. Rabbat:
Sparse binary matrices as efficient associative memories. Allerton 2014: 499-504 - [c18]Helger Lipmaa, Vitaly Skachek:
Linear Batch Codes. ICMCTA 2014: 245-253 - [c17]Vitaly Skachek, Michael G. Rabbat:
Subspace synchronization: A network-coding approach to object reconciliation. ISIT 2014: 2301-2305 - [i22]Helger Lipmaa, Vitaly Skachek:
Linear Batch Codes. CoRR abs/1404.2796 (2014) - [i21]Yauhen Yakimenka, Vitaly Skachek:
Refined Upper Bounds on Stopping Redundancy of Binary Linear Codes. CoRR abs/1410.8753 (2014) - 2013
- [j13]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
Error Correction for Index Coding With Side Information. IEEE Trans. Inf. Theory 59(3): 1517-1531 (2013) - [j12]Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Error-Correction in Flash Memories via Codes in the Ulam Metric. IEEE Trans. Inf. Theory 59(5): 3003-3020 (2013) - [j11]Vitaly Skachek, Olgica Milenkovic, Angelia Nedic:
Hybrid Noncoherent Network Coding. IEEE Trans. Inf. Theory 59(6): 3317-3331 (2013) - [c16]Vincent Gripon, Vitaly Skachek, Michael G. Rabbat:
Sparse structured associative memories as efficient set-membership data structures. Allerton 2013: 500-505 - 2012
- [j10]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
On the Security of Index Coding With Side Information. IEEE Trans. Inf. Theory 58(6): 3975-3988 (2012) - [j9]Jens Zumbrägel, Vitaly Skachek, Mark F. Flanagan:
On the Pseudocodeword Redundancy of Binary Linear Codes. IEEE Trans. Inf. Theory 58(7): 4848-4861 (2012) - [c15]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
Optimal index codes with near-extreme rates. ISIT 2012: 2241-2245 - [c14]Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Rank modulation for translocation error correction. ISIT 2012: 2988-2992 - [c13]Vincent Gripon, Vitaly Skachek, Warren J. Gross, Michael G. Rabbat:
Random clique codes. ISTC 2012: 121-125 - [c12]Vincent Gripon, Michael G. Rabbat, Vitaly Skachek, Warren J. Gross:
Compressing multisets using tries. ITW 2012: 642-646 - [c11]Vitaly Skachek, Olgica Milenkovic, Angelia Nedic:
Hybrid noncoherent network coding. NetCod 2012: 7-12 - [i20]Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Rank Modulation for Translocation Error Correction. CoRR abs/1202.0932 (2012) - [i19]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
Optimal Index Codes with Near-Extreme Rates. CoRR abs/1202.1150 (2012) - [i18]Vincent Gripon, Vitaly Skachek, Michael G. Rabbat:
Forwarding Without Repeating: Efficient Rumor Spreading in Bounded-Degree Graphs. CoRR abs/1208.2936 (2012) - 2011
- [j8]Vitaly Skachek:
Correcting a Fraction of Errors in Nonbinary Expander Codes With Linear Programming. IEEE Trans. Inf. Theory 57(6): 3698-3706 (2011) - [c10]Vitaly Skachek, Kees A. Schouhamer Immink:
Constant weight codes: An approach based on Knuth's balancing method. ISIT 2011: 321-325 - [c9]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
On secure Index Coding with Side Information. ISIT 2011: 983-987 - [c8]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
Index coding and error correction. ISIT 2011: 1787-1791 - [i17]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
Index Coding and Error Correction. CoRR abs/1101.2728 (2011) - [i16]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
On the Security of Index Coding with Side Information. CoRR abs/1102.2797 (2011) - [i15]Jens Zumbrägel, Vitaly Skachek, Mark F. Flanagan:
On the Pseudocodeword Redundancy of Binary Linear Codes. CoRR abs/1103.3641 (2011) - [i14]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
Error Correction for Index Coding with Side Information. CoRR abs/1105.2865 (2011) - [i13]Vitaly Skachek, Olgica Milenkovic, Angelia Nedic:
Hybrid Noncoherent Network Coding. CoRR abs/1107.4581 (2011) - 2010
- [j7]Eimear Byrne, Marcus Greferath, Axel Kohnert, Vitaly Skachek:
New bounds for codes over finite Frobenius rings. Des. Codes Cryptogr. 57(2): 169-179 (2010) - [j6]Vitaly Skachek:
Recursive code construction for random networks. IEEE Trans. Inf. Theory 56(3): 1378-1382 (2010) - [c7]Jens Zumbrägel, Mark F. Flanagan, Vitaly Skachek:
On the pseudocodeword redundancy. ISIT 2010: 759-763 - [c6]Vitaly Skachek:
Characterization of graph-cover pseudocodewords of codes over F3. ITW 2010: 1-5 - [i12]Jens Zumbrägel, Mark F. Flanagan, Vitaly Skachek:
On the Pseudocodeword Redundancy. CoRR abs/1001.1705 (2010) - [i11]Jens Zumbrägel, Mark F. Flanagan, Vitaly Skachek:
Exploration of AWGNC and BSC Pseudocodeword Redundancy. CoRR abs/1005.3486 (2010) - [i10]Vitaly Skachek:
Characterization of Graph-cover Pseudocodewords of Codes over $F_3$. CoRR abs/1007.3808 (2010) - [i9]Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
Secure Index Coding with Side Information. CoRR abs/1011.5566 (2010)
2000 – 2009
- 2009
- [j5]Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath:
Linear-programming decoding of nonbinary linear codes. IEEE Trans. Inf. Theory 55(9): 4134-4154 (2009) - [c5]Vitaly Skachek:
On LP decoding of nonbinary expander codes. ISIT 2009: 384-388 - [i8]Vitaly Skachek:
Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming. CoRR abs/0906.1565 (2009) - 2008
- [j4]Vitaly Skachek, Ron M. Roth:
Probabilistic algorithm for finding roots of linearized polynomials. Des. Codes Cryptogr. 46(1): 17-23 (2008) - [c4]Vitaly Skachek, Mark F. Flanagan, Eimear Byrne, Marcus Greferath:
Polytope representations for linear-programming decoding of non-binary linear codes. ISIT 2008: 1508-1512 - [i7]Vitaly Skachek, Mark F. Flanagan:
Lower Bounds on the Minimum Pseudodistance for Linear Codes with $q$-ary PSK Modulation over AWGN. CoRR abs/0803.3777 (2008) - [i6]Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath:
Linear-Programming Decoding of Nonbinary Linear Codes. CoRR abs/0804.4384 (2008) - [i5]Vitaly Skachek:
Recursive Code Construction for Random Networks. CoRR abs/0806.3650 (2008) - 2007
- [b1]Vitaly Skachek:
Low-density parity-check codes: constructions and bounds. Technion - Israel Institute of Technology, Israel, 2007 - [i4]Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath:
Linear-programming Decoding of Non-binary Linear Codes. CoRR abs/0707.4360 (2007) - [i3]Vitaly Skachek, Mark F. Flanagan, Eimear Byrne, Marcus Greferath:
Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes. CoRR abs/0712.4075 (2007) - 2006
- [j3]Ron M. Roth, Vitaly Skachek:
Improved Nearly-MDS Expander Codes. IEEE Trans. Inf. Theory 52(8): 3650-3661 (2006) - [j2]Alexei E. Ashikhmin, Vitaly Skachek:
Decoding of Expander Codes at Rates Close to Capacity. IEEE Trans. Inf. Theory 52(12): 5475-5485 (2006) - [i2]Ron M. Roth, Vitaly Skachek:
Improved Nearly-MDS Expander Codes. CoRR abs/cs/0601090 (2006) - 2005
- [c3]Alexei Ashikhmin, Vitaly Skachek:
Decoding of expander codes at rates close to capacity. ISIT 2005: 317-321 - [i1]Alexei E. Ashikhmin, Vitaly Skachek:
Decoding of Expander Codes at Rates Close to Capacity. CoRR abs/cs/0508062 (2005) - 2004
- [c2]Ron M. Roth, Vitaly Skachek:
On nearly-MDS expander codes. ISIT 2004: 8 - 2003
- [c1]Vitaly Skachek, Ron M. Roth:
Generalized minimum distance iterative decoding of expander codes. ITW 2003: 245-248
1990 – 1999
- 1998
- [j1]Vitaly Skachek, Tuvi Etzion, Ron M. Roth:
Efficient Encoding Algorithm for Third-Order Spectral-Null Codes. IEEE Trans. Inf. Theory 44(2): 846-851 (1998)
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-08-22 20:48 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:
