dblp.uni-trier.dewww.uni-trier.de

Kenneth W. Regan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

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

Coauthor Index

1Shin Aida [33] [34]
2Harry Buhrman [27] [28] [30]
3Jin-yi Cai [17] [19] [20]
4Marcel Crâsmaru [33] [34] [35]
5Rodney G. Downey (Rod Downey) [25]
6Michael R. Fellows (Mike Fellows) [25]
7Christian Glaßer (Christian Glasser) [35]
8Frederic Green [16]
9Arun K. Jagota [26]
10Maurice J. Jansen [37] [38]
11Johannes Köbler [16]
12Richard J. Lipton [19]
13Hong Liu [36]
14Luc Longpré [19]
15Dieter van Melkebeek [27] [28] [30]
16Ashish V. Naik [10] [14]
17Giri Narasimhan [26]
18Mitsunori Ogihara (Mitsunori Ogiwara) [19]
19Brian Postow [31]
20James S. Royer [15]
21Thomas Schwentick [16]
22Samik Sengupta [35]
23D. Sivakumar [10] [14] [17] [19] [20] [27] [28] [29] [30]
24Carl H. Smith [31]
25Martin Strauss (Martin J. Strauss) [27] [28] [30]
26Jacobo Torán [16]
27Heribert Vollmer [23]
28Osamu Watanabe [33] [34]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)