Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 176 matches
- 1970
- Ashok K. Agrawala:
Learning with a probabilistic teacher. IEEE Trans. Inf. Theory 16(4): 373-379 (1970) - Marshall W. Anderson, R. Benning:
A distribution-free discrimination procedure based on clustering. IEEE Trans. Inf. Theory 16(5): 541-548 (1970) - Garrett Gordon Apple, Paul A. Wintz:
Calculation of Fourier transforms on finite Abelian groups (Corresp.). IEEE Trans. Inf. Theory 16(2): 233-234 (1970) - Michael A. Arbib:
Review of 'Theory of Automata' (Salomaa, A.; 1969). IEEE Trans. Inf. Theory 16(5): 652-653 (1970) - Michael A. Arbib:
Review of 'The Sciences of the Artificial' (Simon, H. A.; 1969). IEEE Trans. Inf. Theory 16(6): 803-804 (1970) - Albert Arcese, P. H. Mengert, E. W. Trombini:
Image detection through bipolar correlation. IEEE Trans. Inf. Theory 16(5): 534-541 (1970) - Michael P. Beddoes, Otto Meier:
Flicker effect and television compression. IEEE Trans. Inf. Theory 16(2): 214-218 (1970) - Toby Berger:
Information rates of Wiener processes. IEEE Trans. Inf. Theory 16(2): 134-139 (1970) - S. Berkowitz:
Block filtering in amplitude-continuous time-discrete channels (Corresp.). IEEE Trans. Inf. Theory 16(6): 782-786 (1970) - Frederick J. Beutler:
Alias-free randomly timed sampling of stochastic processes. IEEE Trans. Inf. Theory 16(2): 147-152 (1970) - B. H. Bharucha, T. T. Kadota:
On the representation of continuous parameter processes by a sequence of random variables. IEEE Trans. Inf. Theory 16(2): 139-141 (1970) - Nelson M. Blachman:
Geometry of optimum incoherent detection. IEEE Trans. Inf. Theory 16(2): 202-205 (1970) - Colin C. Blaydon, R. L. Kashyap, Terry J. Wagner:
Comments on the Estimation of Distribution Functions (Corresp.). IEEE Trans. Inf. Theory 16(2): 226 (1970) - Edward A. Bucher:
Sequential decoding of systematic and nonsystematic convolutional codes with arbitrary decoder bias. IEEE Trans. Inf. Theory 16(5): 611-624 (1970) - Edward A. Bucher, Jerrold A. Heller:
Error probability bounds for systematic convolutional codes. IEEE Trans. Inf. Theory 16(2): 219-224 (1970) - Rudolf de Buda:
Signals that can be calculated from their ambiguity function. IEEE Trans. Inf. Theory 16(2): 195-202 (1970) - Stanley A. Butman:
Rank-order statistics for optimum detection of binary signals in the presence of white noise and dc drift (Corresp.). IEEE Trans. Inf. Theory 16(3): 348-351 (1970) - J. Bibb Cain, Richard S. Simpson:
Concatenation schemes for the Gaussian channel with feedback (Corresp.). IEEE Trans. Inf. Theory 16(5): 632-635 (1970) - Henry D. Chadwick, Irving S. Reed:
The equivalence of rank permutation codes to a new class of binary codes (Corresp.). IEEE Trans. Inf. Theory 16(5): 640-641 (1970) - Gregory J. Chaitin:
On the difficulty of computations. IEEE Trans. Inf. Theory 16(1): 5-9 (1970) - B. Chandrasekaran:
Finite-memory hypothesis testing-A critique (Corresp.). IEEE Trans. Inf. Theory 16(4): 494-496 (1970) - Ke-Yen Chang, A. Moore:
Modified digital correlator and its estimation errors. IEEE Trans. Inf. Theory 16(6): 699-706 (1970) - David Chase:
Coding theorems for the nonsynchronized channel. IEEE Trans. Inf. Theory 16(1): 55-73 (1970) - Chin-Long Chen:
Computer results on the minimum distance of some binary cyclic codes (Corresp.). IEEE Trans. Inf. Theory 16(3): 359-360 (1970) - Albert C. L. Chiang, Irving S. Reed:
Arithmetic norms and bounds of the arithmetic AN codes. IEEE Trans. Inf. Theory 16(4): 470-476 (1970) - C. K. Chow:
On optimum recognition error and reject tradeoff. IEEE Trans. Inf. Theory 16(1): 41-46 (1970) - Arthur J. Collmeyer, Someshwar C. Gupta:
Estimating the amplitude of a sinusoid from noisy random samples (Corresp.). IEEE Trans. Inf. Theory 16(4): 487-489 (1970) - A. Brinton Cooper III, Willis C. Gore:
A recent result concerning the dual of polynomial codes (Corresp.). IEEE Trans. Inf. Theory 16(5): 638-640 (1970) - Joseph T. Cordaro Jr., Terry J. Wagner:
Intersymbol interference on a continuous-time Gaussian channel. IEEE Trans. Inf. Theory 16(4): 422-429 (1970) - Thomas M. Cover, Martin E. Hellman:
The two-armed-bandit problem with time-invariant finite memory. IEEE Trans. Inf. Theory 16(2): 185-195 (1970)
skipping 146 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-24 00:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint