Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Regan, Kenneth W."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved simulation of nondeterministic Turing machines
Subrahmanyam Kalyanasundaram
,
Richard J. Lipton
,
Kenneth W. Regan
,
Farbod Shokrieh
Theoretical Computer Science
417
, 2012, pp. 66-73
Symmetric functions capture general functions
Richard J. Lipton
,
Kenneth W. Regan
,
Atri Rudra
Lecture Notes in Computer Science
6907
, 2011, pp. 436-447
Improved simulation of nondeterministic Turing machines
Subrahmanyam Kalyanasundaram
,
Richard J. Lipton
,
Kenneth W. Regan
,
Farbod Shokrieh
Lecture Notes in Computer Science
6281
, 2010, pp. 453-464
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
Maurice J. Jansen
,
Kenneth W. Regan
Theoretical Computer Science
409
(3), 2008, pp. 617-622
``Resistant'' polynomials and stronger lower bounds for depth-three arithmetical formulas
Maurice J. Jansen
,
Kenneth W. Regan
Lecture Notes in Computer Science
4598
, 2007, pp. 470-481
Improved construction for universality of determinant and permanent
Hong Liu
,
Kenneth W. Regan
Information Processing Letters
100
(6), 2006, pp. 233-237
A protocol for serializing unique strategies
Marcel Crasmaru
,
Christian Glaßer
,
Kenneth W. Regan
,
Samik Sengupta
Lecture Notes in Computer Science
3153
, 2004, pp. 660-672
A generalization of resource-bounded measure, with application to the BPP vs. EXP problem
Harry Buhrman
,
Dieter van Melkebeek
,
Kenneth W. Regan
,
D. Sivakumar
,
Martin Strauss
SIAM Journal on Computing
30
(2), 2000, pp. 576-601
Complexity classes
Eric Allender
,
Michael C. Loui
,
Kenneth W. Regan
Algorithms and Theory of Computation Handbook, 1999, pp. 27-1 - 27-23
Reducibility and completeness
Eric Allender
,
Michael C. Loui
,
Kenneth W. Regan
Algorithms and Theory of Computation Handbook, 1999, pp. 28-1 - 28-28
Other complexity classes and measures
Eric Allender
,
Michael C. Loui
,
Kenneth W. Regan
Algorithms and Theory of Computation Handbook, 1999, pp. 29-1 - 29-24
Formal grammars and languages
Tao Jiang
,
Ming Li
,
Bala Ravikumar
,
Kenneth W. Regan
Algorithms and Theory of Computation Handbook, 1999, pp. 25-1 - 25-26
Computability
Tao Jiang
,
Ming Li
,
Bala Ravikumar
,
Kenneth W. Regan
Algorithms and Theory of Computation Handbook, 1999, pp. 26-1 - 26-22
A generalization of resource-bounded measure, with an application
Harry Buhrman
,
Dieter van Melkebeek
,
Kenneth W. Regan
,
D. Sivakumar
,
Martin Strauss
Lecture Notes in Computer Science
1373
, 1998, pp. 161-171
Parameterized circuit complexity and the
W
hierarchy
Rodney G. Downey
,
Michael R. Fellows
,
Kenneth W. Regan
Theoretical Computer Science
191
(1-2), 1998, pp. 97-115
Probabilistic martingales and BPTIME classes
Kenneth W. Regan
,
D. Sivakumar
Proceedings of the 13th Annual IEEE Conference on Computational Complexity (Buffalo, New York, June 15-18, 1998)
, 1998, pp. 186-200
Gap-languages and log-time complexity classes
Kenneth W. Regan
,
Heribert Vollmer
Theoretical Computer Science
188
(1-2), 1997, pp. 101-116
Polynomial vicinity circuits and nonlinear lower bounds
Kenneth W. Regan
Proceedings of the 12th Annual IEEE Conference on Computational Complexity (Ulm, Germany, June 24-27, 1997)
, 1997, pp. 61-68
Polynomials and combinatorial definitions of languages
Kenneth W. Regan
Complexity Theory Retrospective II, 1997, pp. 261-293
Linear time and memory-efficient computation
Kenneth W. Regan
SIAM Journal on Computing
25
(1), 1996, pp. 133-168
Index sets and presentations of complexity classes
Kenneth W. Regan
Theoretical Computer Science
161
(1-2), 1996, pp. 263-287
Communication complexity of key agreement on small ranges
Jin-Yi Cai
,
Richard J. Lipton
,
Luc Longpré
,
Mitsunori Ogihara
,
Kenneth W. Regan
,
D. Sivakumar
Lecture Notes in Computer Science
900
, 1995, pp. 38-49
The power of the middle bit of a
\#P
function
Frederic Green
,
Johannes Köbler
,
Kenneth W. Regan
,
Thomas Schwentick
,
Jacob Torán
Journal of Computer and System Sciences
50
(3), 1995, pp. 456-467
On quasilinear-time complexity theory
Ashish V. Naik
,
Kenneth W. Regan
,
D. Sivakumar
Theoretical Computer Science
148
(2), 1995, pp. 325-349
Pseudorandom generators, measure theory, and natural proofs
Kenneth W. Regan
,
D. Sivakumar
,
Jin-yi Cai
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 26-35
Seiten 1
2
>