![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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 45 matches
- 1968
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
Time and Tape Complexity of Pushdown Automaton Languages. Inf. Control. 13(3): 186-206 (1968) - Ronald Alter:
On the Non-Existence of Perfect Double Hamming-Error-Correcting Codes on q = 8 and q = 9 Symbols. Inf. Control. 13(6): 619-627 (1968) - Brian D. O. Anderson, John B. Moore:
Optimal State Estimation in High Noise. Inf. Control. 13(4): 286-294 (1968) - Udo Augustin:
The Capacity of the Product Channel. Inf. Control. 13(6): 594-596 (1968) - P. Balasubrahmanyam, Gift Siromoney:
A Note on Entropy of Telugu Prose. Inf. Control. 13(4): 281-285 (1968) - Toby Berger:
Rate Distortion Theory for Sources with Abstract Alphabets and Memory. Inf. Control. 13(3): 254-273 (1968) - Douglas C. Bossen, Stephen S. Yau:
Redundant Residue Polynomial Codes. Inf. Control. 13(6): 597-618 (1968) - Walter S. Brainerd:
The Minimalization of Tree Automata. Inf. Control. 13(5): 484-491 (1968) - Henry D. Chadwick, Ludwik Kurz:
Two Sequential Nonparametric Detection Procedures. Inf. Control. 13(5): 403-428 (1968) - K. Mani Chandy, Chittoor V. Ramamoorthy:
Optimization of Information Storage Systems. Inf. Control. 13(6): 509-526 (1968) - David K. Chow:
On Threshold Decoding of Cyclic Codes. Inf. Control. 13(5): 471-483 (1968) - Edward L. Cohen, Shimshon Berkovits:
Exponential Distributions in Markov Chain Models for Communication Channels. Inf. Control. 13(2): 134-139 (1968) - Tyrone E. Duncan:
Evaluation of Likelihood Functions. Inf. Control. 13(1): 62-74 (1968) - Jerome Feder:
Languages of Encoded Line Patterns. Inf. Control. 13(3): 230-244 (1968) - Michael A. Harrison, Oscar H. Ibarra:
Multi-Tape and Multi-Head Pushdown Automata. Inf. Control. 13(5): 433-470 (1968) - W. E. Hartnett:
Generalization of Tests for Certain Properties of Variable-Length Codes. Inf. Control. 13(1): 20-45 (1968) - Carl W. Helstrom:
Detection Theory and Quantum Mechanics (II). Inf. Control. 13(2): 156-171 (1968) - John E. Hopcroft, Jeffrey D. Ullman:
Sets Accepted by One-Way Stack Automata Are Context Sensitive. Inf. Control. 13(2): 114-133 (1968) - Kazuo Horiuchi:
Sampling Principle for Continuous Signals with Time-Varying Bands. Inf. Control. 13(1): 53-61 (1968) - Charles E. Hutchinson, Y. T. Chon, R. A. Leuchs:
An Analysis of the Effect of Integral and Sigma Pulse Frequency Modulation on White Noise. Inf. Control. 13(3): 173-185 (1968) - Neil D. Jones:
Classes of Automata and Transitive Closure. Inf. Control. 13(3): 207-229 (1968) - Thomas Kailath:
A Note on Least-Squares Estimates from Likelihood Ratios. Inf. Control. 13(6): 534-540 (1968) - Tiko Kameda:
Erratum: "Generalized Transition Matrix of a Sequential Machine and Its Applications". Inf. Control. 13(4): 401 (1968) - Kojiro Kobayashi:
Some Unsolvable Problems on Context-Free Languages and Their Application to On-Line Language Recognizers. Inf. Control. 13(3): 245-253 (1968) - David M. Mandelbaum:
A Note on Synchronizable Error-Correcting Codes. Inf. Control. 13(5): 429-432 (1968) - Wai-Hung Ng, Paul E. Pfeiffer:
Minimum-Hamming-Distance Decoding of Single-Generator Binary Convolutional Codes. Inf. Control. 13(4): 195-315 (1968) - T. T. Nieh:
Stochastic Sequential Machines with Prescribed Performance Criteria. Inf. Control. 13(2): 99-113 (1968) - Claude Pair, Alain Quéré:
Définition et Etude des Bilangages Réguliers. Inf. Control. 13(6): 565-593 (1968) - Franco P. Preparata:
A Class of Optimum Nonlinear Double-Error-Correcting Codes. Inf. Control. 13(4): 378-400 (1968) - Franco P. Preparata:
Erratum, "Weight and Distance Structure of Nordstrom-Robinson Quadratic Code". Inf. Control. 13(2): 172 (1968)
skipping 15 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-09-06 22:50 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