Kevin J. Compton

Publication Activity (10 Years)

Years Active: 1983-2016
Publications (10 Years): 1

Top Topics

Scheduling Problem

Multiresolution

Top Venues

Publications

Jose Javier Gonzalez Ortiz, Kevin J. Compton
A Simple Power Analysis Attack on the Twofish Key Schedule. CoRR (2016)
Denis Bueno, Kevin J. Compton, Karem A. Sakallah, Michael Bailey
Detecting Traditional Packers, Decisively. RAID (2013)
Kevin J. Compton, Brian Timm, Joel VanLaven
A Simple Power Analysis Attack on the Serpent Key Schedule. IACR Cryptol. ePrint Arch. 2009 (2009)
Hosung Song, Kevin J. Compton, William C. Rounds
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN. Electron. Notes Theor. Comput. Sci. 145 (2006)
Olgica Milenkovic, Kevin J. Compton
Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs. Algorithmica 43 (3) (2005)
Joel VanLaven, Mark Brehob, Kevin J. Compton
Side Channel Analysis, Fault Injection and Applications - A Computationally Feasible SPA Attack on AES via Optimized Search. SEC (2005)
Olgica Milenkovic, Kevin J. Compton
Probabilistic Transforms for Combinatorial Urn Models. Comb. Probab. Comput. 13 (4-5) (2004)
Wuwei Shen, Mohsen Guizani, Zijiang Yang, Kevin J. Compton, James Huggins
Execution of A Requirement Model in Software Development. IASSE (2004)
Olgica Milenkovic, T. S. Coffey, Kevin J. Compton
The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes. IEEE Trans. Inf. Theory 49 (3) (2003)
Wuwei Shen, Kevin J. Compton, James Huggins
A Method of Implementing UML Virtual Machines With Some Constraints Based on Abstract State Machines. APSEC (2003)
Wuwei Shen, Kevin J. Compton, James Huggins
A Toolset for Supporting UML Static and Dynamic Model Checking. COMPSAC (2002)
Wuwei Shen, Kevin J. Compton, James Huggins
A UML Validation Toolset Based on Abstract State Machines. ASE (2001)
Kevin J. Compton
A van der Waerden Variant. Electron. J. Comb. 6 (1999)
Edward A. Bender, Kevin J. Compton, L. Bruce Richmond
0-1 laws for maps. Random Struct. Algorithms 14 (3) (1999)
Kevin J. Compton, Scott D. Dexter
Proof Techniques for Cryptographic Protocols. ICALP (1999)
Kevin J. Compton, Erich Grädel
Logical Definability of Counting Functions. J. Comput. Syst. Sci. 53 (2) (1996)
Kevin J. Compton, Chinya V. Ravishankar
Expected Deadlock Time in a Multiprocessing System. J. ACM 42 (3) (1995)
Kevin J. Compton, Erich Grädel
Logical Definability of Counting Functions. Computational Complexity Conference (1994)
Kevin J. Compton
Stratified Least Fixpoint Logic. Theor. Comput. Sci. 131 (1) (1994)
Kevin J. Compton, Rosario Uceda-Sosa
The Model Theory of Concurrency. CSL (1993)
Kevin J. Compton
A Deductive System for Existential Least Fixpoint Logic. J. Log. Comput. 3 (2) (1993)
David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien
Regular Languages in NC¹. J. Comput. Syst. Sci. 44 (3) (1992)
Thomas Behrendt, Kevin J. Compton, Erich Grädel
Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions. CSL (1992)
Kevin J. Compton, Howard Straubing
Characterizations of regular languages in low level complexity classes. Bull. EATCS 48 (1992)
Serge Abiteboul, Kevin J. Compton, Victor Vianu
Queries Are Easier Than You Thought (Probably). PODS (1992)
Kevin J. Compton
Lower Bounds for the Complexity of Theories. Bull. EATCS 43 (1991)
Kevin J. Compton, C. Ward Henson
A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories. Ann. Pure Appl. Log. 48 (1) (1990)
Kevin J. Compton, Carlos H. Montenegro
The largest set partitioned by a subfamily of a cover. J. Comb. Theory, Ser. A 54 (2) (1990)
Kevin J. Compton, Claude Laflamme
An Algebra and a Logic for NC¹ Inf. Comput. 87 (1/2) (1990)
Kevin J. Compton
A logical approach to asymptotic combinatorics II: Monadic second-order properties. J. Comb. Theory, Ser. A 50 (1) (1989)
Kevin J. Compton
The Computational Complexity of Asymptotic Problems I: Partial Orders Inf. Comput. 78 (2) (1988)
Kevin J. Compton, Claude Laflamme
An Algebra and a Logic for NC¹ LICS (1988)
Kevin J. Compton
Some methods for computing component distribution probabilities in relational structures. Discret. Math. 66 (1-2) (1987)
Kevin J. Compton, C. Ward Henson, Saharon Shelah
Nonconvergence, undecidability, and intractability in asymptotic problems. Ann. Pure Appl. Log. 36 (1987)
Kevin J. Compton
Application of a Tauberian theorem to finite model theory. Arch. Math. Log. 25 (1) (1985)
Kevin J. Compton
An Undecidable Problem in Finite Combinatorics. J. Symb. Log. 49 (3) (1984)
Kevin J. Compton
Some Useful Preservation Theorems. J. Symb. Log. 48 (2) (1983)