The SCEAS System
| |||||||

## Search the dblp DataBase
John Gill:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Larry Carter, Robert W. Floyd, John Gill, George Markowsky, Mark N. Wegman
**Exact and Approximate Membership Testers**[Citation Graph (1, 0)][DBLP] STOC, 1978, pp:59-65 [Conf] - John L. Hennessy, Norman P. Jouppi, Forest Baskett, Thomas R. Gross, John Gill
**Hardware/Software Tradeoffs for Increased Performance.**[Citation Graph (0, 0)][DBLP] ASPLOS, 1982, pp:2-11 [Conf] - John L. Hennessy, Norman P. Jouppi, John Gill, Forest Baskett, Alex Strong, Thomas R. Gross, Christopher Rowen, Judson Leonard
**The MIPS Machine.**[Citation Graph (0, 0)][DBLP] COMPCON, 1982, pp:2-7 [Conf] - Janos Simon, John Gill, James Hunt
**On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1978, pp:107-112 [Conf] - John Gill, István Simon
**Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures.**[Citation Graph (0, 0)][DBLP] ICALP, 1976, pp:285-306 [Conf] - Richard Beigel, John Gill, Ulrich Hertrampf
**Counting Classes: Thresholds, Parity, Mods, and Fewness.**[Citation Graph (0, 0)][DBLP] STACS, 1990, pp:49-57 [Conf] - István Simon, John Gill
**Polynomial Reducibilities and Upward Diagonalizations**[Citation Graph (0, 0)][DBLP] STOC, 1977, pp:186-194 [Conf] - Richard Beigel, William I. Gasarch, John Gill, James C. Owings
**Terse, Superterse, and Verbose Sets**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1993, v:103, n:1, pp:68-85 [Journal] - John Gill, Manuel Blum
**On Almost Everywhere Complex Recursive Functions.**[Citation Graph (0, 0)][DBLP] J. ACM, 1974, v:21, n:3, pp:425-435 [Journal] - Theodore P. Baker, John Gill, Robert Solovay
**Relativizatons of the P =? NP Question.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1975, v:4, n:4, pp:431-442 [Journal] - Charles H. Bennett, John Gill
**Relative to a Random Oracle A, P^A != NP^A != co-NP^A with Probability 1.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1981, v:10, n:1, pp:96-113 [Journal] - John Gill
**Computational Complexity of Probabilistic Turing Machines.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1977, v:6, n:4, pp:675-695 [Journal] - Richard Beigel, John Gill
**Sorting n Objects with a K-Sorter.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1990, v:39, n:5, pp:714-716 [Journal] - Richard Beigel, John Gill
**Counting Classes: Thresholds, Parity, Mods, and Fewness.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1992, v:103, n:1, pp:3-23 [Journal] - John Gill, James Hunt, Janos Simon
**Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1980, v:12, n:, pp:333-338 [Journal] **Accessibility of Unsupervised Biometric Systems.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |