default search action
Jos H. Weber
Person information
- affiliation: Delft University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j51]Kees A. Schouhamer Immink, Kui Cai, Tuan Thanh Nguyen, Jos H. Weber:
Constructions and Properties of Efficient DNA Synthesis Codes. IEEE Trans. Mol. Biol. Multi Scale Commun. 10(2): 289-296 (2024) - [j50]Ward J. P. Spee, Jos H. Weber:
Bounds on the Maximum Cardinality of Indel and Substitution Correcting Codes. IEEE Trans. Mol. Biol. Multi Scale Commun. 10(2): 349-358 (2024) - [c47]Yeow Meng Chee, Tuvi Etzion, Kees A. Schouhamer Immink, Tuan Thanh Nguyen, Van Khu Vu, Jos H. Weber, Eitan Yaakobi:
Thermal-Aware Channel with Multiple Wires. ISIT 2024: 1035-1040 - 2023
- [j49]Kees A. Schouhamer Immink, Jos H. Weber:
Minimally Modified Balanced Codes. IEEE Trans. Inf. Theory 69(1): 187-193 (2023) - [c46]Yeow Meng Chee, Tuvi Etzion, Kees A. Schouhamer Immink, Tuan Thanh Nguyen, Van Khu Vu, Jos H. Weber, Eitan Yaakobi:
Thermal-Aware Channel Capacity. ISIT 2023: 2661-2666 - 2022
- [j48]Kees A. Schouhamer Immink, Jos H. Weber:
A New Detection Method for Noisy Channels With Time-Varying Offset. IEEE Trans. Inf. Theory 68(5): 3108-3114 (2022) - 2021
- [j47]Jos H. Weber, Joost A. M. de Groot, Charlot J. van Leeuwen:
On Single-Error-Detecting Codes for DNA-Based Data Storage. IEEE Commun. Lett. 25(1): 41-44 (2021) - [j46]Renfei Bu, Jos H. Weber, Kees A. Schouhamer Immink:
Maximum Likelihood Decoding for Channels With Gaussian Noise and Signal Dependent Offset. IEEE Trans. Commun. 69(1): 85-93 (2021) - 2020
- [j45]Jos H. Weber, Renfei Bu, Kui Cai, Kees A. Schouhamer Immink:
Binary Block Codes for Noisy Channels With Unknown Offset. IEEE Trans. Commun. 68(7): 3975-3983 (2020) - [c45]Renfei Bu, Jos H. Weber, Kees A. Schouhamer Immink:
Maximum Likelihood Decoding for Channels with Uniform Noise and Signal Dependent Offset. ISIT 2020: 706-710
2010 – 2019
- 2019
- [j44]Renfei Bu, Jos H. Weber:
Minimum Pearson Distance Detection Using a Difference Operator in the Presence of Unknown Varying Offset. IEEE Commun. Lett. 23(7): 1115-1118 (2019) - [c44]Renfei Bu, Jos H. Weber:
Decoding Criteria and Zero WER Analysis for Channels with Bounded Noise and Offset. ICC 2019: 1-6 - [c43]Renfei Bu, Jos H. Weber:
Maximum Likelihood Decoding for Multi-Level Cell Memories with Scaling and Offset Mismatch. ICC 2019: 1-6 - [i9]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
- [j43]Jos H. Weber, Kees A. Schouhamer Immink:
Maximum Likelihood Decoding for Gaussian Noise Channels With Gain or Offset Mismatch. IEEE Commun. Lett. 22(6): 1128-1131 (2018) - [j42]Theo G. Swart, Jos H. Weber:
Binary Variable-to-Fixed Length Balancing Scheme With Simple Encoding/Decoding. IEEE Commun. Lett. 22(10): 1992-1995 (2018) - [j41]Kees A. Schouhamer Immink, Kui Cai, Jos H. Weber:
Dynamic Threshold Detection Based on Pearson Distance Detection. IEEE Trans. Commun. 66(7): 2958-2965 (2018) - [j40]Theo G. Swart, Jos H. Weber, Kees A. Schouhamer Immink:
Prefixless q-Ary Balanced Codes With Fast Syndrome-Based Error Correction. IEEE Trans. Inf. Theory 64(4): 2431-2443 (2018) - [c42]Jos H. Weber, Kees A. Schouhamer Immink:
Properties of Binary Pearson Codes. ISITA 2018: 605-609 - 2017
- [j39]Thijs Veugen, Jeroen Doumen, Zekeriya Erkin, Gaetano Pellegrino, Sicco Verwer, Jos H. Weber:
Improved privacy of dynamic group services. EURASIP J. Inf. Secur. 2017: 3 (2017) - [j38]Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar:
Secure Transmission on the Two-Hop Relay Channel With Scaled Compute-and-Forward. IEEE Trans. Inf. Theory 63(12): 7753-7769 (2017) - [c41]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Bounds for cooperative locality using generalized hamming weights. ISIT 2017: 699-703 - 2016
- [j37]Jos H. Weber, Kees A. Schouhamer Immink, Simon R. Blackburn:
Pearson Codes. IEEE Trans. Inf. Theory 62(1): 131-135 (2016) - [c40]Robert M. Seepers, Jos H. Weber, Zekeriya Erkin, Ioannis Sourdis, Christos Strydis:
Secure key-exchange protocol for implants using heartbeats. Conf. Computing Frontiers 2016: 119-126 - [c39]Jos H. Weber, Theo G. Swart, Kees A. Schouhamer Immink:
Simple systematic Pearson coding. ISIT 2016: 385-389 - [c38]Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar:
On the energy benefit of compute-and-forward for multiple unicasts. ISIT 2016: 2334-2338 - 2015
- [j36]Kees A. Schouhamer Immink, Jos H. Weber:
Hybrid Minimum Pearson and Euclidean Distance Detection. IEEE Trans. Commun. 63(9): 3290-3298 (2015) - [j35]Jasper Goseling, Michael Gastpar, Jos H. Weber:
Random Access With Physical-Layer Network Coding. IEEE Trans. Inf. Theory 61(7): 3670-3681 (2015) - [c37]Kees A. Schouhamer Immink, Jos H. Weber:
Detection in the presence of additive noise and unknown offset. ICC 2015: 431-435 - [c36]Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar:
Secure transmission using an untrusted relay with scaled compute-and-forward. ITW 2015: 1-5 - [i8]Jos H. Weber, Kees A. Schouhamer Immink, Simon R. Blackburn:
Pearson codes. CoRR abs/1509.00291 (2015) - [i7]Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar:
Secure Transmission on the Two-hop Relay Channel with Scaled Compute-and-Forward. CoRR abs/1509.04075 (2015) - 2014
- [j34]Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar:
Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast. IEEE Commun. Lett. 18(7): 1111-1114 (2014) - [j33]Kees A. Schouhamer Immink, Jos H. Weber:
Minimum Pearson Distance Detection for Multilevel Channels With Gain and/or Offset Mismatch. IEEE Trans. Inf. Theory 60(10): 5966-5974 (2014) - [c35]Jos H. Weber, Carl H. Heymann, Hendrik C. Ferreira, Khaled A. S. Abdel-Ghaffar:
Optimized markers for balancing runlength-limited sequences in optical recording. ISIT 2014: 1658-1662 - [c34]Reolyn Heymann, Jos H. Weber, Theo G. Swart, Hendrik C. Ferreira:
Concatenated permutation block codes for correcting single transposition errors. ITW 2014: 576-580 - 2013
- [j32]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Parity-Check Matrices Separating Erasures From Errors. IEEE Trans. Inf. Theory 59(6): 3332-3346 (2013) - [c33]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Separating redundancy of linear MDS codes. ISIT 2013: 1894-1898 - [c32]Jasper Goseling, Michael Gastpar, Jos H. Weber:
Physical-layer network coding on the random-access channel. ISIT 2013: 2339-2343 - [c31]Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar:
Compute-and-Forward: Multiple bi-directional sessions on the line network. ISIT 2013: 2344-2348 - [c30]Jasper Goseling, Michael Gastpar, Jos H. Weber:
Random access with physical-layer network coding. ITA 2013: 1-7 - [c29]Jos H. Weber, Kees A. Schouhamer Immink, Paul H. Siegel, Theo G. Swart:
Polarity-balanced codes. ITA 2013: 1-5 - [c28]Reolyn Heymann, Jos H. Weber, Theo G. Swart, Hendrik C. Ferreira:
Concatenated permutation block codes based on set partitioning for substitution and deletion error-control. ITW 2013: 1-5 - [i6]Jos H. Weber, Kees A. Schouhamer Immink, Paul H. Siegel, Theo G. Swart:
Perspectives on Balanced Sequences. CoRR abs/1301.6484 (2013) - 2012
- [j31]Jos H. Weber, Vladimir R. Sidorenko, Christian Senger, Khaled A. S. Abdel-Ghaffar:
Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff. Probl. Inf. Transm. 48(4): 324-333 (2012) - [j30]Jos H. Weber, Kees A. Schouhamer Immink, Hendrik C. Ferreira:
Error-Correcting Balanced Knuth Codes. IEEE Trans. Inf. Theory 58(1): 82-89 (2012) - [c27]Jasper Goseling, Jos H. Weber, Michael Gastpar:
Compute-and-forward on wireless lattice networks with local interference. ISWCS 2012: 281-285 - [c26]Carl H. Heymann, Hendrik C. Ferreira, Jos H. Weber:
A DC-free multi-mode run-length limited coding scheme. ITW 2012: 257-261 - [i5]Jasper Goseling, Michael Gastpar, Jos H. Weber:
Random Access with Physical-layer Network Coding. CoRR abs/1212.5782 (2012) - 2011
- [j29]Umar H. Rizvi, Ferkan Yilmaz, Mohamed-Slim Alouini, Gerard J. M. Janssen, Jos H. Weber:
Performance of Equal Gain Combining with Quantized Phases in Rayleigh Fading Channels. IEEE Trans. Commun. 59(1): 13-18 (2011) - [j28]Jasper Goseling, Michael Gastpar, Jos H. Weber:
Line and Lattice Networks Under Deterministic Interference Models. IEEE Trans. Inf. Theory 57(5): 3080-3099 (2011) - [c25]Kees A. Schouhamer Immink, Jos H. Weber, Hendrik C. Ferreira:
Balanced runlength limited codes using Knuth's algorithm. ISIT 2011: 317-320 - [c24]Carl H. Heymann, Hendrik C. Ferreira, Jos H. Weber:
A Knuth-based RDS-minimizing multi-mode code. ITW 2011: 508-512 - [c23]Filip Paluncic, Theo G. Swart, Jos H. Weber, Hendrik C. Ferreira, Willem A. Clarke:
A note on non-binary multiple insertion/deletion correcting codes. ITW 2011: 683-687 - 2010
- [j27]Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast. EURASIP J. Wirel. Commun. Netw. 2010 (2010) - [j26]Kees A. Schouhamer Immink, Jos H. Weber:
Very Efficient Balanced Codes. IEEE J. Sel. Areas Commun. 28(2): 188-192 (2010) - [j25]Jos H. Weber, Kees A. Schouhamer Immink:
Knuth's balanced codes revisited. IEEE Trans. Inf. Theory 56(4): 1673-1679 (2010) - [c22]Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber:
An upper bound on the separating redundancy of linear block codes. ISIT 2010: 1173-1177
2000 – 2009
- 2009
- [j24]Umar H. Rizvi, Gerard J. M. Janssen, Jos H. Weber:
BER analysis for MPAM signal constellations in the presence of fading and ADC quantization noise. IEEE Commun. Lett. 13(10): 733-735 (2009) - [c21]Kees A. Schouhamer Immink, Jos H. Weber:
Simple balanced codes that approach capacity. ISIT 2009: 1554-1558 - [c20]Theo G. Swart, Jos H. Weber:
Efficient balancing of q-ary sequences with parallel decoding. ISIT 2009: 1564-1568 - [c19]Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
On the energy benefit of network coding for wireless multiple unicast. ISIT 2009: 2567-2571 - [i4]Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
On the Energy Benefit of Network Coding for Wireless Multiple Unicast. CoRR abs/0901.2410 (2009) - 2008
- [j23]Nauman F. Kiyani, Jos H. Weber:
EXIT Chart Analysis of Iterative Demodulation and Decoding of MPSK Constellations with Signal Space Diversity. J. Commun. 3(3): 43-50 (2008) - [j22]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators. IEEE Trans. Inf. Theory 54(3): 1368-1374 (2008) - [j21]Michal M. Pietrzyk, Jos H. Weber:
On the Performance of UWB-IR With Interleaved Coding Modulation and Polarity Randomization on AWGN and Multipath Fading Channels. IEEE Trans. Veh. Technol. 57(6): 3578-3588 (2008) - [c18]Nauman F. Kiyani, Jos H. Weber:
Performance Analysis of a Partially Coherent System Using Constellation Rotation and Coordinate Interleaving. GLOBECOM 2008: 4308-4312 - [c17]Jasper Goseling, Jos H. Weber:
Multi-rate network coding for minimum-cost multicasting. ISIT 2008: 36-40 - [c16]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Separating erasures from errors for decoding. ISIT 2008: 215-219 - [c15]Jos H. Weber, Kees A. Schouhamer Immink:
Knuth's balancing of codewords revisited. ISIT 2008: 1567-1571 - [c14]Umar H. Rizvi, Gerard J. M. Janssen, Jos H. Weber:
BER analysis of single-carrier MPAM in the presence of ADC quantization noise. PIMRC 2008: 1-5 - [c13]Nauman F. Kiyani, Jos H. Weber, Alenka G. Zajic, Gordon L. Stüber:
Performance Analysis of a System using Coordinate Interleaving and Constellation Rotation in Rayleigh Fading Channels. VTC Fall 2008: 1-5 - [c12]Javad Vazifehdan, Jos H. Weber:
Symbol Error Rate of Space-Time Coded Multi-Antenna Wireless Cooperative Networks. VTC Spring 2008: 1453-1457 - [i3]Jasper Goseling, Jos H. Weber:
Energy Benefit of Network Coding for Multiple Unicast in Wireless Networks. CoRR abs/0811.0325 (2008) - 2007
- [j20]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes. IEEE Trans. Inf. Theory 53(9): 3196-3201 (2007) - [c11]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure Channel. ISIT 2007: 66-70 - [c10]Nauman F. Kiyani, Jos H. Weber:
Iterative Demodulation and Decoding for Rotated MPSK Constellations with Convolutional Coding and Signal Space Diversity. VTC Fall 2007: 1712-1716 - [c9]Nauman F. Kiyani, Umar H. Rizvi, Jos H. Weber, Gerard J. M. Janssen:
Optimized Rotations for LDPC-Coded MPSK Constellations with Signal Space Diversity. WCNC 2007: 677-681 - 2006
- [c8]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Stopping Set Enumerators of Full-Rank Parity-Check Matrices of Hamming Codes. ISIT 2006: 1544-1548 - [i2]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes. CoRR abs/cs/0603007 (2006) - [i1]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators. CoRR abs/cs/0607024 (2006) - 2005
- [c7]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Stopping set analysis for Hamming codes. ITW 2005: 244-247 - 2004
- [j19]Jacobus H. Weber, Marc P. C. Fossorier:
Limited-trial chase-like algorithms achieving bounded-distance decoding. IEEE Trans. Inf. Theory 50(12): 3318-3323 (2004) - [c6]Jos H. Weber, Marc P. C. Fossorier:
Limited-trial chase-like bounded-distance decoding. ISIT 2004: 258 - 2003
- [j18]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Reduced GMD decoding. IEEE Trans. Inf. Theory 49(4): 1013-1027 (2003) - [j17]G. Arico, Jos H. Weber:
Limited-trial Chase decoding. IEEE Trans. Inf. Theory 49(11): 2972-2975 (2003) - [c5]Jos H. Weber:
Low-complexity Chase-like bounded-distance decoding algorithms. GLOBECOM 2003: 1608-1612 - [c4]Carlos Barrios Vicente, Jos H. Weber:
Dynamic Chase decoding algorithm. ITW 2003: 312-315 - 2001
- [c3]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Reduced GMD decoding of concatenated codes. GLOBECOM 2001: 901-905 - 2000
- [j16]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding. IEEE Trans. Inf. Theory 46(4): 1590-1597 (2000) - [j15]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Constructing efficient DC-free runlength-limited block codes for recording channels. IEEE Trans. Inf. Theory 46(4): 1599-1602 (2000)
1990 – 1999
- 1998
- [j14]Adrian Mardjuadi, Jos H. Weber:
Codes for Multiple Localized Burst Error Correction. IEEE Trans. Inf. Theory 44(5): 2020-2024 (1998) - 1996
- [j13]René J. van der Vleuten, Jos H. Weber:
Optimized signal constellations for trellis-coded modulation on AWGN channels. IEEE Trans. Commun. 44(6): 646-648 (1996) - [j12]Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber:
Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation. IEEE Trans. Inf. Theory 42(5): 1405-1424 (1996) - 1995
- [j11]Anders G. Skolleborg, Jos H. Weber:
Construction of Systematic Codes for Unidirectional Error Control. IEEE Trans. Computers 44(11): 1331-1334 (1995) - [j10]René J. van der Vleuten, Jacobus H. Weber:
Construction and evaluation of trellis-coded quantizers for memoryless sources. IEEE Trans. Inf. Theory 41(3): 853-859 (1995) - [j9]Khaled A. S. Abdel-Ghaffar, Mario Blaum, Jacobus H. Weber:
Analysis of coding schemes for modulation and error control. IEEE Trans. Inf. Theory 41(6): 1955-1968 (1995) - 1994
- [j8]Jacobus H. Weber:
Asymptotic results on codes for symmetric, unidirectional, and asymmetric error control. IEEE Trans. Inf. Theory 40(6): 2073-2075 (1994) - 1993
- [j7]Peter H. Westerink, Jacobus H. Weber, Dick E. Boekee, J. W. Limpers:
Adaptive channel error protection of subband encoded images. IEEE Trans. Commun. 41(3): 454-459 (1993) - [j6]Jacobus H. Weber, Khaled A. S. Abdel-Ghaffar:
Cascading runlength-limited sequences. IEEE Trans. Inf. Theory 39(6): 1976-1984 (1993) - [c2]Herjan J. Barnard, Jos H. Weber, Jan Biemond:
Efficient signal extension for subband/wavelet decomposition of arbitrary-length signals. VCIP 1993 - 1992
- [j5]Jacobus H. Weber, Cornelis de Vroedt, Dick E. Boekee:
Necessary and Sufficient Conditions on Block Codes Correcting/Detecting Errors of Various Types. IEEE Trans. Computers 41(9): 1189-1193 (1992) - [c1]René J. van der Vleuten, Jos H. Weber:
A New Construction of Trellis-Coded Quantizers. Coding And Quantization 1992: 121-125 - 1991
- [j4]Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber:
Bounds and constructions for runlength-limited error-control block codes. IEEE Trans. Inf. Theory 37(3): 789-800 (1991)
1980 – 1989
- 1989
- [j3]Jacobus H. Weber, Cornelis de Vroedt, Dick E. Boekee:
Bounds and constructions for codes correcting unidirectional errors. IEEE Trans. Inf. Theory 35(4): 797-810 (1989) - 1988
- [j2]Jacobus H. Weber, Cornelis de Vroedt, Dick E. Boekee:
Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6. IEEE Trans. Inf. Theory 34(5): 1321-1331 (1988) - 1987
- [j1]Jacobus H. Weber, Cornelis de Vroedt, Dick E. Boekee:
New upper bounds on the size of codes correcting asymmetric errors. IEEE Trans. Inf. Theory 33(3): 434-437 (1987)
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-13 18:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint