Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #101 to #150.

View ( | ) (20 | 50 | 100 | 250 | 500)

  1. Multi-threshold threshold elements: Label: en
  2. On-Line Turing Machine Computations: Label: en
  3. Band-Pass Quadrature Filters: Label: en
  4. A Learning Network Using Adaptive Threshold Elements: Label: en
  5. Construction of Irredundant Multilevel Switching Functions: Label: en
  6. Three-Valued Propositional Calculus of Lukasiewicz. and Three-Position Double Switches: Label: en
  7. Complete Sets of Functions of Two and Three Binary Variables: Label: en
  8. Computation of Time-Phase Displacements of Binary Linear Sequence Generators: Label: en
  9. Characterization and Cardinality of Universal Functions: Label: en
  10. RST Flip-Flop Input Equations: Label: en
  11. Testing and Realization of Threshold Functions with Don't Cares: Label: en
  12. Computing Irredundant Normal Forms from Abbreviated Presence Functions: Label: en
  13. Optimum Design of a Diode Squarer by Applying the Criterion of Square Root of the Integral of Per Cent Error Squared: Label: en
  14. Stress Effects on Thin-Film Parametrons: Label: en
  15. About Some Properties of Definite, Reverse-Definite and Related Automata: Label: en
  16. An organization for checking experiments on sequential circuits: Label: en
  17. Hybrid Computer Solution of Optimal Control Problems by the Maximum Principle: Label: en
  18. Lower Bound of the Number of Threshold Functions: Label: en
  19. The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4: Label: en
  20. High Speed Binary Parallel Adder: Label: en
  21. Breaker Page: Label: en
  22. A Threshold Logic Network for Shape Invariance: Label: en
  23. Adaptive Coding for Self-Clocking Recording: Label: en
  24. Crosstalk (Noise) in Digital Systems: Label: en
  25. On the Hyperplanes of the Taylor-Steinbuch Linear Separator: Label: en
  26. A Correspondence Between Equivalence Classes of Switching Functions and Group Codes: Label: en
  27. The Theory of Definite Automata: Label: en
  28. Reliability Aspects of the Variable Instruction Computer: Label: en
  29. PHASEPLOT: An On-Line Graphical Display Technique: Label: en
  30. Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms: Label: en
  31. On Computer Self-Diagnosis Part II-Generalizations and Design Principles: Label: en
  32. Feedback in Synchronous Sequential Switching Circuits: Label: en
  33. Synthesis of Error-Tolerant Counters Using Minimum Distance Three State Assignments: Label: en
  34. Computer Simulation of Waveform Distortions in Digital Magnetic Recordings: Label: en
  35. Optimum Time Sharing of a Digital Communication Channel: Label: en
  36. Editor's notice [End of info retrieval cards]: Label: en
  37. A Geometric Synthesis Method of Three-Input Majority Logic Networks: Label: en
  38. Cyclic Codes in Multiple Channel Parallel Systems: Label: en
  39. Memory Protection in Multiprocessing Systems: Label: en
  40. Feed-Forward Threshold Logic Nets for Digital Switching and Pattern Recognition: Label: en
  41. A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks: Label: en
  42. An Algorithm for Linear Inequalities and its Applications: Label: en
  43. A Note on the Problem of Classifying Vertices of the n Cube into m Categories: Label: en
  44. Minimal Shift-Register Realizations of Sequential Machines: Label: en
  45. Ferromagnetic Wire Memory: Label: en
  46. Enumeration of Seven-Argument Threshold Functions: Label: en
  47. Statistical Analysis of Paged and Segmented Computer Systems: Label: en
  48. A Method of Determining the Number of Vertices Contained in the SC Network Corresponding to a Given SC Transmission Function: Label: en
  49. A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table: Label: en
  50. Plated Wire Content-Addressable Memories with Bit-Steering Technique: Label: en

View ( | ) (20 | 50 | 100 | 250 | 500)