The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kenneth W. Regan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kenneth W. Regan
    The Topology of Provability in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:291-310 [Conf]
  2. Kenneth W. Regan
    Finitary Substructure Languages. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:87-96 [Conf]
  3. Kenneth W. Regan
    On Superlinear Lower Bounds in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:50-64 [Conf]
  4. Kenneth W. Regan
    Polynomial Vicinity Circuits and Nonlinear Lower Bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:61-68 [Conf]
  5. Kenneth W. Regan, D. Sivakumar
    Probabilistic Martingales and BPTIME Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:186-0 [Conf]
  6. Kenneth W. Regan
    On Diagonalization Methods and the Structure of Language Classes. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:368-380 [Conf]
  7. Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
    Pseudorandom Generators, Measure Theory, and Natural Proofs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:26-35 [Conf]
  8. Kenneth W. Regan
    A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:324-333 [Conf]
  9. Kenneth W. Regan
    On the Difference Between Turing Machine Time and Random-Access Machine Time. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:36-40 [Conf]
  10. Kenneth W. Regan
    Linear-Time Algorithms in Memory Hierarchies. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:288-293 [Conf]
  11. Kenneth W. Regan
    Linear Speed-Up, Information Vicinity, and Finite-State Machines. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:609-614 [Conf]
  12. Kenneth W. Regan
    Arithmetical degrees of index sets for complexity classes. [Citation Graph (0, 0)][DBLP]
    Logic and Machines, 1983, pp:118-130 [Conf]
  13. Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta
    A Protocol for Serializing Unique Strategies. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:660-672 [Conf]
  14. Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe
    Games with a Uniqueness Property. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:396-407 [Conf]
  15. Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
    A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:161-171 [Conf]
  16. Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
    Communication Complexity of Key Agreement on Small Ranges. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:38-49 [Conf]
  17. Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
    Quasilinear Time Complexity Theory. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:97-108 [Conf]
  18. Kenneth W. Regan
    A New Parallel Vector Model, with Exact Characterization of NC^k. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:289-300 [Conf]
  19. Kenneth W. Regan
    Understanding the Mulmuley-Sohoni Approach to P vs. NP. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:78, n:, pp:86-99 [Journal]
  20. Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
    Pseudorandom Generators, Measure Theory, and Natural Proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:6, pp:- [Journal]
  21. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:58, pp:- [Journal]
  22. Brian Postow, Kenneth W. Regan, Carl H. Smith
    UPSILON: Universal Programming System with Incomplete Lazy Object Notation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:50, n:3-4, pp:325-359 [Journal]
  23. Kenneth W. Regan
    Diagonalization, Uniformity, and Fixed-Point Theorems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:98, n:1, pp:1-40 [Journal]
  24. Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan
    Information capacity of binary weights associative memories. [Citation Graph (0, 0)][DBLP]
    Neurocomputing, 1998, v:19, n:1-3, pp:35-58 [Journal]
  25. Hong Liu, Kenneth W. Regan
    Improved construction for universality of determinant and permanent. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:6, pp:233-237 [Journal]
  26. Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán
    The Power of the Middle Bit of a #P Function. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:456-467 [Journal]
  27. Kenneth W. Regan
    The Topology of Provability in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:3, pp:384-432 [Journal]
  28. Kenneth W. Regan
    Minimum-Complexity Pairing Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:45, n:3, pp:285-295 [Journal]
  29. Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe
    Games with Uniqueness Properties. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:29-47 [Journal]
  30. Kenneth W. Regan, James S. Royer
    On Closure Properties of Bounded Two-Sided Error Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:3, pp:229-243 [Journal]
  31. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:576-601 [Journal]
  32. Kenneth W. Regan
    Linear Time and Memory-Efficient Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:1, pp:133-168 [Journal]
  33. Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
    Parameterized Circuit Complexity and the W Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:97-115 [Journal]
  34. Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
    On Quasilinear-Time Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:2, pp:325-349 [Journal]
  35. Kenneth W. Regan
    Index Sets and Presentations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:263-287 [Journal]
  36. Kenneth W. Regan, Heribert Vollmer
    Gap-Languages and Log-Time Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:188, n:1-2, pp:101-116 [Journal]
  37. Maurice J. Jansen, Kenneth W. Regan
    "Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:470-481 [Conf]

  38. Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. [Citation Graph (, )][DBLP]


  39. Improved Simulation of Nondeterministic Turing Machines. [Citation Graph (, )][DBLP]


  40. Skill rating by Bayesian inference. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002