default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick C. Fischer
Person information
- affiliation: Vanderbilt University, Nashville, TN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1989
[e5]Serge Abiteboul, Patrick C. Fischer, Hans-Jörg Schek:
Nested Relations and Complex Objects, Papers from the Workshop "Theory and Applications of Nested Relations and Complex Objects", Darmstadt, Germany, April 6-8, 1987. Lecture Notes in Computer Science 361, Springer 1989, ISBN 3-540-51171-7 [contents]- 1988
- [j24]Dirk Van Gucht, Patrick C. Fischer:
Multilevel Nested Relational Structures. J. Comput. Syst. Sci. 36(1): 77-105 (1988) - [c23]Patrick C. Fischer:
Nested Relations: A Step Forward - or Backward? SIGMOD Conference 1988: 2 - 1986
- [j23]Stan J. Thomas, Patrick C. Fischer:
Nested Relational Structures. Adv. Comput. Res. 3: 269-307 (1986) - [c22]Dirk Van Gucht, Patrick C. Fischer:
Some Classes of Multilevel Relational Structures. PODS 1986: 60-69 - [c21]Dirk Van Gucht, Patrick C. Fischer:
High Level Data Manipulation Languages for Unnormalized Relational Database Models. XP7.52 Workshop on Database Theory 1986 - 1985
- [j22]Patrick C. Fischer, Lawrence V. Saxton, Stan J. Thomas, Dirk Van Gucht:
Interactions between Dependencies and Nested Relational Structures. J. Comput. Syst. Sci. 31(3): 343-354 (1985) - [c20]Patrick C. Fischer, Dirk Van Gucht:
Structure of Relations Satisfying Certain Families of Dependencies. STACS 1985: 131-142 - [c19]Patrick C. Fischer, Dirk Van Gucht:
Determining when a Structure is a Nested Relation. VLDB 1985: 171-180 - 1984
- [c18]Patrick C. Fischer, Dirk Van Gucht:
Weak Multivalued Dependencies. PODS 1984: 266-274 - 1983
- [j21]Patrick C. Fischer, Don-Min Tsou:
Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard. SIAM J. Comput. 12(2): 259-266 (1983) - [j20]Patrick C. Fischer, Jiann H. Jou, Don-Min Tsou:
Succinctness in Dependency Systems. Theor. Comput. Sci. 24: 323-329 (1983) - 1982
- [j19]Jiann H. Jou, Patrick C. Fischer:
The Complexity of Recognizing 3NF Relation Schemes. Inf. Process. Lett. 14(4): 187-190 (1982) - [j18]Don-Min Tsou, Patrick C. Fischer:
Decomposition of a relation scheme into Boyce-Codd Normal Form. SIGACT News 14(3): 23-29 (1982) - 1981
- [c17]Patrick C. Fischer, Jiann H. Jou, Don-Min Tsou:
Succinctness in Dependency Systems. XP2 Workshop on Relational Database Theory 1981 - 1980
- [j17]Chandra M. R. Kintala, Patrick C. Fischer:
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations. SIAM J. Comput. 9(1): 46-53 (1980) - [c16]Don-Min Tsou, Patrick C. Fischer:
Decomposition of a relation scheme into Boyce-Codd Normal Form. ACM Annual Conference 1980: 411-417
1970 – 1979
- 1979
- [j16]Patrick C. Fischer, Robert L. Probert:
Storage Reorganization Techniques for Matrix Computation in a Paging Environment. Commun. ACM 22(7): 405-415 (1979) - [j15]Patrick C. Fischer, Chandra M. R. Kintala:
Real-Time Computations with Restricted Nondeterminism. Math. Syst. Theory 12: 219-231 (1979) - 1977
- [c15]Chandra M. R. Kintala, Patrick C. Fischer:
Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract). STOC 1977: 178-185 - 1976
- [j14]Patrick C. Fischer, Edward L. Robertson, Lawrence V. Saxton:
On the Sequential Nature of Functions. J. Comput. Syst. Sci. 13(1): 51-68 (1976) - [c14]George T. Ligler, William C. Nylin Jr., Patrick Wang, Patrick C. Fischer, Robert L. Probert:
SIGACT (Paper Session). ACM Annual Conference 1976: 1 - [c13]Patrick C. Fischer, Robert L. Probert:
A note on matrix multiplication in a paging environment. ACM Annual Conference 1976: 17-21 - 1974
- [j13]Patrick C. Fischer, John C. Warkentin:
Predecessor Machines. J. Comput. Syst. Sci. 8(2): 190-219 (1974) - [c12]Patrick C. Fischer, Robert L. Probert:
Efficient Procedures for Using Matrix Algorithms. ICALP 1974: 413-427 - [c11]Patrick C. Fischer:
Further Schemes for Combining Matrix Algorithms. ICALP 1974: 428-436 - 1973
- [e4]Patrick C. Fischer, Jeffrey D. Ullman:
Conference Record of the ACM Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, October 1973. ACM Press 1973 [contents] - 1972
- [j12]Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg:
Real-Time Simulation of Multihead Tape Units. J. ACM 19(4): 590-607 (1972) - [j11]Albert R. Meyer, Patrick C. Fischer:
Computational Speed-Up by Effective Operators. J. Symb. Log. 37(1): 55-68 (1972) - [c10]Patrick C. Fischer:
Theory of computing in computer science education. AFIPS Spring Joint Computing Conference 1972: 857-864 - [c9]John C. Warkentin, Patrick C. Fischer:
Predecessor Machines and Regressing Functions. STOC 1972: 81-87 - [e3]Patrick C. Fischer, H. Paul Zeiger, Jeffrey D. Ullman, Arnold L. Rosenberg:
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1-3, 1972, Denver, Colorado, USA. ACM 1972 [contents] - 1970
- [j10]Patrick C. Fischer, Albert R. Meyer
, Arnold L. Rosenberg:
Time-Restricted Sequence Generation. J. Comput. Syst. Sci. 4(1): 50-73 (1970) - [e2]Patrick C. Fischer, Robert Fabian, Jeffrey D. Ullman, Richard M. Karp:
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, May 4-6, 1970, Northampton, Massachusetts, USA. ACM 1970 [contents]
1960 – 1969
- 1969
- [e1]Patrick C. Fischer, Seymour Ginsburg, Michael A. Harrison:
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, May 5-7, 1969, Marina del Rey, CA, USA. ACM 1969 [contents] - 1968
- [j9]Patrick C. Fischer, Arnold L. Rosenberg:
Multitape One-Way Nonwriting Automata. J. Comput. Syst. Sci. 2(1): 88-101 (1968) - [j8]Patrick C. Fischer:
The Reduction of Tape Reversals for Off-Line One-Tape Turing Machines. J. Comput. Syst. Sci. 2(2): 136-147 (1968) - [j7]Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg:
Counter Machines and Counter Languages. Math. Syst. Theory 2(3): 265-283 (1968) - [c8]Albert R. Meyer, Patrick C. Fischer:
On Computational Speed-Up. SWAT 1968: 351-355 - [c7]Patrick C. Fischer, Juris Hartmanis, Manuel Blum:
Tape Reversal Complexity Hierarchies. SWAT 1968: 373-382 - 1967
- [j6]Patrick C. Fischer:
Turing Machines with a Schedule to Keep. Inf. Control. 11(1/2): 138-146 (1967) - [j5]Stål Aanderaa, Patrick C. Fischer:
The Solvability of the Halting Problem for 2-State Post Machines. J. ACM 14(4): 677-682 (1967) - [c6]Albert R. Meyer, Arnold L. Rosenberg, Patrick C. Fischer:
Turing Machines with Several Read-Write Heads (Preliminary Report). SWAT 1967: 117-127 - [c5]Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg:
Real Time Counter Machines (Preliminary Version). SWAT 1967: 148-154 - 1966
- [j4]Patrick C. Fischer:
Turing Machines with Restricted Memory Access. Inf. Control. 9(4): 364-379 (1966) - 1965
- [j3]Patrick C. Fischer:
Multi-tape and infinite-state automata - a survey. Commun. ACM 8(12): 799-805 (1965) - [j2]Patrick C. Fischer:
Generation of Primes by a One-Dimensional Real-Time Iterative Array. J. ACM 12(3): 388-394 (1965) - [j1]Patrick C. Fischer:
On Formalisms for Turing Machines. J. ACM 12(4): 570-580 (1965) - [c4]S. S. Ruby, Patrick C. Fischer:
Translational methods and computational complexity. SWCT 1965: 173-178 - 1964
- [c3]Patrick C. Fischer:
On formalisms for Turing machines. SWCT 1964: 68-75 - 1963
- [c2]Patrick C. Fischer:
On computability by certain classes of restricted Turing machines. SWCT 1963: 23-32
1950 – 1959
- 1958
- [c1]Patrick C. Fischer:
Automatic propagated and round-off error analysis. ACM National Meeting 1958: 1:1-1:2
Coauthor Index
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.
last updated on 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
