


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 31 matches
- 1961
- R. P. Bambah, D. D. Joshi, Indar S. Luthar:
Some Lower Bounds on the Number of Code Points in a Minimum Distance Binary Code. I. Inf. Control. 4(4): 313-319 (1961) - R. P. Bambah, D. D. Joshi, Indar S. Luthar:
Some Lower Bounds on the Number of Code Points in a Minimum Distance Binary Code. II. Inf. Control. 4(4): 320-323 (1961) - Ranan B. Banerji:
On Constructing Group Codes. Inf. Control. 4(1): 1-14 (1961) - Richard Bellman, Brian Gluss:
On Various Versions of the Defective Coin Problem. Inf. Control. 4(2-3): 118-131 (1961) - Richard Bellman, Robert Kalaba:
A Note on Interrupted Stochastic Control Processes. Inf. Control. 4(4): 346-349 (1961) - Jay M. Berger:
A Note on Error Detection Codes for Asymmetric Channels. Inf. Control. 4(1): 68-73 (1961) - Jay M. Berger:
A Note on Burst Detecting Sum Codes. Inf. Control. 4(2-3): 297-299 (1961) - Frederick J. Beutler:
Sampling Theorems and Bases in a Hilbert Space. Inf. Control. 4(2-3): 97-117 (1961) - Charles P. Bourne, Donald F. Ford:
A Study of the Statistics of Letters in English Words. Inf. Control. 4(1): 48-67 (1961) - Lorenzo Calabi:
A Note on Rank and Nullity in Coding Theory. Inf. Control. 4(4): 359-363 (1961) - Colin Cherry, Peter K. T. Vaswani:
A New Type of Computer for Problems in Propositional Logic, with Greatly Reduced Scanning Procedures. Inf. Control. 4(2-3): 155-168 (1961) - Robert W. Floyd:
A Note on Mathematical Induction on Phrase Structure Grammars. Inf. Control. 4(4): 353-358 (1961) - Arthur Gill:
Sate-Identification Experiments in Finite Automata. Inf. Control. 4(2-3): 132-154 (1961) - Vincent E. Giuliano, Paul E. Jones Jr., George E. Kimball, Richard F. Meyer, Barry A. Stein:
Automatic Pattern Recognition by a Gestalt Method. Inf. Control. 4(4): 332-345 (1961) - I. J. Good:
Amount of Deciding and Decisionary Effort. Inf. Control. 4(2-3): 271-281 (1961) - Harry Kesten:
Some Remarks on the Capacity of Compound Channels in the Semicontinuous Case. Inf. Control. 4(2-3): 169-184 (1961) - Philip M. Lewis II:
A Note on Realization of Decision Networks Using Summation Elements. Inf. Control. 4(2-3): 282-290 (1961) - Benoit Mandelbrot:
Final Note on a Class of Skew Distribution Functions: Analysis and Critique of a Mode Due to H. A. Simon. Inf. Control. 4(2-3): 198-216 (1961) - Benoit Mandelbrot:
Post Scriptum to "Final Note". Inf. Control. 4(2-3): 300-304 (1961) - C. Rajski:
A Metric Space of Discrete Probability Distributions. Inf. Control. 4(4): 371-377 (1961) - William L. Root:
Communications through Unspecified Additive Noise. Inf. Control. 4(1): 15-29 (1961) - Marcel Paul Schützenberger:
A Remark on Finite Transducers. Inf. Control. 4(2-3): 185-196 (1961) - Marcel Paul Schützenberger:
On the Definition of a Family of Automata. Inf. Control. 4(2-3): 245-270 (1961) - Herbert A. Simon:
Reply to "Final Note" by Benoit Mandelbrot. Inf. Control. 4(2-3): 217-223 (1961) - Herbert A. Simon:
Reply to Dr. Mandelbrot's Post Scriptum. Inf. Control. 4(2-3): 305-308 (1961) - Gustave Solomon:
A Note on a New Class of Codes. Inf. Control. 4(4): 364-370 (1961) - Jeremy I. Stone:
Multiple Burst Error Correction. Inf. Control. 4(4): 324-331 (1961) - H. W. Tuffill:
A Note on Recognition of Hand-Printed Characters. Inf. Control. 4(2-3): 197 (1961) - Satosi Watanabe:
A Note on the Formation of Concept and of Association by Information-Theoretical Correlation Analysis. Inf. Control. 4(2-3): 291-296 (1961) - Richard F. Whitbeck:
Phase Plane Analysis: The Application of Lienard's Construction to a Particularly Important Second Order Differential Equation. Inf. Control. 4(1): 30-47 (1961)
skipping 1 more match
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 2025-03-02 19:27 CET 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