| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh |
Improved simulation of nondeterministic Turing machines.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Lipton, Kenneth W. Regan, Atri Rudra |
Simulating Special but Natural Quantum Circuits |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Richard J. Lipton, Kenneth W. Regan, Atri Rudra |
Symmetric Functions Capture General Functions. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh |
Improved Simulation of Nondeterministic Turing Machines. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta |
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. |
ACG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Di Fatta, G. McC. Haworth, Kenneth W. Regan |
Skill rating by Bayesian inference. |
CIDM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen, Kenneth W. Regan |
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen, Kenneth W. Regan |
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives |
| 1 | Hong Liu, Kenneth W. Regan |
Improved construction for universality of determinant and permanent. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe |
Games with Uniqueness Properties. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta |
A Protocol for Serializing Unique Strategies. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian Postow, Kenneth W. Regan, Carl H. Smith |
UPSILON: Universal Programming System with Incomplete Lazy Object Notation. |
Fundam. Inform. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Understanding the Mulmuley-Sohoni Approach to P vs. NP. |
Bulletin of the EATCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe |
Games with a Uniqueness Property. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss |
A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, Martin Strauss, D. Sivakumar |
A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan |
Parameterized Circuit Complexity and the W Hierarchy. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan |
Information capacity of binary weights associative memories. |
Neurocomputing |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss |
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan, D. Sivakumar |
Probabilistic Martingales and BPTIME Classes. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan, Heribert Vollmer |
Gap-Languages and Log-Time Complexity Classes. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Polynomial Vicinity Circuits and Nonlinear Lower Bounds. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Index Sets and Presentations of Complexity Classes. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Linear Time and Memory-Efficient Computation. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan, D. Sivakumar, Jin-yi Cai |
Pseudorandom Generators, Measure Theory, and Natural Proofs |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Ashish V. Naik, Kenneth W. Regan, D. Sivakumar |
On Quasilinear-Time Complexity Theory. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan, James S. Royer |
On Closure Properties of Bounded Two-Sided Error Complexity Classes. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán |
The Power of the Middle Bit of a #P Function. |
J. Comput. Syst. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar |
Communication Complexity of Key Agreement on Small Ranges. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan, D. Sivakumar, Jin-yi Cai |
Pseudorandom Generators, Measure Theory, and Natural Proofs. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
natural proofs, resource-bounded measure theory, partial converse, computational complexity, theorem proving, formal languages, random number generation, measure theory, pseudorandom number generators |
| 1 | Kenneth W. Regan |
On Superlinear Lower Bounds in Complexity Theory. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Kenneth W. Regan, Jie Wang |
The quasilinear isomorphism challenge. |
SIGACT News |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
A New Parallel Vector Model, with Exact Characterization of NC^k. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish V. Naik, Kenneth W. Regan, D. Sivakumar |
Quasilinear Time Complexity Theory. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Linear-Time Algorithms in Memory Hierarchies. |
IFIP Congress |
1994 |
DBLP BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Linear Speed-Up, Information Vicinity, and Finite-State Machines. |
IFIP Congress |
1994 |
DBLP BibTeX RDF |
|
| 1 | Kenneth W. Regan |
On the Difference Between Turing Machine Time and Random-Access Machine Time. |
ICCI |
1993 |
DBLP BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Diagonalization, Uniformity, and Fixed-Point Theorems |
Inf. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Minimum-Complexity Pairing Functions. |
J. Comput. Syst. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Finitary Substructure Languages. |
Structure in Complexity Theory Conference |
1989 |
DBLP BibTeX RDF |
|
| 1 | Kenneth W. Regan |
The Topology of Provability in Complexity Theory. |
J. Comput. Syst. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman. |
ICALP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
The Topology of Provability in Complexity Theory. |
Structure in Complexity Theory Conference |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
On Diagonalization Methods and the Structure of Language Classes. |
FCT |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth W. Regan |
Arithmetical degrees of index sets for complexity classes. |
Logic and Machines |
1983 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")