John Gill

According to our database1, John Gill authored at least 21 papers between 1974 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
i-CORA - A Large-Scale Experimentation Platform for End-to-End 5G Services.
Proceedings of the IEEE Globecom Workshops 2023, 2023

2018
High rate of Falls Risk Screening with Minimal Staff Training using Context Aware Clinical Decision Support.
Proceedings of the AMIA 2018, 2018

Sustainability of Depression Screening Rates over Time Using Context Aware Workflow.
Proceedings of the AMIA 2018, 2018

2008
Accessibility of Unsupervised Biometric Systems.
Proceedings of the Biometrics and Identity Management, First European Workshop, 2008

1993
Terse, Superterse, and Verbose Sets
Inf. Comput., March, 1993

1992
Counting Classes: Thresholds, Parity, Mods, and Fewness.
Theor. Comput. Sci., 1992

1990
Sorting n Objects with a K-Sorter.
IEEE Trans. Computers, 1990

Counting Classes: Thresholds, Parity, Mods, and Fewness.
Proceedings of the STACS 90, 1990

1982
MIPS: A microprocessor architecture.
Proceedings of the 15th annual workshop on Microprogramming, 1982


Hardware/Software Tradeoffs for Increased Performance.
Proceedings of the Symposium on Architectural Support for Programming Languages and Operating Systems, 1982

1981
Relative to a Random Oracle A, P<sup>A</sup> != NP<sup>A</sup> != co-NP<sup>A</sup> with Probability 1.
SIAM J. Comput., 1981

1980
Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers.
Theor. Comput. Sci., 1980

1978
Exact and Approximate Membership Testers
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract)
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
Computational Complexity of Probabilistic Turing Machines.
SIAM J. Comput., 1977

Polynomial Reducibilities and Upward Diagonalizations
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976
Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures.
Proceedings of the Third International Colloquium on Automata, 1976

1975
Relativizations of the P =? NP Question.
SIAM J. Comput., 1975

1974
Conjectures on uniquely decipherable codes (Corresp.).
IEEE Trans. Inf. Theory, 1974

On Almost Everywhere Complex Recursive Functions.
J. ACM, 1974


  Loading...