Patrick C. Fischer

Known as: Fischer, Patrick Carl Fischer 
Patrick Carl Fischer (December 3, 1935 – August 26, 2011) was an American computer scientist, a noted researcher in computational complexity theory… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1937-2018
010020030019372017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2000
Highly Cited
2000
MOTIVATION Evaluating the accuracy of predicted models is critical for assessing structure prediction methods. Because this… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper presents a new approach to enforcing array bounds and pointer checking in the C language Check ing is rigorous in the… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Contributing Authors A. Abe-Ouchi, S. Brinkop, M. Claussen, M. Collins, J. Evans, I. Fischer-Bruns, G. Flato, J.C. Fyfe, A… (More)
  • figure 9.1
  • figure 9.2
  • figure 9.3
  • table 8.1
  • table 8.1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Software protection is one of the most important issues concerning computer practice. There exist many heuristics and ad-hoc… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We estimate and compare a variety of continuous-time models of the short-term riskless rate using the Generalized Method of… (More)
  • table IV
  • figure 1
  • table VI
Is this relevant?
Highly Cited
1992
Highly Cited
1992
This paper investigates the transformation of v-terms into continuation-passing style (CPS). We show that by appropriate… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
This paper is concerned with the solvability of the problem of processor renaming in unreliable, completely asynchronous… (More)
  • figure I
  • figure 2
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Reaching agreement is a primitive of distributed computing. Whereas this poses no problem in an ideal, failure-free environment… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Recently, Fischer, Lynch and Paterson [3] proved that no completely asynchronous consensus protocol can tolerate even a single… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In this paper we consider the Computation Tree Logic (CTL) proposed in [CE] which extends the Unified Branching Time Logic (UB… (More)
Is this relevant?