default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenneth Zeger
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
[j75]Spencer Congero
, Kenneth Zeger:
The 3/4 Conjecture for Fix-Free Codes With at Most Three Distinct Codeword Lengths. IEEE Trans. Inf. Theory 69(3): 1452-1485 (2023)- [i12]Spencer Congero, Kenneth Zeger:
Characterizations of Minimal Expected Length Codes. CoRR abs/2311.07007 (2023) - [i11]Spencer Congero, Kenneth Zeger:
Competitive Advantage of Huffman and Shannon-Fano Codes. CoRR abs/2311.07009 (2023) - 2022
- [j74]Spencer Congero, Kenneth Zeger:
Hexagonal Run-Length Zero Capacity Region - Part I: Analytical Proofs. IEEE Trans. Inf. Theory 68(1): 130-152 (2022) - [j73]Spencer Congero, Kenneth Zeger:
Hexagonal Run-Length Zero Capacity Region - Part II: Automated Proofs. IEEE Trans. Inf. Theory 68(1): 153-177 (2022)
2010 – 2019
- 2019
- [j72]Joseph Connelly, Kenneth Zeger:
Capacity and Achievable Rate Regions for Linear Network Coding Over Ring Alphabets. IEEE Trans. Inf. Theory 65(1): 220-234 (2019) - 2018
- [j71]Joseph Connelly, Kenneth Zeger:
Linear Network Coding Over Rings - Part I: Scalar Codes and Commutative Alphabets. IEEE Trans. Inf. Theory 64(1): 274-291 (2018) - [j70]Joseph Connelly, Kenneth Zeger:
Linear Network Coding Over Rings - Part II: Vector Codes and Non-Commutative Alphabets. IEEE Trans. Inf. Theory 64(1): 292-308 (2018) - 2017
- [j69]Joseph Connelly, Kenneth Zeger:
A Class of Non-Linearly Solvable Networks. IEEE Trans. Inf. Theory 63(1): 201-229 (2017) - [i10]Joseph Connelly, Kenneth Zeger:
Linear Capacity of Networks over Ring Alphabets. CoRR abs/1706.01152 (2017) - 2016
- [c36]Joseph Connelly, Kenneth Zeger:
A class of non-linearly solvable networks. ISIT 2016: 1964-1968 - [i9]Joseph Connelly, Kenneth Zeger:
A Class of Non-Linearly Solvable Networks. CoRR abs/1601.03803 (2016) - [i8]Joseph Connelly, Kenneth Zeger:
Linear Network Coding over Rings, Part II: Vector Codes and Non-Commutative Alphabets. CoRR abs/1608.01737 (2016) - [i7]Joseph Connelly, Kenneth Zeger:
Linear Network Coding over Rings, Part I: Scalar Codes and Commutative Alphabets. CoRR abs/1608.01738 (2016) - 2015
- [j68]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Achievable Rate Regions for Network Coding. IEEE Trans. Inf. Theory 61(5): 2488-2509 (2015) - [j67]Randall Dougherty, Eric Freiling, Kenneth Zeger:
Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding. IEEE Trans. Inf. Theory 61(5): 2510-2530 (2015) - 2014
- [c35]Randall Dougherty, Eric Freiling, Kenneth Zeger:
Characteristic-dependent linear rank inequalities and network coding applications. ISIT 2014: 101-105 - [i6]Randall Dougherty, Eric Freiling, Kenneth Zeger:
Characteristic-Dependent Linear Rank Inequalities with Applications to Network Coding. CoRR abs/1401.2507 (2014) - 2013
- [j66]Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Linear Codes, Target Function Classes, and Network Computing Capacity. IEEE Trans. Inf. Theory 59(9): 5741-5753 (2013) - [i5]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Achievable Rate Regions for Network Coding. CoRR abs/1311.4601 (2013) - 2012
- [c34]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Achievable rate regions for network coding. ITA 2012: 160-167 - 2011
- [j65]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Network Coding and Matroid Theory. Proc. IEEE 99(3): 388-405 (2011) - [j64]Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Network Coding for Computing: Cut-Set Bounds. IEEE Trans. Inf. Theory 57(2): 1015-1030 (2011) - [c33]Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Linear coding for network computing. ISIT 2011: 2652-2655 - [i4]Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Network coding for computing: Linear codes. CoRR abs/1101.0085 (2011) - [i3]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Non-Shannon Information Inequalities in Four Random Variables. CoRR abs/1104.3602 (2011)
2000 – 2009
- 2009
- [j63]Jillian Cannons, Laurence B. Milstein, Kenneth Zeger:
An algorithm for wireless relay placement. IEEE Trans. Wirel. Commun. 8(11): 5564-5574 (2009) - [c32]Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Network computing capacity for the reverse butterfly network. ISIT 2009: 259-262 - [i2]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Linear rank inequalities on five or more variables. CoRR abs/0910.0284 (2009) - [i1]Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Network Coding for Computing Part I : Cut-Set Bounds. CoRR abs/0912.2820 (2009) - 2008
- [j62]Jillian Cannons, Kenneth Zeger:
Network Coding Capacity With a Constrained Number of Coding Nodes. IEEE Trans. Inf. Theory 54(3): 1287-1291 (2008) - [j61]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Linear Network Codes and Systems of Polynomial Equations. IEEE Trans. Inf. Theory 54(5): 2303-2316 (2008) - [c31]Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Network coding for computing. Allerton 2008: 1-6 - [c30]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Linear network codes and systems of polynomial equations. ISIT 2008: 1838-1842 - 2007
- [j60]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Networks, Matroids, and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory 53(6): 1949-1969 (2007) - 2006
- [j59]Benjamin Farber, Kenneth Zeger:
Quantizers with uniform decoders and channel-optimized encoders. IEEE Trans. Inf. Theory 52(2): 640-661 (2006) - [j58]Jillian Cannons, Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Network routing capacity. IEEE Trans. Inf. Theory 52(3): 777-788 (2006) - [j57]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Unachievability of network coding capacity. IEEE Trans. Inf. Theory 52(6): 2365-2372 (2006) - [j56]Benjamin Farber, Kenneth Zeger:
Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation. IEEE Trans. Inf. Theory 52(11): 4945-4964 (2006) - [j55]Randall Dougherty, Kenneth Zeger:
Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks. IEEE Trans. Inf. Theory 52(11): 5067-5077 (2006) - [c29]Rathinakumar Appuswamy, Massimo Franceschetti, Kenneth Zeger:
Optimality of Linear Codes for Broadcast-Mode Multicast Networks. ISIT 2006: 50-53 - [c28]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Six New Non-Shannon Information Inequalities. ISIT 2006: 233-236 - [c27]Zsolt Kukorelly, Kenneth Zeger:
Automated Theorem Proving for Hexagonal Run Length Constrained Capacity Computation. ISIT 2006: 1199-1203 - 2005
- [j54]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Insufficiency of linear coding in network information flow. IEEE Trans. Inf. Theory 51(8): 2745-2759 (2005) - [j53]Zsolt Kukorelly, Kenneth Zeger:
Sufficient conditions for existence of binary fix-free codes. IEEE Trans. Inf. Theory 51(10): 3433-3444 (2005) - [c26]Benjamin Farber, Kenneth Zeger:
Quantization of Multiple Sources Using Integer Bit Allocation. DCC 2005: 368-377 - [c25]Jillian Cannons, Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Network routing capacity. ISIT 2005: 11-13 - [c24]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Insufficiency of linear coding in network information flow. ISIT 2005: 264-267 - 2004
- [j52]Tamás Frajka, Kenneth Zeger:
Downsampling dependent upsampling of images. Signal Process. Image Commun. 19(3): 257-265 (2004) - [j51]Benjamin Farber, Kenneth Zeger:
Quantizers with uniform encoders and channel optimized decoders. IEEE Trans. Inf. Theory 50(1): 62-77 (2004) - [j50]Michelle Effros, Hanying Feng, Kenneth Zeger:
Suboptimality of the Karhunen-Loève Transform for Transform Coding. IEEE Trans. Inf. Theory 50(8): 1605-1619 (2004) - [j49]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Linearity and solvability in multicast networks. IEEE Trans. Inf. Theory 50(10): 2243-2256 (2004) - [j48]Zsigmond Nagy, Kenneth Zeger:
Bit-stuffing algorithms and analysis for run-length constrained channels in two and three dimensions. IEEE Trans. Inf. Theory 50(12): 3146-3169 (2004) - [c23]Zsigmond Nagy, Kenneth Zeger:
Capacity bounds for the hard-triangle model. ISIT 2004: 162 - [c22]Benjamin Farber, Kenneth Zeger:
Cell density functions and effective channel code rates for quantizers with uniform decoders and channel optimized encoders. ISIT 2004: 429 - 2003
- [j47]Zsigmond Nagy, Kenneth Zeger:
Asymptotic capacity of two-dimensional channels with checkerboard constraints. IEEE Trans. Inf. Theory 49(9): 2115-2125 (2003) - [j46]Christopher F. Freiling, Douglas S. Jungreis, François Théberge, Kenneth Zeger:
Almost all complete binary prefix codes have a self-synchronizing string. IEEE Trans. Inf. Theory 49(9): 2219-2225 (2003) - [c21]Michelle Effros, Hanying Feng, Kenneth Zeger:
Suboptimality of the Karhuenen-Loève Transform for Transform Coding. DCC 2003: 293-302 - 2002
- [j45]Erik Agrell, Thomas Eriksson, Alexander Vardy, Kenneth Zeger:
Closest point search in lattices. IEEE Trans. Inf. Theory 48(8): 2201-2214 (2002) - [j44]Jon Hamkins, Kenneth Zeger:
Gaussian source coding with spherical codes. IEEE Trans. Inf. Theory 48(11): 2980-2989 (2002) - [c20]Benjamin Farber, Kenneth Zeger:
Quantizers with Uniform Encoders and Channel Optimized Decoders. DCC 2002: 292-301 - [c19]Kenneth Zeger:
Suboptimality of the Karhunen-Loeve transform for fixed-rate transform coding. GLOBECOM 2002: 1224-1228 - [c18]Tamás Frajka, Kenneth Zeger:
Residual image coding for stereo image compression. ICIP (2) 2002: 271-220 - 2001
- [j43]Marc P. C. Fossorier, Zixiang Xiong, Kenneth Zeger:
Progressive source coding for a power constrained Gaussian channel. IEEE Trans. Commun. 49(8): 1301-1306 (2001) - [j42]Erik Agrell, Alexander Vardy, Kenneth Zeger:
A table of upper bounds for binary codes. IEEE Trans. Inf. Theory 47(7): 3004-3006 (2001) - [c17]Tamás Frajka, Kenneth Zeger:
Robust packet image transmission by wavelet coefficient dispersement. ICASSP 2001: 1745-1748 - 2000
- [j41]Balázs Kégl, Adam Krzyzak, Tamás Linder, Kenneth Zeger:
Learning and Design of Principal Curves. IEEE Trans. Pattern Anal. Mach. Intell. 22(3): 281-297 (2000) - [j40]Pamela C. Cosman, Jon K. Rogers, P. Greg Sherwood, Kenneth Zeger:
Combined forward error control and packetized zerotree wavelet encoding for transmission of images over varying channels. IEEE Trans. Image Process. 9(6): 982-993 (2000) - [j39]Zsigmond Nagy, Kenneth Zeger:
Capacity bounds for the three-dimensional (0, 1) run length limited channel. IEEE Trans. Inf. Theory 46(3): 1030-1033 (2000) - [j38]András Méhes, Kenneth Zeger:
Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds. IEEE Trans. Inf. Theory 46(6): 2133-2151 (2000) - [j37]Erik Agrell, Alexander Vardy, Kenneth Zeger:
Upper bounds for constant-weight codes. IEEE Trans. Inf. Theory 46(7): 2373-2395 (2000) - [j36]András Méhes, Kenneth Zeger:
Performance of quantizers on noisy channels using structured families of codes. IEEE Trans. Inf. Theory 46(7): 2468-2476 (2000) - [j35]Akiko Kato, Kenneth Zeger:
Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels. IEEE Trans. Inf. Theory 46(7): 2666-2670 (2000) - [j34]Tamás Linder, Ram Zamir, Kenneth Zeger:
On source coding with side-information-dependent distortion measures. IEEE Trans. Inf. Theory 46(7): 2697-2704 (2000) - [c16]P. Greg Sherwood, Xiaodong Tian, Kenneth Zeger:
Efficient Image and Channel Coding for Wireless Packet Networks. ICIP 2000: 132-135
1990 – 1999
- 1999
- [j33]Hisashi Ito, Akiko Kato, Zsigmond Nagy, Kenneth Zeger:
Zero Capacity Region of Multidimensional Run Length Constraints. Electron. J. Comb. 6 (1999) - [j32]Tamás Linder, Ram Zamir, Kenneth Zeger:
High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding. IEEE Trans. Inf. Theory 45(2): 548-561 (1999) - [j31]Vahid Tarokh, Alexander Vardy, Kenneth Zeger:
Universal Bound on the Performance of Lattice Codes. IEEE Trans. Inf. Theory 45(2): 670-681 (1999) - [j30]András Méhes, Kenneth Zeger:
Randomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources. IEEE Trans. Inf. Theory 45(2): 788-794 (1999) - [j29]Akiko Kato, Kenneth Zeger:
On the capacity of two-dimensional run-length constrained channels. IEEE Trans. Inf. Theory 45(5): 1527-1540 (1999) - [j28]András György, Tamás Linder, Kenneth Zeger:
On the rate-distortion function of random vectors and stationary sources with mixed distributions. IEEE Trans. Inf. Theory 45(6): 2110-2115 (1999) - [c15]Zsigmond Nagy, Kenneth Zeger:
Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel. AAECC 1999: 245-251 - [c14]András Méhes, Kenneth Zeger:
Performance of Quantizers on Noisy Channels Using Structured Families of Codes. Data Compression Conference 1999: 473-482 - [c13]P. Greg Sherwood, Xiaodong Tian, Kenneth Zeger:
Channel code blocklength and rate optimization for progressive image transmission. WCNC 1999: 978-982 - 1998
- [j27]Pamela C. Cosman, Kenneth Zeger:
Memory constrained wavelet based image coding. IEEE Signal Process. Lett. 5(9): 221-223 (1998) - [j26]P. Greg Sherwood, Kenneth Zeger:
Error protection for progressive image transmission over memoryless and fading channels. IEEE Trans. Commun. 46(12): 1555-1559 (1998) - [j25]András Méhes, Kenneth Zeger:
Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments. IEEE Trans. Inf. Theory 44(1): 79-94 (1998) - [c12]Tamás Linder, Ram Zamir, Kenneth Zeger:
The Multiple Description Rate Region for High Resolution Source Coding. Data Compression Conference 1998: 149-158 - [c11]Pamela C. Cosman, Tamás Frajka, Kenneth Zeger:
Image Compression for Memory Constrained Printers. ICIP (3) 1998: 109-113 - [c10]Marc P. C. Fossorier, Zixiang Xiong, Kenneth Zeger:
Joint Source-Channel Image Coding for a Power Constrained Noisy Channel. ICIP (2) 1998: 122-126 - [c9]P. Greg Sherwood, Kenneth Zeger:
Error Protection for Progressive Image Transmission over Memoryless and Fading Channels. ICIP (1) 1998: 324-328 - [c8]Balázs Kégl, Adam Krzyzak, Tamás Linder, Kenneth Zeger:
A Polygonal Line Algorithm for Constructing Principal Curves. NIPS 1998: 501-507 - 1997
- [j24]P. Greg Sherwood, Kenneth Zeger:
Progressive image coding for noisy channels. IEEE Signal Process. Lett. 4(7): 189-191 (1997) - [j23]Tamás Linder, Gábor Lugosi, Kenneth Zeger:
Empirical quantizer design in the presence of source noise or channel noise. IEEE Trans. Inf. Theory 43(2): 612-623 (1997) - [j22]Jon Hamkins, Kenneth Zeger:
Improved bounds on maximum size binary radar arrays. IEEE Trans. Inf. Theory 43(3): 997-1000 (1997) - [j21]Bertrand M. Hochwald, Kenneth Zeger:
Tradeoff between source and channel coding. IEEE Trans. Inf. Theory 43(5): 1412-1424 (1997) - [j20]Jon Hamkins, Kenneth Zeger:
Asymptotically dense spherical codes - Part h Wrapped spherical codes. IEEE Trans. Inf. Theory 43(6): 1774-1785 (1997) - [j19]Jon Hamkins, Kenneth Zeger:
Asymptotically dense spherical codes - Part II: Laminated spherical codes. IEEE Trans. Inf. Theory 43(6): 1786-1798 (1997) - [j18]Tamás Linder, Vahid Tarokh, Kenneth Zeger:
Existence of optimal prefix codes for infinite source alphabets. IEEE Trans. Inf. Theory 43(6): 2026-2028 (1997) - [c7]P. Greg Sherwood, Kenneth Zeger:
Progressive Image Coding on Noisy Channels. Data Compression Conference 1997: 72-81 - [c6]Tamás Frajka, P. Greg Sherwood, Kenneth Zeger:
Progressive Image Coding with Spatially Variable Resolution. ICIP (1) 1997: 53-56 - 1996
- [j17]Gábor Lugosi, Kenneth Zeger:
Concept learning using complexity regularization. IEEE Trans. Inf. Theory 42(1): 48-54 (1996) - [j16]Tamás Linder, Kenneth Zeger:
On the cost of finite block length in quantizing unbounded memoryless sources. IEEE Trans. Inf. Theory 42(2): 480-487 (1996) - [c5]Tamás Linder, Gábor Lugosi, Kenneth Zeger:
Designing Vector Quantizers in the Presence of Source Noise or Channel Noise. Data Compression Conference 1996: 33-42 - 1995
- [j15]Tamás Linder, Gábor Lugosi, Kenneth Zeger:
Fixed-rate universal lossy source coding and rates of convergence for memoryless sources. IEEE Trans. Inf. Theory 41(3): 665-676 (1995) - [j14]Gábor Lugosi, Kenneth Zeger:
Nonparametric estimation via empirical risk minimization. IEEE Trans. Inf. Theory 41(3): 677-687 (1995) - 1994
- [j13]Kenneth Zeger, Anurag Bist, Tamás Linder:
Universal source coding with codebook transmission. IEEE Trans. Commun. 42(234): 336-346 (1994) - [j12]Tamás Linder, Kenneth Zeger:
Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization. IEEE Trans. Inf. Theory 40(2): 575-579 (1994) - [j11]Kenneth Zeger, Allen Gersho:
Number of nearest neighbors in a Euclidean code. IEEE Trans. Inf. Theory 40(5): 1647-1649 (1994) - [j10]Tamás Linder, Gábor Lugosi, Kenneth Zeger:
Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding. IEEE Trans. Inf. Theory 40(6): 1728-1740 (1994) - [j9]Kenneth Zeger, V. Manzella:
Asymptotic bounds on optimal noisy channel optimization via random coding. IEEE Trans. Inf. Theory 40(6): 1926-1938 (1994) - 1993
- [j8]Kenneth Zeger, Miriam R. Kantorovitz:
Average number of facets per cell in tree-structured vector quantizer partitions. IEEE Trans. Inf. Theory 39(3): 1053-1055 (1993) - [j7]Tamás Linder, Christian Schlegel, Kenneth Zeger:
Corrected proof of de Buda's theorem. IEEE Trans. Inf. Theory 39(5): 1735- (1993) - [c4]Tamás Linder, Gábor Lugosi, Kenneth Zeger:
Universality and Rates of Convergence in Lossy Source Coding. Data Compression Conference 1993: 89-97 - 1992
- [j6]Kris Popat, Kenneth Zeger:
Robust quantization of memoryless sources using dispersive FIR filters. IEEE Trans. Commun. 40(11): 1670-1674 (1992) - [j5]Eyal Yair, Kenneth Zeger, Allen Gersho:
Competitive learning and soft competition for vector quantizer design. IEEE Trans. Signal Process. 40(2): 294-309 (1992) - [j4]Kenneth Zeger, Jacques Vaisey, Allen Gersho:
Globally optimal vector quantizer design by stochastic relaxation. IEEE Trans. Signal Process. 40(2): 310-322 (1992) - [c3]Kenneth Zeger, Anurag Bist:
Universal adaptive vector quantization using codebook quantization with application to image compression. ICASSP 1992: 381-384 - 1991
- [j3]Kenneth Zeger:
Corrections to 'Gradient algorithms for designing predictive vector quantizers'. IEEE Trans. Signal Process. 39(3): 764-765 (1991) - [c2]Kenneth Zeger, Allen Gersho:
A parallel processing algorithm for vector quantizer design based on subpartitioning. ICASSP 1991: 1141-1143 - 1990
- [j2]Hai-Ning Liu, Celia Wrathall, Kenneth Zeger:
Efficient Solution to Some Problems in Free Partially Commutative Monoids. Inf. Comput. 89(2): 180-198 (1990) - [j1]Kenneth Zeger, Allen Gersho:
Pseudo-Gray coding. IEEE Trans. Commun. 38(12): 2147-2158 (1990) - [c1]Eyal Yair, Kenneth Zeger, Allen Gersho:
Conjugate gradient methods for designing vector quantizers. ICASSP 1990: 245-248
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-05-08 21:43 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:
