Patrick C. Fischer | Academic Influence

Patrick C. Fischer's AcademicInfluence.com Rankings

Patrick C. Fischer

Computer Science

#890

World Rank

#922

Historical Rank

#483

USA Rank

Database

#2183

World Rank

#2296

Historical Rank

#503

USA Rank

Machine Learning

#5266

World Rank

#5333

Historical Rank

#207

USA Rank

Artificial Intelligence

#5653

World Rank

#5735

Historical Rank

#322

USA Rank

computer-science Degrees

Download Badge

Computer Science

Patrick C. Fischer's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Patrick C. Fischer Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Patrick Carl Fischer was an American computer scientist, a noted researcher in computational complexity theory and database theory, and a target of the Unabomber. Biography Fischer was born December 3, 1935, in St. Louis, Missouri. His father, Carl H. Fischer, became a professor of actuarial mathematics at the University of Michigan in 1941, and the family moved to Ann Arbor, Michigan, where he grew up. Fischer himself went to the University of Michigan, receiving a bachelor's degree in 1957 and an MBA in 1958. He went on to graduate studies at the Massachusetts Institute of Technology, earning a Ph.D. in 1962 under the supervision of Hartley Rogers, Jr., with a thesis on the subject of recursion theory.

(See a Problem?)

Patrick C. Fischer's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Generation of Primes by a One-Dimensional Real-Time Iterative Array (1965) (198)
Nested Relations and Complex Objects in Databases (1989) (144)
Counter machines and counter languages (1968) (117)
Turing Machines with Restricted Memory Access (1966) (108)
Multitape One-Way Nonwriting Automata (1968) (83)
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations (1980) (78)
Real-Time Simulation of Multihead Tape Units (1972) (75)
Interactions between Dependencies and Nested Relational Structures (1985) (63)
Computational speed-up by effective operators (1972) (58)
Computations with a restricted number of nondeterministic steps (Extended Abstract) (1977) (53)
Translational methods and computational complexity (1965) (49)
On Formalisms for Turing Machines (1964) (44)
Efficient Procedures for Using Matrix Algorithms (1974) (44)
Multilevel Nested Relational Structures (1988) (40)
Determining when a Structure is a Nested Relation (1985) (37)
Weak multivalued dependencies (1984) (36)
Automatic propagated and round-off error analysis (1958) (32)
Decomposition of a relation scheme into Boyce-Codd Normal Form (1980) (30)
Multi-tape and infinite-state automata—a survey (1965) (26)
The Reduction of Tape Reversals for Off-Line One-Tape Turing Machines (1968) (25)
Some classes of multilevel relational structures (1985) (23)
Decomposition of a relation scheme into Boyce-Codd Normal Form (1982) (23)
Further Schemes for Combining Matrix Algorithms (1974) (21)
Theory of provable recursive functions (1965) (21)
Real-time computations with restricted nondeterminism (1978) (20)
Turing machine (2003) (19)
Storage reorganization techniques for matrix computation in a paging environment (1979) (19)
The Solvability of the Halting Problem for 2-State Post Machines (1967) (17)
Turing Machines with a Schedule to Keep (1967) (16)
On Computational Speed-Up (1968) (15)
Succinctness in Dependency Systems (1983) (15)
The Complexity of Recognizing 3NF Relation Schemes (1982) (15)
On computability by certain classes of restricted Turing machines (1963) (15)
Time-Restricted Sequence Generation (1970) (14)
Turing Machines with Several Read-Write Heads (Preliminary Report) (1967) (10)
A NOTE ON BOUNDED-TRUTH-TABLE REDUCIBILITY (1963) (10)
Tape Reversal Complexity Hierarchies (1968) (9)
Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard (1983) (9)
Proceedings of the fourth annual ACM symposium on Theory of computing (1969) (8)
Structure of Relations Satisfying Certain Families of Dependencies (1985) (7)
Quantificational variants on the halting problem for turing machines (1969) (6)
A note on matrix multiplication in a paging environment (1976) (6)
Predecessor Machines (1974) (6)
Real Time Counter Machines (Preliminary Version) (1967) (6)
High Level Data Manipulation Languages for Unnormalized Relational Database Models (1986) (5)
Review: Claude E. Shannon, A Universal Turing Machine with Two Internal States (1971) (5)
Predecessor machines and regressing functions (1972) (4)
Special SIGACT issueFourth Annual ACM Symposium on Theory of Computing (1976) (3)
Papers from the Workshop ``Theory and Applications of Nested Relations and Complex Objects' on Nested Relations and Complex Objects (1987) (2)
Nested Relations and Complex Objects, Papers from the Workshop "Theory and Applications of Nested Relations and Complex Objects", Darmstadt, Germany, April 6-8, 1987 (1989) (1)
Proceedings of the second annual ACM symposium on Theory of computing (1970) (1)
Shannon Claude E.. A universal Turing machine with two internal states. Automata studies, edited by Shannon C. E. and McCarthy J., Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton 1956, pp. 157–165. (1971) (1)
On the Sequential Nature of Functions (1976) (1)
I. the Smart Project -status Report and Plans (1967) (1)
McCarthy John. The inversion of functions defined by Turing machines. Automata studies, edited by Shannon C. E. and McCarthy J., Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton 1956, pp. 177–181. (1970) (0)
de Leeuw K., Moore E. F., Shannon C. E., and Shapiro N.. Computability by probabilistic machines. Automata studies, edited by Shannon C. E. and McCarthy J., Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton 1956, pp. 183–212. (1970) (0)
Review: John McCarthy, The Inversion of Functions Defined by Turing Machines (1970) (0)
Well-formed formula (WFF) (2003) (0)
SIGACT (Paper Session) (1976) (0)
SOME CLASSES OF MULTILEVEL RELATIONAL STRUCTURES (Extended Abstract) (1986) (0)
Review: J. Hartmanis, J. E. Hopcroft, What Makes Some Language Theory Problems Undecidable (1975) (0)
Review: K. de Leeuw, E. F. Moore, C. E. Shannon, N. Shapiro, Computability by Probabilistic Machines (1970) (0)
Minsky M. L.. Some universal elements for finite automata. Automata studies, edited by Shannon C. E. and McCarthy J., Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton 1956, pp. 117–128. (1970) (0)
Review: N. V. Beljakin, L. Ebner, Turning Machines Operating on a Plane (1968) (0)
Review: M. L. Minsky, J.E. McCarthy, C.E. Shannon, Some Universal Elements for Finite Automata (1970) (0)
Nested Relations: A Step Forward - or Backward? (1988) (0)
Special SIGACT issue: Fifth Annual ACM Symposium on Theory of Computing (1974) (0)
Hartmanis J. and Hopcroft J. E.. What makes some language theory problems undecidable. Journal of computer and system sciences , vol. 4 (1970), pp. 368–376. (1975) (0)
Logic and Algorithms. With Applications to the Computer and Information Sciences. Robert R. Korfhage. Wiley, New York, 1966. 206 pp., illus. $7.95 (1967) (0)
Logic for Computation: Logic and Algorithms . With Applications to the Computer and Information Sciences. Robert R. Korfhage. Wiley, New York, 1966. 206 pp., illus. $7.95. (1967) (0)

This paper list is powered by the following services:

Other Resources About Patrick C. Fischer

en.wikipedia.org

What Schools Are Affiliated With Patrick C. Fischer?

Patrick C. Fischer is affiliated with the following schools: